Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-22T16:30:16.162Z Has data issue: false hasContentIssue false

EMBEDDINGS INTO OUTER MODELS

Part of: Set theory

Published online by Cambridge University Press:  11 July 2022

MONROE ESKEW*
Affiliation:
KURT GÖDEL RESEARCH CENTER INSTITUT FÜR MATHEMATIK, UNIVERSITÄT WIEN KOLINGASSE 14-16, 1090WIEN, AUSTRIAE-mail:[email protected]
Rights & Permissions [Opens in a new window]

Abstract

We explore the possibilities for elementary embeddings $j : M \to N$ , where M and N are models of ZFC with the same ordinals, $M \subseteq N$ , and N has access to large pieces of j. We construct commuting systems of such maps between countable transitive models that are isomorphic to various canonical linear and partial orders, including the real line ${\mathbb R}$ .

MSC classification

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2022. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

1 Introduction

The notion of an elementary embedding between transitive models of set theory is central to the investigation of principles of high consistency strength. A typical situation involves an elementary $j : M \to N$ , where M and N are models of ZFC sharing the same ordinals, and j is not the identity map. Such a map cannot be the identity on ordinals, and the least ordinal moved is called the critical point. Postulating more agreement between M and N, and with the “real” universe V, usually results in a stronger hypothesis. Kunen established an upper bound to this collection of ideas, showing that there is no nontrivial elementary $j : V \to V$ .

The question is how exactly to formalize Kunen’s result, which is not on its face equivalent to a first-order statement. Indeed, it cannot be about an arbitrary elementary embedding which may exist in some outer universe, as the relatively low-strength assumption of $0^{\sharp }$ gives a nontrivial elementary $j : L \to L$ . Furthermore, requiring j to be definable from parameters in V yields an impossibility using more elementary considerations and not requiring the Axiom of Choice [Reference Suzuki16]. One way to express the content of Kunen’s Theorem is to require that V satisfies the expansion of ZFC to include Replacement and Comprehension for formulas that use j as a predicate. Another way is to localize its combinatorial content, which shows that there cannot be a cardinal $\lambda $ and a nontrivial elementary $j : V_{\lambda +2} \to V_{\lambda +2}$ .

We begin with an elaboration on Kunen’s theorem in a slightly different direction. Using the main idea of Woodin’s proof of Kunen’s theorem (see [Reference Kanamori11, Theorem 23.12]), we show that whenever one model of ZFC is embedded into another with the same ordinals, there are some general constraints on what the models can know about the embedding and about each other.

Theorem 1.1. Suppose $j : M \to N$ is a nontrivial elementary embedding between transitive models of $\mathrm {ZFC} $ with the same class of ordinals $\Omega $ . Then at least one of the following holds:

  1. (1) The critical sequence $\langle j^n(\operatorname {\mathrm {crit}}(j)) : n \in \omega \rangle $ is cofinal in $\Omega $ .

  2. (2) For some $\alpha \in \Omega $ , $j[\alpha ] \notin N$ .

  3. (3) For some $\alpha \in \Omega $ , $\alpha $ is regular in M and singular in N.

Proof We will suppose that all of the alternatives fail and derive a contradiction. Let $\lambda \in \Omega $ be the supremum of the critical sequence. Since $j[\lambda ] \in N$ , the critical sequence is a member of N, and thus $N \models \operatorname {\mathrm {cf}}(\lambda ) = \omega $ . Since $\operatorname {\mathrm {cf}}(\lambda )^M$ is regular in M, it is also regular in N, and so $M \models \operatorname {\mathrm {cf}}(\lambda ) = \omega $ as well. Thus $j(\lambda ) = \lambda $ . Since $(\lambda ^+)^M$ is regular in N, we must have that $(\lambda ^+)^M$ is also a fixed point.

Let $\kappa = \operatorname {\mathrm {crit}}(j)$ , and choose in M a pairwise-disjoint sequence of stationary subsets of $\lambda ^+ \cap \operatorname {\mathrm {cof}}(\omega )$ , $\langle S_{\alpha } : \alpha < \kappa \rangle $ . Let $\langle S^{\prime }_{\alpha } : \alpha < j(\kappa ) \rangle = j(\langle S_{\alpha } : \alpha < \kappa \rangle )$ . Let $C = \{ \alpha < \lambda ^+ : j[\alpha ] \subseteq \alpha \}$ . C is a member of N and a club in $\lambda ^+$ , so let $\alpha \in C \cap S^{\prime }_{\kappa }$ . Since $N \models \operatorname {\mathrm {cf}}(\alpha ) = \omega $ , there is a sequence $\langle \alpha _n : n < \omega \rangle \in M$ cofinal in $\alpha $ . Since $\alpha $ is closed under j, $j(\alpha ) = \sup _{n<\omega } j(\alpha _n) = \alpha $ . By elementarity, there is some $\beta < \kappa $ such that $\alpha \in S_{\beta }$ . But then $\alpha \in S^{\prime }_{\beta } \cap S^{\prime }_{\kappa } = \emptyset $ , a contradiction.

Let us list some key examples of embeddings between transitive models of ZFC with the same ordinals, in which exactly one of the above alternatives holds:

  1. (1) Axiom I3 asserts the existence of a nontrivial elementary embedding $j : V_{\lambda } \to V_{\lambda }$ , where $\lambda $ is a limit ordinal. (2) and (3) must both fail for such j, so (1) must hold.

  2. (2) Suppose ${\mathcal U}$ is a countably complete ultrafilter over some set. If $j : V \to M \cong \operatorname {\mathrm {Ult}}(V,{\mathcal U})$ is the ultrapower embedding, then (1) fails by the Replacement axiom, and (3) fails since $M \subseteq V$ . Thus (2) holds.

  3. (3) Situations in which (1) and (2) both fail will be considered in Sections 3 and 4 of the present paper.

We will say that an elementary embedding $j : M \to N$ is (target-)amenable if $j[x] \in N$ for all $x \in M$ , or in other words that alternative (2) fails. For ZFC models, this is equivalent to saying that $j \cap \alpha ^2 \in N$ for all ordinals $\alpha \in N$ . It is easy to see that $M \subseteq N$ in such a situation. It is an immediate consequence of Theorem 1.1 that if M and N are transitive models of ZFC with the same ordinals $\Omega $ , and $j : M \to N$ is an amenable elementary embedding such that its critical sequence is not cofinal in $\Omega $ , then M and N do not agree on cofinalities. The proof actually shows that M and N cannot agree on both the class of cardinals and the class $\{ \alpha : \operatorname {\mathrm {cf}}(\alpha ) = \omega \}$ .

When the domain and target of an elementary embedding are the same, alternative (3) cannot hold. If $j : M \to M$ is definable from parameters in some larger universe V, then alternatives (1) and (2) show that the closure of M, as measured by V, must run out at some point. In contrast to the I3 examples that achieve amenability at the cost of countable closure, we show it is possible for such M to be as near to V as desired, and find in this motif a characterization of supercompactness:

Theorem 1.2. Suppose $\kappa \leq \lambda $ are regular. $\kappa $ is $\lambda $ -supercompact if and only if there is a $\lambda $ -closed transitive class M and a nontrivial elementary $j : M \to M$ with critical point $\kappa $ .

Finally, we consider amenable embeddings for which alternative (1) does not hold. Because of the importance of regular fixed points in the proof of Theorem 1.1, we first explore the possible behaviors of cardinal fixed points of amenable embeddings, showing that essentially anything can happen. Then we explore the possible structural configurations of commuting systems of amenable embeddings.

Given an ordinal $\delta $ , let $\mathcal E_{\delta }$ be the category whose objects are all transitive models of ZFC of height $\delta $ and whose arrows are all elementary embeddings between these models. Let ${\mathcal A}_{\delta }$ be the subcategory where we take only amenable embeddings as arrows. (It is easy to see that amenable embeddings are closed under composition.)

Partial orders are naturally represented as categories where between any two objects there is at most one arrow, which we take to point from the lesser object to the greater. We would like to know what kinds of partial orders can appear in a reasonable way as subcategories of an ${\mathcal A}_{\delta }$ . Let us say that a subcategory $\mathcal D$ of a category $\mathcal C$ is honest if whenever x and y are objects of $\mathcal D$ and there is an arrow $f : x \to y$ in $\mathcal C$ , then there is one in $\mathcal D$ as well.

Theorem 1.3. If there is a transitive model of ZFC plus sufficiently many large cardinals,Footnote 1 then there is a countable ordinal $\delta $ such that ${\mathcal A}_{\delta }$ contains honest subcategories isomorphic to:

  1. (1) The real numbers.

  2. (2) The complete binary tree of any countable height.

  3. (3) The reverse-ordered complete binary tree of height $\omega $ .

  4. (4) An Aronszajn tree.

  5. (5) Every countable pseudotree.

A pseudotree is a partial order that is linear below any given element, which generalizes both linear orders and trees. These have been considered by several authors, for example in [Reference Alós-Ferrer and Ritzberger1, Reference Koppelberg and Monk12, Reference Kurepa13]. In order to show the last item, we develop the model theory of pseudotrees. We show that there is a countable pseudotree that has the same kind of universal property that the rationals have with respect to linear orders: It is characterized up to isomorphism by some first-order axioms, and every other countable pseudotree appears as a substructure. We prove that for suitable $\delta $ , the category ${\mathcal A}_{\delta }$ contains a copy of this universal countable pseudotree.

We also rule out some kinds of subcategories. For example, if $\delta $ is countable, then ${\mathcal A}_{\delta }$ cannot contain a copy of $\omega _1$ or a Suslin tree. There are many natural questions about the possible structure of these categories, and we list some of them at the end.

2 Self-embeddings of highly closed classes

In this section, we will prove Theorem 1.2. First let us show that if $\lambda $ is regular, M is a $\lambda $ -closed transitive class, and $j : M \to M$ is a nontrivial elementary embedding with critical point $\kappa $ , then $\kappa $ is $\lambda $ -supercompact. First note that we may assume $j(\kappa )> \lambda $ : The proof of Theorem 1.1 shows that the critical sequence eventually must overtake $\lambda $ . For if not, then $\lambda \geq \eta ^+$ , where $\eta = \sup _{n<\omega } j^n(\kappa )$ , and we can derive a contradiction from the assumption that $j[\eta ^+] \in M$ . So composing j with itself finitely many times yields an embedding that sends $\kappa $ above $\lambda $ .

Next we claim that $\lambda ^{<\kappa } = \lambda $ , using a well-known argument (see [Reference Cummings3]). Let $\vec C = \langle C_{\alpha } : \alpha < \lambda \rangle $ be such that $C_{\alpha }$ is a club in $\alpha $ of ordertype $\operatorname {\mathrm {cf}}(\alpha )$ . Since $j[\lambda ] \in M$ and $j(\lambda )$ is regular in M, $\gamma := \sup j[\lambda ] < j(\lambda )$ . Let $C^* = j(\vec C)(\gamma )$ . Let $D = j^{-1}[C^*]$ . Since $j[\lambda ]$ is ${<}\kappa $ -closed, $|D| = \lambda $ . If $x \in [D]^{<\kappa }$ , then $j(x) = j[x]$ , and by elementarity, $x \subseteq C_{\alpha }$ for some $\alpha < \lambda $ such that $\operatorname {\mathrm {cf}}(\alpha )<\kappa $ . Since $\kappa $ is inaccessible, $|\mathcal {P}(C_{\alpha })| < \kappa $ when $|C_{\alpha }|<\kappa $ . Thus $\lambda ^{<\kappa } \leq \lambda \cdot \kappa = \lambda $ .

Thus, all subsets of $\mathcal {P}_{\kappa }\lambda $ are in M. From j we may define a $\lambda $ -supercompactness measure in the usual way: ${\mathcal U} = \{ X \subseteq \mathcal {P}_{\kappa }\lambda : j[\lambda ] \in j(X) \}$ .

For the other direction, we use an iterated ultrapower. Let ${\mathcal U}$ be a normal, fine, $\kappa $ -complete ultrafilter on $\mathcal {P}_{\kappa }\lambda $ . Let $V = M_0$ and for $n<\omega $ , let $j_{n,n+1} : M_n \to M_{n+1} = \operatorname {\mathrm {Ult}}(M_n,j_{0,n}({\mathcal U}))$ be the ultrapower embedding, and let $j_{m,n+1} = j_{n,n+1} \circ j_{m,n}$ for $m < n$ . Let $M_{\omega }$ the direct limit, and for $n<\omega $ , let $j_{n,\omega }$ be the direct limit embedding. Note that each $M_n$ is $\lambda $ -closed, but the limit $M_{\omega }$ is not even countably closed. $j_{0,\omega }(\kappa ) = \sup _{n<\omega } j_{0,n}(\kappa )$ , yet this ordinal is inaccessible in $M_{\omega }$ .

To construct the desired model M, we find a generic for a Prikry forcing over $M_{\omega }$ , which will restore $\lambda $ -closure when adjoined. The sequences of classes $\langle M_n : n < \omega \rangle $ and embeddings $\langle j_{m,n} : m < n < \omega \rangle $ are definable in V from ${\mathcal U}$ . Applying $j_{{\mathcal U}}$ to the sequences yields $\langle M_n : 1 \leq n < \omega \rangle $ and $\langle j_{m,n} : 1\leq m < n < \omega \rangle $ , which has the same direct limit, $M_{\omega }$ . For any formula $\varphi (v_0,\dots ,v_n)$ and parameters $a_0,\dots ,a_n \in M_{\omega }$ , $\varphi ^{M_{\omega }}(a_0,\dots ,a_n) \Leftrightarrow \varphi ^{M_{\omega }}(j_{{\mathcal U}}(a_0),\dots ,j_{{\mathcal U}}(a_n))$ . Hence, $j_{{\mathcal U}} \ M_{\omega }$ is an elementary embedding into $M_{\omega }$ .

Let us define the Prikry forcing $\mathbb P_{{\mathcal U}}$ , which is standard. Conditions take the form $\langle x_0,\dots ,x_n,A \rangle $ , where:

  1. (1) Each $x_i \in \mathcal {P}_{\kappa }\lambda $ , and $\kappa _i := x_i \cap \kappa $ is inaccessible.

  2. (2) $x_i \subseteq x_{i+1}$ , and $|x_i| < \kappa _{i+1}$ .

  3. (3) $A \in {\mathcal U}$ .

Suppose $p = \langle x_0,\dots ,x_n,A \rangle $ and $q = \langle x^{\prime }_0,\dots ,x^{\prime }_m,B \rangle $ . We say $q \leq p$ when:

  1. (1) $m \geq n$ , and for $i \leq n$ , $x_i = x^{\prime }_i$ .

  2. (2) For $n < i \leq m$ , $x^{\prime }_i \in A$ .

  3. (3) $B \subseteq A$ .

Proof of the following can be found in [Reference Gitik9]:

Lemma 2.1. $\mathbb P_{{\mathcal U}}$ adds no bounded subsets of $\kappa $ , collapses $\lambda $ to $\kappa $ , and is $\lambda ^+$ -c.c.

We now argue that there exists an $M_{\omega }$ -generic filter $G \subseteq j_{0,\omega }(\mathbb P_{{\mathcal U}})$ in V. Furthermore, $M_{\omega }[G]$ is $\lambda $ -closed. The idea for $\kappa = \lambda $ is due to Dehornoy [Reference Dehornoy4].

For $n < \omega $ , let $z_n = j_{n,\omega }[j_{0,n}(\lambda )]$ . Since $\operatorname {\mathrm {crit}}(j_{n+1,\omega }) = j_{0,n+1}(\kappa )> j_{0,n}(\lambda )$ , $z_n = j_{n+1,\omega }(j_{n,n+1}[j_{0,n}(\lambda )])\in \mathcal {P}_{j_{0,\omega }(\kappa )} (j_{0,\omega }(\lambda ))^{M_{\omega }}$ . We define G as the collection of $\langle x_0,\dots ,x_n,A \rangle \in j_{0,\omega }(\mathbb P_{{\mathcal U}})$ such that $\langle x_0,\dots ,x_n\rangle $ is an initial segment of $\langle z_i : i < \omega \rangle $ and $\{ z_i : n < i < \omega \} \subseteq A$ .

Lemma 2.2. G is generic over $M_{\omega }$ .

Proof We use an analogue of Rowbottom’s Theorem [Reference Rowbottom15]: If $F : [\mathcal {P}_{\kappa }\lambda ]^{<\omega } \to 2$ , then there is a set $A \in {\mathcal U}$ and a sequence $r \in {{}^{\omega }}2$ such that whenever $\langle x_i,\dots ,x_n \rangle \subseteq A$ is such that $x_i \subseteq x_{i+1}$ and $|x_i| < x_{i+1} \cap \kappa \in \kappa $ , then $F(\{x_0,\dots ,x_{n-1}\}) = r(n)$ . Let D be a dense open subset of $j_{0,\omega }(\mathbb P_{{\mathcal U}})$ in $M_{\omega }$ . For each s such that $s^{\frown } \langle j_{0,\omega }(\mathcal {P}_{\kappa }\lambda )\rangle \in j_{0,\omega }(\mathbb P_{{\mathcal U}})$ , let $F_s : [\mathcal {P}_{\kappa }\lambda ]^{<\omega } \to 2$ be defined by $F_s(t) = 1$ if there is $B_{s,t}$ such that $s^{\frown } t^{\frown } \langle B_{s,t} \rangle \in D$ , and $F_s(t) = 0$ otherwise. If $F_s(t) = 0$ , define $B_{s,t} = j_{0,\omega }(\mathcal {P}_{\kappa }\lambda )$ . For each s, let $B_s$ be the diagonal intersection $\Delta _t B_{s,t} \in j_{0,\omega }({\mathcal U})$ . For each s, let $A_s$ and $r_s$ be given by the analogue of Rowbottom’s Theorem. Let $A^*$ be the diagonal intersection $\Delta _s A_s \cap B_s$ .

We claim that for each s, whether a condition $s^{\frown } t ^{\frown } \langle B\rangle \leq s^{\frown } \langle A^* \rangle $ is in D depends only on the length of t. Let s be given and let $t,t'$ be of the same length n, such that $s^{\frown } t ^{\frown } \langle B\rangle $ and $s^{\frown } t' \!^{\frown } \langle B' \rangle $ are both $\leq s^{\frown } \langle A^* \rangle $ . Then $t,t' \subseteq A_s$ and $B,B' \subseteq B_s$ , so $B \subseteq B_{s,t}$ and $B' \subseteq B_{s,t'}$ . Thus $F_s(t) = F_s(t') = r_s(n)$ , so either both $s^{\frown } t ^{\frown } \langle B\rangle $ and $s^{\frown } t' \!^{\frown } \langle B' \rangle $ are in D, or they are both are not in D.

Now if D is a dense open subset of $j_{0,\omega }(\mathbb P_{{\mathcal U}})$ in $M_{\omega }$ , there is some $n <\omega $ and $\bar D \in M_n$ such that $j_{n,\omega }(\bar D) = D$ . Let $A^*$ be as above, and let $m \geq n$ be such that $A^* = j_{m,\omega }(\bar A^*)$ for some $\bar A^* \in j_{0,m}({\mathcal U})$ . Let $l <\omega $ be such that for all sequences t of length $\geq l$ and all B such that $\langle z_0,\dots ,z_{m-1} \rangle ^{\frown } t ^{\frown } \langle B \rangle \leq \langle z_0,\dots ,z_{m-1} \rangle ^{\frown } \langle A^* \rangle $ , we have $\langle z_0,\dots ,z_{m-1} \rangle ^{\frown } t ^{\frown } \langle B \rangle \in D$ . Since $z_k \in A^*$ for all $k \geq m$ , $D \cap G \not = \emptyset $ .

Lemma 2.3. The map $j_{{\mathcal U}} \restriction M_{\omega }$ can be extended to a map $j : M_{\omega }[G] \to M_{\omega }[G]$ .

Proof Note that for each $z_n$ ,

$$ \begin{align*} j_{{\mathcal U}}(z_n) = j_{0,1}(j_{n,\omega}[j_{0,n}(\lambda)]) = j_{n+1,\omega}[j_{1,n+1}(j_{0,1}(\lambda))] = j_{n+1,\omega}[j_{0,n+1}(\lambda)] = z_{n+1}. \end{align*} $$

Let $G'$ be the generic filter generated by $\langle z_n : 1 \leq n < \omega \rangle $ . Then $j_{{\mathcal U}}[G] \subseteq G'$ . Thus by Silver’s criterion, we may extend the map to $j : M_{\omega }[G] \to M_{\omega }[G']$ by putting $j(\tau ^G) = j_{{\mathcal U}}(\tau )^{G'}$ for every $j_{0,\omega }(\mathbb P_{{\mathcal U}})$ -name $\tau $ . But clearly, $M_{\omega }[G'] = M_{\omega }[G]$ .

Lemma 2.4. $M_{\omega }[G]$ is $\lambda $ -closed.

Proof It suffices to show that $M_{\omega }[G]$ contains all $\lambda $ -sequences of ordinals. Suppose $\langle \xi _{\alpha } : \alpha < \lambda \rangle \subseteq \operatorname {\mathrm {Ord}}$ . For each $\alpha $ , there is $n < \omega $ and a function $f_{\alpha } : (\mathcal {P}_{\kappa }\lambda )^n \to \operatorname {\mathrm {Ord}}$ such that $\xi _{\alpha } = j_{0,\omega }(f_{\alpha })(z_0,\dots ,z_{n-1})$ . The sequence $\langle j_{0,\omega }(f_{\alpha }) : \alpha < \lambda \rangle $ can be computed from $j_{0,\omega }(\langle f_{\alpha } : \alpha < \lambda \rangle )$ and $j_{0,\omega }[\lambda ]$ , both of which are in $M_{\omega }$ . The sequence $\langle \xi _{\alpha } : \alpha < \lambda \rangle $ can be computed from $\langle j_{0,\omega }(f_{\alpha }) : \alpha < \lambda \rangle $ and $\langle z_n : n < \omega \rangle $ , and is thus in $M_{\omega }[G]$ .

This concludes the proof of Theorem 1.2.

3 Fixed point behavior of amenable embeddings

One way to produce elementary embeddings is with indiscernibles, like the embeddings derived from $0^{\sharp }$ . If we want the embedding to be amenable to the target model, more consistency strength is required. Vickers and Welch [Reference Vickers and Welch17] showed a near-equiconsistency between the existence of an elementary $j : M \to V$ , where M is a transitive class and V satisfies ZFC for formulas involving j, and the existence of a Ramsey cardinal. In this section, we begin with the argument for constructing nontrivial amenable embeddings from a Ramsey cardinal, and then we elaborate on this idea using measurable cardinals to control the behavior of the embedding more precisely.

Recall that a cardinal $\kappa $ is Ramsey when for every coloring of its finite subsets in $<\kappa $ colors, $c : [\kappa ]^{<\omega } \to \delta < \kappa $ , there is $X \in [\kappa ]^{\kappa }$ such that $c \restriction [X]^n$ is constant for all $n<\omega $ (X is homogeneous). Rowbottom [Reference Rowbottom15] showed that if $\kappa $ is measurable and ${\mathcal U}$ is a normal measure on $\kappa $ , then for any coloring $c : [\kappa ]^{<\omega } \to \delta < \kappa $ , there is a homogeneous $X \in {\mathcal U}$ .

Suppose $\kappa $ is Ramsey. Let $\frak A$ be a structure on $V_{\kappa }$ in a language of size $\delta <\kappa $ , that includes a well-order of $V_{\kappa }$ so that the structure has definable Skolem functions. For $X \subseteq \frak A$ , we write $\operatorname {\mathrm {Hull}}^{\frak A}(X)$ for the set $\{ f(z) : z \in X^{<\omega }$ and f is a definable Skolem function for $\frak A \}$ . For $\alpha _0<\dots <\alpha _n<\kappa $ , let $c(\alpha _0,\dots ,\alpha _n) = \{ \varphi (v_0,\dots ,v_n) : \frak A \models \varphi (\alpha _0,\dots ,\alpha _n) \}$ . The number of colors is at most $2^{\delta }$ , so let $X \in [\kappa ]^{\kappa }$ be homogeneous for c. If $Y \subseteq X$ and $\xi \in X \setminus Y$ , then $\xi \notin \operatorname {\mathrm {Hull}}^{\frak A}(Y)$ : For if not, let $f(v_0,\dots ,v_n)$ be a definable Skolem function, and let $\{\alpha _0,\dots ,\alpha _n\} \subseteq Y$ be such that $\xi = f(\alpha _0,\dots ,\alpha _n)$ . Let $m\leq n$ be the maximum such that $\alpha _m < \xi $ . Suppose first that $m<n$ . Let $\alpha _{n+1}> \alpha _n$ be in X. By homogeneity,

$$ \begin{align*} \frak A \models & \xi = f(\alpha_0,\dots,\alpha_m,\alpha_{m+2},\dots,\alpha_n,\alpha_{n+1}), \text{ and } \\ \frak A \models & \alpha_{m+1} = f(\alpha_0,\dots,\alpha_m,\alpha_{m+2},\dots,\alpha_n,\alpha_{n+1}). \end{align*} $$

This contradicts that f is a function. If $\xi> \alpha _n$ , then similarly, $A \models \xi = \xi ' = f(\alpha _0,\dots ,\alpha _n)$ , for some $\xi '>\xi $ in X, again a contradiction. Furthermore, for every infinite $\mu \in [\delta ,\kappa )$ , $|\mathcal {P}(\mu ) \cap \operatorname {\mathrm {Hull}}^{\frak A}(X)| \leq \mu $ [Reference Rowbottom15].

Therefore, if $Y \subseteq X$ has size $\kappa $ , and M is the transitive collapse of $\operatorname {\mathrm {Hull}}^{\frak A}(Y)$ , then M is a proper transitive subset of $V_{\kappa }$ of size $\kappa $ , and there is an elementary $j : M \to V_{\kappa }$ . j is amenable simply because $V_{\kappa }$ has all sets of rank $<\kappa $ , so in particular $j[x] \in V_{\kappa }$ for all $x \in M$ . Furthermore, if $Y_0,Y_1 \in [X]^{\kappa }$ , then the order-preserving bijection $f : Y_0 \to Y_1$ induces an isomorphism $\pi : \operatorname {\mathrm {Hull}}^{\frak A}(Y_0) \to \operatorname {\mathrm {Hull}}^{\frak A}(Y_1)$ , and thus these two hulls have the same transitive collapse M. So given the structure $\frak A$ , this process produces one proper transitive subset $M \subseteq V_{\kappa }$ of size $\kappa $ , which can be amenably embedded into $V_{\kappa }$ in many different ways. Let us examine the ways in which these embeddings may differ with regard to fixed points.

Theorem 3.1. Suppose $\kappa $ is measurable. There is a transitive $M \subseteq V_{\kappa }$ of size $\kappa $ such that for every $\delta \leq \kappa $ , there is an elementary embedding $j : M \to V_{\kappa }$ such that the set of M-cardinals fixed by j above $\operatorname {\mathrm {crit}}(j)$ has ordertype $\delta $ .

Proof Fix a normal ultrafilter ${\mathcal U}$ on $\kappa $ and some cardinal $\theta> 2^{\kappa }$ . Let $\frak A$ be a structure in a countable language expanding $(H_{\theta },\in ,{\mathcal U})$ with definable Skolem functions. Let $\frak A_0 \prec \frak A$ be such that $|\frak A_0| = |\frak A_0 \cap \kappa | < \kappa $ . We show something a little stronger than the claimed result; namely, for every $\delta \leq \kappa $ , there is a set of indiscernibles $B \subseteq \kappa $ of size $\kappa $ such that if $\frak B = \operatorname {\mathrm {Hull}}(\frak A_0 \cup B)$ , then $\frak B \cap \sup (\frak A_0 \cap \kappa ) = \frak A_0 \cap \kappa $ , and the set of cardinals in the interval $[\sup (\frak A_0 \cap \kappa ),\kappa )$ that are fixed by the transitive collapse of $\frak B$ has ordertype $\delta $ . Thus if the inverse of the transitive collapse map of $\frak A_0$ has no fixed points above its critical point, for example if $\frak A_0$ is countable, then the result follows.

Let $\alpha _0 \in \bigcap ({\mathcal U} \cap \frak A_0)$ be strictly greater than $\sup (\frak A_0 \cap \kappa )$ , and let $\frak A_1 = \operatorname {\mathrm {Hull}}(\frak A_0 \cup \{ \alpha _0 \})$ . We claim that $\frak A_0 \cap \kappa = \frak A_1 \cap \alpha _0$ . If $\gamma \in \frak A_1 \cap \kappa $ , then there is a function $f : \kappa \to \kappa $ in $\frak A_0$ such that $f(\alpha _0) = \gamma $ . If $\gamma < \alpha _0$ , then f is regressive on a set in ${\mathcal U}$ , and therefore constant on a set in ${\mathcal U}$ , and thus $\gamma \in \frak A_0$ . Continue in this way, producing a continuous increasing sequence of elementary substructures of $\frak A$ , $\langle \frak A_i : i < \kappa \rangle $ , and an increasing sequence of ordinals $\langle \alpha _i : i < \kappa \rangle $ , such that for $0<i<\kappa $ , $\alpha _i = \min \bigcap ({\mathcal U} \cap \frak A_i)$ , and $\frak A_{i+1} = \operatorname {\mathrm {Hull}} (\frak A_i \cup \{ \alpha _i \})$ .

Claim 3.2. $\{ \alpha _i : i < \kappa \} \in {\mathcal U} $ .

Proof Let $\frak A_{\kappa } = \bigcup _{i<\kappa } \frak A_i$ , and let $\langle X_i : i < \kappa \rangle $ enumerate ${\mathcal U} \cap \frak A_{\kappa }$ . There is a club $C\subseteq \kappa $ such that for all $\beta \in C$ , ${\mathcal U} \cap \frak A_{\beta } = \{ X_i : i < \beta \}$ , and $\beta = \sup (\frak A_{\beta } \cap \kappa )$ . If $\beta \in \bigcap _{i<\beta } X_i$ , then $\alpha _{\beta } = \beta $ . This means that $C \cap \Delta _{i<\kappa } X_i \subseteq \{ \alpha _i : i < \kappa \}$ . Since ${\mathcal U}$ is normal, the claim follows.

Let $A = \{ \alpha _i : i < \kappa \}$ . Under a mild assumption on $\frak A_0$ , A is a set of order-indiscernibles for $\frak A$ . For let $\varphi $ be a formula in n free variables in the language of $\frak A$ . Let $c_{\varphi } : [\kappa ]^n \to 2$ be the coloring defined by $c_{\varphi }(a_1,\dots ,a_n) = 1$ if $\frak A \models \varphi (a_1,\dots ,a_n)$ , and 0 otherwise. Since $c_{\varphi } \in \frak A$ , Rowbottom’s Theorem implies that there is a set $X_{\varphi } \in {\mathcal U}$ such that $\frak A \models \varphi (a_1,\dots ,a_n) \leftrightarrow \varphi (b_1,\dots ,b_n)$ whenever $\langle a_1,\dots ,a_n \rangle ,\langle b_1,\dots ,b_n \rangle $ are increasing sequences from $X_{\varphi }$ . By slightly enlarging $\frak A_0$ at the beginning if necessary, we may assume $c_{\varphi } \in \frak A_0$ for each $\varphi $ . By elementarity, we may assume $X_{\varphi } \in \frak A_0$ . Thus $A \subseteq X_{\varphi }$ for each such $\varphi $ .

Let $\langle \beta _i : i < \kappa \rangle $ be the increasing enumeration of the closure of $A \cup \{ \sup (\frak A_0 \cap \kappa ) \}$ .

Claim 3.3. For every $X \subseteq A$ and $\gamma <\kappa $ , if $\beta _{\gamma } \notin X$ , then $\operatorname {\mathrm {Hull}}(\frak A_0 \cup X)$ is disjoint from the interval $[\beta _{\gamma },\beta _{\gamma +1})$ .

Proof Suppose $\beta _{\gamma } \notin X$ , $\xi \in [\beta _{\gamma },\beta _{\gamma +1})$ , but there are elements $c_1,\dots ,c_k \in \frak A_0$ , ordinals $i_1 < \cdots < i_n$ , and a Skolem function f such that $\xi = f(c_1,\dots ,c_k,\alpha _{i_1},\dots ,\alpha _{i_n})$ , with $\{ \alpha _{i_1},\dots ,\alpha _{i_n} \} \subseteq X$ . Let us assume that we have chosen f and $c_1,\dots ,c_k$ to output $\xi $ with the least number n of parameters from X. Since $\alpha _{i_n+1}> \sup (\frak A_{i_n+1} \cap \kappa )$ , we have $\xi < \alpha _{i_n}$ . Working in $N = \operatorname {\mathrm {Hull}}(\frak A_0 \cup \{ \alpha _{i_1},\dots ,\alpha _{i_{n-1}} \})$ , let

$$ \begin{align*} Y = \{ \eta < \kappa : f(c_1,\dots,c_k, \alpha_{i_1},\dots,\alpha_{i_{n-1}},\eta ) < \eta \}. \end{align*} $$

Since $\alpha _{i_n} \in Y \in {\mathcal U}$ and ${\mathcal U}$ is normal, there is $\zeta < \kappa $ and $Z \in {\mathcal U} \cap N$ such that $f(c_1,\dots ,c_k, \alpha _{i_1},\dots ,\alpha _{i_{n-1}},\eta ) = \zeta $ for all $\eta \in Z$ . Thus, $\zeta = \xi \in N$ , and $\xi $ is the output of a Skolem function with only $n-1$ inputs from X, contrary to the minimality assumption.

Now let $D \subseteq A \cap \lim A$ have ordertype $\delta $ . Let $B = (A \setminus \lim A) \cup D$ . Let $\frak B = \operatorname {\mathrm {Hull}}(\frak A_0 \cup B)$ , let H be the transitive collapse of $\frak B$ , let $M = H \cap V_{\kappa }$ , and let $j : M \to V_{\kappa }$ be the inverse of the collapse map.

Let $C = j^{-1}[B]$ , and let $\langle B(i) : i < \kappa \rangle $ and $\langle C(i) : i < \kappa \rangle $ denote the respective increasing enumerations of these sets. Let $\lambda \in \lim C$ . By Claim 3.3, there is some $i<\kappa $ such that $j(\lambda ) = \beta _i$ , and $\beta _i \in B$ . Thus C is closed. Since $|C(i)| = |C(i+1)|$ for all i, every cardinal of $V_{\kappa }$ above $C(0)$ is a limit point of C.

Let $\kappa _0 = \operatorname {\mathrm {ot}}(\frak A_0 \cap \kappa )$ . Since $\frak B \cap \alpha _0 = \frak A_0 \cap \kappa $ , $j(\kappa _0) = \alpha _0> \kappa _0$ . Define an increasing continuous sequence $\langle \kappa _i : i < \kappa \rangle $ as follows. Given $\kappa _i$ , if $j(\kappa _i)> \kappa _i$ , let $\kappa _{i+1} = j(\kappa _i)$ , and if $j(\kappa _i) = \kappa _i$ , let $\kappa _{i+1} = (\kappa _i^+)^M$ . For limit $\lambda $ , let $\kappa _{\lambda } = \sup _{i<\lambda }\kappa _i$ .

We claim that D is the set of points above $\kappa _0$ that are fixed by j. To show each point in D is fixed, note that if $\xi \in D$ , then $\xi $ is closed under j, because $\operatorname {\mathrm {ot}}(B \cap \xi ) = \xi $ . Thus $\xi = \kappa _{\xi }$ , and $j(\xi ) = \xi $ . To show no other points are fixed, we argue by induction that if $\xi \notin D$ , then $j(\kappa _{\xi }) = \kappa _{\xi +1}$ . Assume that this holds for all $i<\xi $ , and $\xi \notin D$ .

  • ${\textrm{Case}\ 1{:}}\ \ \xi $ is a limit. Then $\kappa _{\xi } = \sup _{i<\xi } \kappa _{\xi }$ . By the inductive assumption, $\kappa _i \in \operatorname {\mathrm {ran}}(j)$ for unboundedly many $i <\xi $ , so $\kappa _{\xi }$ is a cardinal in V, and thus $\kappa _{\xi } = C(\kappa _{\xi })$ . Therefore, $j(\kappa _{\xi }) = B(\kappa _{\xi })$ . If $\xi < \kappa _{\xi }$ , then $\kappa _{\xi } \notin A$ since it is singular, so $B(\kappa _{\xi })> \kappa _{\xi }$ . If $\xi = \kappa _{\xi }$ , then $B(\xi )> \xi $ since $\xi \notin D$ . In either case, the definition of the sequence gives that $\kappa _{\xi +1} = j(\kappa _{\xi })$ .

  • ${\textrm{Case}\ 2{:}} \ \ \xi = \eta +1$ , and $\eta \in D$ . Then $\kappa _{\xi } = (\kappa _{\eta }^+)^M$ . Since $|\frak A_{\eta +1}| = \eta $ , $(\kappa _{\eta }^+)^M < (\kappa _{\eta }^+)^V$ . Thus $j(\kappa _{\xi }) = (\kappa _{\eta }^+)^V = \kappa _{\xi +1}$ .

  • ${\textrm{Case}\ 3{:}}\ \ \xi = \eta +1$ , and $\eta \notin D$ . Then by induction, $\kappa _{\eta } < j(\kappa _{\eta }) = \kappa _{\xi }$ . By elementarity, $\kappa _{\xi } = j(\kappa _{\eta }) < j(\kappa _{\xi })$ , so by definition, $\kappa _{\xi +1} = j(\kappa _{\xi })$ .

To conclude, if $\xi \in D$ , then the interval $[\kappa _{\xi },\kappa _{\xi +1})$ contains only one M-cardinal, and it is fixed. If $\xi \notin D$ , then the interval $[\kappa _{\xi },\kappa _{\xi +1})$ is moved into the interval $[\kappa _{\xi +1},\kappa _{\xi +2})$ .

Theorem 3.4. Suppose $\kappa $ is a measurable limit of measurables, $\delta \leq \kappa $ , and $f : \delta \to 2$ . Then there is a transitive $M \subseteq V_{\kappa }$ of size $\kappa $ and an elementary embedding $j : M \to V_{\kappa }$ such that the set of M-cardinals fixed by j above $\operatorname {\mathrm {crit}}(j)$ has ordertype $\delta $ , and for all $\alpha < \delta $ , the $\alpha ^{th}$ fixed point is regular iff $f(\alpha ) = 1$ .

Proof Let ${\mathcal U}$ be a normal measure on $\kappa $ , let $\theta> 2^{\kappa }$ , and let $\frak A$ be a structure in a countable language expanding $(H_{\theta },\in ,{\mathcal U})$ with definable Skolem functions. Let us first show how to get isolated singular fixed points. Suppose $\frak A_0 \prec \frak A$ and there is a cardinal $\mu \in \frak A_0 \cap \kappa $ such that $|\frak A_0|<\mu $ . Let $\langle \delta _n : n < \omega \rangle $ enumerate the first $\omega $ measurable cardinals in $\frak A_0 \cap \kappa $ above $\mu $ . By the previous construction, we may make a series of elementary extensions $\frak A_0 \prec \frak A_1 \prec \frak A_2 \prec \cdots $ such that:

  1. (1) For all n, $\frak A_n \cap \delta _n = \frak A_{n+1} \cap \delta _n$ .

  2. (2) $\operatorname {\mathrm {ot}}(\frak A_1 \cap \delta _0) = | \frak A_1 | = \mu $ .

  3. (3) For $n \geq 1$ , $\operatorname {\mathrm {ot}}(\frak A_n \cap \delta _n) = |\frak A_n | = \delta _{n-1}$ .

Then let $\frak A_{\omega } = \bigcup _{n<\omega } \frak A_n$ . Let $j : H \to \frak A_{\omega }$ be the inverse of the transitive collapse. It is easy to see that $j(\mu ) = \delta _0$ , and for all $n<\omega $ , $j(\delta _n) = \delta _{n+1}$ . Let $\delta _{\omega } = \sup _n \delta _n$ , which is in $\frak A_0$ . Since $\operatorname {\mathrm {ot}}(\frak A_{\omega } \cap \delta _{\omega }) = \delta _{\omega }$ , $j(\delta _{\omega }) = \delta _{\omega }$ . Since $|\frak A_{\omega }| = \delta _{\omega }$ , all cardinals of H above $\delta _{\omega }$ are below $(\delta _{\omega }^+)^V$ , so j has no cardinal fixed points greater than $\delta _{\omega }$ .

To prove the theorem, we build a continuous chain of elementary submodels of $\frak A$ , $\langle \frak A_{\alpha } : \alpha < \kappa \rangle $ , along with an increasing sequence of cardinals $\langle \delta _{\alpha } : \alpha < \delta \rangle \subseteq \kappa $ , such that:

  1. (1) If $\alpha < \beta $ , then $\frak A_{\beta } \cap \sup (\frak A_{\alpha } \cap \kappa )= \frak A_{\alpha } \cap \kappa $ .

  2. (2) For each $\alpha $ , $\delta _{\alpha } \in \frak A_{\alpha +1} \setminus \sup (\frak A_{\alpha } \cap \kappa )$ .

  3. (3) If $\alpha < \delta $ , then $\delta _{\alpha }$ is the unique cardinal fixed point of the transitive collapse of $\frak A_{\alpha +1}$ that is $\geq \sup (\frak A_{\alpha } \cap \kappa )$ , and $\delta _{\alpha }$ is regular iff $f(\alpha ) = 1$ .

  4. (4) If $\alpha \geq \delta $ , then there are no fixed points in the transitive collapse of $\frak A_{\alpha +1}$ that are $\geq \sup (\frak A_{\alpha } \cap \kappa )$ .

Given $\frak A_{\alpha }$ , first adjoin an ordinal $\gamma _{\alpha } \in \bigcap (\frak A_{\alpha } \cap {\mathcal U})$ that is strictly above $\sup (\frak A_{\alpha } \cap \kappa )$ , to form a model $\frak A_{\alpha }'$ with the same ordinals below $\gamma _{\alpha }$ , so that if $\pi $ is the transitive collapse of $\frak A_{\alpha }'$ , then $\pi (\gamma _{\alpha })<\gamma _{\alpha }$ . If $\alpha <\delta $ and $f(\alpha ) = 0$ , let $\delta _{\alpha }$ be the supremum of the first $\omega $ measurable cardinals in $\frak A_{\alpha }'$ above $\gamma _{\alpha }$ . If $\alpha < \delta $ and $f(\alpha ) = 1$ , let $\delta _{\alpha }$ be the least measurable cardinal in $\frak A_{\alpha }'$ above $\gamma _{\alpha }$ . Depending on $f(\alpha )$ , use either the above construction or that of Theorem 3.1 to build an extension $\frak A_{\alpha +1}$ of $\frak A_{\alpha }'$ with size $\delta _{\alpha }$ , so that $\delta _{\alpha }$ is the unique cardinal fixed point of its transitive collapse above $\sup (\frak A_{\alpha } \cap \kappa )$ , and $\frak A_{\alpha +1} \cap \gamma _{\alpha } = \frak A_{\alpha } \cap \kappa $ .

If $\delta = \kappa $ , we continue the same process for $\kappa $ -many steps. If $\delta < \kappa $ , then once we have $\frak A_{\delta }$ , we can apply Theorem 3.1 to extend to a $\kappa $ -sized model $\frak A_{\kappa }$ , such that $\frak A_{\kappa } \cap \sup (\frak A_{\delta } \cap \kappa ) = \frak A_{\delta } \cap \kappa $ , and the transitive collapse of $\frak A_{\kappa }$ has no fixed points in the interval $[\sup (\frak A_{\delta } \cap \kappa ),\kappa )$ .

4 Categories of amenable embeddings

In this section, we explore the structure of the categories ${\mathcal A}_{\delta }$ of models of ZFC of height $\delta $ and amenable embeddings between them. We attempt to determine, as comprehensively as we can, what kinds of linear and partial orders can appear as honest subcategories of ${\mathcal A}_{\delta }$ , for a countable ordinal $\delta $ . We start by applying the methods of the previous section to build patterns of “amalgamation” and then use stationary tower forcing to build transfinite chains and patterns of “splitting.” Then we pass to ill-founded models that are well-founded up to $\delta $ to find subcategories of ${\mathcal A}_{\delta }$ that are isomorphic to certain canonical ill-founded structures.

The following large cardinal notion will be important for this section:

Definition [Reference Larson14]

A cardinal $\kappa $ is called completely Jónsson if it is inaccessible and for every $a \in V_{\kappa }$ which is stationary in $\bigcup a$ , the set $\{ M \subseteq V_{\kappa } : M \cap \bigcup a \in a \text { and } |M \cap \kappa | = \kappa \}$ is stationary in $\mathcal {P}(V_{\kappa })$ .

The construction of the previous section shows that measurable cardinals are completely Jónsson. For let $\kappa $ be measurable and let $a \in V_{\kappa }$ be stationary. For any function $F : V_{\kappa }^{<\omega } \to V_{\kappa }$ , we can take a well-order $\lhd $ on $H_{\theta }$ , where $\theta> 2^{\kappa }$ , and find an elementary substructure $\frak A \prec (H_{\theta },\in ,\lhd ,F)$ of size $<\kappa $ , and such that $\frak A \cap \bigcup a \in a$ . By repeated end-extension, we get $\frak B \prec (H_{\theta },\in ,\lhd ,F)$ such that $|\frak B \cap \kappa | = \kappa $ and $\frak B \cap \bigcup a = \frak A \cap \bigcup a$ . Since $\frak B \cap V_{\kappa }$ is closed under F, the claim follows. An easy reflection argument shows that if $\kappa $ is measurable and ${\mathcal U}$ is a normal measure on $\kappa $ , then the set of completely Jónsson cardinals below $\kappa $ is in ${\mathcal U}$ .

Similar arguments show the following: If $\langle \kappa _i : i < \delta \rangle $ is an increasing sequence of measurable cardinals with supremum $\theta $ , and $\langle \mu _i : i < \delta \rangle $ is a nondecreasing sequence of cardinals with $\mu _i \leq \kappa _i$ for all i, then the set $\{ X \subseteq \theta : |X \cap \kappa _i| = \mu _i$ for all $i \}$ is stationary.

4.1 Collapsing inward

Following [Reference Jech10], let us say that a sequential tree is a collection of functions $p : n \to \omega $ for $n<\omega $ closed under initial segments, ordered by $p \leq q$ iff $p \supseteq q$ . If T is a well-founded sequential tree, then it has a rank function $\rho _T : T \to \omega _1$ , defined inductively by putting $\rho _T(p) = 0$ for minimal nodes p, and $\rho _T(p) = \sup \{ \rho _T(q) + 1 : q < p \}$ . The rank of T is $\rho _T(\emptyset )$ .

Theorem 4.1. Suppose there is a countable transitive model N of ZFC containing a completely Jónsson cardinal $\delta $ that has infinitely many measurables below it, $\alpha \in N$ is an ordinal, and T is a well-founded sequential tree of rank $\alpha $ . Then there is an honest subcategory of ${\mathcal A}_{\delta }$ isomorphic to T.

Proof For the purposes of this argument, for a natural number n and a model M in the language of set theory, let $\kappa _n^M$ denote the $n^{th}$ measurable cardinal in M, if it exists. We show the following claim by induction on $\alpha $ . Let $\Phi (T,\alpha ,M,\delta ,f)$ stand for the assertion that:

  1. (1) T is a well-founded sequential tree of rank $\alpha $ .

  2. (2) $M \in N$ is a transitive model of $\mathrm {ZF} -$ Powerset + “Every set has a well-ordering” + “ $\delta $ is a completely Jónsson cardinal with infinitely many measurables below it” $+$ $V_{\delta +\alpha +1}$ exists.”

  3. (3) $f : \omega ^2 \to \omega $ is an injection in M.

We claim that if $\Phi (T,\alpha ,M,\delta ,f)$ holds, then there is an assignment $p \mapsto M_p$ for $p \in T$ such that:

  1. (1) Each $M_p$ is a transitive set of rank $\delta $ in M, with $M_{\emptyset } = V^M_{\delta }$ .

  2. (2) If $p \leq q$ , then there is an amenable $j : M_p \to M_q$ in M.

  3. (3) For all $p \in T$ , $\kappa _{f(i,p(i))}^{M_p} < \kappa _{f(i,p(i))}^M$ for $i < \operatorname {\mathrm {len}}(p)$ , and $\kappa _{f(i,i')}^{M_p} = \kappa _{f(i,i')}^M$ for $(i,i') \notin p$ .

Let us first show why the claim implies that the generated subcategory is honest. Suppose $p(i) \not = q(i)$ , and let $n = f(i,q(i))$ . If there were an elementary embedding $j : M_p \to M_q$ , then

$$ \begin{align*} j(\kappa^{M_p}_n) = \kappa^{M_q}_n < \kappa_n^M = \kappa^{M_p}_n, \end{align*} $$

which is impossible since embeddings are monotonic on ordinals.

Suppose $\Phi (T,\alpha ,M,\delta ,f)$ holds, and the claim holds below $\alpha $ . Without loss of generality, $\langle n \rangle \in T$ for each $n<\omega $ , since every sequential tree of rank $\alpha $ can be embedded into one of this form. For each n, let $T_n = \{ \langle p(1),\dots ,p(\operatorname {\mathrm {len}}(p) -1) \rangle : p \in T$ and $p(0) = n \}$ . Note that each $T_n$ is a well-founded sequential tree, and $\alpha = \sup _n (\operatorname {\mathrm {rank}}(T_n)+1)$ . Let $\alpha _n = \operatorname {\mathrm {rank}}(T_n)$ .

Working in M, let $\theta = |V_{\delta +\alpha }|^+$ . We can take for each $n<\omega $ , an elementary substructure $\frak A_n \prec H_{\theta }$ such that:

  1. (1) $| \frak A_n \cap \kappa _{f(0,n)}^M | < \kappa _{f(0,n)}^M$ .

  2. (2) $| \frak A_n \cap \kappa _{f(i,i')}^M | = \kappa _{f(i,i')}^M$ for $(i,i') \not = (0,n)$ .

  3. (3) $\delta \in \frak A_n$ and $| \frak A_n \cap \delta | = \delta $ .

Let $M_n$ be the transitive collapse of $\frak A_n$ . Let $M_{\emptyset } = V_{\delta }^M$ and $M_{\langle n \rangle } = (V_{\delta })^{M_n}$ . (Note that $M_{\langle n \rangle }$ is a rank initial segment of $M_n$ , and the larger model does not satisfy the powerset axiom.) Each $M_{\langle n \rangle }$ amenably embeds into $M_{\emptyset }$ . For each n, $\kappa _{f(0,n)}^{M_n} < \kappa _{f(0,n)}^M$ and $\kappa _{f(i,i')}^{M_n} = \kappa _{f(i,i')}^M$ for $(i,i') \not = (0,n)$ .

Let $g : \omega ^2 \to \omega $ be defined by $g(i,i') = f(i+1,i')$ . Then $\Phi (T_n,\alpha _n,M_n,\delta ,g)$ holds for each n. By the induction hypothesis, there is an assignment $p \mapsto M_p$ , for $p \in T \setminus \{ \emptyset \}$ , such that whenever $p(0) = n$ ,

  1. (1) $M_p$ is a transitive set of rank $\delta $ in $M_n$ .

  2. (2) If $q \leq p$ , then there is an amenable $j : M_q \to M_p$ in $M_n$ .

  3. (3) For $1 \leq i < \operatorname {\mathrm {len}}(p)$ ,

    $$ \begin{align*} \kappa_{g(i-1,p(i))}^{M_p} = \kappa_{f(i,p(i))}^{M_p} < \kappa_{f(i,p(i))}^{M_{n}} = \kappa_{f(i,p(i))}^M, \end{align*} $$
    and for a pair $(i,i') \notin p$ , with $i \geq 1$ ,
    $$ \begin{align*} \kappa_{g(i-1,i')}^{M_p} = \kappa_{f(i,i')}^{M_p} = \kappa_{f(i,i')}^{M_{n}} = \kappa_{f(i,i')}^M. \end{align*} $$
  4. (4) For all $m<\omega $ , $\kappa _{f(0,m)}^{M_p} = \kappa _{f(0,m)}^{M_n}$ .

Therefore, the induction hypothesis holds for $\alpha $ .

4.2 Forcing outward

The background material for this subsection can be found in [Reference Larson14].

Definition (Woodin)

The (proper class) stationary tower forcing $\mathbb P_{\infty }$ is the class of stationary sets ordered by $a \leq b$ if $\bigcup a \supseteq \bigcup b$ and $\{ x \cap \bigcup b : x \in a \} \subseteq b$ . If $\kappa $ is a strong limit cardinal, then $\mathbb P_{<\kappa } = \mathbb P_{\infty } \cap V_{\kappa }$ .

Theorem 4.2 (Woodin)

Suppose there is a proper class of completely Jónsson cardinals, and $G \subseteq \mathbb P_{\infty }$ is generic over V. Then there is an amenable elementary embedding $j : V \to V[G]$ with unboundedly many regular fixed points.

The above theorem immediately implies that if there is a countable transitive model $M_0$ of height $\delta $ with a proper class of completely Jónsson cardinals, then ${\mathcal A}_{\delta }$ contains a subcategory isomorphic to the linear order $\omega $ . Given $M_n$ , we can take a $\mathbb P_{\infty }$ -generic $G_n$ over $M_n$ , which gives us an amenable $j : M_n \to M_{n+1} = M_n[G_n]$ . In order to construct more complicated subcategories, we use the following to determine the action of the maps:

Fact 4.3. Suppose $G \subseteq \mathbb P_{\infty }$ and $j : V \to V[G]$ are as above. Suppose $\varphi (x_0,\dots ,x_n,y)$ is a formula, $a_0,\dots ,a_n,b \in V$ , and b is transitive. Then

$$ \begin{align*} V[G] \models \varphi(j(a_0),\dots,j(a_n),j[b]) \Leftrightarrow \{ z \subseteq b : V \models \varphi(a_0,\dots,a_n,z) \} \in G.\end{align*} $$

Consequently, $\kappa = \operatorname {\mathrm {crit}}(j) \Leftrightarrow \{ z \subseteq \kappa : z \cap \kappa \in \kappa \} \in G$ .

To construct subcategories containing transfinite chains, we use our latitude in determining critical points so that the equivalence classes that make up the ordinals of the direct limit are all eventually “frozen.”

Lemma 4.4. Suppose the following:

  1. (1) $\langle \delta _n : n < \omega \rangle $ is an increasing sequence of ordinals.

  2. (2) $\langle M_n : n <\omega \rangle $ is a sequence of transitive ZFC models, each of height $\delta = \sup _{n<\omega } \delta _n$ .

  3. (3) $\langle j_{m,n} : M_m \to M_n : m \leq n < \omega \rangle $ is a commuting system of elementary embeddings.

  4. (4) For all $m \leq n$ , $j_{m,n}(\delta _n)<\operatorname {\mathrm {crit}}(j_{n,n+1}) $ .

Then the direct limit is isomorphic to a transitive model $M_{\omega } \subseteq \bigcup _{n<\omega } M_n$ . If each $j_{m,n}$ is amenable, then so is each direct limit map $j_{n,\omega }$ , and thus $M_{\omega } = \bigcup _{n<\omega } M_n$ .

Proof Recall that the direct limit is defined as the set of equivalence classes $[n,x]$ , where $x \in M_n$ , and we put $[n,x] \sim [m,y]$ for $n \leq m$ when $j_{n,m}(x) = y$ . The membership relation is defined similarly: for $n\leq m$ , $[n,x]$ $\in $ $[m,y]$ when $j_{n,m}(x) \in y$ . Suppose $\alpha < \delta $ and $n<\omega $ . Let $m \geq n$ be such that $\delta _m \geq \alpha $ , and let $\beta = j_{n,m}(\alpha )$ . Then for all $k> m$ , $\operatorname {\mathrm {crit}}(j_{m,k})>\beta $ . Thus if $[k,\gamma ] < [n,\alpha ]$ in the direct limit, then there is some $\xi <\beta $ such that $[k,\gamma ] \sim [m,\xi ]$ . Thus the set of predecessors of any ordinal in the direct limit is isomorphic to an ordinal below $\delta $ , so the direct limit can be identified with a transitive model $M_{\omega }$ of height $\delta $ . To show $M_{\omega } \subseteq \bigcup _n M_n$ , let $x \in M_{\omega }$ and let $n,y$ be such that $x = j_{n,\omega }(y)$ . Let $m\geq n$ be such that $\operatorname {\mathrm {rank}}(y) <\delta _m$ . $\operatorname {\mathrm {crit}}(j_{m,\omega })> \operatorname {\mathrm {rank}}(j_{n,m}(y))$ , so $x = j_{m,\omega } \circ j_{n,m}(y) = j_{n,m}(y) \in M_m$ .

Now suppose each $j_{m,n}$ is amenable. Let $x \in M_n$ . Let $m\geq n$ be such that $\operatorname {\mathrm {rank}}(x) <\delta _m$ . The critical point of $j_{m,k}$ is greater than $j_{n,m}(\delta _m)$ for all $k>m$ . By amenability, $j_{n,m}[x] \in (V_{j_{n,m}(\delta _m)})^{M_m}$ . But $j_{n,\omega }[x] = j_{m,\omega }[j_{n,m}[x]] = j_{m,\omega }(j_{n,m}[x]) \in M_{\omega }$ .

Corollary 4.5. Suppose M is a countable transitive model of ZFC of height $\delta $ satisfying that there is a proper class of completely Jónsson cardinals. Let $\xi $ be any countable ordinal. Then there is a subcategory of ${\mathcal A}_{\delta }$ isomorphic to $\xi $ .

Proof We argue by induction on $\xi $ , using the following stronger hypothesis: If $M_0$ is a countable transitive model of ZFC + “There is a proper class of completely Jónsson cardinals” of height $\delta $ , and $\gamma <\delta $ , then there is a linear system of amenable embeddings $\langle j_{\alpha ,\beta } : M_{\alpha } \to M_{\beta } : \alpha \leq \beta \leq \xi \rangle $ with $\operatorname {\mathrm {crit}}(j_{0,\xi })> \gamma $ , each $M_{\alpha }$ having the same ordinals $\delta $ . Suppose this is true for all $\xi ' < \xi $ . If $\xi =\xi '+1$ , then we may continue to $\xi $ by taking the final embedding $j_{\xi ',\xi }$ to be a stationary tower embedding with large enough critical point. Suppose $\xi $ is a limit ordinal, and let $\xi = \sup _{n<\omega } \xi _n$ and $\delta = \sup _{n<\omega } \delta _n$ , where the $\xi _n$ and $\delta _n$ are increasing. Let $\gamma <\delta $ . Inductively choose for each $n<\omega $ , a chain of amenable embeddings $\langle j_{\alpha ,\beta } : M_{\alpha } \to M_{\beta } : \xi _n \leq \alpha \leq \beta \leq \xi _{n+1} \rangle $ , such that for all $m\leq n <\omega $ , $\operatorname {\mathrm {crit}}(j_{\xi _n,\xi _{n+1}})> j_{\xi _m,\xi _n}(\delta _n)+\gamma $ . Then by Lemma 4.4, the direct limit $M_{\xi }$ is well-founded of height $\delta $ , and each direct limit map $j_{\xi _n,\xi } : M_{\xi _n} \to M_{\xi }$ is amenable. For $\alpha <\xi $ , let $j_{\alpha ,\xi } : M_{\alpha } \to M_{\xi }$ be $j_{\xi _n,\xi } \circ j_{\alpha ,\xi _n}$ , where n is least such that $\xi _n \geq \alpha $ . For $\alpha <\beta <\xi $ coming from different intervals, let $j_{\alpha ,\beta } = j_{\xi _m,\beta } \circ j_{\xi _{m-1},\xi _m} \circ \cdots \circ j_{\xi _n,\xi _{n+1}} \circ j_{\alpha ,\xi _n}$ , where n is least such $\xi _n \geq \alpha $ and m is greatest such that $\xi _m \leq \beta $ . These are amenable since they are the composition of amenable maps. It is easy to check that $\operatorname {\mathrm {crit}}(j_{0,\xi })> \gamma $ .

The countability of $\xi $ above is optimal:

Theorem 4.6. For any ordinal $\delta $ , $\mathcal E_{\delta }$ contains no subcategory isomorphic to $\delta ^+$ . Moreover, if T is a tree of height $\delta ^+$ such that for every $t \in T$ and every $\alpha <\delta ^+$ , there is $s \geq t$ of height $\geq \alpha $ , and T is isomorphic to a subcategory of $\mathcal E_{\delta }$ , then forcing with T collapses $\delta ^+$ .

Proof Suppose $\{ M_{\alpha } : \alpha < \delta ^+ \}$ is set of objects in $\mathcal E_{\delta }$ , and each pair $\alpha < \beta $ is assigned an embedding $j_{\alpha ,\beta } : M_{\alpha } \to M_{\beta }$ , such that for $\alpha < \beta < \gamma $ , $j_{\alpha ,\gamma } = j_{\beta ,\gamma } \circ j_{\alpha ,\beta }$ .

We select continuous increasing sequences of ordinals, $\langle \xi _i : i <\delta ^+ \rangle $ , and subsets of $\delta $ , $\langle F_i : i < \delta ^+\rangle $ . Let $\xi _0 = 0$ and let $F_0$ be the set of ordinals that are fixed by every map $j_{\alpha ,\beta }$ . Given $\xi _i$ , the sequence $\langle j_{\xi _i,\beta }(\alpha ) : \beta < \delta ^+ \rangle $ is nondecreasing. Thus there is $\xi _{i+1}<\delta ^+$ such that $j_{\xi _i,\xi _{i+1}}(\alpha ) = j_{\xi _i,\beta }(\alpha )$ for all $\beta \geq \xi _{i+1}$ , and all $\alpha <\delta $ . Let $F_{i+1} = j_{\xi _i,\xi _{i+1}}[\delta ]$ . Take unions at limits. By induction, the sets $F_i$ are increasing, and for all $i<\delta ^+$ , $j_{\xi _i,\beta }(\alpha ) = \alpha $ for $\alpha \in F_i$ and $\beta \geq \xi _i$ .

Let $\gamma < \delta ^+$ be the point at which the sets $F_i$ stabilize. We claim that for all $i> \gamma $ , $j_{\xi _{\gamma },i}$ is the identity map and thus $M_i = M_{\xi _{\gamma }}$ . Otherwise, let $\alpha $ and $\eta $ be such that $j_{\xi _{\gamma },\eta }(\alpha )> \alpha $ . But then $j_{\xi _{\gamma },\xi _{\gamma +1}}(\alpha ) \in F_{\gamma +1} \setminus F_{\gamma }$ , a contradiction.

To show the claim about $\delta ^+$ -trees, suppose on the contrary T is a tree satisfying the hypothesis. If b is T-generic branch over V, then b has length $(\delta ^+)^V$ . If $\delta ^+$ is preserved, then in the extension, b gives a chain of length $\delta ^+$ in $\mathcal E_{\delta }$ , contradicting what we have shown.

To further explore the structure of these categories, we use countable transitive models $M \models \mathrm {ZFC} $ of some height $\delta $ which is the supremum of an increasing sequence $\langle \delta _n : n<\omega \rangle $ such that:

  1. (1) Each $\delta _n$ is a completely Jónsson cardinal in M.

  2. (2) For each n, $V_{\delta _n}^M \prec M$ .

Let us call these good models, and let us say an ordinal $\delta $ is good if there exists a good model of height $\delta $ . The existence of a good model follows from the existence a measurable cardinal. Note that if M is good, N has the same ordinals, and $j : M \to N$ is elementary, then $\langle j(\delta _n) : n <\omega \rangle $ witnesses that N is good. Over good models, we can build generics for $\mathbb P_{\infty }$ in a way that allows precise control over what happens to the cardinals $\delta _n$ :

Lemma 4.7. Let $f : \omega \to \omega $ be any increasing function, let M be good with witnessing sequence $\langle \delta _n : n < \omega \rangle $ , and let $\kappa _0<\kappa _1$ be regular cardinals of M below $\delta _{f(0)}$ . There is $G \subseteq \mathbb P_{\infty }^M$ generic over M such that if j is the associated generic embedding, then:

  1. (1) $\kappa _0 = \operatorname {\mathrm {crit}}(j)$ and $j(\kappa _0) \geq \kappa _1$ .

  2. (2) For all n, $\delta _{f(n)}$ is a fixed point of j.

  3. (3) For all n, if $f(n) < m < f(n+1)$ , then $\delta _m$ has cardinality $\delta _{f(n)}$ in $M[G]$ .

Proof Let $\langle p_i : i < \omega \rangle $ enumerate M, such that for all n, $p_n \in V_{\delta _n}$ . For each dense class $D \subseteq {\mathbb P}_{\infty }^M$ definable in M from a parameter p, if $p \in V_{\delta _n}$ , then by elementarity, $D \cap V_{\delta _n}$ is dense in ${\mathbb P}_{<\delta _n}$ . Let $n \mapsto \langle n_0,n_1 \rangle $ be the Gödel pairing function, and let $\langle \varphi _n(x,y) : n < \omega \rangle $ enumerate the formulas in two free variables. Now enumerate the dense subclasses of ${\mathbb P}_{\infty }$ as follows. For $n< \omega $ , if $\{ x : \varphi _{n_0}(x,p_{n_1}) \}$ is dense, let $D_n$ be this class, and otherwise let $D_n = {\mathbb P}_{\infty }$ .

Let $b = \{ z \subseteq \kappa _1 : z \cap \kappa _0 \in \kappa _0, \operatorname {\mathrm {ot}}(z) \leq \kappa _0 \},$ which by Fact 4.3 forces that $\kappa _1 = \operatorname {\mathrm {ot}}(j[\kappa _1]) \leq j(\kappa _0)$ . Then take $b' \leq b$ in $D_0 \cap V_{\delta _{f(0)}}$ . Let $a_0 = \{ z \subseteq V_{\delta _{f(0)}} : z \cap \bigcup b' \in b', \operatorname {\mathrm {ot}}(z \cap \delta _{f(0)} )= \delta _{f(0)} \}$ , which forces $\delta _{f(0)}$ to be fixed.

We choose inductively a sequence $a_0 \geq a_1 \geq a_2 \geq \cdots $ such that for all n:

  1. (1) $a_{n}$ is below something in $D_{n}$ .

  2. (2) $a_{n} \subseteq \{ z \subseteq V_{\delta _{f(n)}} : \operatorname {\mathrm {ot}}(z) = \delta _{f(n)} \}$ .

  3. (3) $a_{n+1}$ forces $\delta _{f(n+1)-1}< j(\delta _{f(n)}^+)<\delta _{f(n+1)}$ .

The last condition ensures that if $f(n)<m<f(n+1)$ , then $\delta _m$ is collapsed to $\delta _{f(n)}$ in $M[G]$ . Given $a_n$ , take a cardinal $\kappa $ , $\delta _{f(n+1)-1}< \kappa <\delta _{f(n+1)}$ , and let $a_n'$ be the stationary set $\{ z \subseteq V_{\kappa } : z \cap \bigcup a_n \in a_n, |z| = \delta _{f(n)} \}$ . By Fact 4.3, this forces that $\kappa = \operatorname {\mathrm {ot}}(j[\kappa ]) < j(\delta _{f(n)}^+)$ . Then extend to $a_n" \in D_{n+1} \cap V_{\delta _{f(n+1)}}$ . Then let $a_{n+1} = \{ z \subseteq V_{\delta _{f(n+1)}} : z \cap \bigcup a_n" \in a_n", \operatorname {\mathrm {ot}}(z \cap \delta _{f(n+1)}) = \delta _{f(n+1)}\}$ .

Theorem 4.8. If $\delta $ is good, then ${\mathcal A}_{\delta }$ contains an honest subcategory isomorphic to an Aronszajn tree.

Proof Let us first describe our mechanism for splitting into incompatible nodes. Suppose M is a good model of height $\delta $ with witnessing sequence $\langle \delta _n : n < \omega \rangle $ . Let us partition the natural numbers into blocks $B_0,B_1,B_2,\dots $ as follows. Let $B_0 = \emptyset $ , and given $B_{n-1}$ , let $B_n$ be the next n numbers above $B_{n-1}$ . In other words, $B_n = \{ \frac {n(n-1)}{2},\frac {n(n-1)}{2} + 1, \dots ,\frac {n(n-1)}{2} + n -1 \}$ for $n>0$ . Let $\langle B_n(i) : i < n \rangle $ enumerate block $B_n$ in increasing order. Using Lemma 4.7, for each n, we can take a $\mathbb P_{\infty }$ -generic $G_n$ over M with associated embedding $j_n$ such that:

  1. (1) $\operatorname {\mathrm {crit}}(j_n) \geq \delta _n$ .

  2. (2) For sufficiently large m, $\delta _{B_m(n)}$ is fixed by $j_n$ .

  3. (3) For sufficiently large m, if $B_{m}(n)<i<B_{m+1}(n)$ , then $\delta _i$ has cardinality $\delta _{B_{m}(n)}$ in $M[G_n]$ .

This ensures that if $n_0 < n_1$ , then there is no model N of ZF with the same class of ordinals $\delta $ containing both $M[G_{n_0}]$ and $M[G_{n_1}]$ . For if there were such an N, then in N, for sufficiently large m, $|\delta _{B_m(n_0)}| = |\delta _{B_m(n_1)}| = |\delta _{B_{m+1}(n_0)}|$ , and so N would have a largest cardinal.

Let $M_0$ be a good model of height $\delta $ , with witnessing sequence $\langle \delta _n : n <\omega \rangle $ . We will build an $\omega _1$ -tree $T \subseteq \,^{<\omega _1}\omega $ by induction. Each $\sigma \in T$ will be assigned a good model $M_{\sigma }$ of height $\delta $ , and for pairs $\sigma \subseteq \tau $ in T, we will assign an amenable embedding $j_{\sigma ,\tau } : M_{\sigma } \to M_{\tau }$ , such that if $\sigma \subseteq \tau \subseteq \upsilon $ , then $j_{\sigma ,\upsilon } = j_{\tau ,\upsilon }\circ j_{\sigma ,\tau }$ . When $\sigma \perp \tau $ , we will arrange that there is not any ZF model N of height $\delta $ such that $M_{\sigma },M_{\tau } \subseteq N$ , which guarantees that there is no arrow between $M_{\sigma }$ and $M_{\tau }$ in the category ${\mathcal A}_{\delta }$ . This makes the tree of models an honest subcategory. Theorem 4.6 will ensure that T is Aronszajn.

We build T as a union of trees $T_{\alpha }$ for $\alpha < \omega _1$ , where $T_{\alpha }$ has height $\alpha +1$ , and $T_{\beta }$ end-extends $T_{\beta }$ for $\beta>\alpha $ . Along the way, we build an increasing sequence of injective functors $F_{\alpha } : T_{\alpha } \to {\mathcal A}_{\delta }$ . Put $T_0 = \{\emptyset \}$ and $F_0(\emptyset ) = M_0$ . Given $T_{\alpha }$ and $F_{\alpha }$ , form $T_{\alpha +1}$ by adding $\sigma ^{\smallfrown } \langle n \rangle $ for each top node $\sigma $ and each $n < \omega $ . For such top nodes $\sigma $ , take an embedding $j_{\sigma ,\sigma ^{\smallfrown }\langle n\rangle } : M_{\sigma } \to M_{\sigma ,\sigma ^{\smallfrown }\langle n\rangle } = M_{\sigma }[G_n]$ as above, so that no two of them amalgamate. For $\tau \subseteq \sigma $ , let $j_{\tau ,\sigma ^{\smallfrown }\langle n\rangle } = j_{\sigma ,\sigma ^{\smallfrown }\langle n\rangle } \circ j_{\tau ,\sigma }$ .

Suppose $\lambda $ is a countable limit ordinal and we have constructed $T_{\alpha }$ and $F_{\alpha }$ for $\alpha <\lambda $ . Let $T_{\lambda }'$ and $F_{\lambda }'$ be the unions of the previously constructed trees and functors. We must build the top level. Let us assume the following inductive hypothesis: for each $\alpha <\lambda $ , each $\sigma \in T_{\alpha }$ , and each $n<\omega $ , there is $\tau \supseteq \sigma $ at the top level of $T_{\alpha }$ such that $\operatorname {\mathrm {crit}}(j_{\sigma ,\tau }) \geq \delta _n$ . To construct $T_{\lambda }$ , use the induction hypothesis to choose for each node $\sigma \in T_{\lambda }'$ and each $n<\omega $ , an increasing sequence $\langle \tau _i : i < \omega \rangle \subseteq T_{\lambda }'$ such that $\tau _0 = \sigma $ , $\sup _i \operatorname {\mathrm {len}}(\tau _i) = \lambda $ , and for each $i < \omega $ ,

$$ \begin{align*} \operatorname{\mathrm{crit}}(j_{\tau_i,\tau_{i+1}})> \max \{ \delta_n,\delta_i,j_{\tau_0,\tau_i}(\delta_i), j_{\tau_1,\tau_i}(\delta_i),\dots, j_{\tau_{i-1},\tau_i}(\delta_i) \}. \end{align*} $$

Let $\tau (\sigma ,n) = \bigcup _i \tau _i$ . By Lemma 4.4, the direct limit of the system $\langle j_{\tau _i,\tau _m} : M_{\tau _i} \to M_{\tau _m} : i \leq m < \omega \rangle $ yields a model $M_{\tau (\sigma ,n)}$ of height $\delta $ such that the direct limit maps $j_{\tau _i, \tau (\sigma ,n)} : M_{\tau _i} \to M_{\tau (\sigma ,n)}$ are amenable. If $\sigma \subseteq \upsilon \subseteq \tau (\sigma ,n)$ , then the map $j_{\upsilon ,\tau (\sigma ,n)}$ is given by $j_{\tau _i,\tau (\sigma ,n)} \circ j_{\upsilon ,\tau _i}$ for any i such that $\tau _i \supseteq \upsilon $ . Let the top level of $T_{\lambda }$ consist of all such $\tau (\sigma ,n)$ , and let the functor $F_{\lambda }$ be defined as above. By construction, the inductive hypothesis is preserved.

Similar constructions yield other kinds of uncountable trees as honest subcategories of ${\mathcal A}_{\delta }$ . For example, we can build a copy of $^{<\omega }\omega $ where we also require that if $\sigma $ has length n, then for every initial segment $\tau \subseteq \sigma $ and every $m<\omega $ , $\operatorname {\mathrm {crit}}(j_{\sigma ,\sigma ^{\smallfrown } \langle m \rangle })> j_{\tau ,\sigma }(\delta _n)$ . Then every branch yields a nice direct limit. An induction as in Corollary 4.5 allows this to be extended to any countable height. Let us record this as:

Proposition 4.9. If $\delta $ is good, then for every countable ordinal $\alpha $ , there is an honest subcategory of ${\mathcal A}_{\delta }$ isomorphic to the complete binary tree of height $\alpha $ .

4.3 Ill-founded subcategories

In order to construct ill-founded subcategories of ${\mathcal A}_{\delta }$ , we pass to models of enough set theory that are well-founded beyond $\delta $ and contain some chosen member of ${\mathcal A}_{\delta }$ , but ultimately have ill-founded $\omega _1$ . One way of achieving this is via Barwise compactness [Reference Barwise2]. Another is via the following:

Fact 4.10 (See [Reference Foreman6, Section 2.6])

Suppose r is a real. Let G be generic for $\mathcal {P}(\omega _1)/\operatorname {\mathrm {NS}}$ over $L[r]$ . Let $j : L[r] \to N = \operatorname {\mathrm {Ult}}(L[r],G)$ be the ultrapower embedding. Then N is well-founded up to $\omega _2^{L[r]}$ , but $\omega _1^N$ is ill-founded.

We can decompose each ordinal in such a model into a sum of purely ill-founded and a purely well-founded part. Let N be any countable ill-founded model of $\mathrm { ZF} -$ Powerset that has standard $\omega $ . Let $\xi $ be the ordertype of the set of well-founded ordinals of N. Friedman [Reference Friedman7] showed that the ordertype of the ordinals of N is $\xi + ({\mathbb Q} \times \xi )$ . Thus every N-ordinal $\alpha $ can be written as $\alpha = i(\alpha ) + w(\alpha )$ , where $w(\alpha ) <\xi $ , and $i(\alpha )$ is either 0 or is represented in the isomorphism as $(q,0)$ , where $q \in {\mathbb Q}$ .

We apply this trick to construct honest subcategories of ${\mathcal A}_{\delta }$ isomorphic to three canonical ill-founded partial orders: the real numbers, the universal countable pseudotree (to be defined below), and the reverse-ordered complete binary tree. We present them in increasing order of the consistency strength of the hypothesis employed.

Theorem 4.11. Suppose there is a countable transitive model of height $\delta $ of ZFC + “There is a proper class of completely Jónsson cardinals.” Then there is a subcategory of ${\mathcal A}_{\delta }$ isomorphic to the linear order $\mathbb R$ .

Proof Suppose M is a countable transitive model of height $\delta $ of ZFC + “There is a proper class of completely Jónsson cardinals” and $r_M$ is a real coding M. Let N be a countable model of $\mathrm {ZFC} -$ Powerset with standard $\omega $ and ill-founded $\omega _1$ , such that $r_M \in N$ and the conclusion of Corollary 4.5 holds in N.

Fix some $\zeta $ that N thinks is a countable ordinal but is really ill-founded. There is a subcategory of ${\mathcal A}_{\delta }$ isomorphic to the linear order $\{ \alpha : N \models \alpha < \zeta \}$ . If we fix an increasing sequence $\langle \delta _n : n < \omega \rangle $ cofinal in $\delta $ , then we can modify the construction in Corollary 4.5 slightly to require that if $\kappa = \operatorname {\mathrm {crit}}(j_{\alpha ,\alpha +1})$ and $\delta _n \leq \kappa <\delta _{n+1}$ , then $j_{\alpha ,\alpha +1}(\kappa ) \geq \delta _{n+1}$ .

Thus there is a subcategory of ${\mathcal A}_{\delta }$ isomorphic to the rationals, which has as its objects all models indexed by $i(\alpha )$ for $0<i(\alpha )<\zeta $ . Let us write this as $\langle j_{a,b} : M_a \to M_b : a \leq b \in {\mathbb Q} \rangle $ . We have that for rationals $a<b$ , if $\kappa = \operatorname {\mathrm {crit}}(j_{a,b})$ and $\delta _n \leq \kappa < \delta _{n+1}$ , then $j_{a,b}(\kappa ) \geq \delta _{n+1}$ . Now we argue that we can fill in the Dedekind cuts with direct limits and get a larger subcategory of ${\mathcal A}_{\delta }$ .

Suppose $r \in \mathbb R \setminus {\mathbb Q}$ . Let $M_r$ be the direct limit and let $j_{a,r}$ be the direct limit map for rationals $a<r$ . Let $b> r$ be rational. For $x \in M_r$ , there is a rational $a<r$ and $y \in M_a$ such that $x = j_{a,r}(y)$ . Let $j_{r,b}(x) = j_{a,b}(y)$ for any such $a,y$ . The choice of $a,y$ does not matter, since if $x = j_{a,r}(y) = j_{a',r}(y')$ for $a < a'$ , then $y' = j_{a,a'}(y)$ , and $j_{a,b}(y) = j_{a',b}(y')$ . Furthermore, if $b,b'$ are rational such that $r<b<b'$ , then $j_{r,b'} = j_{b,b'} \circ j_{r,b}$ . This is because if $x \in M_r$ and $a,y$ are such that $j_{a,r}(y) = x$ , then

$$ \begin{align*} j_{r,b'}(x) = j_{a,b'}(y) = j_{b,b'} \circ j_{a,b}(y)= j_{b,b'} \circ j_{r,b}(x). \end{align*} $$

If $M_r \models \varphi (x_0,\dots ,x_{n-1})$ , then there are a rational $a<r$ and $y_0,\dots ,y_{n-1} \in M_a$ such that $j_{a,r}(y_m) = x_m$ for $m<n$ , and so $M_b \models \varphi (j_{a,b}(y_0),\dots ,j_{a,b}(y_{n-1}))$ . Thus $j_{r,b}$ is elementary, and so $M_r$ is well-founded and has height $\delta $ . For irrational numbers $r<s$ , let $j_{r,s} = j_{b,s} \circ j_{r,b}$ for any rational $b \in (r,s)$ . The choice of b does not matter, since for $b,b'$ rational such that $r < b < b' < s$ , we have

$$ \begin{align*} j_{b,s} \circ j_{r,b} = j_{b',s} \circ j_{b,b'} \circ j_{r,b} = j_{b',s} \circ j_{r,b'}. \end{align*} $$

To verify the commutativity of the system, let $r<s<t$ be reals and let $x \in M_r$ . Let $b,c$ be rational such that $r<b<s<c<t$ . Then

$$ \begin{align*} j_{r,t}(x) = j_{b,t} \circ j_{r,b}(x) = j_{c,t} \circ j_{b,c} \circ j_{r,b}(x). \end{align*} $$

But by definition, $j_{b,c}(z) = j_{s,c} \circ j_{b,s}(z)$ for any $z \in M_b$ . Thus

$$ \begin{align*} j_{r,t}(x) = j_{c,t} \circ \ j_{s,c} \circ j_{b,s} \circ j_{r,b}(x) = j_{s,t} \circ j_{r,s}(x). \end{align*} $$

To show that the maps are amenable, first suppose r is irrational, $a<r$ is rational, and $\gamma < \delta $ . Let $\langle a_n : n < \omega \rangle $ be an increasing sequence of rationals converging to r, with $a_0 = a$ . For $n<\omega $ , let $\kappa _n = \min \{ \operatorname {\mathrm {crit}}(j_{a_n,a_m}) : n<m < \omega \}$ . By passing to a subsequence if necessary, we may assume that for all n, $\kappa _n = \operatorname {\mathrm {crit}}(j_{a_n,a_{n+1}})$ , and $\kappa _n \leq \kappa _{n+1}$ . Now it cannot happen that for infinitely many n and all $m> n$ , $j_{a_n,a_m}(\kappa _n)> \kappa _m$ , because then the direct limit would be ill-founded. Thus there is some $n^*$ such that for all $n \geq n^*$ , there is $m>n$ such that $j_{a_n,a_m}(\kappa _n) \leq \kappa _m$ . By our extra requirement on how high the critical points are sent, this means that for large enough n, $\kappa _n> \gamma $ . Therefore, for a large enough n, $j_{a,r}[\gamma ] = j_{a_n,r}(j_{a,a_n}[\gamma ]) \in M_r$ .

Now suppose r is irrational, $b>r$ is rational, and $\gamma <\delta $ . By the previous paragraph, there is some rational $a<r$ such that $\operatorname {\mathrm {crit}}(j_{a,r})> \gamma $ . Thus $j_{r,b}[\gamma ] = j_{a,b}[\gamma ] \in M_b$ . Finally, if $r<s$ are irrational, the map $j_{r,s}$ is amenable since it is the composition of two amenable maps $j_{b,s} \circ j_{r,b}$ , for any rational $b \in (r,s)$ .

We note also that $M_r = \bigcup _{a<r} M_a$ for any r. This is true for rational r by the construction in the proof of Lemma 4.5, since all limit models are direct limits. If r is irrational and $x \in M_r$ , then $x \in M_b$ for all rational $b> r$ . If $x \notin \bigcup _{a<r} M_a$ , then N thinks there is some least ordinal $\gamma $ such that $x \in M_{\gamma }$ , which must be a successor ordinal of N. Thus $x \notin M_{i(\gamma )}$ , and $i(\gamma )$ corresponds to a rational number greater than r. This contradiction shows that $x \in M_a$ for some $a<r$ .

Using stationary tower forcing as the basic building block, we have constructed various (well-founded) trees and linear orders as honest subcategories of ${\mathcal A}_{\delta }$ . A natural generalization of these two kinds of partial orders is the notion of a pseudotree, which is simply a partial order which is linear below any given element. By the well-known universality of ${\mathbb Q}$ , all countable linear orders appear in ${\mathcal A}_{\delta }$ for appropriate $\delta $ . In fact, this generalizes to pseudotrees:

Theorem 4.12. If $\delta $ is good, then every countable pseudotree is isomorphic to an honest subcategory of ${\mathcal A}_{\delta }$ .

To prove this, we first construct a certain countable pseudotree which contains every other countable pseudotree as a substructure. Let $T_{{\mathbb Q}}$ be the collection of all partial functions $f : {\mathbb Q} \to \omega $ such that:

  1. (1) $\operatorname {\mathrm {dom}} f$ is a proper initial segment of ${\mathbb Q}$ .

  2. (2) If $f \not = \emptyset $ , then there is a finite sequence $-\infty = q_0 < q_1 < \cdots < q_n = \max (\operatorname {\mathrm {dom}} f)$ such that for $i <n$ , $f \restriction (q_i,q_{i+1}]$ is constant.

We put $f \leq g$ when $f \subseteq g$ . Notice that $T_{{\mathbb Q}}$ satisfies the following axiom set, which we call DPM for “Dense Pseudotrees with Meets”:

  1. (1) It’s a pseudotree with a least element 0.

  2. (2) Every two elements $f,g$ have an infimum $f \wedge g$ .

  3. (3) Infinite Splitting: For all $g,f_0,\dots ,f_{n-1}$ such that $f_i \wedge f_j = g$ for $i<j < n$ , there is $f_n> g$ such that $f_i \wedge f_n = g$ for $i< n$ .

  4. (4) Density: If $g<f$ , there is h such that $g<h<f$ .

To be more precise, we take the language to be $\{ 0, \wedge , \leq \}$ , where 0 is a constant, $\wedge $ is a binary function, and $a<b$ means $a \leq b$ and $a \not = b$ . The third axiom is actually an infinite scheme. Let PM be the system consisting of only the first two axioms. Note that in the theory PM, $\leq $ is definable in terms of $\wedge $ : $p \leq q$ iff $p \wedge q = p$ . Thus to verify that a map from one model of PM to another is an embedding, it suffices to show that it is an injection that is a homomorphism in the restricted language $\{0,\wedge \}$ .

Lemma 4.13. Suppose T satisfies PM, Q satisfies DPM, $a \in T$ , S is a finite substructure of T, and $\pi : S \to Q$ is an embedding. Then there is a finite substructure $S'$ of T containing $S \cup \{ a \}$ and an embedding $\pi ' : S' \to Q$ extending $\pi $ .

Proof Let us assume $a \notin S$ . Let $b = \max \{ a \wedge s : s \in S \}$ . Note that $a \wedge s = b \wedge s$ for all $s \in S$ by the maximality of b. First we claim that $S \cup \{ b \}$ and $S \cup \{ a,b \}$ are both closed under the operation $\wedge $ . Let $s_0 = \inf \{ s \in S : s \geq b \}$ . Since T is linearly ordered below $s_0$ , for all $s \in S$ ,

$$ \begin{align*}b \wedge s = \begin{cases} b, &\text{ if } b \leq s_0 \wedge s, \\ s_0 \wedge s, &\text{ if } s_0 \wedge s \leq b. \\ \end{cases}\end{align*} $$

Thus for all $s \in S$ , $b \wedge s \in S \cup \{ b \}$ . Further, if $b \leq s \wedge s_0$ , then $b \leq a \wedge s$ . Thus for all $s \in S$ , either $a \wedge s = b$ , or $b> a \wedge s$ and so $b> s \wedge s_0$ , which implies $a \wedge s = b \wedge s = s \wedge s_0 \in S$ . Therefore, $S \cup \{ a,b \}$ is also closed under $\wedge $ .

Let us first extend $\pi $ to an embedding $\pi ' : S \cup \{b \} \to Q$ . If $b \notin S$ , let $s_1 \in S$ be the maximum element below b. Use Density to pick some $b^* \in Q$ such that $\pi (s_1)<b^*<\pi (s_0)$ , and let $\pi '(b) = b^*$ . Suppose $s \in S$ . If $s_0 \leq s$ , then $\pi '(b \wedge s) = \pi '(b) = b^* = b^* \wedge \pi (s)$ , since $\pi (s) \geq \pi (s_0)> b^*$ . If $s_0 \nleq s$ , then $s_0 \wedge s \leq s_1$ by the minimality of $s_0$ , and $\pi '(b \wedge s) = \pi (s_0 \wedge s) = \pi (s_0) \wedge \pi (s) = b^* \wedge \pi (s_0) \wedge \pi (s) = b^* \wedge \pi (s)$ , since $\pi (s) \wedge \pi (s_0) \leq \pi (s_1) < b^*$ .

Now if b is not maximal in $S \cup \{b \}$ , let $\{ c_0,\dots ,c_{n-1} \}$ be the set of minimal elements above b in S, which implies that $c_i \wedge c_j = b$ for $i < j < n$ . Use Infinite Splitting to find $a^* \in Q$ such that $a^*> b^*$ and, if the $c_i$ are defined, $a^* \wedge \pi (c_i) = b^*$ for $i< n$ . We claim that for all $s \in S$ , $a^* \wedge \pi (s) = b^* \wedge \pi (s)$ . For if $s = b$ , $a^* \wedge \pi (b) = a^* \wedge b^* = b^* = b^* \wedge b^*$ . If $s> b$ , then $s \geq c_i$ for some $i < n$ , so $a^* \wedge \pi (s) = b^*$ . If $s \ngeq b$ , then $\pi (s) \wedge b^* < b^* < a^*$ , so also $\pi (s) \wedge a^* < b^*$ , and thus $a^* \wedge \pi (s) = b^* \wedge \pi (s)$ . Thus for all $s \in S$ , $\pi '(a \wedge s) = \pi '(b \wedge s) = b^* \wedge \pi (s) = a^* \wedge \pi (s)$ . Therefore, we may define the desired extension $\pi "$ of $\pi '$ by putting $\pi "(a) = a^*$ .

Corollary 4.14. Any countable model of PM can be embedded into any model of DPM, and any two countable models of DPM are isomorphic.

Proof Suppose $S \models $ PM, $T \models $ DPM, and S is countable. Let $\langle s_i : i < \omega \rangle $ enumerate S. Using Lemma 4.13, we can build increasing sequences of finite substructures $S_n \subseteq S$ and embeddings $\pi _n : S_n \to T$ for $n<\omega $ , such that $S_n \supseteq \{ s_i : i < n \}$ . Then $\pi = \bigcup _{n<\omega } \pi _n$ is an embedding of S into T. If we additionally assume that $T = \{ t_i : i < \omega \}$ and $S \models $ DPM, then given $\pi _n : S_n \to T$ , we can find a finite substructure $T_n \supseteq \operatorname {\mathrm {ran}} \pi _n \cup \{ t_n \}$ and an embedding $\sigma _n : T_n \to S$ extending $\pi _n^{-1}$ . We then take $S_{n+1} \supseteq \operatorname {\mathrm {ran}} \sigma _n \cup \{ s_n \}$ and $\pi _{n+1}$ extending $\sigma _n^{-1}$ . Then $\pi = \bigcup _{n<\omega } \pi _n$ is an isomorphism.

Lemma 4.15. Every pseudotree is a substructure of a model of PM.

Proof Let T be a pseudotree. T is isomorphic to the collection of its subsets of the form $S_t = \{ x \in T : x \leq t \}$ , ordered by inclusion. Extend this to a collection $T^*$ by adding $S_{t_0} \cap S_{t_1}$ for every two $t_0,t_1\in T$ , and $\emptyset $ if T does not already have a minimal element. We claim that $T^*$ is closed under finite intersection. Let $t_0,t_1,t_2,t_3 \in T$ . The sets $S_{t_0} \cap S_{t_i}$ for $i < 4$ are initial segments of the linearly ordered set $S_{t_0}$ , and so are $\subseteq $ -comparable. If j is such that $S_{t_0} \cap S_{t_j}$ is smallest, then $S_{t_0} \cap S_{t_j} \subseteq S_{t_i}$ for all $i<4$ . To check that $T^*$ is a pseudotree, suppose $S_0,S_1,S_2 \in T^*$ and $S_0,S_1 \subseteq S_2$ . Again, $S_0$ and $S_1$ are initial segments of a linear order, so one is contained in the other.

Corollary 4.16. Every countable pseudotree can be embedded into $T_{{\mathbb Q}}$ .

Now we argue that if $\delta $ is a good ordinal, there is a countable honest subcategory of ${\mathcal A}_{\delta }$ that is a partial order satisfying DPM. Suppose M is a good model of height $\delta $ and $r_M$ is a real coding M. Let N be a countable model of $\mathrm {ZFC} -$ Powerset with standard $\omega $ and ill-founded $\omega _1$ , such that $r_M \in N$ and N satisfies the conclusion of Theorem 4.8. In the real universe, the object T that N thinks is an Aronszajn tree isomorphic to an honest subcategory of ${\mathcal A}_{\delta }^N$ is actually a countable pseudotree isomorphic to an honest subcategory of ${\mathcal A}_{\delta }$ , since $\delta $ is in the well-founded part of N, and because the non-amalgamability of models corresponding to incompatible nodes is witnessed in an absolute way. We will find a substructure of T that satisfies DPM.

As before, each N-ordinal $\alpha $ has a decomposition into ill-founded and well-founded parts, $\alpha = i(\alpha )+w(\alpha )$ , and the collection $\{ i(\alpha ) : \alpha < \omega _1^N \}$ is a dense linear order with a left endpoint. Let $S \subseteq T$ be the collection of nodes at levels $i(\alpha )$ for $\alpha < \omega _1^N$ . Let us verify each axiom of DPM. We have already argued that it’s a pseudotree, and we keep the root node. For infima, if $s,t \in S$ are incomparable, then N thinks that there is a least ordinal $\alpha $ such that $s(\alpha ) \not = t(\alpha )$ . Then $s \restriction i(\alpha ) = t \restriction i(\alpha )$ is the infimum of s and t in S, since $i(\alpha )<i(\beta )$ implies $\alpha <\beta $ . To verify Density, just use the fact that the collection of levels of S is a dense linear order. To verify Infinite Splitting, let $g,f_0,\dots ,f_{n-1}$ be as in the hypothesis, so that $g = f_k \wedge _S f_m$ for $k<m<n$ . Let $\gamma = \operatorname {\mathrm {dom}} g$ . We may select any $f_n\in S$ such that $f_n \restriction \gamma = g$ and $f_n(\gamma ) \not = f_m(\gamma )$ for all $m<n$ . This completes the proof of Theorem 4.12.

Remark. As pointed out by the referee, Theorem 4.12 has the following generalization. If we construct the tree of models and embeddings in the proof of Theorem 4.8 with the additional requirement that the critical points are always sent sufficiently high, as in the proof of Theorem 4.11, then we can take a Dedekind completion of our universal countable pseudotree and obtain an isomorphic honest subcategory of ${\mathcal A}_{\delta }$ . Such a pseudotree will be universal for the class of pseudotrees possessing a countable dense subset.

Theorem 4.17. If there is a set of measurable cardinals of ordertype $\omega +1$ , then there is a countable ordinal $\delta $ such that ${\mathcal A}_{\delta }$ contains an honest subcategory isomorphic to the reverse-ordered complete binary tree of height $\omega $ .

Proof Let $\kappa $ be the $\omega +1^{st}$ measurable cardinal, with normal measure ${\mathcal U}$ . Let M be a countable transitive set such that there is an elementary embedding $\sigma : M \to (H_{\theta },\in ,{\mathcal U})$ , for $\theta>2^{\kappa }$ regular. Let $\kappa ^*,{\mathcal U}^* \in M$ be such that $\sigma (\kappa ^*) = \kappa $ and $\sigma ({\mathcal U}^*)={\mathcal U}$ . Then $(M,{\mathcal U}^*)$ is iterable. (See, for example, Lemma 19.11 of [Reference Kanamori11].)

Let $r_M$ be a real coding $(M,{\mathcal U}^*)$ , and let N be a countable model of $\mathrm {ZFC} - $ Powerset with standard $\omega $ and ill-founded $\omega _1$ , such that $r_M \in N$ , and satisfying that $(M,{\mathcal U}^*)$ is iterable. Let $\delta < \kappa ^*$ be completely Jónsson in M and above the first $\omega $ measurables of M. Working in N, iterate $(M,{\mathcal U}^*) \ \omega _1^N$ -many times, and let $j : M \to M_{\omega _1^N}$ be the iterated ultrapower map. Then j is the identity below $\kappa ^*$ , and $j(\kappa ^*) = \omega _1^N$ . Then take in N an elementary substructure $M^*$ of $(V_{j(\kappa ^*)})^{M_{\omega _1^N}}$ that N thinks is countable and transitive, containing some N-ordinal $\zeta $ which is really ill-founded.

Now we apply Theorem 4.1 in N. Let $T \in N$ be a sequential tree such that N thinks T is well-founded and of rank $\zeta $ . In N, there is an honest subcategory of ${\mathcal A}_{\delta }$ isomorphic to T. The honesty is absolute to our universe, since the incomparability is just witnessed by inequalities among the ordertypes of the first $\omega $ measurable cardinals of the various models corresponding to the nodes of T.

To complete the argument, we show that in our universe, there is a subtree of T isomorphic to the complete binary tree of height $\omega $ . It suffices to show that if $S \in N$ is a sequential tree such that $N \models \rho _S(\emptyset ) = \zeta $ , where $\zeta $ is really ill-founded, then there are incomparable nodes $p,q \in S$ such that $\rho _S(p)$ and $\rho _S(q)$ are both ill-founded ordinals, for then the conclusion follows by a simple induction. Now since $N \models \rho _S(t) = \sup _{s < t}(\rho _S(s) + 1)$ for all $t \in S$ , there is $p \in S$ of rank $i(\zeta )$ . Since $i(\zeta )$ is a limit ordinal, p must have infinitely many nodes immediately below it, call them $\{ q_i : i <\omega \}$ , and $N \models \rho _S(p) = \sup _i(\rho _S(q_i) + 1)$ . Thus there are $n<m$ such that $\rho _S(q_n)$ and $\rho _S(q_m)$ are both ill-founded, as there is no least ill-founded ordinal.

5 Questions

In an earlier version of this manuscript, we asked whether there can be two models of ZFC with the same ordinals such that each is elementarily embeddable into the other. This was answered in [Reference Eskew, Friedman, Hayut and Schlutzenberg5].

If M is a self-embeddable inner model, then in light of Theorems 1.1 and 1.2, it is interesting to ask how close M can be to V. The second author [Reference Friedman8] showed under some mild large cardinal assumptions that V can be a class-generic forcing extension of such an M. Some related questions include:

Question 1. Suppose M is a transitive proper class definable from parameters.

  1. (1) Can M be self-embeddable and correct about cardinals?

  2. (2) Can M be self-embeddable and correct about cofinalities?

  3. (3) Can M be embeddable into V and be correct about either cardinals or cofinality $\omega $ ?

Our direct-limit constructions in Section 4 were particular to countable models. Thus it is natural to ask:

Question 2. Is it consistent that there is an ordinal $\delta $ of uncountable cofinality such that ${\mathcal A}_{\delta }$ contains a copy of the linear order $\omega +1$ ?

Although we ruled out the possibility of a Suslin tree being isomorphic to a subcategory of ${\mathcal A}_{\delta }$ for a countable $\delta $ , we don’t know much else about the combinatorial properties of the Aronszajn tree constructed in Theorem 4.8.

Question 3. Characterize the class of Aronszajn trees that can be isomorphic to an honest subcategory of ${\mathcal A}_{\delta }$ for a countable $\delta $ . Can it contain non-special trees?

Our methods for building upward-growing and downward-growing trees as honest subcategories of ${\mathcal A}_{\delta }$ are quite different, and we don’t know if they can be combined in any interesting way. We would like to know if there is any structural asymmetry in this category, or rather:

Question 4. Can an ${\mathcal A}_{\delta }$ contain an honest subcategory isomorphic to a “diamond,” i.e., the standard partial order on the four-element Boolean algebra?

Question 5. If $\mathbb P$ is a partial order isomorphic to an honest subcategory of ${\mathcal A}_{\delta }$ , does this hold for the reverse of $\mathbb P$ ?

Acknowledgment

The authors wish to acknowledge the support of the Austrian Science Fund (FWF) through Research Project P28420.

Footnotes

1 For (3), we use a set of measurable cardinals of ordertype $\omega +1$ . The others use hypotheses weaker than one measurable cardinal.

References

Alós-Ferrer, C. and Ritzberger, K., Some remarks on pseudotrees. Order , vol. 22 (2005), no. 1, pp. 19.CrossRefGoogle Scholar
Barwise, J., Infinitary logic and admissible sets, this Journal, vol. 34 (1969), no. 2, pp. 226–252.Google Scholar
Cummings, J., Notes on singular cardinal combinatorics. Notre Dame Journal of Formal Logic , vol. 46 (2005), no. 3, pp. 251282.CrossRefGoogle Scholar
Dehornoy, P., Iterated ultrapowers and Prikry forcing. Annals of Mathematical Logic , vol. 15 (1978), no. 2, pp. 109160.CrossRefGoogle Scholar
Eskew, M., Friedman, S.-D., Hayut, Y., and Schlutzenberg, F., Mutually embeddable models of ZFC, preprint, 2021, arXiv:2108.12355.Google Scholar
Foreman, M., Ideals and generic elementary embeddings , Handbook of Set Theory (M. Foreman and A. Kanamori, editors), Springer, Dordrecht, 2010, pp. 8851147.CrossRefGoogle Scholar
Friedman, H., Countable models of set theories , Cambridge Summer School in Mathematical Logic , (A. R. D. Mathias and H. Rogers, editors), Lecture Notes in Mathematics, vol. 337, Springer, Berlin, 1973, pp. 539573.CrossRefGoogle Scholar
Friedman, S.-D., Capturing the universe, preprint, 2021. Available at http://www.logic.univie.ac.at/sdf/papers/capture.pdf.Google Scholar
Gitik, M., Prikry-type forcings , Handbook of Set Theory (M. Foreman and A. Kanamori), Springer, Dordrecht, 2010, pp. 13511447.CrossRefGoogle Scholar
Jech, T., Set Theory: The Third Millennium Edition, Revised and Expanded , Springer Monographs in Mathematics, Springer, Berlin, 2003.Google Scholar
Kanamori, A., The Higher Infinite: Large Cardinals in Set Theory from their Beginnings , second ed., Springer Monographs in Mathematics, Springer, Berlin, 2003.Google Scholar
Koppelberg, S. and Monk, J. D., Pseudo-trees and Boolean algebras. Order , vol. 8 (1991/92), no. 4, 359374.CrossRefGoogle Scholar
Kurepa, D., Ramified sets or pseudotrees. Institut Mathématique , vol. 22 (1977), no. 36, 149163.Google Scholar
Larson, P. B., The Stationary Tower: Notes on a Course by W. Hugh Woodin , University Lecture Series, vol. 32, American Mathematical Society, Providence, 2004.Google Scholar
Rowbottom, F., Some strong axioms of infinity incompatible with the axiom of constructibility. Annals of Mathematical Logic , vol. 3 (1971), no. 1, pp. 144.CrossRefGoogle Scholar
Suzuki, A., No elementary embedding from $V$ into $V$ is definable from parameters, this Journal, vol. 64 (1999), no. 4, pp. 1591–1594.Google Scholar
Vickers, J. and Welch, P. D., On elementary embeddings from an inner model to the universe, this Journal, vol. 66 (2001), no. 3, pp. 1090–1116.Google Scholar