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, any page in its folder, the library card or the imported lemma pages, and had not seen the page before this review. The review is a focused read of the frozen text; it assigns no tier.

Frozen subject: path wiki/research/erdos_501/glazer_theorem_3_2_reconstruction.md as it stood at 2026-09-28T05:03:27Z, the page Glazer Theorem 3.2, read in full as of that time.

Artifact: E. Glazer, draft rev10, the folder-name PDF held by the library card (eight pages; the printed page numbers coincide with the physical pages). Physical pp. 3–4, the whole of Section 3 (coding conventions, Definition 3.1, Theorem 3.2 and its proof, displays (3.1)–(3.10)), were read clause by clause in the text layer and on page images; p. 2 (Lemma 2.1) and the top of p. 3 (Lemma 2.2) were read the same way for the imported lemmas; pp. 1 and 5–8 were skimmed in the text layer only, for the definition of Freeω\mathrm{Free}_\omega and display (1.1) on p. 1 and to confirm that no later page restates Theorem 3.2. Page images rendered: physical pp. 2, 3 and 4. No canonical conversion sits beside the PDF.

Allowed material read: the two input pages Lemma 2.1 and Lemma 2.2 as of the same time, read in full because the whole file is what a revision read prints; their Definitions and Statement sections are what the checks use, and their proofs were not relied on; the provenance paragraph of the library card; the Statement paragraph of the problem page wiki/problems/set_theory/E0501/_index.md; docs/verification.md "Whole-claim report" and "Audit checklist" (the general list of canonical failure modes and the Erdos-specific section of the same name); docs/evidence.md "Source fidelity"; and docs/math_authoring.md in full.

Exposures: (1) the whole library card index reached the reviewer, because the revision read prints the entire file: its Overview, Read status, Companion formalization and Relation to E501 sections, including a read-status sentence that calls the folder's reconstructions author-recorded and a paragraph on the catalog's acceptance of the result; none of it was used, and every check below rests on the PDF. (2) The Status, Source, References and Formalization paragraphs of the problem page were printed with its Statement paragraph, because the page has no Statement heading to cut at; the status text was not used. (3) docs/verification.md "Durable reports and current standing" was printed with the two commissioned sections. (4) A directory listing showed the file names of two other review records in the same evidence/verify/ folder; neither was opened.

Restatement

Conventions. λ\lambda is Lebesgue measure on R\mathbb R. A family is any indexed family A=(Ay)y∈R\mathcal A=(A_y)_{y\in\mathbb R} of subsets of R\mathbb R, with no measurability, boundedness or measure hypothesis on the sets AyA_y. Freeω(A)\mathrm{Free}_\omega(\mathcal A) means: there is an infinite X⊆RX\subseteq\mathbb R such that x∉Ayx\notin A_y for all x,y∈Xx,y\in X with x≠yx\neq y, in both orders of every pair. A coding space is a standard Borel space O\mathcal O with a map c↦U(c)c\mapsto U(c) onto the open subsets of R\mathbb R such that {(x,c):x∈U(c)}\{(x,c):x\in U(c)\} is Borel in R×O\mathbb R\times\mathcal O and c↦λ(U(c))∈[0,∞]c\mapsto\lambda(U(c))\in[0,\infty] is Borel; the source fixes such a "standard coding" without exhibiting one, and the page exhibits one. Im=[m,m+1)I_m=[m,m+1) for m∈Zm\in\mathbb Z.

A profile certificate for A\mathcal A is a tuple ((Ω,ν),Z,⟨xm,cm:m∈Z⟩)((\Omega,\nu),Z,\langle x_m,c_m:m\in\mathbb Z\rangle) such that: (P1) (Ω,ν)(\Omega,\nu) is a standard Borel probability space and Z⊆ΩZ\subseteq\Omega has ν\nu-outer measure one, the outer measure being the infimum of ν(B)\nu(B) over Borel B⊇ZB\supseteq Z, while ZZ itself need not be measurable; (P2) for every mm, xm ⁣:Ω→Imx_m\colon\Omega\to I_m is Borel with ν(xm−1(B))=λ(B∩Im)\nu(x_m^{-1}(B))=\lambda(B\cap I_m) for every Borel B⊆RB\subseteq\mathbb R; (P3) for every mm, cm ⁣:Ω→Oc_m\colon\Omega\to\mathcal O is Borel with λ(U(cm(z)))<1\lambda(U(c_m(z)))<1 for every z∈Ωz\in\Omega, not only for z∈Zz\in Z; (P4) for every z∈Zz\in Z and every m∈Zm\in\mathbb Z, Axm(z)⊆U(cm(z))A_{x_m(z)}\subseteq U(c_m(z)). Prof(A)\mathrm{Prof}(\mathcal A) says that such a certificate exists.

The result (Theorem 3.2, display (3.5)): ZFC proves that for every family A\mathcal A, Prof(A)\mathrm{Prof}(\mathcal A) implies Freeω(A)\mathrm{Free}_\omega(\mathcal A). The source and the page write the family quantifier outside the turnstile; the theorem is the single ZFC sentence

∀A (Prof(A)→Freeω(A)),\forall\mathcal A\,\bigl(\mathrm{Prof}(\mathcal A)\to \mathrm{Free}_\omega(\mathcal A)\bigr),

and nothing in the proof depends on the family being definable. The proof never uses measurability of the relation x∈Ayx\in A_y; it uses (P4) only at the countably many selected profiles, which lie in ZZ.

Checklist

  • Quantifiers and scope: pass. (P3) is used for every z∈Ωz\in\Omega, as stated, to bound every column EsE^s, s∈Ss\in S; (P4) is used only at zi,zj∈Zz_i,z_j\in Z; the conclusion gives both yj∉Ayiy_j\notin A_{y_i} and yi∉Ayjy_i\notin A_{y_j} for i<ji<j, which covers every ordered pair of distinct elements; the selected reals are pairwise distinct by the fiber removal, so the set is infinite. No exceptional set is dropped.
  • Circularity: pass. Neither Freeω\mathrm{Free}_\omega nor Prof\mathrm{Prof} is assumed in the proof; the recursion is ω\omega-long by construction and presupposes no termination; its invariant (CjC_j Borel of infinite measure, tj∈Cjt_j\in C_j, zj∈Zz_j\in Z) holds at j=0j=0 and is carried by Lemmas 2.1 and 2.2.
  • Model and convention changes: pass. The family is replaced by the open envelopes V(t)V(t) only through (P4), the transfer the certificate itself supplies, and only at profiles in ZZ. The coding convention is stated with the two Borel properties the source requires; the page's instance (the Cantor space with a rational-interval enumeration) is labeled a compilation fill and satisfies both properties (re-derived under Weakest steps). The product measure and Borel structure on S=Z×ΩS=\mathbb Z\times\Omega are the actual objects Lemmas 2.1–2.2 need.
  • Finite and statistical overreach: inapplicable. No finite case, average or heuristic enters; the only counting argument is inside the imported Lemma 2.1, a proof by Tonelli's theorem.
  • Uniformity: pass. The column bound K=1K=1 is uniform over all s∈Ss\in S because (P3) holds for every z∈Ωz\in\Omega; the interchange of the sum over mm with the measure is countable additivity over the partition (Im)(I_m); σ\sigma-finiteness of μ\mu is exhibited by the pieces {m}×Ω\{m\}\times\Omega of measure one.
  • Extremal conclusions: inapplicable, except that the page's instance writes λ(U(c))\lambda(U(c)) as a supremum to show it Borel; the supremum is continuity from below over the finite partial unions and is checked under Weakest steps.
  • Consequences and composition: pass. Every "so" on the page was re-derived separately: Borelness of EE and xx; the column bound; null fibers; a positive section of Q(Cj)Q(C_j); the choice of zjz_j by the meeting property; the application of Lemma 2.2; the three omissions and the two directions of independence. Lemmas 2.1 and 2.2 are consumed at exactly their stated strength (measurable set of positive measure; measurable set of infinite measure).
  • Computation: inapplicable. The page carries no computation.
  • Reproduction: inapplicable. The page states no rerun commands and carries no evidence folder.
  • Source and verdict fidelity: faithful with one correction. The statement, Definition 3.1, the locators (Section 3, physical pp. 3–4, Definition 3.1, Theorem 3.2, displays (3.5)–(3.10)) and the proof match the PDF clause by clause. One remark alters the source's sentence about the use of the outer-measure hypothesis into a false statement about the whole of (P1) (finding F1). The standing sentences claim author-recorded status only.

Weakest steps

Measurability of the graph. The page needs E∈Σ⊗ΣE\in\Sigma\otimes\Sigma so that Lemmas 2.1 and 2.2 apply, where Σ\Sigma is the Borel σ\sigma-algebra of S=Z×ΩS=\mathbb Z\times\Omega. Re-derivation: on the Borel piece {m}×Ω×{n}×Ω\{m\}\times\Omega\times\{n\}\times\Omega of S2S^2, the map (t,s)↦(x(t),c(s))=(xm(z),cn(w))(t,s)\mapsto(x(t),c(s))=(x_m(z),c_n(w)) is Borel into R×O\mathbb R\times\mathcal O because xmx_m and cnc_n are Borel; there are countably many pieces, so the map is Borel on S2S^2. EE is the preimage of the Borel relation {(x,c):x∈U(c)}\{(x,c):x\in U(c)\}, so EE is Borel in S2S^2. Since SS is a countable disjoint union of copies of the standard Borel space Ω\Omega, it is standard Borel, and the Borel σ\sigma-algebra of S2S^2 equals Σ⊗Σ\Sigma\otimes\Sigma because a standard Borel space carries a second-countable Polish topology generating its Borel sets. The same route gives xx Borel and every section EtE_t, EsE^s in Σ\Sigma, as the lemmas' setting requires. This step composes with the rest by making Lemma 2.1's Tonelli argument available; no completion of μ\mu is needed, since Tonelli holds on the product σ\sigma-algebra. The page's instance of the coding also checks: the relation x∈U(c)x\in U(c) is the union over nn of Jn×{c:c(n)=1}J_n\times\{c:c(n)=1\}, which is open; U(c)U(c) is the increasing union of the finite unions UN(c)=⋃{Jn:n<N, c(n)=1}U_N(c)=\bigcup\{J_n:n<N,\,c(n)=1\}, so λ(U(c))=sup⁡Nλ(UN(c))\lambda(U(c))=\sup_N\lambda(U_N(c)) by continuity from below, and each c↦λ(UN(c))c\mapsto\lambda(U_N(c)) depends on the first NN bits of cc only, hence is locally constant, so the supremum is Borel into [0,∞][0,\infty].

The column bound and the hypotheses of the lemmas. For s=(n,w)s=(n,w), Es={t:(t,s)∈E}={t:x(t)∈V(s)}E^s=\{t:(t,s)\in E\}=\{t:x(t)\in V(s)\}, and t=(m,z)t=(m,z) lies in it exactly when xm(z)∈V(s)x_m(z)\in V(s), so EsE^s is the disjoint union over mm of {m}×xm−1(V(s))\{m\}\times x_m^{-1}(V(s)). The product of counting measure and ν\nu gives μ(Es)=∑mν(xm−1(V(s)))\mu(E^s)=\sum_m\nu(x_m^{-1}(V(s))). V(s)=U(cn(w))V(s)=U(c_n(w)) is open, hence Borel, so (P2) gives each term as λ(V(s)∩Im)\lambda(V(s)\cap I_m); the ImI_m partition R\mathbb R, so the sum is λ(V(s))\lambda(V(s)), and (P3) at w∈Ωw\in\Omega gives λ(V(s))<1\lambda(V(s))<1. So μ(Es)≤1\mu(E^s)\le 1 for every ss, which is (2.1) with K=1K=1. The remaining hypotheses: μ\mu is σ\sigma-finite and μ(S)=∑mν(Ω)=∞\mu(S)=\sum_m\nu(\Omega)=\infty; xx is Borel; for a∈Ra\in\mathbb R with a∈Imaa\in I_{m_a}, the fiber {t:x(t)=a}\{t:x(t)=a\} is {ma}×xma−1({a})\{m_a\}\times x_{m_a}^{-1}(\{a\}) because xmx_m takes values in ImI_m and the ImI_m are disjoint, and (P2) gives it measure λ({a}∩Ima)=0\lambda(\{a\}\cap I_{m_a})=0. These compose into the recursion: with C0=SC_0=S Borel of infinite measure, Lemma 2.1 gives Q(Cj)Q(C_j) Borel of positive measure, and Lemma 2.2 at tj∈Q(Cj)t_j\in Q(C_j) gives Cj+1C_{j+1} Borel of infinite measure, so the invariant carries. As an independent check of Lemma 2.2's use: Cj+1=(Cj∖Etj)∖NC_{j+1}=(C_j\setminus E_{t_j})\setminus N with N=Etj∪{s:x(s)=x(tj)}N=E^{t_j}\cup\{s:x(s)=x(t_j)\}; μ(Cj∖Etj)=∞\mu(C_j\setminus E_{t_j})=\infty by tj∈Q(Cj)t_j\in Q(C_j), and μ(N)≤1+0\mu(N)\le 1+0, so subadditivity forces μ(Cj+1)=∞\mu(C_{j+1})=\infty.

Selection in ZZ and the two directions of independence. Since μ(Q(Cj))=∑mν({z:(m,z)∈Q(Cj)})>0\mu(Q(C_j))=\sum_m\nu(\{z:(m,z)\in Q(C_j)\})>0, some mjm_j has a section HjH_j of positive ν\nu-measure; HjH_j is Borel because Q(Cj)Q(C_j) is Borel and {mj}×Ω\{m_j\}\times\Omega is a Borel piece. The meeting property: if ν∗(Z)=1\nu^*(Z)=1 and HH is Borel with ν(H)>0\nu(H)>0 and H∩Z=∅H\cap Z=\varnothing, then Ω∖H\Omega\setminus H is a Borel superset of ZZ with ν(Ω∖H)=1−ν(H)<1\nu(\Omega\setminus H)=1-\nu(H)<1, against the infimum being one; so Z∩Hj≠∅Z\cap H_j\neq\varnothing and zjz_j exists, with tj=(mj,zj)∈Q(Cj)⊆Cjt_j=(m_j,z_j)\in Q(C_j)\subseteq C_j. For i<ji<j, the pools decrease, so tj∈Cj⊆Ci+1t_j\in C_j\subseteq C_{i+1} and tjt_j avoids the three sets removed at stage ii. With the source's direction convention, (t,s)∈E(t,s)\in E iff x(t)∈V(s)x(t)\in V(s): tj∉Eti={t:x(t)∈V(ti)}t_j\notin E^{t_i}=\{t:x(t)\in V(t_i)\} gives yj∉V(ti)y_j\notin V(t_i); tj∉Eti={s:x(ti)∈V(s)}t_j\notin E_{t_i}=\{s:x(t_i)\in V(s)\} gives yi∉V(tj)y_i\notin V(t_j); tj∉{s:x(s)=x(ti)}t_j\notin\{s:x(s)=x(t_i)\} gives yj≠yiy_j\neq y_i. Because zi,zj∈Zz_i,z_j\in Z, (P4) gives Ayi⊆V(ti)A_{y_i}\subseteq V(t_i) and Ayj⊆V(tj)A_{y_j}\subseteq V(t_j), hence yj∉Ayiy_j\notin A_{y_i} and yi∉Ayjy_i\notin A_{y_j}. Every unordered pair {yi,yj}\{y_i,y_j\} with i<ji<j is covered in both orders, and the yjy_j are pairwise distinct, so {yj:j<ω}\{y_j:j<\omega\} is an infinite independent set.

Strongest attack

The strongest attempt was to break independence in one direction by misreading the graph's orientation. Removing only the column EtiE^{t_i} (the points forbidden by the envelope of tit_i) would give yj∉V(ti)⊇Ayiy_j\notin V(t_i)\supseteq A_{y_i} for j>ij>i but nothing about yi∉Ayjy_i\notin A_{y_j}, and a family whose sets AyA_y are chosen adversarially could put yiy_i into AyjA_{y_j} for a later jj. The proof survives because the row Eti={s:x(ti)∈V(s)}E_{t_i}=\{s:x(t_i)\in V(s)\} is removed as well, so every later tjt_j has an envelope V(tj)V(t_j) missing yiy_i, and (P4) at zj∈Zz_j\in Z places AyjA_{y_j} inside that envelope. The two removals are exactly (3.10) in the source, and the page's three bullets state them with the correct sections. A second attack, that removing the row EtiE_{t_i} might empty the pool, fails because tit_i is chosen inside Q(Ci)Q(C_i), whose definition is that Ci∖EtiC_i\setminus E_{t_i} keeps infinite measure; the column and the fiber cost at most measure one. A third attack, that a positive Borel set HjH_j might miss ZZ, fails by the outer-measure argument re-derived above. A fourth, that Lemma 2.1 might need a completed product measure or a row bound, fails: Lemma 2.1 as imported asks only for a column bound and Σ⊗Σ\Sigma\otimes\Sigma-measurability, both established. No defect was found in the mathematics; the one defect found is a remark about which hypotheses are used (F1).

Premises

  • Lemma 2.1 (positive-measure selection), source p. 2, held PDF read clause by clause; imported through the author-recorded reconstruction page glazer_lemma_2_1_reconstruction.md as of the same time, whose Statement was compared with the PDF and matches. Interface: for a σ\sigma-finite (S,Σ,μ)(S,\Sigma,\mu) with μ(S)=∞\mu(S)=\infty, a Σ⊗Σ\Sigma\otimes\Sigma-measurable E⊆S2E\subseteq S^2 with μ(Es)≤K<∞\mu(E^s)\le K<\infty for every ss, and measurable CC with μ(C)=∞\mu(C)=\infty, the set Q(C)={t∈C:μ(C∖Et)=∞}Q(C)=\{t\in C:\mu(C\setminus E_t)=\infty\} is measurable with μ(Q(C))>0\mu(Q(C))>0. Applied with K=1K=1; every hypothesis is established on the page.
  • Lemma 2.2 (preservation step), source p. 3, same reading and the same kind of import through glazer_lemma_2_2_reconstruction.md. Interface: under the hypotheses of Lemma 2.1, for measurable x ⁣:S→Rx\colon S\to\mathbb R with every fiber null, measurable CC of infinite measure and t∈Q(C)t\in Q(C), the set C∖(Et∪Et∪{s:x(s)=x(t)})C\setminus(E_t\cup E^t\cup\{s:x(s)=x(t)\}) is measurable of infinite measure. Applied at each stage; every hypothesis is established on the page.
  • Both lemma pages record author-recorded standing only; the page under review names them as reconstructions and inherits that standing.
  • Textbook facts used without a held source: a countable disjoint union of standard Borel spaces is standard Borel; the Borel σ\sigma-algebra of a product of two standard Borel spaces is the product σ\sigma-algebra; sections of product-measurable sets are measurable; countable additivity and continuity from below of Lebesgue measure; the product of counting measure on Z\mathbb Z with a finite Borel measure.
  • Explicit assumptions: the coding convention as stated by the source (two Borel properties), with the page's Cantor-space instance labeled as a fill; the outer measure ν∗\nu^* read as the infimum over Borel supersets, a reading the source does not spell out; the family quantifier read as internal to the ZFC sentence.

Findings

F1. Severity: required. Location: "This meeting property is the only use of (P1) below." Defect: (P1) on the page comprises two clauses, that (Ω,ν)(\Omega,\nu) is a standard Borel probability space and that ν∗(Z)=1\nu^*(Z)=1, and the page's own proof uses the first clause twice, for "SS is a standard Borel space" (to identify the Borel sets of S2S^2 with Σ⊗Σ\Sigma\otimes\Sigma) and for "each {m}×Ω\{m\}\times\Omega has measure one" (to make μ\mu σ\sigma-finite); the sentence is therefore false as written. Witness: the source, p. 3, after Definition 3.1, says "This is the only largeness property of ZZ used below; ZZ need not be measurable", a statement about the largeness of ZZ only. Replacement text: "This meeting property is the only largeness property of ZZ used below; the standard Borel and probability clauses of (P1) are used separately, for the Borel structure of S2S^2 and the σ\sigma-finiteness of μ\mu."

F2. Severity: suggested. Location: "The instance of the coding space given under Definitions is a compilation fill". Defect: the page also supplies the justifications of three facts that the source asserts without proof (that EE is Borel, p. 3, "Define a Borel directed graph"; that (3.1) is equivalent to the meeting property, p. 3; that the Borel sets of S2S^2 form Σ⊗Σ\Sigma\otimes\Sigma, implicit in the source's application of Lemma 2.1), and names only the coding instance as supplied. The justifications are correct; the omission is one of labeling. Replacement text, appended to the Standing paragraph: "The proofs that EE and xx are Borel, that the Borel sets of S2S^2 are the product σ\sigma-algebra, and that ν∗(Z)=1\nu^*(Z)=1 is the meeting property are supplied; the source asserts these facts without proof."

F3. Severity: note. Location: "So Lemma 2.1 and Lemma 2.2 apply with K=1K=1." Lemma 2.2 also needs xx Borel with null fibers, which the page establishes only in the next paragraph. The order follows the source (p. 4, "Thus theorems 2.1 and 2.2 apply with K=1K=1. Moreover, every fiber of xx is null."), and nothing is used before it is proved. Optional replacement: "So Lemma 2.1 applies with K=1K=1, and Lemma 2.2 applies once the fibers of xx are shown null."

F4. Severity: note. Location: "a map c↦U(c)c\mapsto U(c) from O\mathcal O onto the open subsets of R\mathbb R". The source (p. 3) says "coding space O\mathcal O for open subsets of R\mathbb R" and does not state surjectivity; the reading is natural, the instance is onto, and Theorem 3.2 never uses surjectivity, since the certificate supplies its own codes. No change needed; "onto" could be marked as a reading.

F5. Severity: note. Location: "(P1) ... where ν∗(Z)=inf⁡{ν(B):B⊇Z Borel}\nu^*(Z)=\inf\{\nu(B):B\supseteq Z\text{ Borel}\}". The source uses ν∗\nu^* without defining it (p. 3, display (3.1)); the page's definition is the standard outer measure of a Borel probability measure and agrees with the completion's outer measure. It is a supplied reading placed inside the definition and could say so.

F6. Severity: note. Location: "The two measure lemmas it uses are reconstructed in Lemma 2.1 and Lemma 2.2." The imported lemmas are named and linked, but their standing (author-recorded reconstructions, not independently reviewed) is stated only on the linked pages. A clause "both author-recorded" would make the page self-contained on this point.

Verdict

Source fidelity: faithful with corrections. The statement, Definition 3.1, the coding convention, the locators (Section 3, physical pp. 3–4, which are also the printed pages; Definition 3.1; Theorem 3.2; displays (3.5)–(3.10)) and every step of the proof match the held PDF; the one required correction (F1) is a remark that overstates which hypotheses go unused.

The argument as reconstructed: sound. Every deduction was re-derived above; the imported Lemmas 2.1 and 2.2 are applied inside their hypotheses with K=1K=1, and the independence conclusion holds in both orders for every pair.

Limitations: the review checks the reconstruction against the held draft rev10 and the two imported lemma statements; it does not review the proofs of Lemmas 2.1 and 2.2, the forcing module (Theorem 5.1) that produces certificates, or the companion formalization, and it makes no claim about the paper beyond Section 3. The exposures listed above did not enter the checks.

This focused review assigns no tier and changes no status.