Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck pass
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.

Pointwise CDF convergence to a continuous law is uniform

Statement

Let F be a continuous CDF and (Gn) random CDFs, meaning that each Gn(x) is a measurable real random variable and, for every outcome, x↦Gn(x) is a right-continuous CDF. Suppose that for each fixed x∈R, Gn(x)→F(x) in probability. Then sup⁡x∈R∣Gn(x)−F(x)∣⟶0 in probability.

If the initial paths are CDFs only outside specified measurable null sets Nn, first set Gn(x)=1{x≥0} on Nn. All suprema in the conclusion refer to these everywhere-CDF versions; no completeness of the probability space is assumed.

Facts & Assumptions

Given: A continuous CDF F and random CDFs Gn with the stated pointwise convergence in probability.

[F1]

Cumulative distribution function of a real random variable: A CDF is FX(x)=P(X≤x), hence is nondecreasing and has limits 0 and 1 at the two tails by measure continuity.

[F2]

Heine-Cantor in R: a continuous real function on a compact subset of R is uniformly continuous: A continuous real function on a compact subset of R is uniformly continuous.

[F3]

Continuity from above when one set has finite measure: For decreasing measurable sets whose first set has finite measure, the measure of their intersection is the infimum of their measures.

[F4]

Continuity from below for measures: For increasing measurable sets, the measure of their union is the supremum of their measures.

Proof

Given: The objects and hypotheses in the statement.

1.1F1F2F3F4givenchoose

The stated replacement on each measurable null set preserves measurable evaluations and their pointwise convergence in probability, and gives CDF paths everywhere. Consequently sup⁡x∣Gn(x)−F(x)∣ equals the supremum over rational x for every outcome, by right-continuity, and is measurable. Fix 0<η<1/2. The events defining a CDF increase to the whole space as x→+∞ and decrease to the empty set as x→−∞; [F3]–[F4] therefore give its tail limits. Choose L<R with F(L)<η and 1−F(R)<η. By [F2], F is uniformly continuous on [L,R], so choose a finite partition L=x0<⋯<xk=R for which every increment F(xj+1)−F(xj)<η.

2.1F1step 1.1givenalgebra∎

Pointwise convergence at the finitely many grid points implies that, with probability tending to one, ∣Gn(xj)−F(xj)∣≤η for every j. On this event, monotonicity of both CDFs bounds their difference on each [xj,xj+1] by 3η. For x<L, both CDF values lie between 0 and their values at L, so their difference is at most 2η; for x>R, apply the same argument to the complementary tails using their values at R. Hence sup⁡x∣Gn(x)−F(x)∣≤3η with probability tending to one. Since η>0 was arbitrary, the supremum converges to zero in probability.

Depends on

Used by

Dependency tree · two levels

15 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