Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Weak convergence of gaussian laws by parameters

Example

Assume AC. If mnm and σn0 with σnσ0, then N(mn,σn2)N(m,σ2), including N(m,0)=δm.

Facts & Assumptions

[F1]

Standard normal and normal laws: Assume AC. Define γ(E)=Eex2/2/2πdx for Borel E in R. By lem-normal-density-has-total-mass-one and thm-indefinite-integral-of-a-nonnegative-function-is-a-measure, gamma is a probability measure; denote it N(0,1). For mR and σ0, define N(m,σ2) as the law of xm+σx on (R,B,γ). This affine map is continuous: for σ>0 choose δ=ε/σ, and for σ=0 it is constant. Its inverse images of opens are open, so it is Borel measurable. lem-law-of-a-random-element-is-a-probability-measure makes its pushforward a probability. When σ=0, the preimage of E is all of R if m belongs to E and empty otherwise, so N(m,0)=δm in def-dirac-measure.

[F2]

Dominated convergence: Let f and (fn) be measurable complex-valued functions such that fnf almost everywhere and fng almost everywhere for a single nonnegative measurable function g with gdμ<+. Then fL1(μ), fnfdμ0, and hence fndμfdμ.

[F3]

Change of variables for expectation: Let X:(Ω,F,P)(S,Σ) be a random element, let PX be its law, and let g:(S,Σ)R or g:(S,Σ)C be measurable.

  1. If g0, then E[g(X)]=SgdPX.
  2. If g(X) is integrable, then g is integrable with respect to PX and the same formula holds: E[g(X)]=SgdPX.
[F4]

Weak convergence of borel probability measures: For Borel probability measures μn,μ on a metric space S, write μnμ if fdμnfdμ for every bounded continuous real function f on S. Continuity is def-metric-continuity. Such f is Borel measurable (inverse images of open sets are open) and fdμfμ(S)<, so the integrals are finite in def-integrable-real-and-complex-functions-and-their-integrals. No completeness or coupling is required.

Verification

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1

On the standard-normal probability space gamma of F1, put Z(x)=x, Yn=mn+σnZ and Y=m+σZ. For every finite x, Yn(x)Y(x)mnm+σnσx0. Their laws are the stated affine normal laws by that definition.

F1
2.1

For bounded continuous f, f(Yn)->f(Y) pointwise and f(Yn)f, an integrable constant since gamma has mass one. F2 gives convergence of their expectations, and F3 translates this into convergence of the normal-law integrals. Thus F4 applies. When σ=0 the limit Y is the constant m, with law δm.

F2F3F4

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

30 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