Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Density normal laws and square-summable Gaussian series under countable choice

Statement

Assume countable choice. Put g(x)=(2π)−1/2e−x2/2. Then γ(E)=∫Eg(x) dx is a Borel probability on R. In this item and its applications, write N(m,v) for its pushforward under x↦m+v x, where v≥0; thus N(m,0)=δm. This density convention requires no full axiom of choice. For v>0 the law has density gm,v(x)=(2πv)−1/2exp⁡{−(x−m)2/(2v)}, and its CDF is continuous and strictly increasing. Its mean and variance are m and v.

If Zj are mutually independent with density g and ∑j≥1cj2=v<∞, and the finite sums Sm=∑j≤mcjZj converge in probability to a supplied real random variable S, then S has law N(0,v). In particular, this applies whenever the sums converge almost surely or in L2.

Facts & Assumptions

Given: Countable choice, the displayed density, and, for the series assertion, the independent coordinates, real coefficients and supplied probability limit S.

[F2]

The indefinite integral of a nonnegative measurable function is a measure constructs a measure from a nonnegative measurable density; Integrating against a density agrees with integrating the product integrates nonnegative tests against it. Monotone convergence for the integral passes to increasing truncations.

[F4]

Independent random elements have product joint law identifies independent pairs with the product of their laws. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product computes nonnegative integrals by iterated integration.

[F5]

Dynkin's pi-lambda theorem implies that Borel probabilities agreeing on all half-lines (−∞,x] agree: those half-lines, together with R, form a generating pi-system.

Proof

1.1F1F2F5givenalgebra

The positive continuous function g is Borel measurable, since inverse images of open sets are open. For an integer R≥1, substitute x=2 t in the continuous compact-interval integral. The bridge in [F1] and then increasing truncation in [F2] give ∫Re−x2/2 dx=2lim⁡R→∞∫−R/2R/2e−t2 dt=2π. Thus [F2] makes γ a probability. For v>0, compact substitutions in the same way show that its affine pushforward has the asserted half-line integrals of gm,v; limits of compact intervals give the half-lines, and [F5] gives equality of the measures. For v=0 the affine map is constant, giving the Dirac law directly.

2.1F1F2F3step 1.1algebra

The CDF of N(m,v) for v>0 is continuous, since gm,v is bounded and the integral over an interval of length h is at most ∣h∣/2πv. It is strictly increasing because the positive continuous density has a positive minimum on every nondegenerate compact interval. For Z with density g, g′(x)=−xg(x), and integration by parts gives ∫−RR∣x∣g(x)dx=2(g(0)−g(R)) and ∫−RRx2g(x)dx=∫−RRg(x)dx−2Rg(R). The exponential series shows g(R)→0 and Rg(R)→0. Increasing truncation gives E∣Z∣<∞ and EZ2=1; symmetry gives EZ=0. Expanding m+vZ gives the claimed mean and variance, also for v=0.

3.1F1F4F5step 1.1step 2.1algebra

Let U,V be independent centered density normal variables with variances a,b>0. Their sum has density h(x)=∫Rg0,a(u)g0,b(x−u)du. Indeed, [F4] expresses P(U+V≤x) as the nonnegative double integral of 1u+t≤xg0,a(u)g0,b(t); for each fixed u, a translation in the continuous half-line integral followed by Tonelli gives ∫−∞xh(y)dy. These half-line probabilities determine the law by [F5]. Completing the square gives u2a+(x−u)2b=a+bab(u−axa+b)2+x2a+b. The compact substitutions and increasing limits in step 1.1 therefore give h(x)=g0,a+b(x). If either variance is zero the corresponding variable is zero almost surely and the same conclusion is immediate. Scaling a coordinate by a negative coefficient gives the same density as scaling by its absolute value, by the symmetry of g. Finite induction, using mutual independence to separate the last coordinate from the preceding tuple, proves Sm∼N(0,vm) with vm=∑j≤mcj2.

4.1F3F5step 2.1step 3.1givenalgebra∎

If v=0, every coefficient is zero, so convergence in probability implies S=0 almost surely. Suppose v>0. Then vm→v and eventually vm>0. Write Φ for the continuous CDF of γ. For any x∈R and ε>0, convergence in probability and step 3.1 give Φ((x−ε)/vm)−P(∣Sm−S∣>ε)≤P(S≤x)≤Φ((x+ε)/vm)+P(∣Sm−S∣>ε). First let m→∞, then ε↓0. Continuity from step 2.1 gives P(S≤x)=Φ(x/v) for every x. By [F5], S has law N(0,v). Almost sure convergence implies convergence in probability by dominated convergence on the indicators of {∣Sm−S∣>ε}, and L2 convergence implies it by ε2P(∣Sm−S∣>ε)≤E∣Sm−S∣2.

Depends on

Used by

Dependency tree · two levels

101 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