Here is what we already know about the Dushnik-Miller theorem in the case of (given our earlier posts on the subject):
In this post, we shall provide a proof of Todorcevic’s theorem that PFA implies for all .
We commence with a sequence of lemmas.
Lemma 1. Suppose that is a given sequence of sets, with for all . For , denote
If are uncountable sets, and , then there exists some uncountable such that for all in .
Proof. As for all , we may recursively construct a strictly-increasing function such that is finite for all . Let . Then is an uncountable subset of , and is finite for all . There are two cases to consider:
- If is countable, then is an uncountable subset with the desired property;
- Otherwise, let be an uncountable subset of for which forms a -system with root . As the sets in are mutually disjoint, we get that , so it is possible to recursively construct an uncountable subset such that for all in .
Lemma 2. If , then is a P-ideal for every .
[Reminder. The cardinal is defined as the smallest size of a family with the property that for every , there exists some such that is infinite. We say that an ideal is a P-ideal if for every , there exists some such that is finite for all . (slang: every countable collection of -sets, admits a pseudounion within ).]
Proof of Lemma 2. If is countable, then , and we are done. Now, suppose that is uncountable, and that we are given a countable subcollection , and let us show that it admits a pseudounion. As is downward closed, we shall avoid trivialities and assume that are mutually disjoint. Let be large enough so that Fix a bijection . Then for all , define by letting for all :
As , we may pick a function such that is finite, for all . Now, let . Then, for every , is finite. Assume towards a contradiction that . Then, in particular, there exists some such that is infinite. As while is finite for all , let us pick a large enough such that and . Pick , and let . Since , we get that . In particular, , and so by definition of , we get that , contradicting the choice of in .
Lemma 3. Suppose that satisfies . Denote If , then .
[Reminder. The cardinal is defined as the smallest size of a family of subsets of such that for all finite , while does not admit a pseudointersection. (A pseudointersection for is an infinite set such that is finite for all ). Note that .]
Proof of Lemma 3. Suppose not, and let . Then, the intersection of any finite family of sets from is infinite. Then, by , there must exist a pseudointersection , namely, is finite whenever . In particular, is co-countable, and then , contradicting the fact that , and .
Lemma 4 (Laver, 1973). For every nonzero , and every matrix , if all of the following conditions are met:
- ;
- ;
- for all ,
then, there exists a function and a set of order-type such that for all . (By , we mean that .)
Proof. By induction on . For the base case , fix a uniform ultrafilter over . Then, let be a function such that for all . As , the collection must admit a pseudointersection.
Next, suppose that , and that the lemma holds for all . Let be a non-decreasing sequence of ordinals such that for all , and . Denote Then is simply the -section of . In particular:
- for all and ;
- for all , and .
By the induction hypothesis, for every , there exists a function such that admits a pseduointersection of order-type . In particular, . For all , let be an increasing sequence of ordinals that converges to . Then, for all , define a function , by letting:
As , let us pick function such that is finite for all . Next, we shall utilize the fact that is finite for all . Fix a uniform ultrafilter over , and then a function such that for all :
As , we may then find an infinite such that is finite for all . Finally, appeal to , and , by letting Then:
- for all , since ;
- , since .
Thus, we are left with verifying that is indeed a pseudointersection of . For this, fix an arbitrary . Let be large enough so that We claim that . Suppose not, and fix above . Let be the unique integer such that . Then and hence , and . It follows that contradicting the fact that .
Definition (Todorcevic). The P-ideal Dichotomy (abbreviated PID) asserts that for every uncountable set , and every P-Ideal over , exactly one of the following holds:
- There exists an uncountable such that ;
- There exists a sequence such that , and for all .
Now, we are ready to prove the main result of this post.
Theorem (Todorcevic, 1983). Assume PID+(). Then holds for all .
Proof. We prove by induction on . The base case , is covered by the original Dushnik-Miller theorem. Next, suppose that , and that holds for all , and let us establish . For this, suppose that is a given coloring such that for every uncountable subset .
For all , denote . Then iff . In particular, we infer from Lemma 1 that for every uncountable , . Namely, the first alternative of the P-ideal dichotomy fails for . As we assume PID, and since , we infer from Lemma 2 that for every uncountable , there exists a sequence such that , and for all .
Altogether, we conclude that for every uncountable set , there exists an uncountable subset such that .
Next, fix a non-decreasing sequence of ordinals such that for all and . We shall construct by recursion on , a sequence , such that all of the following holds for all ;
Let . Then, let be an uncountable subset of such that . By the induction hypothesis, pick of order-type such that . Since , we get from Lemma 3 that contains an uncountable family consisting of mutually-disjoint sets of some fixed size . Then, by Lemma 4, there exists a choice function and of order-type such that for all . Fix , and an uncountable subset such that for all .
Now, suppose that is given, and has already been defined. Let us define . Put . Pick such that . Pick of order-type such that . Then, use Lemma 4 to find of order-type , , and an uncountable such that . This completes the construction.
Finally, let . Then , and .
It looks like you’ve proven it for all , not just .
How essential is that restriction? Does the PFA result (for any countable ordinal ) apply here too?
I’m afraid I currently do not know how to pass the second indecomposable ordinal. The PFA result should be a consequence of PID , but as for now, I can only prove that the following statement follows from PID : and that holds for all (e.g., ). Let be a non-decreasing sequence of ordinals such that . Then for every coloring that does not admit an uncountable -homogeneous set, there exists a sequence of countable subsets of , , such that for all : ; ; .
Suppose that
1.
2.
3.
So, is a set of order-type which is only piecewise 1-homogeneous.
Edit: On March 7, 2012, I found a way to prove the complete statement, and the old proof in the above post was replaced by the newer one.
I would prefer a more informative title for this and the previous section. for a cardinal and an ordinal where the point is in making the ordinal as large as possible. The Dushnik-Miller theorem is only about i.e., with no hint towards a possible discussion of the ‘length’ of the ‘infinite set’.
This is really about
P.S. There is a typo in the statement of Todorcevic’s theorem: should be in place of .
Thanks. It stayed there from the previous version of this post, where we were dealing only with ordinals below the second indecomposable ordinal.
Pingback: Jones’ theorem on the cardinal invariant p | Assaf Rinot