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.
Countable boundary null partitions of a separable metric space
Statement
Assume AC. For a separable metric S with Borel probability , there are countable refining Borel partitions for , all of whose nonempty atoms have diameter at most and -null boundary. Together these partitions generate .
Facts & Assumptions
Finite and countable subadditivity of measures: Let be a measure and let be measurable. Then
For every one also has
including , where both sides are .
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
S is nonempty since (S)=1. Fix a countable dense list . For a fixed center, spheres at distinct radii are disjoint; at most r spheres have mass at least 1/r. Thus the radii with positive sphere mass form a countable union of finite, increasing-order lists. For each k,i, AC chooses outside this countable exceptional set. The balls cover S by density, and each has diameter at most 2^{-k} and boundary contained in its null sphere.
At level k disjointize this ordered cover: . These sets partition S; discard empty members. Their boundaries lie in the finite union of the first i sphere boundaries, hence are null by F1. Let consist of all nonempty intersections . These form a countable Borel partition, refine the preceding one, and have diameter at most 2^{-k}; their boundaries are again contained in finitely many null boundaries.
Every partition atom is Borel, so the -algebra they generate is contained in Borel(S). Conversely if U is open and x belongs to U, choose a ball about x contained in U and then k with 2^{-k} below its radius. The atom containing x lies in that ball, hence in U. Thus U is the union of the atoms, over countably many levels and members, that are contained in U. It lies in the generated -algebra, proving equality.
Depends on
Used by
Dependency tree · two levels
16 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
- van Gaans, Lemma 4.3, pp. 10–11; refining-partition consequence (standard reference, not scraped)