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 can be approximated in symmetric-difference measure by unions of levels of the stage- Chacon tower, with error tending to zero as . Functions constant on those levels and zero off their tower are dense in complex . If and , every sufficiently late stage has a level with .
Facts & Assumptions
The physical tower levels and reservoir partition , refining at each stage, with widths and reservoir mass tending to zero Chacon three cut one spacer towers.
Finite-measure sets admit symmetric-difference approximation by a generating algebra Approximation in symmetric difference by a generating algebra.
Half-open intervals generate the Borel sigma-algebra The sigma-algebra generated by the half-open boxes of is the Borel sigma-algebra.
Lebesgue measurable sets have Borel representatives modulo null sets under countable choice is exactly the completion of the restriction of to the Borel sets.
Finite complex simple functions are dense in Complex finite-simple and smooth compact-support density for finite p.
The complex pairing supplies the norm inequalities The complex pairing is well-defined and satisfies Cauchy–Schwarz.
Assume AC The Axiom of Choice.
Proof
Given: measurable and AC.
The algebra of finite unions of intervals in with any endpoint conventions generates the trace Borel sigma-algebra by F3. Under AC, F4 replaces by a Borel set modulo a null set. Given , F2 supplies a finite interval union with . Let count its finitely many endpoints. The physical partition at stage has maximum atom length . Outside the at most atoms incident to endpoints, every atom is wholly inside or outside . Taking all atoms wholly inside therefore gives symmetric-difference error at most (endpoint singletons are null). Removing the reservoir adds at most . Hence a level union satisfies for all sufficiently large .
Given and , choose with . If , use zero. Otherwise approximate each by a level union at one common sufficiently late stage so that every error measure is below , using step 1.1. Then is constant on each level and zero off the tower, and . Thus .
For take and choose, at any sufficiently late stage, a level union with . Then . If every level of had -proportion at most , summing over its disjoint levels would give , contradicting the error bound. At least one level has the required strict density. The case is also covered by this contradiction, and only finitely many levels are compared.
Depends on
- Chacon three cut one spacer towers
- Approximation in symmetric difference by a generating algebra
- The sigma-algebra generated by the half-open boxes of $\mathbb{R}^n$ is the Borel sigma-algebra
- $\mathcal{L}(\mathbb{R}^n)$ is exactly the completion of the restriction of $\lambda_n$ to the Borel sets
- Complex finite-simple and smooth compact-support density for finite p
- The complex $L^2$ pairing is well-defined and satisfies Cauchy–Schwarz
- The Axiom of Choice
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
- Sarig Problem 3.8(3) p.101 (standard reference, not scraped)
- Katok–Thouvenot generating partitions paragraph p.697 (standard reference, not scraped)