LOTS (of) embeddability results
24
LOTS (of) embeddability results Katie Thompson Institute of Discrete Mathematics and Geometry Vienna University of Technology 21 March 2011 Joint work with Alex Primavesi
Transcript of LOTS (of) embeddability results
LOTS (of) embeddability resultsInstitute of Discrete Mathematics
and Geometry Vienna University of Technology
21 March 2011
Introduction
LOTS and embeddings
A LOTS or linearly ordered topological space is exactly what it says: a linear order equipped with the open interval topology.
A LOTS embedding is an injective continuous function which preserves order.
Katie Thompson 2 / 24
Embedding quasi-orders
The relation on the class of all LOTS defined by setting A B if and only if A LOTS-embeds into B is a quasi-order. There are several aspects of the LOTS embeddability order that we study:
I The top (universal structures or families): can we find a (non-trivial set of) LOTS such that every LOTS in a given class must be LOTS-embeddable into one of them?
I The internal structure of the embeddability order: what are the possible cardinalities of chains and antichains in the LOTS embeddability order for a given class of LOTS?
I The bottom (prime models or bases): can we find a (non-trivial set of) LOTS such that every LOTS must embed one of them?
Katie Thompson 3 / 24
Universality for LOTS
Countable universal LOTS
Let (Q,<,τ) be the LOTS whose underlying linear order is the rationals and which is endowed with the open interval topology τ .
Claim (Q,<,τ) forms a universal LOTS at ℵ0.
Q is universal for countable linear orders. Given a countable linear order L there exists f : L →Q order-preserving. We may “fix” f so that it is continuous: if f is discontinuous at x then there is a sequence x ⊆ L such that x is the limit, but the limit of f [x] is not f (x). By removing half-open intervals between f [x] and f (x) we can show the resulting order is isomorphic to Q.
Katie Thompson 4 / 24
Universality for LOTS
Regular uncountable LOTS
Assume that κ is a regular uncountable cardinal such that κ = κ<κ . Q(κ) is the unique linear order of size κ without endpoints with the κ-density property:
∀S,T ∈ [Q(κ)]<κ [S < T ⇒ (∃x)S < x < T ].
Q(κ) is universal for linear orders of size κ .
Q(κ) is the completion of Q(κ) under < κ-sequences.
For any infinite limit ordinal α < κ , the linear orders α + 1 and α + 1 + α∗, respectively, generate counterexamples to LOTS universality.
Katie Thompson 5 / 24
Restricting cofinalities and coinitialities
Definition A LOTS, L, of size κ is κ-entwined if for all x ∈ L, sup((−∞,x)) = inf((x ,+∞)) = x implies that both the cofinality and coinitiality of x are equal to κ .
Claim
Assume κ = κ<κ and let Q(κ) be the completion of Q(κ) under sequences of length < κ . Then Q(κ) is universal for κ-entwined LOTS.
Note that all countable LOTS are ℵ0-entwined so the fact that Q is universal is a corollary.
Katie Thompson 6 / 24
Universality for LOTS
No universal LOTS
The dominating number for a quasi-order P is the least cardinality of a subset Q ⊆ P such that for any p ∈ P there is a q ∈ Q with p ≤ q.
Theorem
For any κ ≥ 2ℵ0 there is no universal LOTS of cardinality κ . Moreover the dominating number for this LOTS embeddability quasi-order is 2κ .
Katie Thompson 7 / 24
Universality for linear orders below the continuum
I (Shelah) ¬CH: The existence of a universal linear order at ℵ1 is independent.
I (Kojman, Shelah) For λ ∈ (ℵ1,2ℵ0) regular, there is no universal linear order of size λ .
Katie Thompson 8 / 24
Countable linear orders and LOTS
Better quasi-ordered is a strengthening of well-quasi ordered which means that there are no infinite antichains and no infinite descending sequences.
Theorem (Laver) Countable linear orders are better quasi-ordered under order embeddability.
Theorem (Beckmann, Goldstern, Preining) Countable closed sets of reals are better quasi-ordered under LOTS embeddability.
Katie Thompson 9 / 24
Uncountable LOTS
Let κ ≥ 2ℵ0 . Then there exists:
1. An antichain A of size 2κ consisting of LOTS of size κ (i.e. there is no LOTS embedding from A into B for any two distinct A,B ∈A ).
2. A sequence of length κ+ of LOTS of size κ , strictly increasing in the LOTS embeddability order.
3. For each η < κ+, a sequence of length η of LOTS of size κ , strictly decreasing in the LOTS embeddability order.
Katie Thompson 10 / 24
Antichain proof idea
Claim
Let κ ≥ 2ℵ0 . Then there exists a set A with |A |= 2κ of LOTS of size κ such that for any A,B ∈A there is no LOTS embedding between A and B.
Proof idea: The intermediate value theorem (IVT): a continuous embedding from a linear continuum, A, into a linear order B must be surjective onto a convex subset of B.
Idea is to find 2 linear continua which do not embed into each other. Concatenate these linear continua together according to the characteristic function for a subset of κ . This will give another linear continuum for each subset of κ . They form an antichain in the LOTS embedding order by the IVT.
Any linear continuum has size ≥ 2ℵ0 .
Katie Thompson 11 / 24
Definition
Let A and B be linear orders and f : A→ B a linear order embedding. Then we call f a dense embedding if there is a convex subset C ⊆ B such that f [A] is a dense subset of C.
Fact Let A,B be linear orders and suppose f : A→ B is a dense embedding. Then f is continuous.
Katie Thompson 12 / 24
Embedding structure for separable linear orders
Theorem I (Cantor) The reals (R,<) form a universal separable linear order.
I (Baumgartner) Under PFA there is a unique ℵ1-dense set of reals up to isomorphism.
The reals then also form a universal separable LOTS.
As with order embeddings, Baumgartner’s result implies that this set of reals forms a universal and prime model for separable LOTS of size ℵ1.
The embedding q.o. under PFA is thus totally flat: all separable LOTS of size ℵ1 are bi-embeddable.
Katie Thompson 13 / 24
Basis basics
Reminder: A basis B for A is a collection of structures in A such that for every A ∈A there is B ∈B such that B A.
ω and ω∗ form a basis for the infinite linear orders and infinite LOTS.
Fact Under CH there is no countable basis for the uncountable linear orders or LOTS.
Katie Thompson 14 / 24
Linear order basis under PFA
Theorem (Moore) Assuming PFA there is a five-element basis for the uncountable linear orders: every uncountable linear order will embed (at least) one of these five elements. The basis elements are as follows:
I ω1 and ω∗1 I X a fixed ℵ1-dense set of reals
I C a fixed ℵ1-dense non-stationary Countryman line, and C∗ its inverse
Katie Thompson 15 / 24
Why is this minimal?
Separable orders only (order) embed separable orders.
There are uncountable orders which do not embed ω1 or ω∗1 and do not contain a separable suborder. These are the Aronszajn lines.
Katie Thompson 16 / 24
Countryman lines
Definition A Countryman line, C, is a linear order of size ℵ1 such that the product C×C is the union of countably many chains (in the product order).
Shelah proved that Countryman lines exist in ZFC.
Every Countryman line is also an Aronszajn line.
ℵ1-dense Countryman lines with a particular property, called non-stationarity, are unique up to isomorphism / reverse isomorphism under PFA.
Katie Thompson 17 / 24
Basis for Aronszajn lines
Let C be a fixed ℵ1-dense non-stationary Countryman line, and C∗ its inverse.
Theorem (Moore) Assuming PFA, every Aronszajn line contains one of C or C∗.
Lemma If a linear order D embeds into both C and C∗, then D must be countable.
Katie Thompson 18 / 24
Lemma
(PFA) Given an Aronszajn line A, one of either C×Z or C∗×Z must embed into A.
No limit points!
Basis for separable LOTS
However, for the ℵ1-dense set of reals, X , avoiding all limit points does not work: if |B| ≥ 2 then X ×B 6→ X , for any linear order B.
Lemma Let A be an uncountable linear order such that there exists a linear order embedding f : X → A. Then we can find a LOTS embedding f ′ : X ×B→ A for some B ∈ {1,2,ω,ω∗,Z}.
Katie Thompson 20 / 24
Basis for LOTS which order embed ω1 or ω∗1
Here again we build the appropriate enhancements of ω1 and ω∗1 which do not have limit points:
Start with ω1 and replace each limit ordinal with a copy of ω∗. Call this ω1 × ω∗.
Start with ω∗1 and replace each limit ordinal with a copy of ω . Call this ω∗1 × ω .
Lemma For an uncountable linear order A if ω1 order embeds into A then either ω1
LOTS-embeds into A or ω1 × ω∗ LOTS-embeds into A. If ω∗1 order embeds into A then either ω∗1 LOTS-embeds into A or ω∗1 × ω LOTS-embeds into A.
Katie Thompson 21 / 24
Theorem (PFA) The set:
C×Z,C∗×Z, ω1,ω1×ω
∗,
forms a minimal basis for uncountable LOTS.
Note that this finite basis relies on there being linear orders with no limit points.
Katie Thompson 22 / 24
Basis for dense LOTS
A linear order L is dense iff for every point x ∈ L there is a there are increasing and decreasing sequences in L such that x is the supremum, respectively infimum of these sequences.
A finite basis for the dense linear orders must be restricted to those with points of limited cofinality and coinitiality.
Theorem (PFA) There is a six element basis for those uncountable dense LOTS in which all points have cofinality and coinitiality ω . The basis is {X ,X ×Q,C×Q,C∗×Q,ω1×Q,ω∗1 ×Q}.
Katie Thompson 23 / 24
Uncountable universal LOTS: open questions
I Is it consistent that there is a universal LOTS at ℵ1 < 2ℵ0?
I Moore proves that there is a universal Aronszajn line assuming PFA. This is not a universal LOTS. Can it be shown that there is no universal Aronszajn LOTS in any model of ZFC?
I Are the countable LOTS well-quasi ordered under embeddability?
Katie Thompson 24 / 24
Separable LOTS
21 March 2011
Introduction
LOTS and embeddings
A LOTS or linearly ordered topological space is exactly what it says: a linear order equipped with the open interval topology.
A LOTS embedding is an injective continuous function which preserves order.
Katie Thompson 2 / 24
Embedding quasi-orders
The relation on the class of all LOTS defined by setting A B if and only if A LOTS-embeds into B is a quasi-order. There are several aspects of the LOTS embeddability order that we study:
I The top (universal structures or families): can we find a (non-trivial set of) LOTS such that every LOTS in a given class must be LOTS-embeddable into one of them?
I The internal structure of the embeddability order: what are the possible cardinalities of chains and antichains in the LOTS embeddability order for a given class of LOTS?
I The bottom (prime models or bases): can we find a (non-trivial set of) LOTS such that every LOTS must embed one of them?
Katie Thompson 3 / 24
Universality for LOTS
Countable universal LOTS
Let (Q,<,τ) be the LOTS whose underlying linear order is the rationals and which is endowed with the open interval topology τ .
Claim (Q,<,τ) forms a universal LOTS at ℵ0.
Q is universal for countable linear orders. Given a countable linear order L there exists f : L →Q order-preserving. We may “fix” f so that it is continuous: if f is discontinuous at x then there is a sequence x ⊆ L such that x is the limit, but the limit of f [x] is not f (x). By removing half-open intervals between f [x] and f (x) we can show the resulting order is isomorphic to Q.
Katie Thompson 4 / 24
Universality for LOTS
Regular uncountable LOTS
Assume that κ is a regular uncountable cardinal such that κ = κ<κ . Q(κ) is the unique linear order of size κ without endpoints with the κ-density property:
∀S,T ∈ [Q(κ)]<κ [S < T ⇒ (∃x)S < x < T ].
Q(κ) is universal for linear orders of size κ .
Q(κ) is the completion of Q(κ) under < κ-sequences.
For any infinite limit ordinal α < κ , the linear orders α + 1 and α + 1 + α∗, respectively, generate counterexamples to LOTS universality.
Katie Thompson 5 / 24
Restricting cofinalities and coinitialities
Definition A LOTS, L, of size κ is κ-entwined if for all x ∈ L, sup((−∞,x)) = inf((x ,+∞)) = x implies that both the cofinality and coinitiality of x are equal to κ .
Claim
Assume κ = κ<κ and let Q(κ) be the completion of Q(κ) under sequences of length < κ . Then Q(κ) is universal for κ-entwined LOTS.
Note that all countable LOTS are ℵ0-entwined so the fact that Q is universal is a corollary.
Katie Thompson 6 / 24
Universality for LOTS
No universal LOTS
The dominating number for a quasi-order P is the least cardinality of a subset Q ⊆ P such that for any p ∈ P there is a q ∈ Q with p ≤ q.
Theorem
For any κ ≥ 2ℵ0 there is no universal LOTS of cardinality κ . Moreover the dominating number for this LOTS embeddability quasi-order is 2κ .
Katie Thompson 7 / 24
Universality for linear orders below the continuum
I (Shelah) ¬CH: The existence of a universal linear order at ℵ1 is independent.
I (Kojman, Shelah) For λ ∈ (ℵ1,2ℵ0) regular, there is no universal linear order of size λ .
Katie Thompson 8 / 24
Countable linear orders and LOTS
Better quasi-ordered is a strengthening of well-quasi ordered which means that there are no infinite antichains and no infinite descending sequences.
Theorem (Laver) Countable linear orders are better quasi-ordered under order embeddability.
Theorem (Beckmann, Goldstern, Preining) Countable closed sets of reals are better quasi-ordered under LOTS embeddability.
Katie Thompson 9 / 24
Uncountable LOTS
Let κ ≥ 2ℵ0 . Then there exists:
1. An antichain A of size 2κ consisting of LOTS of size κ (i.e. there is no LOTS embedding from A into B for any two distinct A,B ∈A ).
2. A sequence of length κ+ of LOTS of size κ , strictly increasing in the LOTS embeddability order.
3. For each η < κ+, a sequence of length η of LOTS of size κ , strictly decreasing in the LOTS embeddability order.
Katie Thompson 10 / 24
Antichain proof idea
Claim
Let κ ≥ 2ℵ0 . Then there exists a set A with |A |= 2κ of LOTS of size κ such that for any A,B ∈A there is no LOTS embedding between A and B.
Proof idea: The intermediate value theorem (IVT): a continuous embedding from a linear continuum, A, into a linear order B must be surjective onto a convex subset of B.
Idea is to find 2 linear continua which do not embed into each other. Concatenate these linear continua together according to the characteristic function for a subset of κ . This will give another linear continuum for each subset of κ . They form an antichain in the LOTS embedding order by the IVT.
Any linear continuum has size ≥ 2ℵ0 .
Katie Thompson 11 / 24
Definition
Let A and B be linear orders and f : A→ B a linear order embedding. Then we call f a dense embedding if there is a convex subset C ⊆ B such that f [A] is a dense subset of C.
Fact Let A,B be linear orders and suppose f : A→ B is a dense embedding. Then f is continuous.
Katie Thompson 12 / 24
Embedding structure for separable linear orders
Theorem I (Cantor) The reals (R,<) form a universal separable linear order.
I (Baumgartner) Under PFA there is a unique ℵ1-dense set of reals up to isomorphism.
The reals then also form a universal separable LOTS.
As with order embeddings, Baumgartner’s result implies that this set of reals forms a universal and prime model for separable LOTS of size ℵ1.
The embedding q.o. under PFA is thus totally flat: all separable LOTS of size ℵ1 are bi-embeddable.
Katie Thompson 13 / 24
Basis basics
Reminder: A basis B for A is a collection of structures in A such that for every A ∈A there is B ∈B such that B A.
ω and ω∗ form a basis for the infinite linear orders and infinite LOTS.
Fact Under CH there is no countable basis for the uncountable linear orders or LOTS.
Katie Thompson 14 / 24
Linear order basis under PFA
Theorem (Moore) Assuming PFA there is a five-element basis for the uncountable linear orders: every uncountable linear order will embed (at least) one of these five elements. The basis elements are as follows:
I ω1 and ω∗1 I X a fixed ℵ1-dense set of reals
I C a fixed ℵ1-dense non-stationary Countryman line, and C∗ its inverse
Katie Thompson 15 / 24
Why is this minimal?
Separable orders only (order) embed separable orders.
There are uncountable orders which do not embed ω1 or ω∗1 and do not contain a separable suborder. These are the Aronszajn lines.
Katie Thompson 16 / 24
Countryman lines
Definition A Countryman line, C, is a linear order of size ℵ1 such that the product C×C is the union of countably many chains (in the product order).
Shelah proved that Countryman lines exist in ZFC.
Every Countryman line is also an Aronszajn line.
ℵ1-dense Countryman lines with a particular property, called non-stationarity, are unique up to isomorphism / reverse isomorphism under PFA.
Katie Thompson 17 / 24
Basis for Aronszajn lines
Let C be a fixed ℵ1-dense non-stationary Countryman line, and C∗ its inverse.
Theorem (Moore) Assuming PFA, every Aronszajn line contains one of C or C∗.
Lemma If a linear order D embeds into both C and C∗, then D must be countable.
Katie Thompson 18 / 24
Lemma
(PFA) Given an Aronszajn line A, one of either C×Z or C∗×Z must embed into A.
No limit points!
Basis for separable LOTS
However, for the ℵ1-dense set of reals, X , avoiding all limit points does not work: if |B| ≥ 2 then X ×B 6→ X , for any linear order B.
Lemma Let A be an uncountable linear order such that there exists a linear order embedding f : X → A. Then we can find a LOTS embedding f ′ : X ×B→ A for some B ∈ {1,2,ω,ω∗,Z}.
Katie Thompson 20 / 24
Basis for LOTS which order embed ω1 or ω∗1
Here again we build the appropriate enhancements of ω1 and ω∗1 which do not have limit points:
Start with ω1 and replace each limit ordinal with a copy of ω∗. Call this ω1 × ω∗.
Start with ω∗1 and replace each limit ordinal with a copy of ω . Call this ω∗1 × ω .
Lemma For an uncountable linear order A if ω1 order embeds into A then either ω1
LOTS-embeds into A or ω1 × ω∗ LOTS-embeds into A. If ω∗1 order embeds into A then either ω∗1 LOTS-embeds into A or ω∗1 × ω LOTS-embeds into A.
Katie Thompson 21 / 24
Theorem (PFA) The set:
C×Z,C∗×Z, ω1,ω1×ω
∗,
forms a minimal basis for uncountable LOTS.
Note that this finite basis relies on there being linear orders with no limit points.
Katie Thompson 22 / 24
Basis for dense LOTS
A linear order L is dense iff for every point x ∈ L there is a there are increasing and decreasing sequences in L such that x is the supremum, respectively infimum of these sequences.
A finite basis for the dense linear orders must be restricted to those with points of limited cofinality and coinitiality.
Theorem (PFA) There is a six element basis for those uncountable dense LOTS in which all points have cofinality and coinitiality ω . The basis is {X ,X ×Q,C×Q,C∗×Q,ω1×Q,ω∗1 ×Q}.
Katie Thompson 23 / 24
Uncountable universal LOTS: open questions
I Is it consistent that there is a universal LOTS at ℵ1 < 2ℵ0?
I Moore proves that there is a universal Aronszajn line assuming PFA. This is not a universal LOTS. Can it be shown that there is no universal Aronszajn LOTS in any model of ZFC?
I Are the countable LOTS well-quasi ordered under embeddability?
Katie Thompson 24 / 24
Separable LOTS
