Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-27
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.

Every finite Borel measure on R splits as an atomic part plus an atomless part

Statement

Assume the Axiom of Countable Choice. Let μ be a finite Borel measure on R. Then there are a countable set A⊆R and a finite atomless Borel measure ν such that

μ=∑a∈Aμ({a}) δa+ν.

The set A is exactly the set of atoms of μ.

Facts & Assumptions

Given: The Axiom of Countable Choice and a finite Borel measure μ on R.

[L1]

Assuming Countable Choice, finite-on-compacts Borel measures correspond to increasing right-continuous distribution functions, and the resulting Lebesgue-Stieltjes measure is the original measure. (Assuming countable choice, finite-on-compacts Borel measures on R correspond to nondecreasing right-continuous functions modulo constants)

[L2]

For a Lebesgue-Stieltjes measure, atoms are exactly positive jumps, and there are at most countably many of them. (Interval formulas and atoms for a Lebesgue-Stieltjes measure)

[L3]

Every Dirac measure is a probability measure, and countable nonnegative weighted sums of measures are measures. (A Dirac set function is a probability measure, Nonnegative scalar multiples and countable weighted sums of measures are measures)

Proof

technique · direct
1.1L1L2choose

Let Fμ be the distribution function of μ. By [L1], one has μ=μFμ. Therefore [L2] shows that the atom set.

A:={ x∈R:μ({x})>0 }

is at most countable. If A=∅, then μ({x})=0 for every x∈R, so μ is already atomless; taking ν:=μ proves the theorem. Otherwise choose an injective enumeration A={ai:i∈I}, where I={1,…,m} if A is finite and I=N if A is infinite.

2.1step 1.1L3algebra

By [L3], the weighted Dirac sum

μat:=∑i∈Iμ({ai}) δai

is a Borel measure. For every Borel set E,

μat(E)=∑ai∈Eμ({ai})=μ(E∩A),

because the singletons {ai} are pairwise disjoint and countable additivity of μ applies to their union. [step 1.1, L3, algebra]

3.1step 2.1givenalgebra

Define

ν(E):=μ(E∖A)(E∈B(R)).

Because (En∖A) remains pairwise disjoint whenever (En) is, the same countable additivity as for μ shows that ν is a finite Borel measure. [step 2.1, given, algebra]

4.1step 2.1step 3.1algebra

For every Borel set E, the disjoint decomposition E=(E∩A)⊔(E∖A) gives.

μ(E)=μ(E∩A)+μ(E∖A)=μat(E)+ν(E).

If x∈A, then ν({x})=μ(∅)=0; if x∉A, then μ({x})=0 by definition of A, so also ν({x})=0. Hence ν is atomless. [step 2.1, step 3.1, algebra]

5.1step 1.1step 4.1∎

If A=∅, step 1.1 already gives the claimed decomposition. Otherwise step 4.1 is exactly that decomposition, and step 1.1 identifies A as the atom set of μ.

Depends on

Used by

Dependency tree · two levels

23 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