Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Shelah 1988 was sierpinski right i
conclusion_3_5: Shelah's ZFC consequences of Theorem 3.3: aleph_{omega+1} does not arrow [aleph_{omega+1}]^2_{aleph_{omega+1}} when instances of Chang's conjecture fail, lambda^+ does not arrow [lambda^+]^2_{aleph_0}, and the like for inaccessible non-Mahlo cardinals and for the successor of aleph_{omega_1}.
theorem_1_1: Shelah's forcing theorem that, for regular mu < kappa < lambda with the printed cardinal arithmetic, a mu-complete forcing of size lambda that collapses no cardinal forces 2^mu = lambda and lambda -> (lambda, [kappa; kappa]).
theorem_2_1: Shelah's main theorem: from a strongly inaccessible measurable cardinal lambda above mu = mu^{<mu}, a mu-complete forcing that collapses no cardinal up to lambda forces 2^mu = lambda and lambda -> [mu^+]^2_3, giving the consistency of 2^{aleph_0} -> [aleph_1]^2_3.
theorem_2_8: Shelah's announced strengthening of Theorem 2.1, with lambda the first strongly inaccessible Erdos cardinal when mu = aleph_0 (measurable otherwise) and 2^mu forced equal to any chi = chi^mu > lambda, its proof deferred to Part II.
theorem_3_1: Shelah's ZFC generalization of Todorcevic's theorem: if lambda is regular and uncountable and some stationary subset of lambda does not reflect, then lambda does not arrow [lambda]^2_lambda.
Shelah, Saharon, Was Sierpiński right? I. Israel J. Math. 62 (1988), 355--380, DOI 10.1007/BF02783304. The copy read for this card is the Shelah archive's file (https://shelah.logic.at/files/276.pdf), whose page 355 prints the journal header "ISRAEL JOURNAL OF MATHEMATICS, Vol. 62, No. 3, 1988", whose pages carry the stamp "Sh:276", and whose pages 355 and 380 print no copyright line; the archive's legal notice (https://shelah.logic.at/impressum/, read 2026-10-02) states "Some documents on the site are copyrighted, and provided for 'fair use' in research. We do not own (and thus do not and cannot transfer or grant) any copyright to these documents.", and the publisher's journal page was not consulted, every other right reserved.
Prompted by Todorcevic's ZFC theorem that aleph_1 does not arrow [aleph_1]^2_{aleph_1}, Shelah proves complementary consistency and outright theorems for square-bracket partition relations. In 1.1 he forces, under the printed cardinal arithmetic, 2^mu = lambda while making lambda arrow (lambda, [kappa; kappa]) and collapsing no cardinals (the introduction's GCH form raises 2^{aleph_0} to any chi >= lambda = kappa^{+3}), so Todorcevic's restriction to aleph_1 is removed and aleph_0 can be replaced by any regular mu using mu-complete forcing. The main result, in 2.1, is the consistency with ZFC of the positive relation 2^{aleph_0} arrow [aleph_1]^2_3 on the continuum - in the introduction's words, from a strongly inaccessible Erdos (mu = aleph_0) or measurable cardinal lambda with lambda > mu = mu^{<mu}, a mu-complete cardinal-preserving forcing makes 2^mu = lambda and forces lambda arrow [mu^+]^2_3 (the introduction prints [mu]^2_3) - which the introduction says settles the old Erdos-Hajnal problem of whether the negative results of Sierpinski, Galvin-Shelah and Todorcevic can be strengthened to 2^{aleph_0} not arrow [aleph_1]^2_3. Section 3 continues Todorcevic's method with a simpler coloring and yields, among others, 3.1: if lambda is regular above aleph_0 and some stationary subset of lambda is not reflected then lambda does not arrow [lambda]^2_lambda (covering Mahlo but not 2-Mahlo lambda and successors of regulars), plus result (B), on aleph_{omega+1} when instances of Chang's conjecture fail, and result (C), a club-guessing consequence of lambda arrow [lambda]^2_{aleph_0}. He lists the minimal remaining cases, such as aleph_2 arrow [aleph_1]^2_3 and 2^{aleph_0} arrow [aleph_1]^3_{aleph_0} (triples with aleph_0 colors). The paper is the source for problem 474 on these Erdos-Hajnal partition relations for the continuum.
Source: https://shelah.logic.at/files/276.pdf.
Read status. Claims checked: Theorem 1.1 with Definition 1.2 (pp. 357--358), Theorem 2.1 with Remarks 2.1A--B, Claims 2.6--2.7 and Theorem 2.8 (pp. 362, 367--368), Theorem 3.1 (p. 369), Conclusion 3.5 (p. 376) and the introduction's statements (pp. 355--357) were read clause by clause on the printed pages. No proof was checked. Per Remark 2.1A the printed proof of Theorem 2.1 treats only mu = aleph_0 with lambda the first measurable, and Theorem 2.8 is stated with its proof deferred to Part II.
Bears on. #474: the problem asks for a 3-coloring of the pairs of reals in which every uncountable set has a pair of each color, the relation . Theorem 2.1 with Claim 2.6 gives, relative to a strongly inaccessible measurable cardinal (or the least with ), a forcing extension with and , in which no such coloring exists; the introduction (p. 356) says this settles the original problem of Erdős and Hajnal. Theorem 2.8, stated without proof (deferred to Part II), announces the conclusion of 2.1 with the first strongly inaccessible Erdős cardinal when and for any . Theorem 3.1 at is Todorcevic's , which under CH gives the coloring the problem asks for (an observation of the Theorem 3.1 page, not drawn in the paper). The claim page Shelah 1988 records the consistency result as a claim on the problem.
Results.
- Theorem 1.1 (p. 357): for regular with , , , and for all , a -complete forcing of size that collapses no cardinal and changes no cofinality forces and (Definition 1.2, pp. 357--358).
- Theorem 2.1 (p. 362), with Remarks 2.1A--B (p. 362) and Claims 2.6 (p. 367) and 2.7 (p. 368): from with a strongly inaccessible measurable cardinal (or , minimal), a -complete forcing of size that collapses no cardinal , changes no cofinality and adds no sequence of ordinals of length forces and . Remark 2.1B(1) points to 2.7 for the improvement in the hypothesis on ; Claim 2.7 is stated for measurable above or, for , the first with .
- Theorem 2.8 (p. 368): the conclusion of 2.1 for , the first strongly inaccessible Erdős cardinal when and measurable otherwise, and ; the proof is deferred to Part II.
- Theorem 3.1 (p. 369; (A) of the introduction, p. 356): if is regular and some stationary is not reflected, then ; the examples include , successors of regulars and -Mahlo cardinals that are not -Mahlo.
- Conclusion 3.5 (p. 376; (B) of the introduction, p. 356): from Theorem 3.3, when instances of Chang's conjecture fail as printed, , for inaccessible and not Mahlo, and .
- Result (C) (pp. 356--357; on its hypothesis see 3.7 and 3.11), not given a page: for regular above with (so is -Mahlo), a club-guessing statement holds for sequences of clubs on inaccessible ordinals below . The introduction prints this hypothesis with a negated arrow, but its own inference that is -Mahlo, its proposed weakening to , its consequence (D)(3) and the abstract's for regular not -Mahlo all read it as the positive relation.
No file of this source is held: no license on record permits its redistribution, and the card cites the edition it names above.