この文書はAlweさんの企画された
Mathematical Logic Advent Calendar 2023
の15日目の記事です。まだ日本語を使わなくてすみません🙏。
I learned the following argument from Garrett Ervin.
Increasing continuous elementary chain
An elementary chain a sequence of models over a common first-order language , indexed by ordinals below , such that for all , is an elementary extension.
We say is increasing if for all such that , it holds that is a proper extension.
We say is continuous if for all limit ordinals , it holds that is the union of its predecessors .
Main theorem
Let be an arbitrary model of size over a countable language. The following hold:
- If is an infinite cardinal, and is an ordinal such that , then there exists an increasing continuous elementary chain of elementary extensions of size , such that the models are all isomorphic.
- There exists an increasing continuous elementary chain of elementary extensions of size , such that the models are all isomorphic.
- Assume
or
. There exists an increasing continuous elementary chain of elementary extensions of size , such that the models are all isomorphic.
- If is an infinite cardinal such that , then there exists an increasing continuous elementary chain of elementary extensions of size , such that the models are all isomorphic.
Assuming
, this holds for every regular cardinal .
In the cases (2), (3), and (4), the elementary chain is maximal: The next model always has size , so it cannot be isomorphic to the earlier models of size .
It is currently an open question whether case (3) always holds in .
Ehrenfeucht–Mostowski models
The following lemma reveals the combinatorial content of the main theorem.
An increasing continuous chain of models is defined similarly as an increasing continuous elementary chain, except for all , we no longer require to be an elementary extension, but we instead assume is some extension (where the inclusion respects the function, relation, and constant symbols from the language).
Given an infinite cardinal and an ordinal , the following are equivalent:
- For any model of size over a countable language, there exists an increasing continuous elementary chain of elementary extensions of size , such that the models are all isomorphic.
- There exists an increasing continuous chain of linear orders of size , such that the linear orders are all isomorphic.
1 ⇒ 2
Let . Then the increasing continuous chain of linear orders is what we wanted.
To prove the implication (2 ⇒ 1), we need a theorem by Ehrenfeucht–Mostowski.
Skolem hull, see [1] §5.2
Every complete first-order theory has an extension into an expanded first-order language , such that , and has built-in Skolem functions: For every formula in the language of , there is a function symbol such that contains the sentence .
For every complete first-order theory with infinite models and every linear order , there is a model of with a sequence of order indiscernibles: For every two increasing sequences and in and every formula , we have .
Given a complete first-order theory with built-in Skolem functions, a model with order indiscernibles , and a suborder , the Skolem hull of is the -submodel with universe .
Ehrenfeucht–Mostowski, see [1] §5.2
Let , , , and be as in the definition above. For any , the following hold:
- is a model of of size , and an elementary submodel of .
- If , then .
- More generally, every -order-preserving extends uniquely into an elementary embedding .
- If is an -order-preserving bijection, then extends uniquely into an isomorphism .
2 ⇒ 1
Let be the elementary/complete diagram of , so that is a countable complete first-order theory extending the theory of , and every model admits an elementary embedding (mapping ), such that if is an elementary embedding between models of , then (see [1] Lemma 2.3.3).
Let be a countable complete first-order extension (in an expanded language) with built-in Skolem functions, and let , , and be as in the Ehrenfeucht–Mostowski theorem, where .
For every , let , and let . We can check that is the elementary chain that we wanted:
- By the Ehrenfeucht–Mostowski theorem part (2), forms an -elementary chain. So their reducts form an -elementary chain.
- By the Ehrenfeucht–Mostowski theorem part (1), every model is a model of of size . So by identifying the model with its isomorphic image , the properties of from before imply that for all under this identification.
- From the assumption that is a sequence of order indiscernibles, one can prove that for all . This implies that since is increasing, the chain is also increasing.
- From the definition of Skolem hulls, one can prove that if is a chain of subsets (such that implies ), then . This implies that since is continuous, the chain is also continuous.
- By the Ehrenfeucht–Mostowski theorem part (4), since the linear orders are all isomorphic, the models are also all isomorphic.
Robust linear orders
In light of the lemma from the previous section, the main theorem is equivalent to the following proposition:
Main proposition
- If is an infinite cardinal, and is an ordinal such that , then there exists an increasing continuous chain of linear orders of size which are all isomorphic.
- There exists an increasing continuous chain of linear orders of size which are all isomorphic.
- Assume or . There exists an increasing continuous chain of linear orders of size which are all isomorphic.
- If is an infinite cardinal such that , then there exists an increasing continuous chain of linear orders of size which are all isomorphic.
In this section we will prove parts (1) and (2).
Note that in the notation above, we cannot have , or else the increasing continuous property of the chain implies that always has size , so that cannot be isomorphic to previous linear orders of size .
Main proposition part 1
Assume . Let be a limit ordinal such that . For , we can define the linear order
such that is a well-order, and being a limit ordinal implies that for all . It is easy to check that is an increasing continuous chain of linear orders of size which are all isomorphic to .
The next parts (2), (3), and (4) all concern the case , so it is convenient to define a term for this case.
Robust linear order
We say that a linear order of size is robust if there exists an increasing continuous chain of linear orders which are all isomorphic to .
Do robust linear orders always exist in every infinite cardinality?
Main proposition part 2
We will show that is robust of size .
For , we define the linear order
This is constructed by replacing every point in the linear order with a copy of . Then every is a dense linear order without endpoints of size , so by Cantor's back-and-forth method (see [1] Theorem 2.4.1), we get an isomorphism .
It's easy to see that forms an increasing continuous chain, witnessing robustness of .
Baumgartner's theorem
In this section we'll see that the Proper Forcing Axiom () implies a robust linear order of size .
Baumgartner, see [2] Corollary 8.3
A set of reals is called -dense if for every nonempty open interval , there is .
Assume . Every two -dense sets of reals and are isomorphic.
Main proposition part 3, assuming PFA
Let be an -dense set of reals. We'll show that is robust.
implies ([3] Theorem 31.23), so we can pick many distinct reals that are not in . For , define
Then every is -dense since is -dense and , and so Baumgartner's theorem implies .
It's easy to see that is increasing continuous, which witnesses that is robust of size .
I was given this argument in a
Mathematics Stack Exchange answer
by username Holo when I first asked about robust linear orders.
In an
unpublished result
, Itay Neeman has shown the consistency of “every two -dense sets of reals are isomorphic”.
Saturated linear orders
In this section, we will prove part (4) of the main proposition:
Ervin
If is an infinite cardinal such that , then there exists a robust linear order of size .
The assumption that is equivalent to the assumptions that is regular and .
The Continuum Hypothesis () implies that satisfies this condition, and so part (3) of the main proposition follows. More generally, the Generalized Continuum Hypothesis () implies that every infinite cardinal satisfies , which then implies there are robust linear orders of size any regular cardinal .
In the discussions below, we fix a regular cardinal satisfying .
and
is the lexicographic ordering on binary strings of length .
Let be the set of all which are not eventually constant. The linear order is the suborder of induced by .
Define to be the set of all elements of of the form for some .
Note that and .
Saturation lemma part 1
Let be two subsets of such that , , and for all and there is . Then there exists such that for all , and for all .
We can define a supremum recursively, such that for all , is the smallest such that for all , there is . It is not hard to show that for all , there is , and for all there exists some such that .
We split into cases.
- If , then for all , since , we can pick some such that . Then let so that by regularity, and we see that satisfies for all .
Since , , and , we have , so that for some . Letting , we have , so that for all , , and for all , . By , we've seen that is what we wanted. - Similarly if , then a desired exists.
- Assume and .
First we can show that is eventually constantly . For every , fix such that , and let by regularity. Then is such that , but for all . Since is a supremum, we must have , and so is eventually constantly as claimed.
Similarly is eventually constantly .
From we know that . But since , we have . So we can fix some such that , , and . Then satisfies and , so is what we wanted.
Saturation lemma part 2, see [1] Theorem 4.3.20
Define a linear order of size to be saturated if for every such that , , and for all and , there exists such that for all and for all .
Every two saturated linear orders and of size are isomorphic.
Let .
We can build a chain of partial isomorphisms such that and both have size , is an isomorphism between and , and .
- When let .
- When is limit, let .
- When is a successor stage and , we let and . By saturation of , there is such that , and we can define .
- The other cases are similar, and it's never hard to see that has the desired properties for all .
Finally, we get an isomorphism from to .
Main proposition part 4
We'll show the linear order is robust of size .
Since , we can pick many distinct elements that are not in . For , define
By the saturation lemma part 1, every is saturated of size , because . By the saturation lemma part 2, .
It's easy to see that is increasing continuous, which shows that is robust of size .
This argument is due to Garrett Ervin in a private conversation.
From Shelah [4] Theorem 8.4.7, there exist saturated linear orders of size if and only if . For a simple argument when , see [1] §4.3.