Dushnik-Miller for singular cardinals (part 1)

Continuing the previous post, let us now prove the following.

Theorem (Erdos-Dushnik-Miller, 1941). For every singular cardinal λ, we have:
λ(λ,ω)2.

Proof. Suppose that λ is a singular cardinal, and c:[λ]2{0,1} is a given coloring. For any ordinal α<λ, denote Iα:={β(α,λ)c(α,β)=1}.

 

Subclaim. At least one of the following holds:

  1. there exists an infinite subset Bλ for which c[B]2={1};
  2. there exists a subset Xλ of size λ, such that |XIα|<λ for all αX.

Proof. Suppose that (2) fails. Recursively define a seuqence (Xn,αn)n<ω as follows:
X0:=λ, and α0 is a witness to the fact that {αX0|X0Iα|=λ} is non-empty;
Xn+1:=XnIαn, and αn+1 is an element of the non-empty set {αXn+1|Xn+1Iα|=λ}.

Then n<m<ω implies that αn<αmXmXn+1Iαn. In particular, c(αn,αm)=1. So B={αnn<ω} witnesses clause (1). End of proof of subclaim.

Next, let us suppose that c[B]2{1} for any infinite Bλ, and work towards showing that c[A]2={0} for some subset Aλ of size λ. By our hypothesis, we may fix a subset X as in clause (2) of the preceding subclaim. Let λii<cf(λ) be a strictly increasing sequence of regular cardinals converging to λ, with λ0>cf(λ). Let Xii<cf(λ) be some partition of a subset of X into pairwise-disjoint sets such that |Xi|=λi for all i<cf(λ). For simplicity, we shall further require that sup(Xi)<min(Xj) for all i<j<cf(λ).

Denote κ:=cf(λ), and fix i<κ.
– Since λi is regular, we infer from the previous post, the existence of a subset YiXi of size λi such that c[Yi]={0}.
– Since YiXiX, we get that Yi=j<κ{αYi|XIα|<λj}, and since |Yi|=cf(λi)>κ, we infer the existence of some ji<κ for which |{αYi|XIα|<λji}|=λi.

Recursively define a function f:κκ so that for all i<κ, we would have:
λf(i)>l<i(λf(l)+λjf(l)).

Then, for all i<κ, let Zi:=Yf(i){Iααl<iYf(l)}, and notice that the choice of f insures that |Zi|=λf(i) for all i<κ. So in particular, A:=i<κZi is a subset of size λ.
Finally, to see that c[A]2={0}, fix α0<α1 in A. Let i0,i1 be such that αnZin for all n<2. There are two cases to consider:

case 1: i0=i1. Here, {α0,α1}Yf(i0). So, by the choice of Yf(i0), we conclude that c(α0,α1)=0.

case 2: i0<i1. Since α0Zi0Yf(i0), we know that Iα0 is disjoint from Zi1. In particular, α1 is not an element of Iα0, meaning that c(α0,α1)=0. ◻

To see that the preceding theorem is somewhat optimal, we point out the following.

Proposition (folklore). λ(λ,ω+1)2 fails for every uncountable cardinal λ of countable cofinality.
Proof. Suppose that λ>cf(λ)=ω. Let λnn<ω denote an increasing sequence of ordinals converging to λ. Define f:λω by letting f(α):=min{n<ωα<λn}. Define c:[λ]2{0,1} by letting c(α,β):=0 iff f(α)=f(β).

Evidently, for every Bλ that satisfies c[B]2={1}, we have that fB is order-preserving. In particular, otp(B)ω for any such B. On the other front, as |f1{n}|<λ for all n<ω, we get that c[A]2{0} for every subset Aλ of order-type λ. Altogether, c witnesses the failure of λ(λ,ω+1)2. ◻.

In an upcoming post, we shall provide a proof for Shelah’s recent extension of the Edros-Dushnik-Miller theorem that handles singular cardinals of uncountable cofinality.

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

3 Responses to Dushnik-Miller for singular cardinals (part 1)

  1. Ari B. says:

    I think there’s a problem with the second-last line, where it says c”[A]^2 is infinite. It looks like you meant neq {0}.

    • saf says:

      That’s right, Ari. What I wanted to say is that fA is infinite whenever textotp(A)=lambda, and hence c[A]2neq0 for every such A.

      Thanks!

  2. Pingback: Dushnik-Miller for singular cardinals (part 2) | Assaf Rinot

Leave a Reply

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