--- title: Entangled Linear Orders in Set Theory url: https://www.emergentmind.com/topics/entangled-linear-orders type: topic --- # Entangled Linear Orders in Set Theory Entangled linear orders are uncountable linear orders with a strong finite-dimensional configuration property: every uncountable family of pairwise disjoint finite tuples must contain two tuples whose coordinates realize any prescribed comparison pattern. Introduced by Abraham and Shelah, the notion isolates a combinatorial form of order-theoretic complexity, and Todorčević showed under \(\mathsf{CH}\) that fully entangled orders exist. Subsequent work has clarified the internal hierarchy of \(n\)-entangledness, its interaction with separability and the c.c.c., its failure to be a purely topological invariant on suborders of \(\mathbb R\), and its role in the theory of Suslin lines and forcing axioms [2507.17503], [2512.01065]. ## 1. Formal definition and combinatorial content Let \((L,\le)\) be a linear order, let \(\kappa\) be an infinite cardinal, and let \(n>0\). The order \(L\) is \((\kappa,n)\)-entangled if whenever \(F\subseteq\{e\in L^n:e\text{ is injective}\}\) has \(|F|=\kappa\), the tuples in \(F\) are pairwise disjoint, and \(t\in\{0,1\}^n\), there exist distinct \(e,e'\in F\) such that \[ \forall i\}\), with the same meaning coordinatewise [2507.17503], [2512.01065]. The definition is sensitive to families of *pairwise disjoint* tuples rather than arbitrary tuples. This disjointness requirement eliminates trivial repetitions and forces genuinely finite-dimensional comparison phenomena. In the standard presentation, one often works with increasing tuples, but the central issue is the realization of all coordinatewise order patterns inside a large disjoint family. A useful strengthening follows from the Erdős–Dushnik–Miller theorem: once \(L\) is \((\kappa,n)\)-entangled, then for any sufficiently large \(F\) and any pattern \(t\), there is in fact an infinite subfamily of \(F\) all of whose pairs realize \(t\) [2507.17503]. This reformulation is often more effective in recursive or forcing arguments, because it converts a single witness requirement into an infinite homogeneous-pattern conclusion. ## 2. Weak entangledness and general structural constraints A weaker variant restricts attention to *separated* tuples. For \(2\le n<\omega\), a sequence of pairwise disjoint increasing \(n\)-tuples \(\langle(a_{\xi,0},\dots,a_{\xi,n-1}):\xi<\omega_1\rangle\) is separated if there are points \[ c_0<_L c_1<_L\cdots<_L c_{n-2} \] such that for every \(\xi<\omega_1\) and every \(i1\), there is a subset \(E\subseteq\mathbb R\) which is \(n\)-entangled but not \((n+1)\)-entangled [2507.17503]. The construction proceeds by hereditary diagonalization of Sierpiński type. One begins with an auxiliary countable “bad” family \(D\subseteq(\mathbb R)^{n+1}\) of pairwise disjoint \((n+1)\)-tuples that avoids the increasing type \(\langle 0,\dots,0\rangle\), while still guaranteeing that in every open region one can find patterns with a single \(1\) in any coordinate. One then enumerates all continuous maps \(f_\alpha\) from \(G_\delta\subseteq\mathbb R^n\) into \(\mathbb R\) and builds by transfinite recursion of length \(\omega_1\) a family of \((n+1)\)-tuples \(\{r_\alpha:\alpha<\omega_1\}\) such that \[ E=\bigcup_{\alpha<\omega_1}\operatorname{ran}(r_\alpha) \] satisfies the criterion of Proposition 2.10 in the paper: continuous maps cannot create a large counterexample to \(n\)-entangledness, but the embedded bad family blocks \((n+1)\)-entangledness [2507.17503]. A mild covering-by-meager hypothesis, \(\mathrm{cov}(\mathcal B)=2^{\aleph_0}\), enters the argument to ensure that diagonalization against fewer than \(2^{\aleph_0}\) meager bad sets succeeds in an open region; this hypothesis holds under \(\mathsf{CH}\) [2507.17503]. The result establishes a strict finite hierarchy rather than a single undifferentiated notion. ## 4. Topological non-invariance and definability Entangledness is not determined by the homeomorphism type of the underlying subspace of \(\mathbb R\). Under \(\mathsf{CH}\), there exist two homeomorphic suborders \(A,B\subseteq\mathbb R\) such that \(A\) is entangled, meaning \(n\)-entangled for all \(n\), while \(B\) is not even \(2\)-entangled [2507.17503]. The proof uses a combinatorial invariant denoted \(\mathfrak{hm}\). Assuming \(\mathfrak{hm}=2^{\aleph_0}\), one constructs a \(2^{\aleph_0}\)-entangled, \(2^{\aleph_0}\)-crowded subset \(E\subseteq{}^\omega 2\) that admits a nontrivial homeomorphism \(s_2:E\to E\). The argument enumerates countably many forbidden relations \(H^n_\alpha\subseteq({}^\omega 2)^{n+1}\), each closed on fibers and enforcing monochromaticity constraints, and then diagonalizes so as to preserve both entangledness and closure under \(s_2\). From such a space one can carve two homeomorphic suborders of \(\mathbb R\) with different entangledness behavior [2507.17503]. The same paper also places entangledness in descriptive set theory. Under \(\mathbb R\subseteq L\), there exists a lightface co-analytic, i.e. \(\Pi^1_1\), subset \(E\subseteq\mathbb R\) which is entangled. The construction codes each countable admissible \(\alpha<\omega_1\) by a unique real \(x\), and lets \(E\) consist of those codes whose transitive collapse is \(\langle L_\alpha,\in\rangle\) and which are minimal in \(<_{L}\) among reals coding that structure. A canonical well-ordering of the admissibles then yields an enumeration \(\langle x_\nu:\nu<\omega_1\rangle\), and diagonalization against continuous maps again invokes the Proposition 2.10 criterion [2507.17503]. The descriptive-set-theoretic significance is explicit in the literature: analytic sets are too “perfect-set”-rich to be entangled, so the existence of a \(\Pi^1_1\) example is best possible in that sense [2507.17503]. ## 5. Suslin lines and non-separable phenomena A linear order has the c.c.c. if every family of pairwise disjoint nonempty open intervals is countable. It is order-theoretically separable if there is a countable \(D\subseteq L\) meeting every nonempty interval; equivalently, \(L\) embeds into \(\mathbb R\). A Suslin line is a c.c.c. linear order with no countable dense subset, and classical arguments show that every Suslin line contains an order-isomorphic copy of a lexicographically ordered Suslin tree [2512.01065]. Because every \(2\)-entangled order is c.c.c. but every \(3\)-entangled order is separable, Suslin lines are the natural setting for the borderline case \(n=2\). Krueger showed that there is an \(\omega_1\)-Knaster forcing \(P\) which adds a Suslin line \(S\) that is weakly \(n\)-entangled for every \(2\le n<\omega\). The construction first adds a normal Suslin tree \(T\) with rational immediate successors, using a variation of Tennenbaum’s forcing; \(S\) is then defined as the lexicographical order on \(T\). Weak entangledness is verified by thinning to a stationary set of compatible finite approximations and amalgamating them so as to realize a prescribed type [1910.08793]. The same work extends entangledness from linear orders to \(\omega_1\)-trees and proves that an \(\omega_1\)-tree is entangled if and only if it is free. It also forces, for any positive \(n<\omega\), a Suslin tree which is \(n\)-entangled but all of whose derived trees of dimension \(n+1\) are special [1910.08793]. Carroy, Levine, and Notaro obtained a stronger genuinely order-theoretic result under \(\diamondsuit\): there exists a \(2\)-entangled linear order of size \(\aleph_1\) which is non-separable, hence a Suslin line. Their construction starts from a tree order \(\unlhd\) on \(\omega_1\times\omega\), anticipates countable increasing partial automorphisms \(f_\alpha\) at stage \(\alpha\), and defines the final order \(\preceq\) as a lexicographic break-tie extension of the tree order. The resulting order is c.c.c. and \(2\)-entangled, while remaining non-separable [2507.17503]. ## 6. OGA, iteration methods, and the current frontier A later development shows that \(2\)-entangled Suslin lines can coexist with strong graph-dichotomy principles. Under the assumption of a supercompact cardinal, there is a forcing extension in which the Open Graph Axiom holds, \(2^{\aleph_0}=\aleph_2\), and there exists a \(2\)-entangled Suslin line \(S\). Consequently, in that model there is a \(2\)-entangled uncountable linear order, but no such order is separable [2512.01065]. The construction begins with the \(2\)-entangled Suslin line \(S\) built by Krueger as a lexicographically ordered Suslin tree and performs a countable support iteration \[ \langle P_\alpha,\mathbb Q_\beta:\alpha\le\kappa,\beta<\kappa\rangle \] of length \(\kappa\), guided by a Laver function \(f:\kappa\to H(\kappa)\). Two technical notions are central. The first is *weakly bi-entangled*, a strengthening of weak \(2\)-entangledness tailored to separated pairs whose heights go to \(\omega_1\). The second is \(E_S\)-properness, a strengthening of properness designed to preserve both the Suslin-tree property of \(S\) and its weakly bi-entangledness through iteration. For open graphs \(G\) on separable metric spaces that fail countable chromaticity, one uses a Todorčević-style side-condition forcing \(P_G\) that adds an uncountable clique and can be refined to be \(E_S\)-proper and \(S\)-preserving [2512.01065]. The resulting compatibility theorem for countable support iterations shows that the order-theoretic entanglement property and the Suslin-tree structure can be preserved in tandem. This resolves a problem of Carroy, Levine, and Notaro and answers a question of McKenney recorded in the literature [2512.01065]. Several open problems remain explicit. Among them are whether the supercompact assumption can be eliminated, whether OGA alone already implies the existence of some \(2\)-entangled uncountable order, whether there is an OGA model with a \(3\)-entangled Suslin line, and what the exact relationship is between entangledness and other splitting or reflection principles in topology [2512.01065]. In parallel, earlier work notes that \(\mathsf{MA}+\neg\mathsf{CH}\) eliminates genuinely entangled orders of size \(\aleph_1\) while leaving weak entangledness open to further analysis [1910.08793]. Together these results place entangled linear orders at a junction of infinitary combinatorics, descriptive set theory, Suslin-tree technology, and forcing axioms. Source: https://www.emergentmind.com/topics/entangled-linear-orders