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.
Assuming choice, the completion of the Borel Dirac measure at zero is defined on every subset of the real line
Example
Assume the Axiom of Choice. On , let be the Borel Dirac measure at . Its completion has domain and satisfies
The original Borel measure space is therefore not complete.
Facts & Assumptions
Given: The real line, its Borel sigma-algebra, the point , and the Axiom of Choice.
Every measure space has a unique complete extension to its completion construction under countable choice (Assuming countable choice, every measure space has a unique complete extension to its completion), and the Axiom of Choice supplies every choice function required by countable choice (The Axiom of Choice).
The Dirac set function at assigns value exactly to measurable sets containing and value otherwise (The Dirac set function at a point); it is a probability measure (A Dirac set function is a probability measure).
A set lies in the completion domain exactly when it is a measurable core union a subset of a measurable null set, and its completed value is the measure of that core (The completion domain and proposed completed set function of a measure space).
The Borel sigma-algebra is generated by the open sets (The Borel sigma-algebra of a topological space), and open rays are open while their complements are closed (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen).
Under choice, (Assuming the Axiom of Choice, the Borel sigma-algebra on R^n has cardinality continuum for n at least one) and every power set has strictly larger cardinality than its underlying set (Assuming the Axiom of Choice, , and Cantor's theorem in cardinal form: ).
Binary sequences inject into the Cantor set and hence into (The Cantor set is exactly the set of with every , and this gives a bijection with ).
Verification
The singleton is Borel because its complement is the union of the open rays and ; hence is Borel and .
The binary-sequence injection [L5] gives an injection from a set of cardinality into ; the map then injects its power set into . Hence [L4] gives , so some subset of is not Borel.
If , then with is a completed representation and has completed value by [L6]; if , then with the second part contained in , so [L2] and [L6] give completed value .
Thus every subset of lies in the completion and the displayed formula holds.
For the non-Borel set from step 1.2, the set is still non-Borel, since otherwise adjoining the Borel singleton when necessary would make Borel; it is a subset of the Borel null set from step 1.1. Thus the original Borel Dirac space is not complete, while step 3.1 shows that its completion is the full power set.
Depends on
- The completion domain and proposed completed set function of a measure space
- Assuming countable choice, every measure space has a unique complete extension to its completion
- The Dirac set function at a point
- A Dirac set function is a probability measure
- The Borel sigma-algebra of a topological space
- Open subset of $\mathbb{R}$ (every point has a neighbourhood inside it), closed subset (complement open), and clopen
- Assuming the Axiom of Choice, the Borel sigma-algebra on R^n has cardinality continuum for n at least one
- Assuming the Axiom of Choice, $2^{\kappa} = \lvert \mathcal{P}(\kappa) \rvert$, and Cantor's theorem in cardinal form: $\kappa < 2^{\kappa}$
- The Cantor set is exactly the set of $\sum_{k \ge 1} a_k 3^{-k}$ with every $a_k \in \{0,2\}$, and this gives a bijection with $\{0,1\}^{\mathbb{N}}$
- The Axiom of Choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
64 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.