Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-23 (gpt-6-sol)
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.

Probability laws correspond to distribution functions

Statement

Assume the Axiom of Countable Choice.

  1. Let X be a real random variable, let PX be its law, and let FX(x)=P(X≤x). Then FX is nondecreasing and right-continuous, satisfies lim⁡x→−∞FX(x)=0,lim⁡x→+∞FX(x)=1, and obeys PX((a,b])=FX(b)−FX(a)(a<b).
  2. Conversely, if F:R→R is nondecreasing and right-continuous with lim⁡x→−∞F(x)=0,lim⁡x→+∞F(x)=1, then there is a unique Borel probability measure μ on R such that μ((a,b])=F(b)−F(a)(a<b), equivalently F(x)=μ((−∞,x])(x∈R).

Facts & Assumptions

Given: Countable Choice (The Axiom of Countable Choice (ACω)), a real random variable X, its law PX, and a function F as in part 2.

[L1]

The law PX is a probability measure on (R,B(R)) (Law or distribution of a random element, The law of a random element is a probability measure).

[L2]

For measures, monotonicity, set-difference subtraction, continuity from below, and continuity from above are available (Measures are monotone, Measure of a set difference when the smaller set has finite measure, Continuity from below for measures, Continuity from above when one set has finite measure).

[L3]

Assuming Countable Choice, finite-on-compacts Borel measures on R correspond to nondecreasing right-continuous functions modulo constants, and the interval increments determine the measure (Assuming countable choice, finite-on-compacts Borel measures on R correspond to nondecreasing right-continuous functions modulo constants). Its application in steps 1.3 and 2.1 is the use of Countable Choice here.

Proof

technique · direct
1.1L1L2

If a<b, then (−∞,a]⊆(−∞,b], so [L1] and [L2] give FX(a)≤FX(b). Also (−∞,b]∖(−∞,a]=(a,b], so the finite-measure difference formula from [L2] yields PX((a,b])=FX(b)−FX(a).

1.2L1L2

For fixed x, the sets (−∞,x+1/n] decrease to (−∞,x], and PX((−∞,x+1])≤PX(R)=1. Hence [L2] gives right continuity of FX. Likewise (−∞,n]↑R and (−∞,−n]↓∅, so continuity from below and from above give lim⁡n→∞FX(n)=1,lim⁡n→∞FX(−n)=0.

1.3L3given

Put G(x):=F(x)−F(0). Then G is still nondecreasing and right-continuous, so [L3] gives a unique Borel measure μ finite on compact sets with μ((a,b])=G(b)−G(a)=F(b)−F(a)(a<b).

2.1L2L3step 1.3

For fixed x, the sets (−n,x] increase to (−∞,x]. Hence [L2] and step 1.3 give μ((−∞,x])=lim⁡n→∞μ((−n,x])=lim⁡n→∞(F(x)−F(−n))=F(x). Applying continuity from below once more to (−∞,n]↑R shows μ(R)=lim⁡nF(n)=1, so μ is a probability measure. If ν is another Borel probability measure with ν((−∞,x])=F(x) for all x, then ν((a,b])=F(b)−F(a)=μ((a,b]) for every a<b, and [L3] gives ν=μ.

3.1step 1.1step 1.2step 1.3step 2.1∎

Steps 1.1 and 1.2 prove part 1, and steps 1.3 and 2.1 prove part 2.

Depends on

Used by

Dependency tree · two levels

22 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