Jones’ theorem on the cardinal invariant p

This post continues the study of the cardinal invariant p. We refer the reader to a previous post for all the needed background. For ordinals α,α0,α1,β,β0,β1, the polarized partition relation (αβ)(α0α1β0β1) asserts that for every coloring f:α×β2, (at least) one of the following holds:

  1. there are Aα and Bβ with otp(A)=α0,otp(B)=β0 s.t. f[A×B]={0};
  2. there are Aα and Bβ with otp(A)=α1,otp(B)=β1 s.t. f[A×B]={1}.

Erdős and Rado proved that (ω1ω)(ω1nωω) holds for all n<ω. The current post will center around a proof of the following relative:

Theorem (A.L. Jones, 2008). For all α<p: (pω)(pαωω).

Proof. Suppose that we are given a coloring f:p×ω2. Denote 1τ:={n<ωf(τ,n)=1}, and let X be a maximal (with respect to inclusion) subset of p with the property that the intersection of any finite collection of subsets from AX:={1ττX} is infinite. The proof is now divided into two.

Suppose that |X|<p.
By |AX|<p, let us fix an infinite pseudointersection P for AX (indeed, if X=, we simply take P:=ω). Notice that if Qω and PQ is infinite, then QτI1τ is infinite for all I[X]<ω. Thus, it follows from the maximality of X that P1τ is finite for all τpX. Put Y:=pX and define g:Y[P]<ω by letting g(τ):=P1τ for all τY. Then, by p=cf(p)>ω, we may find a subset AY of size p on which g is constant. In particular, B:=τA(ω1τ) contains the infinite set Pg(min(A)).
Altogether, otp(A)=p, otp(B)=ω, and f[A×B]={0}.

Suppose that |X|=p.
Let Mαα<p be a continuous ϵ-chain of elementary submodels of (H(θ),,<θ) for a large enough regular θ, such that f,XM0 and Mαpp for all α<p.
Suppose that we are given a limit ordinal α<p. Pick χ(XMα+1)Mα, and consider the poset P:=P,, where P:={(a,b)[XMα]<ω×[ω]<ωχa,f[a×b]={1}}, and (a0,b0)(a1,b1) iff a0a1 and b0b1.
For all b[ω]<ω, put Pb:={(a,b)Pb=b}. Then Pbb[ω]<ω witnesses that P is σ-centered.

For all n<ω, let Dn:={(a,b)Pmax(b)>n}. Recalling that the intersection of any finite collection of subsets from {1ττX} is infinite, we see that Dn is cofinal in P.

For all β<α, let Eβ:={(a,b)P(aMβ+1)Mβ}.Then, by χ(aMα+1)Mα for all (a,b)P, and a standard elementarity argument, we see that Eβ is cofinal in P.

Finally, let us pick some subset G(α)P such that:

  1. {p}{q} for all p,qG(α);
  2. G(α)Dn for all n<ω;
  3. G(α)Eβ for all β<α.

Put A:={a(a,b)G(α)} and B:={b(a,b)G(α)}.
Then item 1 entails that f[a×b]={1}, item 2 entails that otp(B)=ω, and item 3 entails that otp(A)α. ◻

Let us point out that the above proof works equally well for stationary sets.

Proposition. For every stationary subset S of a regular uncountable cardinal κ, and every coloring f:S×ω2, one of the following holds:

  1. there exists a stationary AS and an infinite Bω such that f[A×B]={0};
  2. for every ϵ<min{κ,p}, there exists AS of order-type ϵ and an infinite Bω such that f[A×B]={1}.

Proof (sketch). Given the coloring f:S×ω2, let 1τ:={n<ωf(τ,n)=1}. Let X be a maximal subset of S with the property that the intersection of any finite collection of subsets from AX:={1ττX} is infinite.
Write μ:=min{κ,p}, and consider two complimentary cases.

Suppose that |X|<μ.
Fix an infinite pseudointersection P for AX (or let P=ω in case that X is empty). Then P1τ is finite for all τSX. Define g:SX[P]<ω by stipulating that g(τ):=P1τ. Then, by cf(κ)>ω, we may find a stationary ASX on which g is constant. Put B:=τA(ω1τ). Then B is infinite, and f[A×B]={0}.

Suppose that |X|μ.
Fix a limit ϵ<μ. Let Mαα<ϵ+1 be a continuous ϵ-chain of elementary submodels with f,XM0 and Mαμμ for all α. Pick χXMϵ, and consider the poset P:=P,, where P:={(a,b)[XMϵ]<ω×[ω]<ωχa,f[a×b]={1}}, and (a0,b0)(a1,b1) iff a0a1 and b0b1. As before, P is σ-centered. Also, for all n<ω and β<ϵ, the set Dnβ:={(a,b)P(aMβ+1)Mβ and |b|>n} is cofinal in P. Thus, by ϵ<p, we can pick a subset GP such that {p}{q} for all p,qG, and GDnβ for all n<ω and β<ϵ.

Put A:={a(a,b)G(α)} and B:={b(a,b)G(α)}. Then B is infinite, otp(A)ϵ, and f[a×b]={1}. ◻

As p is provably uncountable in ZFC, Jones’ theorem shows that the integer n 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 ω1.

Theorem (Sierpiński). CH entails (ω1ω)(ω1ω1ωω).

Proof. Sierpinski proved in the 1930’s that CH implies the existence of sequence of functions fn:RRn<ω such that for every uncountable set of reals A, there exists some m<ω such that fn[A]=R for all nm. By CH, let us also fix a bijection ψ:ω1R. Finally, define f:ω1×ω2 by letting f(τ,n):=0 iff fn(ψ(τ))=0.
Then f witnesses the failure of (ω1ω)(ω1ω1ωω). ◻

In contrast:

Theorem (Laver, 1973). MA1 entails(ω1ω)(ω1ω1ωω).

Moreover, for every ordinal κ<p of uncountable cofinality, any nonzero limit ordinal α<ω1, and any positive integer n<ω we have:(κωα)(κωα)n.
Proof. Given a coloring f:κ×ωαn, write Ai,ζ:={β<ωαf(β,ζ)=i}. Then by Lemma 4 from a previous post, there exists a function g:κn and a set Bωα of order-type ωα such that BAg(ζ),ζ for all ζ<κ. Fix i<n such that g1{i} is cofinal in κ, and put A:=g1{i}. Let {βkk<ω} be some cofinal subset of ωα, and then, define h:Aω by stipulating h(ζ):=min{k<ω(Bβk)Ai,ζ}.As cf(κ)>ω, let us fix k<ω such that h1{k} is cofinal in κ.  Put A:=h1{k} and B:=Bβk. Then otp(A)=κ,otp(B)=ωα, and f[A×B]={i}. ◻

 

 

 

This entry was posted in Blog, Expository and tagged , . Bookmark the permalink.

Leave a Reply

Your email address will not be published. Required fields are marked *