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 spacer measure budget
Example
Assume AC for the Lebesgue-measure interpretation. The initial Chacon column has mass . The first two spacers have masses and . All spacers together have mass ; after stage the unused reservoir has mass . Spacers are retained, so it is the unused tail, not total spacer mass, that tends to zero.
Facts & Assumptions
Spacer has width , the initial column has width , and all the physical spacers are disjoint and retained Chacon three cut one spacer towers.
Assume AC for the measure assertions in F1 The Axiom of Choice.
Verification
Given: The finite normalized Chacon construction.
At the first cut the spacer has width , and at the second it has width . After stage the retained spacer mass is the finite sum . The empty sum at is zero. For , multiplying the sum by cancels all interior terms, giving , hence . The formula also gives zero at .
Adding the initial mass yields , whose missing mass is exactly the reservoir. As , and the reservoir tends to zero. Countable additivity on the disjoint spacer intervals identifies their union's measure with this sum; their union is also the physical interval , since their adjacent endpoints tend to one. The numerical geometric identities themselves are choice-free; AC is used only through F1's Lebesgue-measure interpretation.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
6 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 pp.99–101 (standard reference, not scraped)