Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Notation, standard and used by the paper without restatement for cardinals: means that every two-coloring of the pairs from a set of size has a subset of size all of whose pairs have one color, and that every three-coloring has a subset of size homogeneous in color for some .
Theorem 1.2 (printed p. 1260). Let be an infinite cardinal with , let , and suppose that the sequence is not eventually constant but is eventually . Then , and in fact .
Reading note. The printed hypothesis reads "is not eventually constant, but is eventually ". That bound is a misprint for : the proof chooses with , which needs the powers eventually at least , and as printed the theorem would apply, with and , whenever for all , asserting , which fails for every singular cardinal (color a pair by whether its two points lie in the same piece of a partition of into pieces of size below ). The statement above carries the corrected bound; Corollary 1.3 states its instance, , explicitly. The printed proof treats a two-coloring, and the three-color form in the parenthesis is stated without a separate argument.
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 proof on printed p. 1260 (PDF p. 4 of the archive's scan), the Canonization Lemma 1.1 on pp. 1258--1260 (PDF pp. 2--4), read on the page images. The artifact is identified in the source digest.
Read depth. Claims checked: the statement was read clause by clause on the page image on 2026-09-27, together with the hypothesis actually used in the proof. The proof (half a page, p. 1260) and the statement and proof of Lemma 1.1 (pp. 1258--1260) were read on the page images for structure only; no step was checked, and the cited relations from [4] were not consulted. Nothing here is independently reviewed.
Proof pointer
Page 1260, in outline. Let two-color the pairs of . Choose cardinals for with , with strictly increasing in and with ; put and split into consecutive blocks of size . If some block contains a set of size at least on which is constant, the theorem holds. Otherwise the relations and , cited from [4], give inside every subset of of full size sets and of size on which is constantly and constantly . This realizability inside every full-size subset is the property that the Canonization Lemma 1.1 requires, so the lemma yields of size such that, by its clause (1B), the value for , , , depends only on ; call it . Since , there are of size and a color with constantly on the pairs from . Then has size , and is constantly on its pairs: within one by its homogeneity, across blocks by . Not reconstructed here: the choice of the from the hypothesis, the hypotheses of Lemma 1.1 for these (the paper's growth condition and $2^{\chi+\kappa}< \lambda_0$ for its ), and the three-color form. Those steps, the proof of the Canonization Lemma 1.1, and a derivation of the three-color form from the two-color one are written out, author-recorded, in the reconstruction of Theorem 1.2 and the reconstruction of Lemma 1.1; those pages are not an independent review and change no standing here.
Dependencies
Within the paper: the Canonization Lemma 1.1 (p. 1258, proof pp. 1258--1260), whose clause (1B) supplies the reduction to a coloring of block indices. Outside it: the relations and for , cited to [4] (Erdős, Hajnal and Rado, Partition relations for cardinals, Acta Math. Acad. Sci. Hungar. 16 (1965), 93--196, not held), and the hypothesis , which for is Ramsey's theorem.
Bears on
- Problem 1219: through its case , , which is Corollary 1.3, the problem's relation; the Remark after the corollary records that, with this theorem, the question of which infinite satisfy is fully answered.