Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

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 (R,B(R)), let δ0 be the Borel Dirac measure at 0. Its completion has domain P(R) and satisfies

δ0(E)={1,0E,0,0E.

The original Borel measure space is therefore not complete.

Facts & Assumptions

Given: The real line, its Borel sigma-algebra, the point 0, and the Axiom of Choice.

[L1]

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).

[L2]

The Dirac set function at 0 assigns value 1 exactly to measurable sets containing 0 and value 0 otherwise (The Dirac set function at a point); it is a probability measure (A Dirac set function is a probability measure).

[L6]

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).

[L3]

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 R (every point has a neighbourhood inside it), closed subset (complement open), and clopen).

Verification

technique · direct
1.1

The singleton {0} is Borel because its complement is the union of the open rays (,0) and (0,+); hence Z:=R{0} is Borel and δ0(Z)=0.

givenL2L3
1.2

The binary-sequence injection [L5] gives an injection f from a set of cardinality c into R; the map Sf[S] then injects its power set into P(R). Hence [L4] gives P(R)2c>c=B(R), so some subset S of R is not Borel.

givenL4L5algebra
2.1

If 0E, then E=E with EZ is a completed representation and has completed value 0 by [L6]; if 0E, then E={0}(E{0}) with the second part contained in Z, so [L2] and [L6] give completed value 1.

step 1.1L2L6
3.1

Thus every subset of R lies in the completion and the displayed formula holds.

step 2.1
4.1

For the non-Borel set S from step 1.2, the set S{0} is still non-Borel, since otherwise adjoining the Borel singleton {0} when necessary would make S Borel; it is a subset of the Borel null set Z 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.

step 1.1step 3.1step 1.2L1

Depends on

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.