Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

../


Source. Saharon Shelah, Notes on partition calculus, Infinite and finite sets (Keszthely, 1973), Colloq. Math. Soc. János Bolyai 10, North-Holland, 1975, 1257--1276; Theorem 1.2 with its half-page proof and the Remark after Corollary 1.3, printed p. 1260, PDF p. 4 of the twenty-page scan without a text layer held by its library card, Shelah (1975), read on page images rendered from the scan; the result page is theorem_1_2. The lemma the proof consumes is reconstructed in Lemma 1.1, and the corollary that consumes the theorem in Corollary 1.3.

Standing. This is an author-recorded reconstruction of the source's argument. It is not an independent review, changes no status and assigns no tier. The two-color statement is reconstructed in full, with one relation imported from Erdős, Hajnal and Rado (1965), which is not held. The parenthetical three-color form is derived here from the two-color form and the imported Erdős--Dushnik--Miller theorem, an argument the source does not print; a preliminary remark that κ<λ\kappa<\lambda under the hypotheses, which the source does not discuss, imports Sierpiński's theorem.

Definitions

For cardinals θ\theta and μ0,…,μk−1\mu_0,\ldots,\mu_{k-1} with k≥2k\ge2, the relation θ→(μ0,…,μk−1)2\theta\to(\mu_0,\ldots,\mu_{k-1})^2 means: for every f:[θ]2→kf:[\theta]^2\to k, where [θ]2[\theta]^2 is the set of two-element subsets of θ\theta, there are ν<k\nu<k and H⊆θH\subseteq\theta with ∣H∣=μν|H|=\mu_\nu such that ff is constantly ν\nu on [H]2[H]^2; and θ→(μ)22\theta\to(\mu)^2_2 is θ→(μ,μ)2\theta\to(\mu,\mu)^2. Only the cardinality of the underlying set matters: a coloring of the pairs of any set of size θ\theta is transported along a bijection, and a homogeneous set of size at least μν\mu_\nu contains one of size μν\mu_\nu.

cf⁡λ\operatorname{cf}\lambda is the cofinality of λ\lambda. The sequence ⟨2μ:μ<λ⟩\langle2^\mu:\mu<\lambda\rangle, indexed by the cardinals μ<λ\mu<\lambda, is eventually ≥λ\ge\lambda when there is a cardinal μ0<λ\mu_0<\lambda with 2μ≥λ2^\mu\ge\lambda for every cardinal μ\mu with μ0≤μ<λ\mu_0\le\mu<\lambda, and not eventually constant when for every cardinal ν<λ\nu<\lambda there is a cardinal μ\mu with ν<μ<λ\nu<\mu<\lambda and 2μ≠2ν2^\mu\ne2^\nu; since μ↦2μ\mu\mapsto2^\mu is nondecreasing, 2μ>2ν2^\mu>2^\nu then.

χ=∑μ<λ2μ\chi=\sum_{\mu<\lambda}2^\mu is the cardinal sum over all cardinals μ<λ\mu<\lambda, the finite ones included.

Sum formula. If II is an infinite set and κi≥1\kappa_i\ge1 (i∈Ii\in I) are cardinals, then

∑i∈Iκi=∣I∣⋅sup⁡i∈Iκi.\sum_{i\in I}\kappa_i=|I|\cdot\sup_{i\in I}\kappa_i .

Each term is at most the supremum, so the sum is at most ∣I∣|I| times it; each term is at least 11, so the sum is at least ∣I∣|I|; each term is at most the sum, so the sum is at least the supremum; and ∣I∣⋅sup⁡iκi=max⁡(∣I∣,sup⁡iκi)|I|\cdot\sup_i\kappa_i=\max(|I|,\sup_i\kappa_i) because ∣I∣|I| is infinite.

Standard facts used without citation: successor cardinals are regular; 2∑iκi=∏i2κi2^{\sum_i\kappa_i}=\prod_i2^{\kappa_i}; (2μ)μ=2μ(2^\mu)^\mu=2^\mu for infinite μ\mu; a union of fewer than cf⁡θ\operatorname{cf}\theta sets of size less than θ\theta has size less than θ\theta; a subset of a cardinal θ\theta of cardinality θ\theta is unbounded in θ\theta; and fewer than cf⁡λ\operatorname{cf}\lambda cardinals below λ\lambda have supremum below λ\lambda.

Imported results

  • (ER) Erdős, Hajnal and Rado, Partition relations for cardinals, Acta Math. Acad. Sci. Hungar. 16 (1965), 93--196, the paper's [4], not held: for every infinite cardinal μ\mu, (2μ)+→((2μ)+,μ+)2(2^\mu)^+\to((2^\mu)^+,\mu^+)^2. The source cites from [4] the two relations λi→(λi,μ(i))2\lambda_i\to(\lambda_i,\mu(i))^2 and λi→(μ(i),λi)2\lambda_i\to(\mu(i),\lambda_i)^2 for λi=(2μ(i))+\lambda_i=(2^{\mu(i)})^+; both follow from (ER) with μ=μ(i)\mu=\mu(i), by shrinking a homogeneous set of size μ+\mu^+ to one of size μ\mu and by exchanging the two colors. The stronger form (2κ)+→((2κ)+,(κ+)κ)2(2^\kappa)^+\to((2^\kappa)^+,(\kappa^+)_\kappa)^2 for infinite κ\kappa, with κ\kappa colors in the second slot, is printed in Komjáth's survey, printed p. 442, PDF p. 25, in the commentary on Problem 53, komjath_2025_erdos_hajnal_problem_list, inside a remark the survey attributes to Erdős and Hajnal; the survey's next paragraph attaches the label Erdős--Rado to the form λ+→(λ+,(κ+)κ)2\lambda^+\to(\lambda^+,(\kappa^+)_\kappa)^2 for cardinals λ\lambda with λκ<λκ+\lambda^\kappa<\lambda^{\kappa^+}. That held page anchors the statement, not its proof.
  • (K) The hypothesis κ→(κ)22\kappa\to(\kappa)^2_2, used once, in Step 7. For κ=ω\kappa=\omega it is Ramsey's theorem; see the corollary page.
  • (S) Sierpiński, Sur un problème de la théorie des relations, Ann. Scuola Norm. Sup. Pisa (2) 2 (1933), 285--287, not held: for every infinite cardinal μ\mu there is a two-coloring of [2μ]2[2^\mu]^2 with no homogeneous set of size μ+\mu^+, that is, 2μ↛(μ+)222^\mu\not\to(\mu^+)^2_2. Used only in the preliminary remark.
  • (EDM) Dushnik and Miller, Partially ordered sets, Amer. J. Math. 63 (1941), 600--610, with the singular case due to Erdős in the same paper, not held: θ→(θ,ω)2\theta\to(\theta,\omega)^2 for every infinite cardinal θ\theta. Used only for the three-color form.

Statement

Theorem 1.2 (printed p. 1260, with the hypothesis as corrected on the result page). Let λ\lambda be an infinite cardinal and κ=cf⁡λ\kappa=\operatorname{cf}\lambda. Suppose κ→(κ)22\kappa\to(\kappa)^2_2 and that ⟨2μ:μ<λ⟩\langle2^\mu:\mu<\lambda\rangle is not eventually constant but eventually ≥λ\ge\lambda. Then

χ=∑μ<λ2μ→(λ)22,\chi=\sum_{\mu<\lambda}2^\mu\to(\lambda)^2_2 ,

and in fact χ→(λ,λ,ω)2\chi\to(\lambda,\lambda,\omega)^2.

The printed hypothesis reads "eventually ≥κ\ge\kappa"; the result page records why this is a misprint for ≥λ\ge\lambda, the bound the proof uses when it chooses 2μ(i)≥λ2^{\mu(i)}\ge\lambda (Step 1 below).

Proof

Preliminary: κ<λ\kappa<\lambda

This paragraph is supplied here; the source does not discuss it. Suppose κ=λ\kappa=\lambda, so λ\lambda is regular and λ→(λ)22\lambda\to(\lambda)^2_2. By the hypothesis there is a cardinal μ<λ\mu<\lambda with 2μ≥λ2^\mu\ge\lambda; μ\mu is infinite, because 2μ≥λ2^\mu\ge\lambda is infinite while 2μ2^\mu is finite for finite μ\mu. By (S) there is a two-coloring of the pairs of a set of size 2μ2^\mu with no homogeneous set of size μ+\mu^+. Restricting it to a subset of size λ≤2μ\lambda\le2^\mu gives a two-coloring of [λ]2[\lambda]^2 with no homogeneous set of size μ+\mu^+, and μ+≤λ\mu^+\le\lambda; this contradicts λ→(λ)22\lambda\to(\lambda)^2_2. Hence κ<λ\kappa<\lambda, and λ\lambda is singular. Step 1 uses κ<λ\kappa<\lambda to choose μ(0)≥κ\mu(0)\ge\kappa, which Step 5 needs.

Step 1: the cardinals μ(i)\mu(i)

Fix a cardinal μ0<λ\mu_0<\lambda with 2μ≥λ2^\mu\ge\lambda for every cardinal μ\mu with μ0≤μ<λ\mu_0\le\mu<\lambda, and a sequence ⟨νi:i<κ⟩\langle\nu_i:i<\kappa\rangle of cardinals below λ\lambda with sup⁡i<κνi=λ\sup_{i<\kappa}\nu_i=\lambda, which exists because cf⁡λ=κ\operatorname{cf}\lambda=\kappa. Define cardinals μ(i)<λ\mu(i)<\lambda by recursion on i<κi<\kappa. Given μ(j)\mu(j) for j<ij<i, put

ρi=max⁡(μ0, κ, νi, sup⁡j<iμ(j)),\rho_i=\max\bigl(\mu_0,\ \kappa,\ \nu_i,\ \sup_{j<i}\mu(j)\bigr),

a cardinal below λ\lambda: the first three are, and sup⁡j<iμ(j)\sup_{j<i}\mu(j) is because i<κ=cf⁡λi<\kappa=\operatorname{cf}\lambda. Since the sequence of powers is not eventually constant, there is a cardinal μ\mu with ρi<μ<λ\rho_i<\mu<\lambda and 2μ>2ρi2^\mu>2^{\rho_i}; let μ(i)\mu(i) be the least one. Then, for all j<i<κj<i<\kappa:

  • μ(j)≤ρi<μ(i)\mu(j)\le\rho_i<\mu(i), so the μ(i)\mu(i) are strictly increasing;
  • 2μ(j)≤2ρi<2μ(i)2^{\mu(j)}\le2^{\rho_i}<2^{\mu(i)}, so the 2μ(i)2^{\mu(i)} are strictly increasing;
  • μ(i)≥μ0\mu(i)\ge\mu_0, so 2μ(i)≥λ2^{\mu(i)}\ge\lambda;
  • μ(i)≥κ\mu(i)\ge\kappa, so μ(i)\mu(i) is infinite and ∣i∣<κ≤μ(i)|i|<\kappa\le\mu(i);
  • μ(i)≥νi\mu(i)\ge\nu_i, so sup⁡i<κμ(i)=λ\sup_{i<\kappa}\mu(i)=\lambda.

Hence ∑i<κμ(i)=λ\sum_{i<\kappa}\mu(i)=\lambda: the sum is at least the supremum, and at most κ⋅λ=λ\kappa\cdot\lambda=\lambda. The source states the choice of μ(i)\mu(i) with ∑iμ(i)=λ\sum_i\mu(i)=\lambda, 2μ(i)2^{\mu(i)} strictly increasing and 2μ(i)≥λ2^{\mu(i)}\ge\lambda; the bounds μ(i)≥κ\mu(i)\ge\kappa and μ(i)≥∣i∣\mu(i)\ge|i| are added here for Step 5.

Step 2: the blocks and the identification of χ\chi

Put λi=(2μ(i))+\lambda_i=(2^{\mu(i)})^+ and

Ai={ξ: sup⁡j<iλj≤ξ<λi}(i<κ),A=⋃i<κAi.A_i=\Bigl\{\xi:\ \sup_{j<i}\lambda_j\le\xi<\lambda_i\Bigr\} \qquad(i<\kappa), \qquad A=\bigcup_{i<\kappa}A_i .

(a) Each λi\lambda_i is a successor cardinal, hence regular, and for i<ji<j, λi=(2μ(i))+≤2μ(j)<λj\lambda_i=(2^{\mu(i)})^+\le2^{\mu(j)}<\lambda_j because 2μ(i)<2μ(j)2^{\mu(i)}<2^{\mu(j)}. So the λi\lambda_i are strictly increasing and λj≤2μ(i)\lambda_j\le2^{\mu(i)} for j<ij<i.

(b) For i<κi<\kappa, sup⁡j<iλj≤2μ(i)<λi\sup_{j<i}\lambda_j\le2^{\mu(i)}<\lambda_i by (a). So AiA_i is the interval of ordinals from sup⁡j<iλj\sup_{j<i}\lambda_j to λi\lambda_i; these intervals are pairwise disjoint, and ∣Ai∣=λi|A_i|=\lambda_i, because removing an initial segment of size less than λi\lambda_i from the cardinal λi\lambda_i leaves λi\lambda_i elements.

(c) AA is the ordinal sup⁡i<κλi\sup_{i<\kappa}\lambda_i: every ordinal ξ<sup⁡iλi\xi<\sup_i\lambda_i lies in AiA_i for the least ii with ξ<λi\xi<\lambda_i. Moreover sup⁡iλi=sup⁡i2μ(i)\sup_i\lambda_i=\sup_i2^{\mu(i)}, since 2μ(i)<λi≤2μ(i+1)2^{\mu(i)}<\lambda_i\le2^{\mu(i+1)}.

(d) χ=sup⁡i<κ2μ(i)\chi=\sup_{i<\kappa}2^{\mu(i)}. The index set of χ\chi, the cardinals below λ\lambda, is infinite of cardinality at most λ\lambda, and every term is at least 11, so by the sum formula χ=∣{μ:μ<λ}∣⋅sup⁡μ<λ2μ\chi=|\{\mu:\mu<\lambda\}|\cdot\sup_{\mu<\lambda}2^\mu, which is sup⁡μ<λ2μ\sup_{\mu<\lambda}2^\mu because that supremum is at least λ\lambda by the eventual bound. Finally sup⁡μ<λ2μ=sup⁡i<κ2μ(i)\sup_{\mu<\lambda}2^\mu=\sup_{i<\kappa}2^{\mu(i)}: for every cardinal μ<λ\mu<\lambda there is ii with μ≤μ(i)\mu\le\mu(i), because sup⁡iμ(i)=λ\sup_i\mu(i)=\lambda, and 2μ≤2μ(i)2^\mu\le2^{\mu(i)}.

By (c) and (d), AA is the ordinal χ\chi, so a coloring of [χ]2[\chi]^2 is a coloring of the pairs from AA, the disjoint union of the blocks AiA_i of sizes λi\lambda_i. The source writes the blocks and χ\chi without (c) and (d); they are made explicit here.

Step 3: a large homogeneous set inside one block

Let f:[χ]2→2={0,1}f:[\chi]^2\to2=\{0,1\}. If for some i<κi<\kappa there is B⊆AiB\subseteq A_i with ∣B∣≥λ|B|\ge\lambda and ff constant on [B]2[B]^2, then a subset of BB of size λ\lambda is homogeneous and the theorem holds. Assume from now on:

(N) for every i<κi<\kappa and every B⊆AiB\subseteq A_i with ∣B∣≥λ|B|\ge\lambda, ff is not constant on [B]2[B]^2.

Step 4: both colors inside every large subset of a block

Claim. For every i<κi<\kappa and every A′⊆AiA'\subseteq A_i with ∣A′∣=λi|A'|=\lambda_i there are B0,B1⊆A′B_0,B_1\subseteq A' with ∣B0∣=∣B1∣=μ(i)|B_0|=|B_1|=\mu(i) such that ff is constantly 00 on [B0]2[B_0]^2 and constantly 11 on [B1]2[B_1]^2.

Apply (ER) with μ=μ(i)\mu=\mu(i), infinite by Step 1, to the restriction of ff to [A′]2[A']^2, transported to (2μ(i))+=λi(2^{\mu(i)})^+=\lambda_i: there is H⊆A′H\subseteq A' with either ∣H∣=λi|H|=\lambda_i and ff constantly 00 on [H]2[H]^2, or ∣H∣=μ(i)+|H|=\mu(i)^+ and ff constantly 11 on [H]2[H]^2. The first alternative contradicts (N), because H⊆AiH\subseteq A_i and ∣H∣=λi>2μ(i)≥λ|H|=\lambda_i>2^{\mu(i)}\ge\lambda. So the second holds, and any B1⊆HB_1\subseteq H with ∣B1∣=μ(i)|B_1|=\mu(i) serves. Applying (ER) to the coloring 1−f1-f in the same way gives B0B_0.

Step 5: the properties PαP_\alpha and the hypotheses of Lemma 1.1

For α<κ\alpha<\kappa let Pα(⟨Bi:i≤α⟩,⟨ai:α<i<κ⟩)P_\alpha(\langle B_i:i\le\alpha\rangle,\langle a_i:\alpha<i<\kappa\rangle) hold exactly when there are Bα,0,Bα,1⊆BαB_{\alpha,0},B_{\alpha,1}\subseteq B_\alpha with

Bα=Bα,0∪Bα,1,∣Bα,0∣=∣Bα,1∣=μ(α),B_\alpha=B_{\alpha,0}\cup B_{\alpha,1}, \qquad|B_{\alpha,0}|=|B_{\alpha,1}|=\mu(\alpha),

ff constantly 00 on [Bα,0]2[B_{\alpha,0}]^2 and constantly 11 on [Bα,1]2[B_{\alpha,1}]^2. The property depends on BαB_\alpha alone.

Lemma 1.1 is applied with this κ\kappa, these λi\lambda_i, μ(i)\mu(i) and AiA_i, with the lemma's χ\chi equal to 22, and with two two-place functions F0=F1=f~F_0=F_1=\tilde f, where f~:A2→2\tilde f:A^2\to2 is f~(ξ,η)=f({ξ,η})\tilde f(\xi,\eta)=f(\{\xi,\eta\}) for ξ≠η\xi\ne\eta and f~(ξ,ξ)=0\tilde f(\xi,\xi)=0. Its hypotheses hold:

  • κ=cf⁡λ\kappa=\operatorname{cf}\lambda is an infinite regular cardinal; the λi\lambda_i are regular and strictly increasing by Step 2(a); and ∣Ai∣=λi|A_i|=\lambda_i by Step 2(b).
  • 22+κ=2κ≤2μ(0)<λ02^{2+\kappa}=2^\kappa\le2^{\mu(0)}<\lambda_0, because μ(0)≥κ\mu(0)\ge\kappa.
  • Growth: λiμ(i)=λi\lambda_i^{\mu(i)}=\lambda_i for every ii. Indeed μ(i)<2μ(i)<λi=cf⁡λi\mu(i)<2^{\mu(i)}<\lambda_i=\operatorname{cf}\lambda_i, so every function from μ(i)\mu(i) into λi\lambda_i has bounded range, and λiμ(i)≤∑θ<λi∣θ∣μ(i)≤λi⋅(2μ(i))μ(i)=λi⋅2μ(i)=λi\lambda_i^{\mu(i)}\le\sum_{\theta<\lambda_i}|\theta|^{\mu(i)}\le\lambda_i\cdot(2^{\mu(i)})^{\mu(i)}=\lambda_i\cdot2^{\mu(i)}=\lambda_i, using ∣θ∣≤2μ(i)|\theta|\le2^{\mu(i)} for θ<λi\theta<\lambda_i. Hence for 1≤j<κ1\le j<\kappa, by Step 2(a) and ∣j∣≤μ(j)|j|\le\mu(j), λj=∏i<jλi≤(2μ(j))∣j∣≤(2μ(j))μ(j)=2μ(j)<λj\lambda^j=\prod_{i<j}\lambda_i\le(2^{\mu(j)})^{|j|}\le(2^{\mu(j)})^{\mu(j)}=2^{\mu(j)}<\lambda_j, and λ0=1<λ0\lambda^0=1<\lambda_0.
  • (H): given α<κ\alpha<\kappa, any admissible ⟨Bi:i<α⟩\langle B_i:i<\alpha\rangle, any points aia_i and any C⊆AαC\subseteq A_\alpha with ∣C∣=λα|C|=\lambda_\alpha, Step 4 gives B0,B1⊆CB_0,B_1\subseteq C of size μ(α)\mu(\alpha) homogeneous in the colors 00 and 11; then Bα=B0∪B1B_\alpha=B_0\cup B_1 has ∣Bα∣=μ(α)|B_\alpha|=\mu(\alpha) and satisfies PαP_\alpha.

The source asserts that Lemma 1.1 applies without checking the second and third items; they are verified here, and the second is where μ(0)≥κ\mu(0)\ge\kappa, hence the preliminary κ<λ\kappa<\lambda, enters.

Step 6: canonization to a coloring of pairs of indices

Lemma 1.1 yields ai∗∈Aia^*_i\in A_i and Bi⊆AiB_i\subseteq A_i with ∣Bi∣≤μ(i)|B_i|\le\mu(i) satisfying its (1A), (1B) and (2). By (2) and the definition of PαP_\alpha, fix for every α<κ\alpha<\kappa sets Bα,0,Bα,1⊆BαB_{\alpha,0},B_{\alpha,1}\subseteq B_\alpha as in PαP_\alpha; in particular ∣Bα∣=μ(α)|B_\alpha|=\mu(\alpha). By (1B) for F0=f~F_0=\tilde f with no further arguments, for all α<β<κ\alpha<\beta<\kappa, b,b′∈Bαb,b'\in B_\alpha and c,c′∈Bβc,c'\in B_\beta,

f({b,c})=f~(b,c)=f~(b′,c′)=f({b′,c′}),f(\{b,c\})=\tilde f(b,c)=\tilde f(b',c')=f(\{b',c'\}),

where b≠cb\ne c and b′≠c′b'\ne c' because Aα∩Aβ=∅A_\alpha\cap A_\beta=\emptyset. So

g({α,β})=f({b,c})(b∈Bα, c∈Bβ, α<β<κ)g(\{\alpha,\beta\})=f(\{b,c\}) \qquad(b\in B_\alpha,\ c\in B_\beta,\ \alpha<\beta<\kappa)

is a well-defined coloring g:[κ]2→2g:[\kappa]^2\to2.

Step 7: the Ramsey step

By (K) there are I⊆κI\subseteq\kappa with ∣I∣=κ|I|=\kappa and δ∈{0,1}\delta\in\{0,1\} such that gg is constantly δ\delta on [I]2[I]^2. Put

B=⋃α∈IBα,δ.B=\bigcup_{\alpha\in I}B_{\alpha,\delta}.

ff is constantly δ\delta on [B]2[B]^2. Let ξ≠η\xi\ne\eta be in BB. If both lie in one Bα,δB_{\alpha,\delta}, then f({ξ,η})=δf(\{\xi,\eta\})=\delta by the homogeneity of Bα,δB_{\alpha,\delta}. Otherwise ξ∈Bα,δ\xi\in B_{\alpha,\delta} and η∈Bβ,δ\eta\in B_{\beta,\delta} with α≠β\alpha\ne\beta in II, say α<β\alpha<\beta, and f({ξ,η})=g({α,β})=δf(\{\xi,\eta\})=g(\{\alpha,\beta\})=\delta by Step 6.

∣B∣=λ|B|=\lambda. The sets Bα,δ⊆AαB_{\alpha,\delta}\subseteq A_\alpha are pairwise disjoint, so ∣B∣=∑α∈Iμ(α)|B|=\sum_{\alpha\in I}\mu(\alpha). This is at most ∑α<κμ(α)=λ\sum_{\alpha<\kappa}\mu(\alpha)=\lambda. Conversely II, a subset of κ\kappa of cardinality κ\kappa, is unbounded in κ\kappa; the μ(α)\mu(\alpha) increase; so sup⁡α∈Iμ(α)=sup⁡α<κμ(α)=λ\sup_{\alpha\in I}\mu(\alpha)=\sup_{\alpha<\kappa}\mu(\alpha)=\lambda, and the sum is at least its supremum.

Thus BB is a homogeneous set of size λ\lambda for ff, and χ→(λ)22\chi\to(\lambda)^2_2 is proved. The source's proof ends with "∣B∣=∑i∈Iμ(i)=λ|B|=\sum_{i\in I}\mu(i)=\lambda" and "ff has on [B]2[B]^2 the constant value δ\delta"; the two verifications are written out here.

The three-color form

The source states χ→(λ,λ,ω)2\chi\to(\lambda,\lambda,\omega)^2 in a parenthesis without argument. It follows from the two-color form and (EDM), as follows; this derivation is supplied here. Let f:[χ]2→3f:[\chi]^2\to3. Apply (EDM) to the two-coloring of [χ]2[\chi]^2 that marks a pair when ff gives it the color 22: either there is an infinite H⊆χH\subseteq\chi all of whose pairs have color 22, which is a homogeneous set of size ω\omega in the third color, or there is X⊆χX\subseteq\chi with ∣X∣=χ|X|=\chi none of whose pairs has color 22. In the second case the restriction of ff to [X]2[X]^2 takes values in {0,1}\{0,1\}; transported to [χ]2[\chi]^2 it has, by the two-color form, a homogeneous set of size λ\lambda in color 00 or 11. Hence χ→(λ,λ,ω)2\chi\to(\lambda,\lambda,\omega)^2.

Reading notes

  • The printed hypothesis "eventually ≥κ\ge\kappa" is read as "eventually ≥λ\ge\lambda", as recorded on the result page; the proof uses 2μ(i)≥λ2^{\mu(i)}\ge\lambda in Step 4, where λi>λ\lambda_i>\lambda makes the first alternative of (ER) contradict (N).
  • The printed proof writes "there are Bα⊆AB_\alpha\subseteq A, ∣Bα∣=μ(i)|B_\alpha|=\mu(i)" for ∣Bα∣=μ(α)|B_\alpha|=\mu(\alpha), and the Remark after Corollary 1.3 refers to "Theorem 2" for Theorem 1.2.
  • The printed proof places the two homogeneous sets in AiA_i (p. 1260: "there are sets Bi,0,Bi,1⊆AiB_{i,0},B_{i,1}\subseteq A_i of cardinality μ(i)\mu(i)") in the sentence that applies the two relations from [4] to every Ai′⊆AiA'_i\subseteq A_i of size λi\lambda_i; they are read as subsets of that Ai′A'_i, the form that the lemma's hypothesis (H) needs and that the Step 4 claim states and proves.
  • The preliminary remark, Step 2(c)--(d), the verification of the lemma's growth and 2χ+κ2^{\chi+\kappa} hypotheses in Step 5, the two verifications in Step 7 and the three-color derivation are additions of this reconstruction; each is labeled at its place. The remaining steps follow the printed proof.