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; Corollary 1.3 and the Remark after it, printed p. 1260, PDF p. 4, and the restatement in § 0, printed p. 1257, PDF p. 1, 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 corollary_1_3. The corollary prints no proof; it specializes Theorem 1.2. The catalog question is Problem 1219, and Komjáth's survey records the acceptance of the proof as Problem 3 of the Erdős--Hajnal list, printed p. 419, PDF p. 2, komjath_2025_erdos_hajnal_problem_list.

Standing. This is an author-recorded reconstruction of the specialization and of the identification of the two sums. It is not an independent review, changes no status and assigns no tier. Ramsey's theorem is imported.

Definitions

ℵn\aleph_n (n<ωn<\omega) are the first infinite cardinals and ℵω=sup⁡n<ωℵn\aleph_\omega=\sup_{n<\omega}\aleph_n; the cardinals below ℵω\aleph_\omega are the finite ones and the ℵn\aleph_n. Since the ℵn\aleph_n form a countable cofinal subset and no finite set of cardinals below ℵω\aleph_\omega is cofinal, cf⁡ℵω=ω\operatorname{cf}\aleph_\omega=\omega. The partition notation and the sum formula are those of the Theorem 1.2 page: θ→(μ0,μ1)2\theta\to(\mu_0,\mu_1)^2 means that every two-coloring of the pairs from a set of size θ\theta has a homogeneous set of size μ0\mu_0 in the first color or of size μ1\mu_1 in the second, θ→(μ)22\theta\to(\mu)^2_2 is θ→(μ,μ)2\theta\to(\mu,\mu)^2, and for an infinite index set and terms at least 11 a cardinal sum equals the number of terms times their supremum.

Imported result (R). Ramsey, On a problem of formal logic, Proc. London Math. Soc. (2) 30 (1930), 264--286, not held; the infinite form for pairs and two colors: ω→(ω)22\omega\to(\omega)^2_2, that is, every two-coloring of the pairs of an infinite set has an infinite homogeneous set.

Statement

Corollary 1.3 (printed p. 1260). Let (n(k))k<ω(n(k))_{k<\omega} be a sequence of natural numbers with

ℵω<2ℵn(0)<2ℵn(1)<⋯ .\aleph_\omega<2^{\aleph_{n(0)}}<2^{\aleph_{n(1)}}<\cdots .

Then ∑n<ω2ℵn→(ℵω,ℵω)2\sum_{n<\omega}2^{\aleph_n}\to(\aleph_\omega,\aleph_\omega)^2; in the other notation, ∑n<ω2ℵn→(ℵω)22\sum_{n<\omega}2^{\aleph_n}\to(\aleph_\omega)^2_2. The three-color form of Theorem 1.2 gives ∑n<ω2ℵn→(ℵω,ℵω,ω)2\sum_{n<\omega}2^{\aleph_n}\to(\aleph_\omega,\aleph_\omega,\omega)^2 as well, which the source does not state separately.

The Remark after the corollary records that it answers Problem 3 of the paper's [1], the Erdős--Hajnal list, and that Theorem 1.2 completes the answer to the question when λ→(μ)22\lambda\to(\mu)^2_2 holds for infinite λ\lambda, μ\mu; § 0 states the same relation with the chain written out to 2ℵn(k)2^{\aleph_{n(k)}}.

Proof

The sequence n(k)n(k) is strictly increasing

If n(k+1)≤n(k)n(k+1)\le n(k) for some kk, then ℵn(k+1)≤ℵn(k)\aleph_{n(k+1)}\le\aleph_{n(k)} and so 2ℵn(k+1)≤2ℵn(k)2^{\aleph_{n(k+1)}}\le2^{\aleph_{n(k)}}, against the hypothesis. Hence n(0)<n(1)<⋯n(0)<n(1)<\cdots, so n(k)≥kn(k)\ge k and the set {n(k):k<ω}\{n(k):k<\omega\} is unbounded in ω\omega. The corollary states no monotonicity of n(k)n(k); it is forced.

The hypotheses of Theorem 1.2 at λ=ℵω\lambda=\aleph_\omega

Take λ=ℵω\lambda=\aleph_\omega, so κ=cf⁡λ=ω\kappa=\operatorname{cf}\lambda=\omega.

  • κ→(κ)22\kappa\to(\kappa)^2_2 is ω→(ω)22\omega\to(\omega)^2_2, which is (R).
  • Eventually ≥λ\ge\lambda. Take μ0=ℵn(0)\mu_0=\aleph_{n(0)}. For every cardinal μ\mu with ℵn(0)≤μ<ℵω\aleph_{n(0)}\le\mu<\aleph_\omega, 2μ≥2ℵn(0)>ℵω2^\mu\ge2^{\aleph_{n(0)}}>\aleph_\omega.
  • Not eventually constant. Let ν<ℵω\nu<\aleph_\omega be a cardinal. Choose mm with ν≤ℵm\nu\le\aleph_m and then kk with n(k)≥mn(k)\ge m, which exists by the previous paragraph. Then ν≤ℵn(k)<ℵn(k+1)<ℵω\nu\le\aleph_{n(k)}<\aleph_{n(k+1)}<\aleph_\omega and 2ℵn(k)<2ℵn(k+1)2^{\aleph_{n(k)}}<2^{\aleph_{n(k+1)}}, so the powers are not constant from ν\nu on: the cardinal μ=ℵn(k+1)\mu=\aleph_{n(k+1)} satisfies ν<μ<λ\nu<\mu<\lambda and 2μ>2ℵn(k)≥2ν2^\mu>2^{\aleph_{n(k)}}\ge2^\nu.

The cardinal χ\chi of Theorem 1.2

χ=∑μ<ℵω2μ=∑m<ω2m+∑n<ω2ℵn=ℵ0+∑n<ω2ℵn=∑n<ω2ℵn,\chi=\sum_{\mu<\aleph_\omega}2^\mu =\sum_{m<\omega}2^m+\sum_{n<\omega}2^{\aleph_n} =\aleph_0+\sum_{n<\omega}2^{\aleph_n} =\sum_{n<\omega}2^{\aleph_n},

the finite cardinals contributing a countable sum of finite terms, which is ℵ0\aleph_0, and ∑n<ω2ℵn≥2ℵ0>ℵ0\sum_{n<\omega}2^{\aleph_n}\ge2^{\aleph_0}>\aleph_0.

Conclusion

Theorem 1.2 gives χ→(ℵω)22\chi\to(\aleph_\omega)^2_2, that is, ∑n<ω2ℵn→(ℵω,ℵω)2\sum_{n<\omega}2^{\aleph_n}\to(\aleph_\omega,\aleph_\omega)^2, and its three-color form gives ∑n<ω2ℵn→(ℵω,ℵω,ω)2\sum_{n<\omega}2^{\aleph_n}\to(\aleph_\omega,\aleph_\omega,\omega)^2.

Fidelity to Problem 1219

The catalog asks, for an increasing sequence (nk)(n_k) of integers with 2ℵnk2^{\aleph_{n_k}} strictly increasing and 2ℵn0>ℵω2^{\aleph_{n_0}}>\aleph_\omega, whether

∑k2ℵnk→(ℵω)2,\sum_{k}2^{\aleph_{n_k}}\to(\aleph_\omega)^2 ,

with the omitted subscript meaning two colors and the sequence infinite, as the problem page records with Komjáth's form λ=2ℵn0+2ℵn1+⋯\lambda=2^{\aleph_{n_0}}+2^{\aleph_{n_1}}+\cdots. The hypotheses are those of the corollary with n(k)=nkn(k)=n_k: the chain ℵω<2ℵn0<2ℵn1<⋯\aleph_\omega<2^{\aleph_{n_0}}<2^{\aleph_{n_1}}<\cdots is exactly "2ℵn0>ℵω2^{\aleph_{n_0}}>\aleph_\omega and 2ℵnk2^{\aleph_{n_k}} strictly increasing", and the catalog's "increasing" is the monotonicity forced above. The conclusions agree once the two sums are the same cardinal, because a partition relation depends only on the cardinal on its left.

Claim. ∑k<ω2ℵnk=∑n<ω2ℵn=sup⁡n<ω2ℵn\sum_{k<\omega}2^{\aleph_{n_k}}=\sum_{n<\omega}2^{\aleph_n}=\sup_{n<\omega}2^{\aleph_n}.

Both sums have the infinite index set ω\omega and terms at least 2ℵ0>ℵ02^{\aleph_0}>\aleph_0, so by the sum formula

∑n<ω2ℵn=ℵ0⋅sup⁡n<ω2ℵn=sup⁡n<ω2ℵn,∑k<ω2ℵnk=sup⁡k<ω2ℵnk.\sum_{n<\omega}2^{\aleph_n}=\aleph_0\cdot\sup_{n<\omega}2^{\aleph_n} =\sup_{n<\omega}2^{\aleph_n}, \qquad \sum_{k<\omega}2^{\aleph_{n_k}}=\sup_{k<\omega}2^{\aleph_{n_k}} .

The two suprema agree. Every 2ℵnk2^{\aleph_{n_k}} is one of the 2ℵn2^{\aleph_n}, so sup⁡k2ℵnk≤sup⁡n2ℵn\sup_k2^{\aleph_{n_k}}\le\sup_n2^{\aleph_n}. For the other inequality let n<ωn<\omega; since nk≥kn_k\ge k there is kk with nk≥nn_k\ge n, and then 2ℵn≤2ℵnk2^{\aleph_n}\le2^{\aleph_{n_k}} because μ↦2μ\mu\mapsto2^\mu is nondecreasing. This proves the claim.

Hence Corollary 1.3 states the relation the catalog asks, in the catalog's hypotheses and with two colors. The identification is made here and on the result page; the paper writes the sum over all nn in § 0 and in the corollary and does not comment on the subsequence. If the sequence were finite the sum would be a single power 2ℵm2^{\aleph_m}, for which the relation fails by Sierpiński's 2μ↛(μ+)222^\mu\not\to(\mu^+)^2_2, as the problem page records; the corollary and the catalog both take an infinite sequence.

Reading notes

  • The corollary carries the hypothesis 2ℵn(0)>ℵω2^{\aleph_{n(0)}}>\aleph_\omega explicitly, so the reading of Theorem 1.2's printed "eventually ≥κ\ge\kappa" does not affect it: the bound used is eventually ≥ℵω\ge\aleph_\omega, verified above.
  • Hajnal's Conjecture 1A on p. 1261, the three-dimensional strengthening ∑n<ω2ℵn→(ℵω,4)3\sum_{n<\omega}2^{\aleph_n}\to(\aleph_\omega,4)^3, is not touched by this reconstruction; its result page is conjecture_1a.