Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Chacon levels approximate measurable sets

Statement

Assume AC. Every Lebesgue-measurable E⊆[0,1) can be approximated in symmetric-difference measure by unions of levels of the stage-r Chacon tower, with error tending to zero as r→∞. Functions constant on those levels and zero off their tower are dense in complex L2. If μ(E)>0 and δ>0, every sufficiently late stage has a level J with μ(E∩J)>(1−δ)μ(J).

Facts & Assumptions

[F1]

The physical tower levels and reservoir partition [0,1), refining at each stage, with widths and reservoir mass tending to zero Chacon three cut one spacer towers.

[F2]

Finite-measure sets admit symmetric-difference approximation by a generating algebra Approximation in symmetric difference by a generating algebra.

[F3]
[F4]

Lebesgue measurable sets have Borel representatives modulo null sets under countable choice L(Rn) is exactly the completion of the restriction of λn to the Borel sets.

[F5]

Finite complex simple functions are dense in L2 Complex finite-simple and smooth compact-support density for finite p.

[F6]

The complex pairing supplies the norm inequalities The complex L2 pairing is well-defined and satisfies Cauchy–Schwarz.

[F7]

Proof

Given: E⊆[0,1) measurable and AC.

1.1F1F2F3F4F7

The algebra of finite unions of intervals in [0,1) with any endpoint conventions generates the trace Borel sigma-algebra by F3. Under AC, F4 replaces E by a Borel set modulo a null set. Given ε>0, F2 supplies a finite interval union V with μ(E△V)<ε/2. Let q count its finitely many endpoints. The physical partition at stage r has maximum atom length br=max⁡(wr,3−(r+1))→0. Outside the at most 2q atoms incident to endpoints, every atom is wholly inside or outside V. Taking all atoms wholly inside V therefore gives symmetric-difference error at most 2qbr (endpoint singletons are null). Removing the reservoir adds at most 3−(r+1). Hence a level union Qr satisfies μ(E△Qr)≤ε/2+2qbr+3−(r+1)<ε for all sufficiently large r.

2.1F5F6step 1.1

Given f∈L2 and ε>0, choose s=∑j=1mcj1Ej with ∥f−s∥2<ε/2. If B=∑∣cj∣=0, use zero. Otherwise approximate each Ej by a level union at one common sufficiently late stage so that every error measure is below (ε/(2B))2, using step 1.1. Then sr=∑jcj1Qr,j is constant on each level and zero off the tower, and ∥s−sr∥2≤∑j∣cj∣μ(Ej△Qr,j)<ε/2. Thus ∥f−sr∥2<ε.

3.1F1step 1.1∎

For μ(E)>0 take 0<η<δμ(E)/(1+δ) and choose, at any sufficiently late stage, a level union Q with μ(E△Q)<η. Then μ(Q)>μ(E)−η>0. If every level of Q had E-proportion at most 1−δ, summing over its disjoint levels would give μ(Q∖E)≥δμ(Q)>δ(μ(E)−η)>η, contradicting the error bound. At least one level has the required strict density. The case δ≥1 is also covered by this contradiction, and only finitely many levels are compared.

Depends on

Used by

Dependency tree · two levels

53 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources