Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31
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.

The measure δ0+λ ⁣[0,1] splits into discrete and absolutely continuous parts

Example

Assume the Axiom of Countable Choice. Let μ:=δ0+λ ⁣[0,1]. Then in the three-part decomposition of Every finite Borel measure on R has a unique absolutely continuous, discrete, and singular-continuous decomposition one has μd=δ0,μac=λ ⁣[0,1],μsc=0.

Facts & Assumptions

Given: The finite Borel measure μ=δ0+λ ⁣[0,1].

[L1]

Dirac measure is a finite Borel measure concentrated at one point. (The Dirac set function at a point, A Dirac set function is a probability measure)

[A1]

The restriction λ ⁣[0,1] is absolutely continuous with respect to λ.

[L3]

Every finite Borel measure on R has a unique absolutely continuous, discrete, and singular-continuous decomposition. (Every finite Borel measure on R has a unique absolutely continuous, discrete, and singular-continuous decomposition)

Verification

technique · direct
1.1

By [L1], δ0 is discrete. By [A1], λ ⁣[0,1] is absolutely continuous with respect to λ. Their sum is μ, and neither summand has an atomless singular part.

L1A1given
2.1

Therefore the displayed decomposition has exactly the form required by [L3], and uniqueness there forces μd=δ0, μac=λ ⁣[0,1], and μsc=0.

step 1.1L3

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

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