This post continues the study of the cardinal invariant . We refer the reader to a previous post for all the needed background. For ordinals , the polarized partition relation asserts that for every coloring , (at least) one of the following holds:
- there are and with s.t. ;
- there are and with s.t. .
Erdős and Rado proved that holds for all . The current post will center around a proof of the following relative:
Theorem (A.L. Jones, 2008). For all :
Proof. Suppose that we are given a coloring . Denote and let be a maximal (with respect to inclusion) subset of with the property that the intersection of any finite collection of subsets from is infinite. The proof is now divided into two.
Suppose that .
By , let us fix an infinite pseudointersection for (indeed, if , we simply take ). Notice that if and is infinite, then is infinite for all . Thus, it follows from the maximality of that is finite for all . Put and define by letting for all . Then, by , we may find a subset of size on which is constant. In particular, contains the infinite set .
Altogether, , , and .
Suppose that .
Let be a continuous -chain of elementary submodels of for a large enough regular , such that and for all .
Suppose that we are given a limit ordinal . Pick , and consider the poset , where and iff and .
For all , put . Then witnesses that is -centered.
For all , let Recalling that the intersection of any finite collection of subsets from is infinite, we see that is cofinal in .
For all , let Then, by for all , and a standard elementarity argument, we see that is cofinal in .
Finally, let us pick some subset such that:
- for all ;
- for all ;
- for all .
Put and .
Then item 1 entails that , item 2 entails that , and item 3 entails that .
Let us point out that the above proof works equally well for stationary sets.
Proposition. For every stationary subset of a regular uncountable cardinal , and every coloring , one of the following holds:
- there exists a stationary and an infinite such that ;
- for every , there exists of order-type and an infinite such that .
Proof (sketch). Given the coloring , let . Let be a maximal subset of with the property that the intersection of any finite collection of subsets from is infinite.
Write , and consider two complimentary cases.
Suppose that .
Fix an infinite pseudointersection for (or let in case that is empty). Then is finite for all . Define by stipulating that . Then, by , we may find a stationary on which is constant. Put . Then is infinite, and .
Suppose that .
Fix a limit . Let be a continuous -chain of elementary submodels with and for all . Pick , and consider the poset , where , and iff and . As before, is -centered. Also, for all and , the set is cofinal in . Thus, by , we can pick a subset such that for all , and for all and .
Put and . Then is infinite, , and .
As is provably uncountable in ZFC, Jones’ theorem shows that the integer in the above-cited theorem of Erdos and Rado, may be replaced with any countable ordinal . We conclude this post by addressing the remaining case, that is, the case of .
Theorem (Sierpiński). CH entails
Proof. Sierpinski proved in the 1930’s that CH implies the existence of sequence of functions such that for every uncountable set of reals , there exists some such that for all . By CH, let us also fix a bijection . Finally, define by letting iff .
Then witnesses the failure of .
In contrast:
Theorem (Laver, 1973). entails
Moreover, for every ordinal of uncountable cofinality, any nonzero limit ordinal , and any positive integer we have:
Proof. Given a coloring , write . Then by Lemma 4 from a previous post, there exists a function and a set of order-type such that for all . Fix such that is cofinal in , and put . Let be some cofinal subset of , and then, define by stipulating As , let us fix such that is cofinal in . Put and . Then , and .