Wiki
Wiki

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

Updated


Subject and independence

Role: independent reviewer in a fresh context, commissioned for refutation and given only the assignment. The reviewer took no part in writing the page, the sibling reconstruction pages or the library card, and opened no other review.

Subject: path wiki/research/erdos_501/lee_theorem_1_1_reconstruction.md as it stood at 2026-09-28T05:03:27Z, read whole as of that time.

Artifact: the six-page second-version PDF beside the library card Lee (2026), file lee_2026_relative_independence_erdos_problem_501.pdf, date line "June 1, 2026"; its physical page numbers coincide with the printed ones. Physical pages 1--3 were read clause by clause in the text layer and on page images rendered at 110 dpi (pages 1, 2 and 3), every displayed formula being checked on the images: the statements of Theorem 1.1 and Corollary 1.2 and the remark between them (p. 1); the comparison (1), the statement of Lemma 2.1, displays (2) and (3), the definition of GG, the recursion and the induction (p. 2); the independence argument (p. 3). Pages 4--6 were read in the text layer only, to confirm that the corollary is proved nowhere else in the note and that Appendix A (pp. 5--6) is the counterexample under CH.

Allowed material read: the Statement section of the Lemma 2.1 page and, because the page under review cites it, that page's Definitions (the comparison ν≤m∗\nu\le m^*); the Statement section of the CH counterexample page; the Statement section of the Glazer Theorem 1.1 page, for the cross-link check only; the provenance paragraph of the Lee library card; the statement of Problem 501; and the wiki sections named in the assignment (whole-claim report, audit checklist, source fidelity, page mechanics).

Exposures, none of which changed a finding: (a) the library card was displayed whole, so its Bears-on, Read-status, Overview, Lean-files and Relation sections were seen, and they carry status-adjacent sentences about supersession and site adoption; (b) the Lemma 2.1 page was displayed whole, including its Proof and Boundary; (c) the CH counterexample page and the Glazer Theorem 1.1 page were displayed with their Source and Standing paragraphs; (d) the problem page has no Statement heading, and the region before its assessment section, displayed to reach the statement, contains the page's Status paragraph, its Source paragraph, its References and its Formalization paragraph, while its frontmatter description also names the status; (e) the wider "canonical failure modes" section of the verification wiki was displayed together with the audit checklist; (f) a directory listing showed the file names of four other reviews under evidence/verify/, none of which was opened. Nothing among the private working files, no evidence program and no web search was consulted.

Restatement

Convention. The source writes ⊂\subset for inclusion allowing equality; mm and m∗m^* are Lebesgue measure and Lebesgue outer measure on R\mathbb R; a measure extending Lebesgue measure is a countably additive ν ⁣:P(R)→[0,∞]\nu\colon\mathcal P(\mathbb R)\to[0,\infty] with ν(S)=m(S)\nu(S)=m(S) for every Lebesgue measurable SS; FMEA asserts that such a ν\nu exists. A set XX is independent for a family (Ay)y∈R(A_y)_{y\in\mathbb R} when no member of XX lies in the set indexed by a different member of XX: x∉Ayx\notin A_y for all x,y∈Xx,y\in X with x≠yx\ne y, which covers both orders of every pair.

Theorem 1.1. Work in ZFC and assume FMEA. Let (Ay)y∈R(A_y)_{y\in\mathbb R} be any family of subsets of R\mathbb R indexed by all reals, with no boundedness and no measurability assumed, such that m∗(Ay)<1m^*(A_y)<1 for every y∈Ry\in\mathbb R; the bound 11 is the same for every yy and strict. Then there is an infinite X⊆RX\subseteq\mathbb R such that x∉Ayx\notin A_y whenever x,y∈Xx,y\in X and x≠yx\ne y. Consequence, stated by the source as a remark: since the bounded families form a subclass, ZFC + FMEA proves PP, the positive answer to the first question of Problem 501, which asks the same for families of bounded sets with m∗(Ay)<1m^*(A_y)<1.

Corollary 1.2. If the theory ZFC + FMEA is consistent, then PP is independent of ZFC: ZFC proves neither PP nor ¬P\neg P. In particular, if ZFC together with the existence of a measurable cardinal is consistent, then PP is independent of ZFC.

Checklist

  • Quantifiers and scope. Pass. "For every y∈Ry\in\mathbb R" is carried from the source's "with Lebesgue outer measure <1<1" into the page's hypothesis; the recursion uses it at every stage through Lemma 2.1 and at f(n)f(n) through ν(Af(n))<1\nu(A_{f(n)})<1. The conclusion is proved for all distinct pairs in both orders (f(j)∉Af(i)f(j)\notin A_{f(i)} and f(i)∉Af(j)f(i)\notin A_{f(j)} for i<ji<j). The base case n=0n=0 is stated with Cf↾0=RC_{f\restriction0}=\mathbb R. Nothing is "almost all".
  • Circularity. Pass. GG is total on R<ω\mathbb R^{<\omega} because of the default value r0r_0, so ff exists by the recursion theorem before the induction begins; the induction hypothesis ν(Cf↾n)=∞\nu(C_{f\restriction n})=\infty is not the conclusion; and Lemma 2.1 is proved on its own page from the section inequality without Theorem 1.1.
  • Model and convention changes. Pass. ⊆\subseteq renders the source's ⊂\subset; the CH page's λ∗\lambda^* and this page's m∗m^* are both Lebesgue outer measure; ν\nu has the same type and extension property as in the source; no relaxed or averaged object replaces the family.
  • Finite and statistical overreach. Inapplicable: no finite case, sample or heuristic is used anywhere.
  • Uniformity. Inapplicable: no constant, error term or exchange of limits appears. The one uniform bound, m∗(Ay)<1m^*(A_y)<1, is a hypothesis; the recursion uses it only at the strength "finite", and Lemma 2.1 uses it at the strength "<1<1".
  • Extremal conclusions. Inapplicable: the theorem asserts the existence of an infinite independent set and claims no extremum or sharpness.
  • Consequences and composition. Pass. "So the theorem implies PP under FMEA": bounded families are a subclass, checked. "So Con(ZFC+P)\mathrm{Con}(\mathrm{ZFC}+P)": from ZFC+FMEA⊢P\mathrm{ZFC}+\mathrm{FMEA}\vdash P, checked. "Hence Con(ZFC+CH)\mathrm{Con}(\mathrm{ZFC}+\mathrm{CH})": the imported Gödel step, named as imported. "So Con(ZFC+¬P)\mathrm{Con}(\mathrm{ZFC}+\neg P)": uses the CH page's Statement at exactly the strength "CH implies ¬P\neg P". Lemma 2.1 is consumed at exactly its statement with all three hypotheses present (ν\nu a total extension of mm, m∗(Ay)<1m^*(A_y)<1 for all yy, ν(C)=∞\nu(C)=\infty). The composition inherits Lemma 2.1 and the CH counterexample at author-recorded standing and the equiconsistency from a source that is not held; the page's standing sentence claims no more.
  • Computation. Inapplicable: the page contains no computation.
  • Reproduction. Inapplicable: the page states no rerun command and no coverage claim.
  • Source and verdict fidelity. Pass with one suggested correction. Both statements match the source in every hypothesis, quantifier and conclusion; every locator was checked (Theorem 1.1, Corollary 1.2 and the boundedness remark on p. 1; Section 2 on pp. 2--3; displays (1), (2) and (3) on p. 2; the reference to Fremlin's notes with "1D(e), 2E" on p. 1); the standing sentence claims author-recorded standing only. The corollary's derivation is supplied by the page and not labeled as such (F1), and the Boundary sentence about Glazer's argument reads more strongly than that page's Statement (F2).

Weakest steps

1. The measure of the next pool. Let S=Cf↾n∖Bf(n)S=C_{f\restriction n}\setminus B_{f(n)} and T=Af(n)∪{f(n)}T=A_{f(n)}\cup\{f(n)\}. Applying R∖(U∪V)=(R∖U)∖V\mathbb R\setminus(U\cup V)=(\mathbb R\setminus U)\setminus V to the union defining Cf↾(n+1)C_{f\restriction(n+1)}, with UU the union over i<ni<n and V=Af(n)∪Bf(n)∪{f(n)}V=A_{f(n)}\cup B_{f(n)}\cup\{f(n)\}, and then once more inside,

Cf↾(n+1)=Cf↾n∖(Af(n)∪Bf(n)∪{f(n)})=S∖T.C_{f\restriction(n+1)} =C_{f\restriction n}\setminus\bigl(A_{f(n)}\cup B_{f(n)}\cup\{f(n)\}\bigr) =S\setminus T.

Since S⊆(S∖T)∪TS\subseteq(S\setminus T)\cup T and ν\nu is defined on every subset of R\mathbb R and finitely subadditive, ∞=ν(S)≤ν(S∖T)+ν(T)\infty=\nu(S)\le\nu(S\setminus T)+\nu(T). Further ν(T)≤ν(Af(n))+ν({f(n)})≤m∗(Af(n))+0<1\nu(T)\le\nu(A_{f(n)})+\nu(\{f(n)\})\le m^*(A_{f(n)})+0<1, using the comparison and ν({p})=m({p})=0\nu(\{p\})=m(\{p\})=0. Hence ν(S∖T)=∞\nu(S\setminus T)=\infty. The comparison itself: if S′⊆⋃iJiS'\subseteq\bigcup_iJ_i with open intervals JiJ_i, countable subadditivity and the extension property give ν(S′)≤∑iν(Ji)=∑im(Ji)\nu(S')\le\sum_i\nu(J_i)=\sum_im(J_i), and the infimum over such covers is m∗(S′)m^*(S'). Composition: this is the induction hypothesis at n+1n+1, which is exactly what Lemma 2.1 needs at the next stage; without it the pool Qf↾(n+1)Q_{f\restriction(n+1)} could be empty and f(n+1)f(n+1) would fall to the default r0r_0, which need not lie in any pool.

2. Nonemptiness of the pool and the location of f(n)f(n). Given ν(Cf↾n)=∞\nu(C_{f\restriction n})=\infty, Lemma 2.1 with C=Cf↾nC=C_{f\restriction n} (its hypotheses: ν\nu a total extension of mm; m∗(Ay)<1m^*(A_y)<1 for all yy; ν(C)=∞\nu(C)=\infty) yields a∈Cf↾na\in C_{f\restriction n} with ν(Cf↾n∖Ba)=∞\nu(C_{f\restriction n}\setminus B_a)=\infty, that is a∈Qf↾na\in Q_{f\restriction n} by (3). A nonempty subset of R\mathbb R has a ⪯\preceq-least element, so G(f↾n)G(f\restriction n) is that element; it lies in Qf↾n⊆Cf↾nQ_{f\restriction n}\subseteq C_{f\restriction n} and satisfies ν(Cf↾n∖Bf(n))=∞\nu(C_{f\restriction n}\setminus B_{f(n)})=\infty. Composition: this supplies both inputs of step 1, and f(n)∈Cf↾nf(n)\in C_{f\restriction n} is also the fact used as f(j)∈Cf↾jf(j)\in C_{f\restriction j} when the independent set is checked. For i<ji<j, Cf↾j⊆Cf↾(i+1)C_{f\restriction j}\subseteq C_{f\restriction(i+1)} because the union removed grows with the sequence, so f(j)f(j) avoids {f(i)}\{f(i)\}, Af(i)A_{f(i)} and Bf(i)B_{f(i)}; and f(j)∉Bf(i)f(j)\notin B_{f(i)} unfolds, by Bf(i)={y:f(i)∈Ay}B_{f(i)}=\{y:f(i)\in A_y\}, to f(i)∉Af(j)f(i)\notin A_{f(j)}. Injectivity of ff makes XX infinite.

3. The corollary. Positive half: Theorem 1.1 is proved in ZFC + FMEA and its conclusion restricted to bounded families is PP, so every model of ZFC + FMEA is a model of ZFC + PP, and ZFC does not prove ¬P\neg P, since otherwise ZFC + FMEA would prove both PP and ¬P\neg P. Negative half: a model of ZFC + FMEA is a model of ZFC; its constructible universe is a model of ZFC + CH (Gödel, imported); ZFC + CH proves ¬P\neg P by the CH counterexample; so ZFC + ¬P\neg P has a model and ZFC does not prove PP. Second sentence: the imported direction, from the consistency of a measurable cardinal to the consistency of ZFC + FMEA, feeds the first sentence. Composition: the two halves are independent of each other and each consumes exactly one page-level input.

Strongest attack

The attack aimed at the corollary, where reconstructions of independence results most often slip. First, FMEA refutes CH: under CH no total extension of Lebesgue measure exists (a classical theorem), so the negative half cannot be read off inside a model of FMEA, and a reconstruction that argued "the model of FMEA also gives ¬P\neg P" would be wrong. The page does not do this: it passes from Con(ZFC+FMEA)\mathrm{Con}(\mathrm{ZFC}+\mathrm{FMEA}) to Con(ZFC)\mathrm{Con}(\mathrm{ZFC}) and only then to Con(ZFC+CH)\mathrm{Con}(\mathrm{ZFC}+\mathrm{CH}) through the constructible universe, which is the correct route, and it names the Gödel step as imported. Second, the "in particular" clause could use the wrong direction of the equiconsistency; the page uses the direction from the consistency of a measurable cardinal to Con(ZFC+FMEA)\mathrm{Con}(\mathrm{ZFC}+\mathrm{FMEA}), which is the direction the clause needs. Third, "independent of ZFC" needs both non-provabilities, and the page derives both. The attack failed; its residue is the labeling defect F1, since the source proves the corollary only by one sentence and the page's derivation is supplied.

A second attack tried to make the recursion circular or the default value r0r_0 load-bearing: the induction might presuppose that the pools stay nonempty. It failed because GG is total, ff exists by the recursion theorem before any measure is computed, and the induction proves ν(Cf↾n)=∞\nu(C_{f\restriction n})=\infty from the previous stage alone, after which Lemma 2.1, not the recursion, supplies nonemptiness. A third attack looked for a dropped order of the independence pairs; both orders are derived, as shown in weakest step 2.

Premises

  • Lemma 2.1, consumed from the Lemma 2.1 page. Interface: for ν\nu a countably additive measure on P(R)\mathcal P(\mathbb R) extending Lebesgue measure and (Ay)y∈R(A_y)_{y\in\mathbb R} with m∗(Ay)<1m^*(A_y)<1 for every yy, every C⊆RC\subseteq\mathbb R with ν(C)=∞\nu(C)=\infty contains an xx with ν(C∖Bx)=∞\nu(C\setminus B_x)=\infty. Standing: author-recorded reconstruction. Reading depth: its Statement and Definitions; the source's statement on p. 2 read on the page image; the source's proof (pp. 4--5) not verified here.
  • The comparison ν(S)≤m∗(S)\nu(S)\le m^*(S) for every S⊆RS\subseteq\mathbb R: the source's display (1), p. 2; re-derived in weakest step 1.
  • CH implies ¬P\neg P, consumed from the Statement of the CH counterexample page. Standing: author-recorded reconstruction; the source's Appendix A (pp. 5--6) read in the text layer only; not re-verified here.
  • Gödel's theorem that the constructible universe of any model of ZFC satisfies ZFC + CH, hence Con(ZFC)\mathrm{Con}(\mathrm{ZFC}) implies Con(ZFC+CH)\mathrm{Con}(\mathrm{ZFC}+\mathrm{CH}): standard, not held, named as imported by the page.
  • The equiconsistency of FMEA with a measurable cardinal, cited by the source to Fremlin's notes on real-valued-measurable cardinals, 1D(e) and 2E: not held in the library, so the cited version could not be compared; only the direction from the consistency of a measurable cardinal to Con(ZFC+FMEA)\mathrm{Con}(\mathrm{ZFC}+\mathrm{FMEA}) is used; named as imported by the page.
  • Background ZFC: a well-ordering of R\mathbb R (the axiom of choice) and the recursion theorem on ω\omega.
  • Explicit assumptions beyond these: none. No batch acceptance order.

Findings

F1. Severity: suggested. Location: "## Proof of Corollary 1.2", "Theorem 1.1 gives ZFC+FMEA⊢P\mathrm{ZFC}+\mathrm{FMEA}\vdash P, so ...". Defect: the source proves the corollary only by the sentence "Combining Theorem 1.1 with Hechler's theorem gives the following consequence" (p. 1, the paragraph before Corollary 1.2) and never mentions the constructible universe or the step from Con(ZFC)\mathrm{Con}(\mathrm{ZFC}) to Con(ZFC+CH)\mathrm{Con}(\mathrm{ZFC}+\mathrm{CH}). The page presents a full derivation under a proof heading without stating that the derivation is supplied here; the Standing paragraph lists Gödel's theorem as imported for the corollary but does not say that the source does not invoke it. Witness: p. 1, the sentence after "see [3, 1D(e), 2E]". Replacement: open the section with "The source justifies the corollary in one sentence, by combining Theorem 1.1 with Hechler's theorem (p. 1); the derivation below is supplied here."

F2. Severity: note. Location: Boundary, "The measure-extension hypothesis is what Glazer's argument ... removes by forcing." Defect: the sentence can be read as saying that Glazer's argument proves the theorem's conclusion outright. The Statement on the Glazer Theorem 1.1 page proves it inside M[G]M[G], the ω2\omega_2-random-real extension of a model of CH, so FMEA is replaced by a forcing-extension hypothesis, and what is removed is the large-cardinal assumption of Corollary 1.2. Witness: that page's Statement. Replacement: "Glazer's argument ... replaces it by working inside the ω2\omega_2-random-real extension of a model of CH, which brings the consistency assumption of Corollary 1.2 down from a measurable cardinal to Con(ZFC)\mathrm{Con}(\mathrm{ZFC})."

F3. Severity: note. Location: "By the comparison ν≤m∗\nu\le m^* recorded on the Lemma 2.1 page". Defect: at this step the source cites its display (1) on p. 2; the page's locator points only to the sibling page, where the comparison sits in the Definitions section rather than in the Statement. Witness: p. 2, "By (1), ν(Af(n))≤m∗(Af(n))<1\nu(A_{f(n)})\le m^*(A_{f(n)})<1". Replacement: "By the comparison ν≤m∗\nu\le m^* (the source's (1), p. 2, recorded in the Definitions of the Lemma 2.1 page)".

F4. Severity: note. Location: Standing, "the equiconsistency of FMEA with a measurable cardinal". Defect: the notes cited are not held in the library, and only the direction from a measurable cardinal to FMEA is used; the paragraph says neither. Witness: p. 1, "FMEA is equiconsistent with the existence of a measurable cardinal; see [3, 1D(e), 2E]"; no library folder holds the notes. Replacement: "... 1D(e) and 2E, not held; only the direction from the consistency of a measurable cardinal to Con(ZFC+FMEA)\mathrm{Con}(\mathrm{ZFC}+\mathrm{FMEA}) is used; ...".

F5. Severity: note. Location: Statement, "Boundedness is not assumed, so the theorem implies PP under FMEA." Defect: the sentence sits inside the bold Theorem 1.1 paragraph, while in the source it is the remark following the theorem, not part of it. Witness: p. 1, "Note that Theorem 1.1 does not assume boundedness. Hence Theorem 1.1 implies P under FMEA." Replacement: start a new paragraph, "Remark (source, p. 1). Boundedness is not assumed, so the theorem implies PP under FMEA."

Verdict

Source fidelity: faithful. The statements of Theorem 1.1 and Corollary 1.2, the definitions, the displays (2) and (3), the recursion and the induction match the artifact at the stated pages and labels, and no hypothesis, quantifier, constant or boundary case is changed; no correction is required.

The argument as reconstructed: sound. Every deduction was re-derived; the inputs are consumed at exactly their stated strength.

Limitations: Lemma 2.1 and the CH counterexample were consumed at their page Statements and not re-verified; the equiconsistency cited to Fremlin's notes and Gödel's theorem are imported and their sources are not held; pages 4--6 of the artifact were read in the text layer only; the Lean files accompanying the source were not read or built.

This focused review assigns no tier and changes no status.