Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. E. Glazer, Erdős Problem 501 after adding random reals, draft rev10, Theorem 1.1 and Corollary 1.2 (statements, physical p. 1; proof of Theorem 1.1, p. 7; proof of Corollary 1.2 and the counterexample under CH, Section 6, p. 8), in the eight-page PDF held by its library source card, Glazer (2026). Its two inputs are Theorem 3.2 and Theorem 5.1; the counterexample under CH is reconstructed on the CH counterexample page.
Standing. This is an author-recorded reconstruction. It is not an independent review and changes no status and assigns no tier. Imported: the forcing theorem for complete Boolean algebras and the relative consistency it yields, and Gödel's theorem that the constructible universe satisfies ZFC + CH (T. Jech, Set Theory, third millennium edition, Chapters 13--14).
Definitions
is Lebesgue outer measure; and are as on the Theorem 3.2 page. is the positive assertion of the first question of Problem 501: every family of bounded subsets of with for all satisfies .
Statement
Theorem 1.1. Let , let , and let be generic over for the measure algebra adding random reals. In , every family with for all satisfies . Boundedness is not assumed.
Corollary 1.2. If ZFC is consistent, then both and are consistent.
Proof of Theorem 1.1
Theorem 5.1 is a theorem of ZFC + CH about the forcing relation, so it holds in : the top condition of forces that every family with all outer measures below one has a profile certificate. By the forcing theorem, in every such family satisfies . Theorem 3.2 is a theorem of ZFC, and , so holds in . Hence .
Proof of Corollary 1.2
Consistency of . Assume ZFC is consistent, and let be a model of ZFC. Its constructible universe satisfies ZFC + CH. Adding random reals over it, in the sense of Theorem 1.1, yields a model of ZFC in which every family with outer measures below one has an infinite independent set; in particular every family of bounded such sets does, which is . Formally, Theorems 5.1 and 3.2 give , and the forcing theorem turns this into , while by the constructible universe.
Consistency of . satisfies CH, and CH implies by the construction on the CH counterexample page: a family of countable, hence null, bounded sets with no infinite independent set. So .
Together these give the corollary: is independent of ZFC relative to .
Boundary. The paper's Section 6 separates the argument into formalization units F1--F6; only Lemmas 4.1, 4.2, 4.5, Proposition 4.4 and Theorem 5.1 mention forcing. The library card records that the author's companion Lean development formalizes the independence by a different positive model; nothing on this page bears on that development.