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.
Borel cores of sigma-finite Hausdorff measurable sets
Statement
Assume the Axiom of Countable Choice. Let be -measurable and sigma-finite, where is finite. There are Borel sets such that . If has finite measure, it contains an set of equal measure; for every it contains a closed set with .
Facts & Assumptions
Given: The objects, conventions, and hypotheses in the statement above.
Every set has an equal-measure Borel hull; in Euclidean space it has an equal-measure hull, under Countable Choice. Hausdorff measure is Borel regular
Measures are continuous from below on increasing sequences of measurable sets, without a finiteness hypothesis. Continuity from below for measures
Proof
First suppose . Choose a Borel hull of . Measurability of gives , hence is null. Choose a null Borel hull of that difference; then is the required sandwich. This also covers empty or null .
For the Euclidean assertion take , with open and . Each has an increasing closed exhaustion: if its complement is nonempty, use ; for use the closed balls. Continuity of the distance function follows from its triangle-inequality Lipschitz bound. These sets exhaust .
For sigma-finite , write with measurable finite-measure and apply the first step to each. The unions of the lower and upper hulls are Borel, and their difference is contained in the union of the null differences. Thus it is null. Only the finite pieces required subtraction; this includes infinite .
Fix . Continuity from below on , with , gives such that . The closed set lies in and loses less than of . Its excess is null. Take a null hull of that excess. Then is , lies in , and loses less than of .
Apply this for and take the union of the resulting sets; it is an subset of with . Express as an increasing union of closed sets (replace any closed sequence by its finite unions). Continuity from below now gives a closed subset of with deficit less than any prescribed positive number. The argument applies to as well; in that case finite-measure is finite.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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
- Fremlin, Measure Theory, 264F(c) (standard reference, not scraped)
- Falconer, The Geometry of Fractal Sets, Theorem 1.6(b) (standard reference, not scraped)