Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-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.

A finite-array normal limit from vanishing fourth moments

Statement

Assume Countable Choice, and suppose the probability law with density ϕ(t)=(2π)−1/2e−t2/2 is supplied. Write Φ(t)=∫−∞tϕ(s) ds; normalization is part of the given probability-law hypothesis. For each positive integer n, let Xn,1,…,Xn,kn be independent centered real random variables, where kn is finite and each variable has a finite fourth moment. Different rows need not share a probability space. Suppose

∑j=1knEXn,j2⟶v∈(0,∞),∑j=1knEXn,j4⟶0.

Then, for Sn=∑jXn,j,

sup⁡t∈R∣P(Sn≤t)−Φ(t/v)∣⟶0.

The same conclusion applies to any specified sequence of finite arrays satisfying these two limits; no identical-distribution hypothesis is needed.

Facts & Assumptions

Given: The supplied normalized scalar Gaussian probability law and the finite independent arrays in the Statement.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is assumed. No family of uncountably many auxiliary random variables is constructed.

[F1]

For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique and Independent random elements have product joint law: finite products of probability laws exist, have the rectangle formula, and give the joint law of a finite independent family.

[F2]

Fubini's theorem for L^1 functions on a sigma-finite product: absolutely integrable functions on a finite product of probability spaces can be integrated successively.

[F3]

A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: under Countable Choice, a scalar invertible affine substitution has the usual Jacobian formula for nonnegative Lebesgue integrals.

[F4]

Taylor's Lagrange remainder follows from repeated Rolle steps: for a C3 function with third derivative bounded by C, expansion through degree two at a has remainder of absolute value at most C∣x−a∣3/6.

[F5]

If u,v are differentiable on [a,b] with u′,v′ integrable, then ∫abuv′=u(b)v(b)−u(a)v(a)−∫abu′v: on each finite interval, differentiable functions with integrable derivatives satisfy the integration-by-parts identity. The polynomial and Gaussian functions used below are continuously differentiable on every [−R,R], with continuous, hence integrable, derivatives.

[F6]

The exponential dominates every fixed nonnegative integer power at +∞: every fixed polynomial times e−x2/2 tends to zero as ∣x∣→∞; for odd powers this follows by putting y=x2 and bounding ∣x∣m by an integer power of y for ∣x∣≥1.

[F7]

Monotone convergence for the integral: the integrals of the nonnegative truncations x2kϕ(x)1[−R,R](x) increase to the integral over R as integer R→∞.

Proof

1.1givenA1F1F3F5F6F7constructalgebra

For each row put an,j=EXn,j2 and vn=∑jan,j. Finite products in [F1] allow us to integrate replacement coordinates with independent centered Gaussian laws of variances an,j; a zero variance means the point mass at zero. These products need not be coupled across rows. The supplied scalar density already has integral one, so [F3] gives its scaled probability laws without a separate Gaussian-normalization theorem. For ϕ(t)=(2π)−1/2e−t2/2, direct differentiation gives ϕ′(t)=−tϕ(t). On [−R,R], apply [F5] with (u,v)=(t,ϕ(t)) and then (u,v)=(t3,ϕ(t)) to obtain ∫−RRt2ϕ(t) dt=[−tϕ(t)]−RR+∫−RRϕ(t) dt, ∫−RRt4ϕ(t) dt=[−t3ϕ(t)]−RR+3∫−RRt2ϕ(t) dt. The boundary terms tend to zero by [F6]; [F7] and the supplied normalization ∫ϕ=1 then give EG2=1 and EG4=3. Odd moments vanish by symmetry. Consequently a replacement coordinate Gn,j has mean zero, variance an,j and fourth moment 3an,j2.

2.1givenF1F2F3step 1.1inductionalgebra

The sum of the replacement coordinates has law N(0,vn). One can verify this using only scalar integration: for positive variances a,b, Fubini and the substitution y=t−x make the sum density the convolution of the two scalar densities. Completing the square in x2/a+(t−x)2/b and using [F3] together with the given unit Gaussian integral makes that convolution (2π(a+b))−1/2exp⁡(−t2/(2(a+b))). Induction gives the assertion for every finite row, and zero-variance coordinates have no effect. The absolute integrals here are finite because they are probability densities.

2.2F1F2F4step 1.1constructalgebra

Let f be bounded and C3 on R, with bounded first, second and third derivatives. In the finite product integral replace Xn,j by Gn,j one coordinate at a time. Conditional on the other coordinates, the constant, linear and quadratic terms of the Taylor expansion of f at their sum have the same integrals, since both coordinates have mean zero and variance an,j. The two remainders are bounded by [F4]. Fubini is legitimate since f is bounded and the displayed moments are finite. Summing the telescoping differences therefore gives ∣Ef(Sn)−Ef(∑jGn,j)∣≤∥f′′′∥∞∑j(E∣Xn,j∣3+E∣Gn,j∣3)/6.

3.1givenstep 1.1step 2.2algebra

Cauchy--Schwarz, first for each coordinate integral and then for the finite index sum, gives ∑jE∣Xn,j∣3≤(∑jEXn,j2)1/2(∑jEXn,j4)1/2→0. Also an,j2≤EXn,j4, by expanding the nonnegative integral of (Xn,j2−an,j)2. Hence ∑jan,j2→0, and the same calculation with the Gaussian fourth moments in step 1.1 gives ∑jE∣Gn,j∣3≤(3vn∑jan,j2)1/2→0. Both Cauchy--Schwarz inequalities follow by expanding a nonnegative square and minimizing its scalar coefficient, for the coordinate integral and the finite index sum respectively. Thus the replacement error in step 2.2 tends to zero for each such test f.

4.1givenstep 2.1step 3.1constructalgebra

For η>0, a concrete C3 cutoff is obtained by integrating the nonnegative polynomial s3(1−s)3 on [0,1], normalizing its integral to one, and extending the resulting cumulative function by zero and one outside that interval. Its first three derivatives join continuously at the endpoints. Translate, rescale and subtract this function from one to bound 1(−∞,t] from below and above by bounded C3 functions that differ only on [t−η,t+η]. Apply step 3.1 to these two fixed cutoffs. By step 2.1 the replacement sum has variance vn→v>0; its probability of this interval is at most 2η/2πvn, and its distribution at each fixed endpoint converges to Φ scaled by v. Taking n→∞ and then η↓0 proves P(Sn≤t)→Φ(t/v) for every real t.

5.1givenA1step 4.1constructalgebra∎

Finally fix δ>0. Choose finitely many increasing real grid points so that the two tails of the limiting normal law each have mass below δ and its mass between consecutive grid points is below δ. Such a finite grid exists because its density is bounded and its total integral is one. Step 4.1 gives convergence at every grid point simultaneously. Between consecutive points monotonicity of the two distribution functions bounds their difference by the largest grid-point difference plus δ; the tail intervals have the same bound using zero and one. Thus the supremum in the Statement has limsup at most δ. Letting δ↓0 proves the asserted uniform convergence. All replacements were finite products of supplied probability laws, and the only additional choice hypothesis remains [A1].

Depends on

Used by

Dependency tree · two levels

67 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