Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Conclusion 3.5 (p. 376). In ZFC:
- If for and, for every , there is such that for all , then . The paper introduces the clause as an example ("E.g.").
- .
- If is inaccessible and not Mahlo, then .
- .
Part (2) carries no printed hypothesis on ; its proof applies Theorem 3.3(1) to the set of limit ordinals between and .
The introduction's form (B) (p. 356). If for every there are with for all , which the introduction glosses as "various instances of the Chang conjecture fail", then . The introduction also records Todorcevic's when for all .
Source. Saharon Shelah, Was Sierpiński right? I, Israel J. Math. 62 (1988), no. 3, 355--380, doi:10.1007/BF02783304: Conclusion 3.5 and its proof on p. 376, Theorem 3.3 on pp. 371--372 with its proof on pp. 372--375, the introduction's (B) on p. 356. The edition is identified on the source card.
Read depth. Claims checked: the four statements and the introduction's (B) were read clause by clause on the printed page, and the one-line derivations of each part from Theorem 3.3 were read. The proof of Theorem 3.3 (pp. 372--375) was not checked.
Proof pointer
Page 376, each part from Theorem 3.3 (pp. 371--372), which colors pairs from a regular using stationary sets of points of fixed cofinality that reflect in no inaccessible, together with colorings of finite subsets of each regular . Part (1): Theorem 3.3(2) gives , with on the finite subsets of chosen from the failures of the Chang-type relations, and Theorem 3.3(3) gives the stronger version with colors. Part (2): Theorem 3.3(1) applied to . Part (3): Theorem 3.3(1) applied to a club of consisting of singular ordinals. Part (4): Theorem 3.3(4), with for regular and for a one-to-one map from onto .
Dependencies
Theorem 3.3 (pp. 371--372) and Definition 3.4 (p. 372) of the same paper; the coloring follows the proof of Theorem 3.1.
Bears on
No Erdős problem in the corpus. These are negative relations at cardinals other than ; Problem 474 concerns .