Dushnik-Miller for regular cardinals (part 3)

Here is what we already know about the Dushnik-Miller theorem in the case of ω1 (given our earlier posts on the subject):

In this post, we shall provide a proof of Todorcevic’s theorem that PFA implies ω1(ω1,α)2 for all α<ω1.

We commence with a sequence of lemmas.

Lemma 1.  Suppose that Iββ<ω1 is a given sequence of sets, with Iββ for all β<ω1. For Zω1, denote I(Z):={X[Z]0|{βZXIβ is infinite}|0}.

If AZω1 are uncountable sets, and [A]0I(Z), then there exists some uncountable BA such that αIβ for all α<β in B.
Proof. As AδI(Z) for all δ<ω1, we may recursively construct a strictly-increasing function f:ω1A such that f[β]If(β) is finite for all β<ω1. Let A1:=f[ω1]. Then A1 is an uncountable subset of A, and xβ:=A1Iβ is finite for all βA1. There are two cases to consider:

  • If {xββA1} is countable, then B:=A1{xββA1} is an uncountable subset with the desired property;
  • Otherwise, let A2 be an uncountable subset of A1 for which {xββA2} forms a Δ-system with root r. As the sets in {(xβr)βA2} are mutually disjoint, we get that sup{min(xβr)βA2}=ω1, so it is possible to recursively construct an uncountable subset B(A2r) such that αxβ for all α<β in B◻

 

Lemma 2. If b>1, then I(Z) is a P-ideal for every Zω1.

[Reminder. The cardinal b is defined as the smallest size of a family Bωω with the property that for every f:ωω, there exists some bB such that {n<ωf(n)<b(n)} is infinite. We say that an ideal I is a P-ideal if for every A[I]0, there exists some BI such that AB is finite for all AA. (slang: every countable collection of I-sets, admits a pseudounion within I).]

Proof of Lemma 2.  If Z is countable, then I(Z)=P(Z), and we are done. Now, suppose that Z is uncountable, and that we are given a countable subcollection {Xnn<ω}I, and let us show that it admits a pseudounion. As I is downward closed, we shall avoid trivialities and assume that {Xnn<ω} are mutually disjoint. Let δ<ω1 be large enough so that n<ω{β<ω1XnIβ is infinite}δ. Fix a bijection ψ:ωn<ωXn . Then for all βZδ, define fβ:ωω by letting for all n<ω: fβ(n):=min{m<ωXnIβψm}.

As b>ω1, we may pick a function f:ωω such that {n<ωfβ(n)>f(n)} is finite, for all βZδ. Now, let X:={Xnψ[f(n)]n<ω}. Then, for every n<ω, XnXψ[f(n)] is finite. Assume towards a contradiction that XI. Then, in particular, there exists some βZδ such that IβX is infinite. As fβf while IβXn is finite for all n<ω, let us pick a large enough n<ω such that fβ(n)f(n) and (IβX)Xn. Pick γIβXXn, and let m:=ψ1(γ). Since γIβXn, we get that fβ(n)>m. In particular, f(n)>m, and so by definition of X, we get that ψ(m)X, contradicting the choice of γ=ψ(m) in X. ◻

Lemma 3. Suppose that AZω1 satisfies [A]0I(Z)=.  Denote F(A,Z):={F[Z]<ω(AβFIβ) is finite }. If p>1=|Z|>|A|, then sup{min(F)FF(A,Z)}=ω1.

[Reminder. The cardinal p is defined as the smallest size of a family A of subsets of ω such that |F|=0 for all finite FA, while A does not admit a pseudointersection. (A pseudointersection for A is an infinite set B such that BA is finite for all AA). Note that bp.]
Proof of Lemma 3. Suppose not, and let δ:=sup{min(F)FF(A,Z)}. Then, the intersection of any finite family of sets from {AIββZδ+1} is infinite. Then, by p>ω1, there must exist a pseudointersection BA, namely, B(AIβ) is finite whenever βZδ+1. In particular, {βZBIβ is finite} is co-countable, and then BI(Z), contradicting the fact that BA, and [A]0I(Z)=. ◻

Lemma 4 (Laver, 1973). For every nonzero α<ω1, and every matrix Ai,ζi<n,ζ<κ, if all of the following conditions are met:

  1. n<ω;
  2. κ<p;
  3. i<nAi,ζ=ωα for all ζ<κ,

then, there exists a function f:κn and a set Bωα of order-type ωα such that BAf(ζ),ζ for all ζ<κ. (By BA, we mean that sup(BA)<sup(B).)

Proof. By induction on α. For the base case α=1, fix a uniform ultrafilter F over ω. Then, let f:κn be a function such that Af(ζ),ζF for all ζ<κ. As κ<p, the collection {Af(ζ),ζζ<κ} must admit a pseudointersection.
Next, suppose that 1<α<ω1, and that the lemma holds for all β<α. Let βmm<ω be a non-decreasing sequence of ordinals such that 1βm<α for all m<ω, and m<ωωβm=ωα. Denote  Ai,ζm:=Ai,ζ((kmωβk)(k<mωβk)). Then Ai,ζm is simply the mth-section of Ai,ζ. In particular:

  • Ai,ζ=m<ωAi,ζm for all i<n and ζ<κ;
  • otp(i<nAi,ζm)=ωβm for all m<ω, and ζ<κ.

By the induction hypothesis, for every m<ω, there exists a function fm:κn such that {Afm(ζ),ζmζ<κ} admits a pseduointersection Bm of order-type ωβm. In particular, sup(Bm)=kmωβk. For all m<ω, let βmjj<ω be an increasing sequence of ordinals that converges to kmωβk. Then, for all ζ<κ, define a function hζ:ωω, by letting:

hζ(m):=min{j<ω(BmAfm(ζ),ζm)βmj},(m<ω).

As κ<pb, let us pick function h:ωω such that {m<ωh(m)<hζ(m)} is finite for all ζ<κ. Next, we shall utilize the fact that {fm(ζ)m<ω} is finite for all ζ<κ. Fix a uniform ultrafilter F over ω, and then a function g:κn such that for all ζ<κ:{m<ωfm(ζ)=g(ζ)}F.
As κ<p, we may then find an infinite Mω such that {mMfm(ζ)g(ζ)} is finite for all ζ<κ. Finally, appeal to h, and M, by letting B:={Bmβmh(m)mM}. Then:

  • otp(Bmβmh(m))=otp(Bm)=ωβm for all mM, since βmh(m)<kmωβk=sup(Bm) ;
  • otp(B)=mMωβm=ωα, since sup(M)=ω.

Thus, we are left with verifying that B is indeed a pseudointersection of {Ag(ζ),ζζ<κ}. For this, fix an arbitrary ζ<κ. Let t<ω be large enough so that t>max{mMh(m)<hζ(m) & fm(ζ)g(ζ)}. We claim that (BAg(ζ),ζ)ktωβk<ωα. Suppose not, and fix δ(BAg(ζ),ζ) above ktωβk. Let mM be the unique integer such that δBmβmh(m). Then m>t and hence hζ(m)h(m), and fm(ζ)=g(m). It follows that δ(BmAg(ζ),ζ)(BmAg(ζ),ζm)=(BmAfm(ζ),ζm)βmhζ(m)βmh(m),contradicting the fact that δB. ◻

Definition (Todorcevic). The P-ideal Dichotomy (abbreviated PID) asserts that for every uncountable set Z, and every P-Ideal I over [Z]0, exactly one of the following holds:

  • There exists an uncountable AZ such that [A]0I;
  • There exists a sequence Znn<ω such that n<ωZn=Z, and [Zn]0I= for all n<ω.

Now, we are ready to prove the main result of this post.

Theorem (Todorcevic, 1983). Assume PID+(p>ω1). Then ω1(ω1,α)2 holds for all α<ω1.
Proof. We prove ω1(ω1,ωα)2 by induction on α<ω1. The base case α=1, is covered by the original Dushnik-Miller theorem. Next, suppose that 1<α<ω1, and that ω1(ω1,ωβ)2 holds for all β<α, and let us establish ω1(ω1,ωα)2. For this, suppose that c:[ω1]22 is a given coloring such that c[B]2{0} for every uncountable subset Bω1.
For all β<ω1, denote Iβ:={γ<βc(γ,β)=1}. Then c(γ,β)=0 iff γIβ. In particular, we infer from Lemma 1 that for every uncountable AZω1, [A]0I(Z). Namely, the first alternative of the P-ideal dichotomy fails for I(Z). As we assume PID+(p>ω1), and since bp, we infer from Lemma 2 that for every uncountable Zω1, there exists a sequence Znn<ω such that n<ωZn=Z, and [Zn]0I(Z)= for all n<ω.
Altogether, we conclude that for every uncountable set Zω1, there exists an uncountable subset YZ such that [Y]0I(Z)=.

Next, fix a non-decreasing sequence of ordinals αmm<ω such that 1αm<α for all m<ω and m<ωωαm=ωα. We shall construct by recursion on m<ω, a sequence (Am,Bm,τm,Zm,Ym,Xm)m<ω, such that all of the following holds for all m<ω;

  • BmAmYmZmXmZm+1;
  • otp(Bm)=otp(Am)=ωαm;
  • otp(Ym)=otp(Zm)=otp(Xm)=ω1;
  • τm<sup(Bm)<min(Bm+1);
  • c[Bm]2={1};
  • c[(Bmτm)×Xm]={1}.

Let Z0=ω1. Then, let Y0 be an uncountable subset of Z0 such that [Y0]0I(Z0)=. By the induction hypothesis, pick A0Y0 of order-type ωα0 such that c[A0]2={1}. Since [A0]0I(Z0)=, we get from Lemma 3 that F(A0,Z0) contains an uncountable family F0[Z0]<ω consisting of mutually-disjoint sets of some fixed size n. Then, by Lemma 4, there exists a choice function f0:F0Z0 and B0A0 of order-type ωα0 such that B0If0(F) for all FF0. Fix τ0<sup(B0), and an uncountable subset X0rng(f0) such that (B0τ0)Iβ for all βX0.
Now, suppose that m<ω is given, and (Am,Bm,τm,Zm,Ym,Xm) has already been defined. Let us define (Am+1,Bm+1,τm+1,Zm+1,Ym+1,Xm+1). Put Zm+1:=Xm. Pick Ym+1[Zm+1(sup(Bm)+1)]1 such that [Ym+1]0I(Zm+1)=. Pick Am+1Ym+1 of order-type ωαm+1 such that c[Am+1]2={1}. Then, use Lemma 4 to find Bm+1Am+1 of order-type ωαm+1, τm+1<sup(Bm+1), and an uncountable Xm+1Zm+1 such that c[(Bm+1τm+1)×Xm+1]2={1}. This completes the construction.

Finally, let B:=n<ω(Bnτn). Then otp(B)=ωα, and c[B]2={1}. ◻

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

6 Responses to Dushnik-Miller for regular cardinals (part 3)

  1. Ari B. says:

    It looks like you’ve proven it for all α<ωω, not just α<ω2.

    How essential is that restriction? Does the PFA result (for any countable ordinal α) apply here too?

    • saf says:

      I’m afraid I currently do not know how to pass the second indecomposable ordinal. The PFA result should be a consequence of PID+p>ω1, but as for now, I can only prove that the following statement follows from PID+p>ω1:
      Suppose that α<ω1 and that ω1(ω1,ωβ)2 holds for all β<α (e.g., α=2). Let βnn<ω be a non-decreasing sequence of ordinals such that ωα=n<ωωβn. Then for every coloring c:[ω1]20,1 that does not admit an uncountable 0-homogeneous set, there exists a sequence of countable subsets of ω1, Bnn<ω, such that for all n<ω:
      1. otp(Bn)=ωβn;
      2. sup(Bn)<min(Bn+1);
      3. c[BnBn+1]2=1.

      So, n<ωBn 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.

  2. Euclid says:

    I would prefer a more informative title for this and the previous section.
    This is really about κ(κ,α)2 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 κ(κ,infinite)2 i.e., with no hint towards a possible discussion of the ‘length’ of the ‘infinite set’.

  3. Euclid says:

    P.S. There is a typo in the statement of Todorcevic’s theorem: α<ω1 should be in place of α<ω2.

    • saf says:

      Thanks. It stayed there from the previous version of this post, where we were dealing only with ordinals below the second indecomposable ordinal.

  4. Pingback: Jones’ theorem on the cardinal invariant p | Assaf Rinot

Leave a Reply

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