../
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 κ<λ under the hypotheses,
which the source does not discuss, imports Sierpiński's theorem.
Definitions
For cardinals θ and μ0,…,μk−1 with k≥2, the
relation θ→(μ0,…,μk−1)2 means: for every
f:[θ]2→k, where [θ]2 is the set of two-element subsets of
θ, there are ν<k and H⊆θ with ∣H∣=μν such
that f is constantly ν on [H]2; and θ→(μ)22 is
θ→(μ,μ)2. Only the cardinality of the underlying set matters:
a coloring of the pairs of any set of size θ is transported along a
bijection, and a homogeneous set of size at least μν contains one of
size μν.
cfλ is the cofinality of λ. The sequence
⟨2μ:μ<λ⟩, indexed by the cardinals μ<λ,
is eventually ≥λ when there is a cardinal μ0<λ with
2μ≥λ for every cardinal μ with μ0≤μ<λ, and
not eventually constant when for every cardinal ν<λ there is a
cardinal μ with ν<μ<λ and 2μ=2ν; since
μ↦2μ is nondecreasing, 2μ>2ν then.
χ=∑μ<λ2μ is the cardinal sum over all cardinals
μ<λ, the finite ones included.
Sum formula. If I is an infinite set and κi≥1 (i∈I)
are cardinals, then
i∈I∑κi=∣I∣⋅i∈Isupκi.
Each term is at most the supremum, so the sum is at most ∣I∣ times it;
each term is at least 1, so the sum is at least ∣I∣; each term is at
most the sum, so the sum is at least the supremum; and
∣I∣⋅supiκi=max(∣I∣,supiκi) because ∣I∣ is infinite.
Standard facts used without citation: successor cardinals are regular;
2∑iκi=∏i2κi; (2μ)μ=2μ for infinite
μ; a union of fewer than cfθ sets of size less
than θ has size less than θ; a subset of a cardinal θ
of cardinality θ is unbounded in θ; and fewer than
cfλ cardinals below λ have supremum below
λ.
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 μ,
(2μ)+→((2μ)+,μ+)2. The source cites from [4] the two
relations λi→(λi,μ(i))2 and
λi→(μ(i),λi)2 for λi=(2μ(i))+; both
follow from (ER) with μ=μ(i), by shrinking a homogeneous set of
size μ+ to one of size μ and by exchanging the two colors. The
stronger form (2κ)+→((2κ)+,(κ+)κ)2 for
infinite κ, with κ 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 for cardinals λ with
λκ<λκ+. That held page anchors the statement,
not its proof.
- (K) The hypothesis κ→(κ)22, used once, in Step 7.
For κ=ω 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 μ there is a two-coloring of [2μ]2 with no
homogeneous set of size μ+, that is, 2μ→(μ+)22. 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 for every infinite cardinal
θ. Used only for the three-color form.
Statement
Theorem 1.2 (printed p. 1260, with the hypothesis as corrected on the
result page). Let λ be an infinite cardinal and
κ=cfλ. Suppose κ→(κ)22 and that
⟨2μ:μ<λ⟩ is not eventually constant but eventually
≥λ. Then
χ=μ<λ∑2μ→(λ)22,
and in fact χ→(λ,λ,ω)2.
The printed hypothesis reads "eventually ≥κ"; the result page
records why this is a misprint for ≥λ, the bound the proof uses
when it chooses 2μ(i)≥λ (Step 1 below).
Proof
Preliminary: κ<λ
This paragraph is supplied here; the source does not discuss it. Suppose
κ=λ, so λ is regular and λ→(λ)22.
By the hypothesis there is a cardinal μ<λ with 2μ≥λ;
μ is infinite, because 2μ≥λ is infinite while 2μ is
finite for finite μ. By (S) there is a two-coloring of the pairs of a
set of size 2μ with no homogeneous set of size μ+. Restricting it
to a subset of size λ≤2μ gives a two-coloring of [λ]2
with no homogeneous set of size μ+, and μ+≤λ; this
contradicts λ→(λ)22. Hence κ<λ, and
λ is singular. Step 1 uses κ<λ to choose
μ(0)≥κ, which Step 5 needs.
Step 1: the cardinals μ(i)
Fix a cardinal μ0<λ with 2μ≥λ for every cardinal
μ with μ0≤μ<λ, and a sequence
⟨νi:i<κ⟩ of cardinals below λ with
supi<κνi=λ, which exists because
cfλ=κ. Define cardinals μ(i)<λ by
recursion on i<κ. Given μ(j) for j<i, put
ρi=max(μ0, κ, νi, j<isupμ(j)),
a cardinal below λ: the first three are, and supj<iμ(j) is
because i<κ=cfλ. Since the sequence of powers
is not eventually constant, there is a cardinal μ with
ρi<μ<λ and 2μ>2ρi; let μ(i) be the least
one. Then, for all j<i<κ:
- μ(j)≤ρi<μ(i), so the μ(i) are strictly increasing;
- 2μ(j)≤2ρi<2μ(i), so the 2μ(i) are strictly
increasing;
- μ(i)≥μ0, so 2μ(i)≥λ;
- μ(i)≥κ, so μ(i) is infinite and ∣i∣<κ≤μ(i);
- μ(i)≥νi, so supi<κμ(i)=λ.
Hence ∑i<κμ(i)=λ: the sum is at least the supremum,
and at most κ⋅λ=λ. The source states the choice of
μ(i) with ∑iμ(i)=λ, 2μ(i) strictly increasing and
2μ(i)≥λ; the bounds μ(i)≥κ and μ(i)≥∣i∣ are
added here for Step 5.
Step 2: the blocks and the identification of χ
Put λi=(2μ(i))+ and
Ai={ξ: j<isupλj≤ξ<λi}(i<κ),A=i<κ⋃Ai.
(a) Each λi is a successor cardinal, hence regular, and for
i<j, λi=(2μ(i))+≤2μ(j)<λj because
2μ(i)<2μ(j). So the λi are strictly increasing and
λj≤2μ(i) for j<i.
(b) For i<κ, supj<iλj≤2μ(i)<λi by (a).
So Ai is the interval of ordinals from supj<iλj to
λi; these intervals are pairwise disjoint, and
∣Ai∣=λi, because removing an initial segment of size less than
λi from the cardinal λi leaves λi elements.
(c) A is the ordinal supi<κλi: every ordinal
ξ<supiλi lies in Ai for the least i with ξ<λi.
Moreover supiλi=supi2μ(i), since
2μ(i)<λi≤2μ(i+1).
(d) χ=supi<κ2μ(i). The index set of χ, the
cardinals below λ, is infinite of cardinality at most λ,
and every term is at least 1, so by the sum formula
χ=∣{μ:μ<λ}∣⋅supμ<λ2μ, which is
supμ<λ2μ because that supremum is at least λ by the
eventual bound. Finally
supμ<λ2μ=supi<κ2μ(i): for every cardinal
μ<λ there is i with μ≤μ(i), because
supiμ(i)=λ, and 2μ≤2μ(i).
By (c) and (d), A is the ordinal χ, so a coloring of [χ]2 is a
coloring of the pairs from A, the disjoint union of the blocks Ai of
sizes λi. The source writes the blocks and χ without (c) and
(d); they are made explicit here.
Step 3: a large homogeneous set inside one block
Let f:[χ]2→2={0,1}. If for some i<κ there is
B⊆Ai with ∣B∣≥λ and f constant on [B]2, then a
subset of B of size λ is homogeneous and the theorem holds.
Assume from now on:
(N) for every i<κ and every B⊆Ai with ∣B∣≥λ,
f is not constant on [B]2.
Step 4: both colors inside every large subset of a block
Claim. For every i<κ and every A′⊆Ai with
∣A′∣=λi there are B0,B1⊆A′ with
∣B0∣=∣B1∣=μ(i) such that f is constantly 0 on [B0]2 and
constantly 1 on [B1]2.
Apply (ER) with μ=μ(i), infinite by Step 1, to the restriction of f
to [A′]2, transported to (2μ(i))+=λi: there is
H⊆A′ with either ∣H∣=λi and f constantly 0 on
[H]2, or ∣H∣=μ(i)+ and f constantly 1 on [H]2. The first
alternative contradicts (N), because H⊆Ai and
∣H∣=λi>2μ(i)≥λ. So the second holds, and any
B1⊆H with ∣B1∣=μ(i) serves. Applying (ER) to the coloring
1−f in the same way gives B0.
Step 5: the properties Pα and the hypotheses of Lemma 1.1
For α<κ let
Pα(⟨Bi:i≤α⟩,⟨ai:α<i<κ⟩)
hold exactly when there are Bα,0,Bα,1⊆Bα
with
Bα=Bα,0∪Bα,1,∣Bα,0∣=∣Bα,1∣=μ(α),
f constantly 0 on [Bα,0]2 and constantly 1 on
[Bα,1]2. The property depends on Bα alone.
Lemma 1.1 is applied with this κ, these λi, μ(i) and
Ai, with the lemma's χ equal to 2, and with two two-place
functions F0=F1=f~, where f~:A2→2 is
f~(ξ,η)=f({ξ,η}) for ξ=η and
f~(ξ,ξ)=0. Its hypotheses hold:
- κ=cfλ is an infinite regular cardinal; the
λi are regular and strictly increasing by Step 2(a); and
∣Ai∣=λi by Step 2(b).
- 22+κ=2κ≤2μ(0)<λ0, because
μ(0)≥κ.
- Growth: λiμ(i)=λi for every i. Indeed
μ(i)<2μ(i)<λi=cfλi, so every function
from μ(i) into λi has bounded range, and
λiμ(i)≤∑θ<λi∣θ∣μ(i)≤λi⋅(2μ(i))μ(i)=λi⋅2μ(i)=λi,
using ∣θ∣≤2μ(i) for θ<λi. Hence for
1≤j<κ, by Step 2(a) and ∣j∣≤μ(j),
λj=∏i<jλi≤(2μ(j))∣j∣≤(2μ(j))μ(j)=2μ(j)<λj,
and λ0=1<λ0.
- (H): given α<κ, any admissible ⟨Bi:i<α⟩,
any points ai and any C⊆Aα with ∣C∣=λα,
Step 4 gives B0,B1⊆C of size μ(α) homogeneous in
the colors 0 and 1; then Bα=B0∪B1 has
∣Bα∣=μ(α) and satisfies Pα.
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)≥κ, hence the preliminary κ<λ, enters.
Step 6: canonization to a coloring of pairs of indices
Lemma 1.1 yields ai∗∈Ai and Bi⊆Ai with
∣Bi∣≤μ(i) satisfying its (1A), (1B) and (2). By (2) and the
definition of Pα, fix for every α<κ sets
Bα,0,Bα,1⊆Bα as in Pα; in
particular ∣Bα∣=μ(α). By (1B) for F0=f~ with no
further arguments, for all α<β<κ, b,b′∈Bα and
c,c′∈Bβ,
f({b,c})=f~(b,c)=f~(b′,c′)=f({b′,c′}),
where b=c and b′=c′ because Aα∩Aβ=∅. So
g({α,β})=f({b,c})(b∈Bα, c∈Bβ, α<β<κ)
is a well-defined coloring g:[κ]2→2.
Step 7: the Ramsey step
By (K) there are I⊆κ with ∣I∣=κ and δ∈{0,1}
such that g is constantly δ on [I]2. Put
B=α∈I⋃Bα,δ.
f is constantly δ on [B]2. Let ξ=η be in B. If
both lie in one Bα,δ, then f({ξ,η})=δ by the
homogeneity of Bα,δ. Otherwise ξ∈Bα,δ
and η∈Bβ,δ with α=β in I, say
α<β, and f({ξ,η})=g({α,β})=δ by Step 6.
∣B∣=λ. The sets Bα,δ⊆Aα are pairwise
disjoint, so ∣B∣=∑α∈Iμ(α). This is at most
∑α<κμ(α)=λ. Conversely I, a subset of κ
of cardinality κ, is unbounded in κ; the μ(α) increase;
so supα∈Iμ(α)=supα<κμ(α)=λ, and
the sum is at least its supremum.
Thus B is a homogeneous set of size λ for f, and
χ→(λ)22 is proved. The source's proof ends with
"∣B∣=∑i∈Iμ(i)=λ" and "f has on [B]2 the constant
value δ"; the two verifications are written out here.
The source states χ→(λ,λ,ω)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→3. Apply
(EDM) to the two-coloring of [χ]2 that marks a pair when f gives it
the color 2: either there is an infinite H⊆χ all of whose
pairs have color 2, which is a homogeneous set of size ω in the
third color, or there is X⊆χ with ∣X∣=χ none of whose
pairs has color 2. In the second case the restriction of f to [X]2
takes values in {0,1}; transported to [χ]2 it has, by the
two-color form, a homogeneous set of size λ in color 0 or 1.
Hence χ→(λ,λ,ω)2.
Reading notes
- The printed hypothesis "eventually ≥κ" is read as "eventually
≥λ", as recorded on the result page; the proof uses
2μ(i)≥λ in Step 4, where λi>λ makes the
first alternative of (ER) contradict (N).
- The printed proof writes "there are Bα⊆A,
∣Bα∣=μ(i)" for ∣Bα∣=μ(α), and the Remark after
Corollary 1.3 refers to "Theorem 2" for Theorem 1.2.
- The printed proof places the two homogeneous sets in Ai (p. 1260:
"there are sets Bi,0,Bi,1⊆Ai of cardinality μ(i)")
in the sentence that applies the two relations from [4] to every
Ai′⊆Ai of size λi; they are read as subsets of that
Ai′, 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χ+κ 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.