Set-theoretic tree

A partial order in which the strict predecessors of each node form a well-order. The height of a node is the order type of its predecessors; nodes of a common height form a level. This order-theoretic meaning is distinct from a graph-theoretic tree.

At a limit level, two nodes with the same predecessor at every smaller level must be equal. This is a uniqueness condition; it need not provide an upper node for every cofinal branch through the lower levels.

Every node has an extension at every higher level below the height of the set-theoretic tree. Equivalently, its extension heights are unbounded in the set-theoretic tree height. Having no terminal nodes alone is weaker.

For a kappa-tree, retain nodes whose extension heights are unbounded in $\kappa$. The retained nodes are predecessor-closed. Each level remains nonempty: otherwise regularity would bound the union of fewer than $\kappa$ bounded extension sets. The same argument above a retained node ensures retained extensions at every later level. Singular height invalidates this proof and the unrestricted conclusion.

For a regular uncountable cardinal number $\kappa$, a set-theoretic tree of height $\kappa$ with nonempty levels of cardinality less than $\kappa$. The regular-height convention is important for the unbounded-extension kernel of a regular tree.

A set-theoretic tree of height ${\omega }_1$ with countable levels and at least ${\aleph }_2$ distinct cofinal branches.

Let $\kappa$ be strongly inaccessible cardinal in the ground model and perform the finite Lévy collapse to omega-one. The ground full binary set-theoretic tree of height $\kappa$ has all levels of size less than $\kappa$, so these levels become countable. Its at least $({\kappa }^{+}{)}^M$ ground branches remain distinct. The chain in a partial order condition preserves $({\kappa }^{+}{)}^M$, which is the extension ${\aleph }_2$. The unchanged ground set-theoretic tree therefore witnesses the Kurepa hypothesis.

There exists an ${\omega }_1$-tree with countable levels and at least ${\aleph }_2$ distinct cofinal branches.

There is $\mathcal{F}\subseteq \mathcal{P}({\omega }_1)$ of size ${\aleph }_2$ such that $\{X\cap \alpha :X\in \mathcal{F}\}$ is countable for every $\alpha <{\omega }_1$. Its initial-segment tree, pruned and leveled to be normal, is a Kurepa tree.

A set-theoretic tree of height ${\omega }_1$ with countable levels and no cofinal branch. More generally, a $\kappa$-Aronszajn tree has height a regular uncountable $\kappa$, levels of size less than $\kappa$, and no cofinal branch.

Given coherent coinfinite injections into omega, use all restrictions $e_{\alpha }\upharpoonright \beta$, where $\beta \le \alpha <{\omega }_1$, ordered by proper extension. Every level is countable because its nodes differ finitely from a fixed function on a countable domain. An uncountable chain in a partial order would have unbounded domain heights, and its union would inject ${\omega }_1$ into $\omega$, which is impossible.

An Aronszajn tree with no uncountable tree antichain. A normal splitting Suslin tree yields a Suslin line by a lexicographic ordering followed by Dedekind completion.

A well-pruned set-theoretic tree that is an Aronszajn tree and a Suslin tree gives a forcing with the countable chain condition for forcing: stronger nodes extend weaker ones. The ${\omega }_1$ dense subsets of a forcing order of nodes at or above each level cannot all be met by a filter in an ordered set, since that would produce a cofinal branch. Thus ${\mathrm{MA}}_{{\aleph }_1}$ fails. When the continuum exceeds ${\aleph }_1$, full Martin axiom includes this instance.

An Aronszajn tree that is a union of countably many tree antichains. Equivalently, it admits a map into a countable set that is injective on each chain.

A set-theoretic tree of height ${\omega }_2$, levels of size at most ${\aleph }_1$, and no cofinal branch. The Continuum hypothesis supplies one through the minimal-walk tree.

A set-theoretic tree with one root, extensions of every node at every higher level, at least two immediate successors for every node, and distinct limit-level nodes distinguished by their predecessor chains. If splitting occurs only at later levels, a continuous cofinal selection of levels can enforce immediate splitting.

A maximal chain with nodes at unbounded heights in a set-theoretic tree. Taking predecessor closure gives one node at each level below the tree height.

A set of pairwise incomparable nodes in a set-theoretic tree. A maximal tree antichain has a comparable member for every node of the tree.