Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

../


Source. Two write-ups of the same construction: E. Glazer, Erdős Problem 501 after adding ω2\omega_2 random reals, draft rev10, Section 6, physical p. 8, held by Glazer (2026); and S. Lee, Relative independence of Erdős problem #501, second version dated 2026-06-01, Appendix A, physical pp. 5--6, held by Lee (2026). Both attribute the result to S. H. Hechler, On two problems in combinatorial set theory, Bull. Acad. Polon. Sci. 20 (1972), 429--431, which is not held; the problem page records the open attribution question.

Standing. This is an author-recorded reconstruction. It is not an independent review and changes no status and assigns no tier.

Statement

Assume CH. There is a family (Ay)y∈R(A_y)_{y\in\mathbb R} such that every AyA_y is countable (so λ∗(Ay)=0<1\lambda^*(A_y)=0<1) and bounded, and no infinite X⊆RX\subseteq\mathbb R satisfies x∉Ayx\notin A_y for all distinct x,y∈Xx,y\in X. Hence CH implies ¬P\neg P, where PP is the positive assertion of the first question of Problem 501.

Proof

By CH, ∣R∣=ℵ1|\mathbb R|=\aleph_1; fix an enumeration R={rα:α<ω1}\mathbb R=\{r_\alpha:\alpha<\omega_1\} without repetition, and let ≺\prec be the induced well-ordering: rα≺rβr_\alpha\prec r_\beta if and only if α<β\alpha<\beta. For y=rβy=r_\beta define

Ay={rα:α<β, ∣rα∣≤∣y∣+1}.A_y=\{r_\alpha:\alpha<\beta,\ |r_\alpha|\le|y|+1\}.

Each AyA_y is a subset of the countable set {rα:α<β}\{r_\alpha:\alpha<\beta\}, so it is countable and therefore Lebesgue null: λ∗(Ay)=0\lambda^*(A_y)=0. Each AyA_y is contained in [−(∣y∣+1),∣y∣+1][-(|y|+1),|y|+1], so it is bounded.

Suppose X⊆RX\subseteq\mathbb R is infinite and independent. Since ≺\prec well-orders R\mathbb R and XX is infinite, XX contains a strictly increasing sequence x0≺x1≺x2≺⋯x_0\prec x_1\prec x_2\prec\cdots (its first ω\omega elements in the order ≺\prec). Let i<ji<j and write xi=rαx_i=r_\alpha, xj=rβx_j=r_\beta, so α<β\alpha<\beta. Independence gives xi∉Axjx_i\notin A_{x_j}. By the definition of AxjA_{x_j}, a point rαr_\alpha with α<β\alpha<\beta lies outside AxjA_{x_j} only when ∣rα∣>∣xj∣+1|r_\alpha|>|x_j|+1. Hence

∣xi∣>∣xj∣+1(i<j).|x_i|>|x_j|+1\qquad(i<j).

Applying this to consecutive indices, ∣x0∣>∣x1∣+1>∣x2∣+2>⋯|x_0|>|x_1|+1>|x_2|+2>\cdots, so ∣xn∣<∣x0∣−n|x_n|<|x_0|-n for every n≥1n\ge1. For an integer n>∣x0∣n>|x_0| this gives ∣xn∣<0|x_n|<0, which is impossible. So no infinite independent set exists.

Boundary. The sets are null, so the construction refutes even the variant of the first question with "outer measure below one" replaced by "null"; the problem page records the same construction along a well-ordering of order type c\mathfrak c under Martin's axiom. Both theorem pages, Glazer Theorem 1.1 and Lee Theorem 1.1, use this page for the negative half of their corollaries.