Wiki
Wiki

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 ω2\omega_2 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

λ∗\lambda^* is Lebesgue outer measure; Freeω(A)\mathrm{Free}_\omega(\mathcal A) and Prof(A)\mathrm{Prof}(\mathcal A) are as on the Theorem 3.2 page. PP is the positive assertion of the first question of Problem 501: every family (Ay)y∈R(A_y)_{y\in\mathbb R} of bounded subsets of R\mathbb R with λ∗(Ay)<1\lambda^*(A_y)<1 for all yy satisfies Freeω(A)\mathrm{Free}_\omega(\mathcal A).

Statement

Theorem 1.1. Let M⊨ZFC+CHM\models\mathrm{ZFC}+\mathrm{CH}, let κ=(ω2)M\kappa=(\omega_2)^M, and let GG be generic over MM for the measure algebra B(κ×ω)\mathbb B(\kappa\times\omega) adding κ\kappa random reals. In M[G]M[G], every family A=(Ay)y∈R\mathcal A=(A_y)_{y\in\mathbb R} with λ∗(Ay)<1\lambda^*(A_y)<1 for all y∈Ry\in\mathbb R satisfies Freeω(A)\mathrm{Free}_\omega(\mathcal A). Boundedness is not assumed.

Corollary 1.2. If ZFC is consistent, then both ZFC+P\mathrm{ZFC}+P and ZFC+¬P\mathrm{ZFC}+\neg P are consistent.

Proof of Theorem 1.1

Theorem 5.1 is a theorem of ZFC + CH about the forcing relation, so it holds in MM: the top condition of B(κ×ω)\mathbb B(\kappa\times\omega) forces that every family with all outer measures below one has a profile certificate. By the forcing theorem, in M[G]M[G] every such family A\mathcal A satisfies Prof(A)\mathrm{Prof}(\mathcal A). Theorem 3.2 is a theorem of ZFC, and M[G]⊨ZFCM[G]\models\mathrm{ZFC}, so Prof(A)→Freeω(A)\mathrm{Prof}(\mathcal A)\to\mathrm{Free}_\omega(\mathcal A) holds in M[G]M[G]. Hence M[G]⊨Freeω(A)M[G]\models\mathrm{Free}_\omega(\mathcal A).

Proof of Corollary 1.2

Consistency of PP. Assume ZFC is consistent, and let NN be a model of ZFC. Its constructible universe LNL^N satisfies ZFC + CH. Adding ω2\omega_2 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 PP. Formally, Theorems 5.1 and 3.2 give ZFC+CH⊢Bω2⊩P\mathrm{ZFC}+\mathrm{CH}\vdash\mathbb B_{\omega_2}\Vdash P, and the forcing theorem turns this into Con(ZFC+CH)→Con(ZFC+P)\mathrm{Con}(\mathrm{ZFC}+\mathrm{CH})\to\mathrm{Con}(\mathrm{ZFC}+P), while Con(ZFC)→Con(ZFC+CH)\mathrm{Con}(\mathrm{ZFC})\to\mathrm{Con}(\mathrm{ZFC}+\mathrm{CH}) by the constructible universe.

Consistency of ¬P\neg P. LNL^N satisfies CH, and CH implies ¬P\neg P by the construction on the CH counterexample page: a family of countable, hence null, bounded sets with no infinite independent set. So LN⊨ZFC+¬PL^N\models\mathrm{ZFC}+\neg P.

Together these give the corollary: PP is independent of ZFC relative to Con(ZFC)\mathrm{Con}(\mathrm{ZFC}).

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.