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, given only the commissioning assignment, with the charge of refutation. The reviewer took no part in writing the page under review or any page in its folder, and had not read the source before this review.
Subject: path wiki/research/erdos_501/glazer_lemma_4_5_reconstruction.md as
it stood at 2026-09-28T05:03:27Z, read whole, clause by clause.
Artifact: the eight-page PDF held under the library card (no canonical conversion sits beside it; the folder holds the card and the PDF only). Physical pages read: pp. 5--6 (Lemma 4.2 with its citation line; Section 4.3, Lemma 4.5 with its proof and the displays (4.3)--(4.5)) clause by clause in the text layer and on page images rendered at 110 dpi, with p. 6 rendered again at 160 dpi for the displays; p. 4 (the Section 4 preamble defining and supports, and the statement of Lemma 4.1) in the text layer and on a 110 dpi image; p. 7 (the proof of Theorem 5.1, the displays (5.5)--(5.7), the application of Lemma 4.5) in the text layer and on a 110 dpi image; pp. 1--3 in the text layer, skimmed for the definitions of , and profile certificates; p. 8 in the text layer for reference [5]. Physical and printed page numbers coincide.
Allowed material read: the Lemma 4.1 reconstruction page as of the same time
(whole page, for the conventions (R1)--(R5) and the statement; its proof
skimmed); the Statement sections of the Theorem 5.1 and Proposition 4.4
reconstructions, plus the three lines of the Theorem 5.1 proof that apply
Lemma 4.5, located by a text search, because the page's Boundary paragraph
makes a claim about that application; the Statement paragraph of the
problem page E0501; the canonical audit checklist and the Erdos-specific
"Whole-claim report" and "Audit checklist" sections of
docs/verification.md; the "Source fidelity" section of
docs/evidence.md; docs/math_authoring.md whole.
Exposures, disclosed: (1) the library card _index.md was read whole, not
only its provenance paragraph, so its read-status paragraph, its overview
(which summarizes Lemma 4.5 in one sentence), its companion-formalization
section and its acceptance text reached the reviewer; (2) the extraction
of the E0501 Statement also printed that page's Status paragraph; (3) the
Standing paragraph of the Lemma 4.1 reconstruction (two sentences) was
read with that page; (4) a directory listing of the library, without
opening any page, was taken to check the page's claim that reference [5]
is not held. None of this was used in any judgment below; every
mathematical check was made against the PDF and the page. No other
review, nothing under any evidence/ folder, nothing among the private working
files
or outside the repository, and no web search was consulted.
Restatement
Theorem of ZFC. Let be the ground model. In , let be an uncountable set, let be pairwise disjoint countable sets of coordinates, let be one fixed countable set with bijections , and let be any set of coordinates disjoint from every (the empty set allowed). Put and force with the measure algebra of the completed fair-coin product measure on . For the generic point put
the pullback along , which the source writes in (4.2) and (5.6). Then in , with the fair-coin product measure on and its outer measure, ; equivalently, every Borel of with contains some . The statement is forced by the top condition, for every choice of ; the petals need not cover ; nothing beyond the uncountability of in is assumed about , and CH is not assumed.
Checklist
- Quantifiers and scope. Pass. "For every further " is carried by the Definitions; the uncountability of is used once, to find a petal missing the countable support ; the almost-everywhere statement on is used only inside an integral and to build a positive-measure condition, never upgraded to "all ".
- Circularity. Pass. The proof assumes a condition forcing the negation and derives a contradiction; no step assumes .
- Model and convention changes. Fail at one step, repairable (F1). The objects are the source's, the measure algebra of the completed product; the ground-model computation of a Boolean value is carried into the forcing relation through (R2), which is stated for Borel sets, at two places where, under the page's Borel-code reading, the sets are only coanalytic.
- Finite and statistical overreach. Inapplicable: no finite cases, samples or heuristics occur.
- Uniformity. Pass. The only constant is the rational , fixed with before the petal is chosen; the petal choice does not depend on .
- Extremal conclusions. Pass. "Outer measure one" is a supremum statement; the Reduction converts into a positive Borel set missing exactly, in both directions (rederived under W3).
- Consequences and composition. Pass with corrections. The Boundary paragraph matches p. 7: (5.6) reads from the petals of Proposition 4.4, with and , and (5.7) is (4.3). The composition consumes Lemma 4.1, (R1)--(R4), Lemma 4.2 and Tonelli at their stated strengths, except at the transfer step (F1) and at the mixing step that the hypothesis of Lemma 4.1 needs (F2).
- Computation. Inapplicable: the page carries no computation.
- Reproduction. Inapplicable: no rerun command or coverage claim.
- Source and verdict fidelity. Pass with a wording correction. The statement, the labels (4.3)--(4.5), the physical pages, the bibliographic data of reference [5] and the locator "Fact 1 in the proof of Lemma 8" match the PDF; the Standing sentence "imported below exactly as the source states it" overstates, since the Lemma 4.2 import carries a measure-level gloss (F3).
Weakest steps
W1. The almost-everywhere step and its transfer into forcing. Let be Borel with and , and put and . Under the closed-code reading, with for a fixed enumeration of the basic clopen sets, so
is a Borel function of and is Borel. If , then is a nonzero condition with ; (R2) gives , (R4) says that the reinterpreted is again with computed by the same formula from the of , and , so , against . Hence , almost everywhere on , and . Under the Borel-code reading is defined through the relation " is a Borel code and ", which is coanalytic and not Borel, so is only coanalytic; the same conclusion then needs a Borel with and the absoluteness between and of the sentence "", which (R2) and (R4) as stated do not supply (F1).
W2. The Boolean value and the Tonelli display. Put , a disjoint union since , and
so that . Since and , and since "" is the closed relation , which means the same in and in by (R4), the top condition forces
and (R2) with gives . For the display, Lemma 4.2 applied to and gives , and applied to and makes the completion of ; Tonelli for the completed product on the Borel set gives , where for and, for , has -measure , because permutes coordinates and so carries the fair-coin product on to the one on . Hence , the source's (4.5) before its inequality. Under the Borel-code reading is coanalytic; Tonelli still applies, since coanalytic sets are universally measurable, but (R2) does not (F1). Composition: W1 makes the integral positive, so is a nonzero condition below forcing , while and ; a nonzero condition cannot force a statement and its negation.
W3. The reduction and the fresh petal. In any model, , since a measurable superset is contained in a Borel superset of the same measure. If choose Borel with and put : Borel, , . Conversely such a gives the Borel superset of measure below one. Applied inside : if the top condition does not force , then is nonzero (the inequality is forced), and the maximum principle gives a name with " codes a set with and ". As
some has . (R1) gives a countable support of ; Lemma 4.1, applied to once it is a name for an element of a standard Borel space under the top condition (F2), gives a countable and a Borel with ; then is countable, supports and reads through . Each coordinate of lies in at most one petal, so at most countably many petals meet , and uncountable gives with . Every choice is made in , where is uncountable.
Strongest attack
The attack: break the transfer from a ground-model measure computation into the forcing relation by exhibiting a set to which (R2) is applied but for which (R2) is not available. It succeeds against the page's text and fails against the lemma. Under the page's main line, is given by a name for a Borel code and is "the Borel set decoded from ". The set of Borel codes is and not Borel, and the relation " is a Borel code and lies in the set it codes" is (the page itself says so in its second route), so neither nor is known to be Borel. The Lemma 4.1 page states (R2) for Borel coded in and (R4) for Borel statements about points. So the two sentences that say "by (R2)" and the closing sentence "With either reading the argument above goes through unchanged" are not supported by the listed imports. The lemma survives: with the page's first route (closed codes in , every point of a code, a closed relation) every set in W1 and W2 is Borel and the argument closes with (R1)--(R4) alone; with Borel codes it closes after one further import, the absoluteness of and sentences with parameters in between and : for a coanalytic coded in , choose in Borel sets with , transfer the inclusions to , and squeeze
to get . Since the source's proof (p. 6) is the Borel-code argument and says only "by Fubini", the gap is in the page's closure, not in the theorem; the correction is filed as F1.
Attacks that failed: (a) making small in although is uncountable in fails, because every Borel set of is read from a countable and the petal choice needs only minus a countable set to be nonempty in ; (b) making the petal depend on , or on the petal, fails because and are fixed first and depends only on ; (c) finite (all petals finite) keeps the statement and the proof intact, then being a finite uniform probability space; (d) empty changes nothing, since the proof never uses ; (e) a boundary case with and a null Borel set missing is not lost, the Reduction being an exact equivalence; (f) the identification of with is harmless, since gives .
Premises
- Lemma 4.1 (Borel reading). Interface: for a -name with , standard Borel, a countable and a Borel with ; a support may be enlarged. Source held, pp. 4--5, statement read clause by clause; the folder's reconstruction read whole. Explicit assumption: the name must be for an element of under the top condition, which the page's code name satisfies only after mixing (F2).
- (R1)--(R5). Imported standard facts stated on the Lemma 4.1 page and read there in full: countable supports (R1); Boolean values of Borel events about , for Borel sets coded in (R2); the maximum principle and mixing (R3); reinterpretation of Borel codes and absoluteness of Borel statements (R4); Borel isomorphism (R5). The external sources they cite are not held and were not checked. The page uses (R2) beyond its stated scope (F1).
- Lemma 4.2 (factorization). Interface as the page states it: for disjoint , is the completion of , with the finite-family form. Source held, p. 5, statement read clause by clause; the source's proof is the citation "[5, Fact 1 in the proof of Lemma 8]", and reference [5] (Laczkovich and Miller, Colloq. Math. 69 (1996), 299--308) is not held, which a listing of the library confirmed. Standing: imported, unproved here, as the page says. Explicit assumption added by the page: Tonelli for the completion of a product of probability measures, a standard theorem not named as an import (F3).
- Inner regularity of (closed-code route): every Borel set of a finite Borel measure on a metrizable space is approximated from inside by closed sets; standard, applied inside , not named as an import.
- Descriptive set theory (Borel-code route): the set of Borel codes and the decoding relation are , and sets are universally measurable; the page cites Kechris, Chapters 29 and 35, not held and not checked here. The absoluteness import that this route also needs is missing (F1).
- The identification of with through is a coordinate permutation and preserves the fair-coin product; elementary, verified in W2.
- Consumers, not premises. The Theorem 5.1 reconstruction (Statement, and the three proof lines applying Lemma 4.5) and the Proposition 4.4 reconstruction (Statement) were read only to check the Boundary paragraph and the pullback convention; no standing of theirs is relied on.
Findings
F1. Severity: required. Location: "it forces, by (R2), "; "By (R2), (R4) and the identity ... is the class "; and "With either reading the argument above goes through unchanged." Defect: (R2) is stated on the Lemma 4.1 page for Borel coded in . Under the page's main-line reading, is given by a Borel code, and the set of Borel codes is not Borel, so , and are only coanalytic and the two invocations of (R2) are outside its hypotheses; the closing sentence of the labeled point is therefore false for its second route. Witness: source p. 6 says only "by Fubini" and "the Borel set read from the code at the -generic point", so the transfer is the page's own supplied step, and the page's second route itself records that the decoding relation is coanalytic. Proposed replacement: take the closed-code route as the main line (in the Reduction, after fixing , apply inner regularity inside the extension to obtain a name for a closed with and , coded in by the basic clopen sets it misses, and run the proof with ), and end the labeled point with: "With the closed-code reading the argument uses only (R1)--(R4). With general Borel codes, and are only coanalytic, and (R2) must first be extended to coanalytic sets coded in : squeeze such a set between Borel with , transfer the inclusions to by Mostowski absoluteness (T. Jech, Set Theory, third millennium edition, Chapter 25), and conclude ; this import is not among (R1)--(R5)."
F2. Severity: suggested. Location: "there is a name for a Borel subset of , given by a name for a Borel code" and "reads the code of through a Borel map from into the space of codes". Defect: Lemma 4.1, as reconstructed with (R4), applies to a name with for a standard Borel ; the maximum principle yields a code name only below , and the set of Borel codes is not a standard Borel space, so "the space of codes" must be the ambient Polish space and needs a value when is not a code. Witness: source p. 7 performs exactly this mixing for the open codes, "Mix with a fixed default code off so that the top condition forces ". Proposed replacement: "by the maximum principle (R3) there is a name , mixed with a fixed default code off , for an element of the Polish space of codes ( for closed codes; for Borel codes, where forces to be a code), with ; is the set it codes, the set decoded from , and when is not a code."
F3. Severity: suggested. Location: Standing, "Lemma 4.2 is imported below exactly as the source states it", and the import's clause " is the completion of the product measure ... so Fubini and Tonelli apply to -measurable sets". Defect: the source's statement (p. 5) says only that is the completed product of and , and its proof line says "product-measure Fubini for the complete measure algebra"; the measure-level gloss and the Tonelli consequence are the page's reading, and Tonelli for the completed product is a standard theorem not named as an import. Witness: p. 5, Lemma 4.2 and its one-line proof. Proposed replacement: "Lemma 4.2 is imported below in the source's words, followed by the reading of 'completed product' that the proof uses; Tonelli's theorem for the completion of a product of probability measures is a standard import."
F4. Severity: note. Location: Definitions, "The normalized generic point on is the name ..." and "In the extension, is the fair-coin product measure on ". Defect: the source's Lemma 4.5 (p. 6) defines neither term; the page's definitions are its reading of (4.2) on p. 5, , and of (5.6)--(5.7) on p. 7, "Let be product measure on "; the reading is correct but unlabeled. Proposed replacement: append "(the source does not define the term in Lemma 4.5; this is its use in (4.2) and (5.6), where denotes the pullback along , and is as in (5.6))".
Verdict
Source fidelity: faithful with corrections. The statement, its hypotheses, quantifiers, the displays (4.3)--(4.5), the physical pages, the result labels and the bibliographic locator of reference [5] match the artifact; F3 and F4 correct the description of what is imported and what is supplied.
The argument as reconstructed: defective at the transfer step, namely the two invocations of (R2) (the identity and the almost-everywhere step) under the page's main-line Borel-code reading, where the sets are only coanalytic; sound once the closed-code route is taken as the main line, or once the absoluteness import named in F1 is added. The lemma itself is not refuted; the source's own argument is the Borel-code one and carries the same unstated transfer.
Limitations: reference [5], the Kechris and Jech chapters and the sources behind (R1)--(R5) are not held and were not checked; those facts were taken as the imports the pages declare. No computation or Lean development bears on this page. This focused review assigns no tier and changes no status.