Alphabeta Math
Pipeline-generated
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.

Central Limit Theorems

1 · Prerequisites

2 · Summary

Central limit theorems describe the laws of normalized sums. The scalar argument begins with an explicit normal transform and a second-order expansion requiring only a finite second moment. A finite-product estimate controls the accumulated error when the number of factors grows.

A local AC-to-countable-choice and dependent-choice lemma supplies the choices used in probability-product constructions. The iid theorem leads to de Moivre–Laplace. Triangular arrays then allow the distributions to change within each row. Lindeberg's tail condition implies that no individual variance dominates and gives a Gaussian limit. Conversely, when maximal summand variance tends to zero and total variance is one, a normal limit forces Lindeberg: the proof uses a nonnegative cosine deficit and a fixed frequency chosen for each tail threshold. Lyapunov's higher-moment condition is a convenient sufficient condition.

Multivariate normal laws are constructed by a positive semidefinite matrix square root. Their projection characterization includes singular covariance matrices, so the multivariate iid theorem separates positive-variance projections from those that vanish almost surely. Cramer–Wold then combines these scalar conclusions.

The results state their choice assumptions. AC covers the published Gaussian, independent-copy, uniqueness and weak-convergence machinery where used; the scalar remainder and finite-product arguments are choice-free. The final remark distinguishes convergence of laws from convergence in probability or almost surely on a common space. No quantitative approximation rate is asserted.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-13Open item page →

Characteristic function of a normal law

Statement

Assume AC. If X has law N(m,σ2) with σ0, then φX(t)=exp(imtσ2t2/2) for every real t. Moreover EX=m and Var(X)=σ2, including σ=0.

Facts & Assumptions

[F1]

Under AC the normal laws are the affine images of the standard density law. Standard normal and normal laws.

[F2]

The positive Borel density g has total integral one. The standard normal density has total mass one.

[F3]

The real exponential is smooth with derivative itself. The exponential function is smooth and (exp)=exp.

[F6]

Continuous real integrands are Riemann integrable on compact intervals. A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion.

[F9]
[F10]

Increasing nonnegative truncations converge in integral. Monotone convergence for the integral.

[F11]

Integration against a density agrees with integration of the product for nonnegative measurable integrands. Integrating against a density agrees with integrating the product.

[F12]

Finite first absolute moment permits differentiation of the characteristic function. Moments give derivatives of the characteristic function.

[F13]

An integrable absolute majorant permits complex integral limits. Dominated convergence.

[F15]

The sine and cosine derivatives justify real-component integration by parts. The derivatives of sine and cosine are cosine and minus sine.

[F17]

Affine changes give the stated characteristic-function transformation. Characteristic functions under affine maps and independent sums.

[F18]

The exponential addition law holds, and the complex exponential extends the real exponential. exp(z+w)=expzexpw, and the complex exponential extends the real exponential.

[F19]

Real integrals are defined through positive and negative parts, and complex integrals through real and imaginary parts. Integrable real and complex functions, and their integrals.

[F20]

The real exponential is defined by the everywhere convergent series ex=j=0xj/j!. The real exponential function and the number e by a power series.

Proof

Given: Assume AC. If X has law N(m,σ2) with σ0, then φX(t)=exp(imtσ2t2/2) for every real t. Moreover EX=m and Var(X)=σ2, including σ=0.

1.1

Write g(x)=ex2/2/2π and let Z be the coordinate under its probability law. By [F1]–[F2], this is a probability law with density g. For any measurable complex h with hg<, apply [F11] to the positive and negative parts of Reh and Imh. The definitions in [F19] then give Eh(Z)=h(x)g(x)dx; in particular, every density-integral identity used below is covered. The derivative rules give g(x)=xg(x). All compact-interval functions below are continuously differentiable, so [F6]–[F9] apply also to each real and imaginary component. AC is used through the normal-law construction and the countable-choice Riemann/Lebesgue bridge; no sequence of arbitrary witnesses is selected.

F1F2F3F4F5F6F7F8F9F11F19
2.1

For R1, the series in [F20] has nonnegative terms at R2/2, so eR2/2(R2/2)2/2=R4/8. By [F18], eR2/2=1/eR2/2; hence 0<g(R)8/(2πR4) and both g(R) and Rg(R) tend to zero. For each positive integer R, FTC on each half interval gives RRxg(x)dx=2[g(0)g(R)]. Thus MCT proves EZ=2g(0)<. Also RRxg(x)dx=g(R)g(R)=0; DCT with majorant xg(x) proves EZ=0. Integration by parts with u=x,v=g gives RRx2g(x)dx=RRg(x)dx2Rg(R). MCT and [F2] now give EZ2=1. All truncations here use the explicit integers R.

step 1.1F7F8F10F13F18F20F2
3.1

By the finite first moment and [F12], φZ(t)=ixeitxg(x)dx. On [R,R], componentwise integration by parts, using [F14]–[F15], gives xeitxg(x)dx=[eitxg(x)]RR+iteitxg(x)dx. The boundary has modulus at most 2g(R)0. The two integrands are dominated respectively by xg(x) and g(x), already integrable. DCT therefore gives φZ(t)=tφZ(t) for every t, with no improper differentiation left unjustified.

step 1.1step 2.1F8F12F13F14F15
4.1

By the real-component product and chain rules, H(t)=et2/2φZ(t) has derivative zero. Apply [F16] to its real and imaginary parts on every real interval. Since H(0)=g=1, H(t)=1 for all t, hence φZ(t)=et2/2. For X=m+σZ in law, [F17] yields eimtφZ(σt), and [F18] combines the exponents. Its moments follow by expanding the finite integrable expressions: EX=m+σEZ=m and E(Xm)2=σ2EZ2=σ2. For σ=0 the variable equals m almost surely and both formulas give the Dirac law directly.

step 2.1step 3.1F3F4F5F16F17F18
LemmaStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-13Open item page →

Second-order characteristic-function expansion

Statement

If EX=0 and EX2=σ2<, then φX(t)=1σ2t2/2+o(t2) as t0. No third moment or choice axiom is assumed. The same scalar estimates give 01cosuu2/2 for every real u. More precisely, for r(u)=eiu1iu+u2/2, r(u)min(u3/3,4u2),eiu1iuu2.

Facts & Assumptions

[F1]

Real Taylor remainders are bounded by the uniform next derivative bound. A uniform derivative bound gives a uniform Taylor remainder bound.

[F2]

Sine and cosine have derivatives of all orders bounded by one. The derivatives of sine and cosine are cosine and minus sine.

[F4]

DCT applies to the prescribed nonnegative majorant sequence below. Dominated convergence.

[F5]

Integrable real and complex linear combinations commute with integration. The Lebesgue integral is linear on L1(μ).

[F6]

The characteristic function is the expectation of the unit exponential. Characteristic function of a real random variable.

Proof

Given: If EX=0 and EX2=σ2<, then φX(t)=1σ2t2/2+o(t2) as t0. No third moment or choice axiom is assumed. The same scalar estimates give 01cosuu2/2 for every real u. More precisely, for r(u)=eiu1iu+u2/2, r(u)min(u3/3,4u2),eiu1iuu2.

1.1

Taylor at zero through degree two for cosine and sine, with third derivatives bounded by one, gives cosu1+u2/2u3/6 and sinuuu3/6. Euler form and the triangle inequality give r(u)u3/3. Taylor through degree one gives cosu1u2/2 and sinuuu2/2, hence eiu1iuu2. Adding u2/2 bounds r(u)3u2/24u2 for all real u. At u=0 all remainders vanish.

F1F2F3
2.1

For 0<t1/n, the first step gives r(tX)/t2X2min(X/(3n),4). This is a measurable nonnegative sequence tending pointwise to zero, bounded by the integrable 4X2. DCT therefore makes its expectations tend to zero. The bound is uniform over all such t, so Er(tX)=o(t2) as a genuine two-sided real limit, without choosing a sequence of frequencies or requiring EX3<. Also X1+X2 gives integrability of the linear term.

step 1.1F4
3.1

By linearity, φX(t)=1+itEXt2EX2/2+Er(tX). Insert the stated moments and the preceding remainder limit. If σ=0, the same majorants have zero integral, so the remainder vanishes and the formula still holds. At t=0 the defining expectation is one. Every limiting integrand was explicitly specified; no choice principle enters.

step 1.1step 2.1F5F6
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Products of near-one characteristic factors

Statement

Let each row (zn,k)1kkn be a finite family of complex numbers; empty rows are allowed with maximum zero. Suppose maxkzn,k10, M:=supnkzn,k1<, and kzn,k120. Then kzn,kexp ⁣(k(zn,k1))0.

Facts & Assumptions

[F1]

The exponential is its power series. The complex exponential by its power series.

[F2]

The series converges absolutely at every complex argument. The complex exponential series converges absolutely for every complex argument.

[F3]

Proof

Given: Let each row (zn,k)1kkn be a finite family of complex numbers; empty rows are allowed with maximum zero. Suppose maxkzn,k10, M:=supnkzn,k1<, and kzn,k120. Then kzn,kexp ⁣(k(zn,k1))0.

1.1

Put wn,k=zn,k1. For w1/2, absolute convergence gives ew1wj2wj/j!w2j2(1/2)j2/2=w2. Also 1+w1+wew and ewj0wj/j!=ew. The real series is nonnegative term by term, which proves the middle inequality without a logarithm.

F1F2F3
2.1

For arbitrary finite lists a,b of length r, subtracting successive mixed products gives k=1rakk=1rbk=j=1r(ajbj)(k<jak)(k>jbk). The cancellation follows by expanding each difference; for r=0 both products are one and the sum zero. Apply it with ak=1+wn,k and bk=ewn,k. For all sufficiently large n every modulus of w is at most 1/2. Each pair of partial products is bounded by exp(kjwn,k)eM, so the difference of the row products has modulus at most eMjwn,j2.

step 1.1algebra
3.1

The bound tends to zero by hypothesis. Repeated exponential addition identifies the comparison product with exp(kwn,k), including empty and one-factor rows. If M=0 then all w vanish and equality is exact in every row. All products and telescoping sums are finite; no branch of logarithm or choice principle is used.

step 2.1F3
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Lindeberg-Levy iid central limit theorem

Statement

Assume AC. Let (Xk)k1 be iid real random variables with mean m and variance 0<σ2<. Then k=1nXknmσn  N(0,1).

Facts & Assumptions

[F1]

Centered variance-one variables have characteristic function 1-t^2/2+o(t^2). Second-order characteristic-function expansion.

[F2]

Near-one rows with bounded absolute sum and vanishing square sum admit exponential comparison. Products of near-one characteristic factors.

[F3]

Affine transformations and finite independent sums have the stated transform identities. Characteristic functions under affine maps and independent sums.

[F4]

Under AC the standard normal has transform exp(-t^2/2). Characteristic function of a normal law.

[F5]

Under AC convergence to the transform of a specified law gives weak convergence. Characteristic function criterion for weak convergence.

[F6]

Linearity permits centering and variance calculations. The Lebesgue integral is linear on L1(μ).

Proof

Given: Assume AC. Let (Xk)k1 be iid real random variables with mean m and variance 0<σ2<. Then k=1nXknmσn  N(0,1).

1.1

Set Yk=(Xkm)/σ. The affine functions are Borel; independence is preserved because an event concerning Y_k is the corresponding inverse-image event concerning X_k. Their laws agree, and linearity gives EYk=0, EYk2=1. The normalized sum in the statement is n1/2k=1nYk. The positive finite variance makes every division well defined.

F6given
2.1

Fix a nonzero real t and write wn=φY1(t/n)1. By [F1], nwnt2/2. Therefore wn0, nwn is bounded, and nwn2=(nwn)wn0. The bounds extend to the finitely many early n since their values are finite. Apply [F2] to the row with n copies of 1+wn. Its product differs from enwn by a quantity tending to zero. Continuity of the exponential yields the limit et2/2. At t=0 each factor is exactly one.

step 1.1F1F2
3.1

By [F3], row independence identifies that product with the characteristic function of the normalized sum. By [F4] its limit is the standard-normal transform, continuous at zero and equal to one there. Thus [F5] proves the claimed convergence of laws. AC is inherited only through the normal-law and Levy-criterion suppliers; the iid sequence is given and no new copies are constructed. This theorem excludes sigma=0 because its displayed normalization divides by sigma.

step 2.1F3F4F5
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

AC supplies countable selections and prescribed serial paths

Statement

Assume AC. Then countable choice holds. Moreover, if RX×X is serial on a nonempty set X and aX, there is a sequence (xn)n0 with x0=a and xnRxn+1 for every n. Thus the countable and dependent choices required by the probability-product suppliers are available under AC.

Facts & Assumptions

[F1]

AC supplies a choice function on a set of nonempty sets. The Axiom of Choice.

[F2]

Countable choice is selection from an omega-indexed nonempty family. The Axiom of Countable Choice (ACω).

[F4]

A given self-map and initial point have a uniquely specified natural-number iterate sequence. The recursion theorem.

Proof

Given: Assume AC. Then countable choice holds. Moreover, if RX×X is serial on a nonempty set X and aX, there is a sequence (xn)n0 with x0=a and xnRxn+1 for every n. Thus the countable and dependent choices required by the probability-product suppliers are available under AC.

1.1

For an omega-indexed family (An) of nonempty sets, its image S={An:nN} is a set of nonempty sets. By [F1] choose c with c(A)A for every AS. Then b(n)=c(An) is a function and b(n)An, which is [F2]. Repeated sets use the same selected value and cause no ambiguity. For an empty index family the empty function already suffices; singleton fibers force their unique value.

F1F2
1.2

For the stated serial R, every fiber R[x]={yX:xRy} is nonempty. AC applied to the set of all these fibers gives c with c(R[x])R[x]. Define the self-map s(x)=c(R[x]) on X. No recursively changing choice is being assumed: s is now one fixed function chosen from a fixed set of nonempty fibers. It satisfies xRs(x) for every x.

F1F3
2.1

Apply [F4] to X, the prescribed a and s to obtain x0=a and xn+1=s(xn) for every natural n. The defining property of s gives xnRxn+1, precisely [F3]. If X has one element and R is serial, this is its constant sequence. Empty X is excluded by the prescribed a. The uses of AC are exactly the two fixed-family selections in steps 1.1 and 1.2; recursion itself requires no further choice. This proves the two implications from AC, not either converse.

step 1.1step 1.2F3F4
CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

De Moivre-Laplace central limit theorem

Statement

Assume AC and fix 0<p<1. If Bn has law Bin(n,p) for every n1, then (Bnnp)/np(1p)N(0,1). No relationship between the probability spaces of the Bn is required.

Facts & Assumptions

[F1]

Under dependent and countable choice a prescribed Bernoulli law has independent copies. Countably many independent copies of a prescribed law exist.

[F2]

AC implies dependent choice and countable choice. AC supplies countable selections and prescribed serial paths.

[F4]

The iid finite-positive-variance CLT applies under AC. Lindeberg-Levy iid central limit theorem.

[F5]

A binomial law is the law of a finite independent Bernoulli sum. Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials.

Proof

Given: Assume AC and fix 0<p<1. If Bn has law Bin(n,p) for every n1, then (Bnnp)/np(1p)N(0,1). No relationship between the probability spaces of the Bn is required.

1.1

By [F2], AC supplies the countable and dependent choice required in [F1]. Apply that result to the two-point probability with masses 1-p and p to obtain iid Bernoulli variables Ik. The law of Cn=k=1nIk is Bin(n,p) by [F5]. In particular it agrees with the specified law of B_n for each n; equality persists under the displayed affine standardization.

F1F2F5
2.1

By [F3], EIk=p and Var(Ik)=p(1p)>0. The variables are bounded, hence their second moments are finite. [F4] gives (Cnnp)/np(1p)N(0,1). Equality of laws in step 1.1 transfers the conclusion to B_n. The excluded p=0,1 and n=0 would make the denominator zero; no claim using that denominator is made there. Neither a finite-n error estimate nor continuity correction follows from this limit theorem.

step 1.1F3F4
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Row-wise independent centered triangular array

Definition

For each integer n1, let kn1 be a finite integer and let Xn,1,,Xn,kn be integrable real random variables on a probability space (Ωn,Fn,Pn). The family is a centered triangular array when EnXn,k=0 for every admissible pair (n,k). It is row-wise independent when, for each fixed n and all Borel sets B1,,Bkn, Pn ⁣(k=1kn{Xn,kBk})=k=1knPn(Xn,kBk). Taking unused Bk equal to the real line gives the same factorization for each subfamily; by Independent random elements are characterized by finite rectangle probabilities, this is exactly independence in Independent random elements. Random variables and integrability have the meanings in Random elements and real random variables and Expectation of a nonnegative or integrable random variable. There is no independence requirement between different rows. The spaces may differ with n; assertions about row sums compare their laws. A single-entry row is independent automatically, and deterministic zero entries are allowed. Empty rows are excluded by kn1. This definition makes no existence or choice assumption.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Total row variance and the Lindeberg condition

Definition

For a centered triangular array as in Row-wise independent centered triangular array, suppose every entry has finite second moment. Write vn,k=EnXn,k2=Varn(Xn,k),sn2=k=1knvn,k. Variance is defined in Moments, variance, and covariance on a probability space. Every term is finite and nonnegative, so the finite sum and its nonnegative square root s_n exist. Whenever sn>0, define Ln(ε)=sn2k=1knEn ⁣[Xn,k21{Xn,k>εsn}](ε>0). The Lindeberg condition is Ln(ε)0 for every fixed ε>0, with sn>0 for all n under consideration. The event is measurable because absolute value is continuous and the entries are measurable; products are measurable by Arithmetic and lattice operations preserve measurability whenever they are defined. Its nonnegative integrand is bounded by Xn,k2, so its expectation exists and is finite by Monotonicity and nonnegative homogeneity of the nonnegative integral and Expectation of a nonnegative or integrable random variable. In particular 0Ln(ε)1.

For Yn,k=Xn,k/sn, scalar homogeneity gives kEnYn,k2=1. The equality Yn,k>εXn,k>εsn gives Ln(ε)=kEn[Yn,k21{Yn,k>ε}]. Thus the normalized and unnormalized conditions are exactly equivalent, not merely asymptotic. The cutoff uses strict inequality; equality at the threshold is excluded. A zero-variance row is allowed in the initial variance definition, but its normalization and Lindeberg expression above are undefined. No independence or choice is needed to define these quantities.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

The Lindeberg condition implies Feller negligibility

Statement

For a centered triangular array with kEXn,k2=1, the Lindeberg condition implies Feller negligibility: maxkVar(Xn,k)0. Independence is not needed.

Facts & Assumptions

[F1]

In normalized rows the Lindeberg quantity is the sum of the truncated second moments. Total row variance and the Lindeberg condition.

[F2]

An integrable function splits into its two complementary restrictions. The Lebesgue integral is linear on L1(μ).

[F3]

Nonnegative integrals preserve pointwise inequalities. Monotonicity and nonnegative homogeneity of the nonnegative integral.

Proof

Given: For a centered triangular array with kEXn,k2=1, the Lindeberg condition implies Feller negligibility: maxkVar(Xn,k)0. Independence is not needed.

1.1

Fix ε>0. For each entry split its square on Xn,kε and its complement. The first integral is at most ε2P(Xn,kε)ε2. The second is one nonnegative term of Ln(ε). Centering identifies variance with second moment, hence 0maxkVar(Xn,k)ε2+Ln(ε). The maximum exists because the row is finite and nonempty.

F1F2F3
2.1

For any η>0, take 0<ε<η/2. Lindeberg gives an index after which Ln(ε)<η/2. The preceding bound is then less than eta, proving convergence to zero. Values at the cutoff stay in the small part, zero entries satisfy the bound, and a single variance-one summand in every row would contradict this conclusion and hence could not satisfy Lindeberg. The proof uses only given finite rows and explicit inequalities, not independence or choice.

step 1.1F1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Lindeberg-Feller central limit theorem: sufficiency

Statement

Assume AC. If a centered row-wise independent triangular array has finite second moments, sn>0 and the Lindeberg condition, then sn1k=1knXn,kN(0,1).

Facts & Assumptions

[F1]

Normalization makes total variance one and preserves the Lindeberg quantity. Total row variance and the Lindeberg condition.

[F2]

The scalar remainder obeys min(|u|^3/3,4u^2), and the centered exponential increment is bounded by u^2. Second-order characteristic-function expansion.

[F3]

Lindeberg implies maximal entry variance tends to zero. The Lindeberg condition implies Feller negligibility.

[F4]

The near-one product estimate controls the full growing row. Products of near-one characteristic factors.

[F5]

Finite row independence identifies the product transform. Characteristic functions under affine maps and independent sums.

[F6]

The standard-normal transform is exp(-t^2/2). Characteristic function of a normal law.

[F7]

Under AC pointwise convergence to a specified characteristic function implies weak convergence. Characteristic function criterion for weak convergence.

[F8]

Finite sums and centered integrable terms may be integrated linearly. The Lebesgue integral is linear on L1(μ).

[F9]

The modulus of a complex integral is bounded by the integral of the modulus. The modulus of an integral is bounded by the integral of the modulus.

Proof

Given: Assume AC. If a centered row-wise independent triangular array has finite second moments, sn>0 and the Lindeberg condition, then sn1k=1knXn,kN(0,1).

1.1

Put Yn,k=Xn,k/sn and vn,k=EYn,k2. By [F1], the normalized row has total variance one, remains centered and independent, and its tail sum Ln(ε) tends to zero. Fix real t and write wn,k=φYn,k(t)1. The centering and scalar bound in [F2] give wn,k=E(eitYn,k1itYn,k)t2vn,k, using [F8]–[F9]. Consequently kwn,kt2, maxkwn,kt2maxkvn,k0, and kwn,k2t4maxkvn,k0 by [F3].

F1F2F3F8F9
2.1

With r as in [F2], linearity gives kwn,k=t2/2+kEr(tYn,k). On Yn,kε the cubic bound gives r(tYn,k)t3εYn,k2/3; on the complement the quadratic bound gives r(tYn,k)4t2Yn,k2. Therefore kEr(tYn,k)t3ε/3+4t2Ln(ε). First take limsup in n, then let the arbitrary positive epsilon decrease to zero. This proves kwn,kt2/2, without interchanging an unbounded number of unquantified little-o terms.

step 1.1F2F8F9
3.1

All hypotheses of [F4] were verified in step 1.1, so k(1+wn,k)exp(kwn,k)0. Step 2.1 makes its limit et2/2. By [F5] this product is the row-sum transform, and by [F6] its limit is the transform of N(0,1), continuous at zero. [F7] proves the result. At t=0 all factors and the limit are exactly one. AC is inherited in [F6]–[F7]; rows on different probability spaces cause no difficulty because only their laws are compared.

step 1.1step 2.1F4F5F6F7
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Feller converse to Lindeberg-Feller

Statement

Assume AC. Let a centered row-wise independent triangular array satisfy kEXn,k2=1 and maxkVar(Xn,k)0. If kXn,kN(0,1), then it satisfies the Lindeberg condition.

Facts & Assumptions

[F1]

The scalar centered exponential increment has modulus at most u^2; its proof also gives 1-cos(u)<=u^2/2. Second-order characteristic-function expansion.

[F2]

Near-one products differ from the exponential of their summed increments by o(1). Products of near-one characteristic factors.

[F3]

The independent row sum has product characteristic function. Characteristic functions under affine maps and independent sums.

[F4]

The assumed weak convergence gives pointwise characteristic-function convergence. Levy continuity theorem forward direction.

[F5]

Under AC N(0,1) has transform exp(-t^2/2). Characteristic function of a normal law.

[F7]

Exponential addition and real extension identify the modulus as exp(real part). exp(z+w)=expzexpw, and the complex exponential extends the real exponential.

[F8]

The real nonnegative exponential series gives exp(d)>=1+d for d>=0. The complex exponential by its power series.

[F9]

Centering, real parts and finite sums commute with integration. The Lebesgue integral is linear on L1(μ).

[F10]

Complex expectation is bounded by the expectation of its absolute value. The modulus of an integral is bounded by the integral of the modulus.

[F11]

For total row variance one, Lindeberg is exactly convergence of the summed tail second moments. Total row variance and the Lindeberg condition.

Proof

Given: Assume AC. Let a centered row-wise independent triangular array satisfy kEXn,k2=1 and maxkVar(Xn,k)0. If kXn,kN(0,1), then it satisfies the Lindeberg condition.

1.1

Fix real t and put vn,k=EXn,k2 and wn,k=E(eitXn,k1). Centering, [F1], [F9] and [F10] give wn,kt2vn,k. Thus kwn,kt2, maxkwn,k0, and kwn,k2t4maxkvn,k0. By [F2]–[F5] and the assumed normal limit, exp(kwn,k)et2/2. This inference uses the forward continuity theorem only, not Lindeberg sufficiency.

F1F2F3F4F5F9F10
2.1

Define the nonnegative function dt(x)=t2x2/2(1cos(tx)). Nonnegativity follows from the cosine Taylor bound in [F1]; also dt(x)t2x2/2 because cos(tx)1. Hence Dn(t):=kEdt(Xn,k) is finite and nonnegative. Total variance one and [F9] give Rekwn,k=t2/2+Dn(t). Exponential addition and Euler modulus show exp(kwn,k)=et2/2+Dn(t). Step 1.1 therefore implies eDn(t)1. Since the nonnegative series gives 0Dn(t)eDn(t)1, we obtain Dn(t)0. No complex logarithm or subsequence of measures is needed.

step 1.1F1F6F7F8F9
3.1

Now fix any ε>0 and take the single frequency t=4/ε. On x>ε we have t2x2>16, and 1cos(tx)2 yields dt(x)t2x2/22t2x2/4. On the complementary set d_t is nonnegative. Integrating and summing gives kE[Xn,k21{Xn,k>ε}]4Dn(t)/t20. This is precisely [F11], for every positive epsilon. AC is inherited from the target normal-law construction; the proof uses no Helly selection, uniqueness inversion or backward application of sufficiency. Zero entries and t=0 in the earlier steps are harmless, but the final chosen t is nonzero.

step 2.1F6F11
CorollaryStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-13Open item page →

Lyapunov central limit theorem

Statement

Assume AC. Let a centered row-wise independent triangular array have finite second moments and sn>0. If for some δ>0 its (2+δ) moments are finite and sn(2+δ)kEXn,k2+δ0, then sn1kXn,kN(0,1).

Facts & Assumptions

[F1]

The unnormalized tail expression defines Lindeberg. Total row variance and the Lindeberg condition.

[F2]

Under AC Lindeberg implies a standard-normal limit for the normalized row sums. Lindeberg-Feller central limit theorem: sufficiency.

[F3]

Pointwise bounds pass to nonnegative expectations. Monotonicity and nonnegative homogeneity of the nonnegative integral.

[F5]

For positive a, a^r=exp(r log a); zero to a positive power is zero. Real powers for positive bases, with the zero-base positive-exponent convention.

Proof

Given: Assume AC. Let a centered row-wise independent triangular array have finite second moments and sn>0. If for some δ>0 its (2+δ) moments are finite and sn(2+δ)kEXn,k2+δ0, then sn1kXn,kN(0,1).

1.1

Fix ε>0. On Xn,k>εsn>0, monotonicity of the positive real power gives Xn,kδ>(εsn)δ. Multiplying by Xn,k2/(εsn)δ gives Xn,k2Xn,k2+δ/(εsn)δ there. Off that event the truncated square is zero and the right side is nonnegative, including X=0. [F3] therefore bounds Ln(ε)εδsn(2+δ)kEXn,k2+δ. The exponent simplification uses [F4]. For positive delta, monotonicity of log and exp in the defining formula [F5] gives the asserted power monotonicity.

F1F3F4F5
2.1

The right side tends to zero for this fixed positive epsilon, so Lindeberg holds for every epsilon. All hypotheses of [F2] are now satisfied: finite second moments, centered independent rows and positive total standard deviations were given. Apply it to obtain the stated limit. The positive delta is fixed across all rows; delta=0 is excluded because the displayed normalized second-moment sum would be one. AC is inherited from [F2].

step 1.1F2
DefinitionDefinition: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Multivariate normal law, including singular covariance

Definition

Assume AC and let d1 be finite. For mRd and a real symmetric positive semidefinite matrix Σ, a Borel probability law is denoted Nd(m,Σ) when a vector X with that law satisfies uXN(um,uTΣu) for every uRd. Such a law exists, has mean m and covariance Sigma, and can be realized as m+Σ1/2Z with independent standard-normal coordinates. Singular Sigma is allowed. Uniqueness will be proved in the following characteristic-function lemma.

Facts & Assumptions

[F1]

Normal laws have their specified means, variances and characteristic functions. Characteristic function of a normal law.

[F2]

A finite-dimensional positive semidefinite symmetric operator has a positive semidefinite square root. A non-negative operator has a unique non-negative square root.

[F3]

Independent standard-normal coordinates can be realized under DC and countable choice. Countably many independent copies of a prescribed law exist.

[F4]
[F5]

Finite independent linear combinations have product transforms. Characteristic functions under affine maps and independent sums.

[F6]

Under AC equality of scalar characteristic functions determines scalar laws. Uniqueness of a law from its characteristic function.

[F7]

Integrable products in distinct independent coordinates factor. Expectations factor over finite products of independent random variables.

[F8]

Finite linear combinations commute with expectations. The Lebesgue integral is linear on L1(μ).

[F9]

A law is the probability pushforward of a measurable random element. Law or distribution of a random element.

Proof

Given: Assume AC and let d1 be finite. For mRd and a real symmetric positive semidefinite matrix Σ, a Borel probability law is denoted Nd(m,Σ) when a vector X with that law satisfies uXN(um,uTΣu) for every uRd. Such a law exists, has mean m and covariance Sigma, and can be realized as m+Σ1/2Z with independent standard-normal coordinates. Singular Sigma is allowed. Uniqueness will be proved in the following characteristic-function lemma.

1.1

For any square-integrable vector X, covariance entries Σij=E[(Ximi)(Xjmj)] exist because 2aba2+b2. They are symmetric. Finite linearity gives uTΣu=E(iui(Ximi))20, so covariance matrices are positive semidefinite. Conversely let a symmetric positive semidefinite Sigma be given and take its nonnegative symmetric square root A by [F2], so AAT=A2=Σ.

F2F8
2.1

By [F3]–[F4], AC realizes d independent standard normals Z1,,Zd, each of mean zero and second moment one by [F1]. Define X=m+AZ. Coordinate linear combinations are measurable, so X is a Borel random vector and its pushforward is a probability by [F9]. For any u and real t, [F5] and [F1] give EeituX=eitumjet2(ATu)j2/2=eitumt2uTΣu/2. This equals the characteristic function of N(um,uTΣu) by [F1]; [F6] gives equality of scalar laws. Thus the required projection condition holds, including u=0 and all null directions.

step 1.1F1F3F4F5F6F9
3.1

Finite linearity gives EX=m. By [F7], EZiZj=0 for i different from j, and [F1] gives EZi2=1. Hence the covariance of AZ is AIAT=Σ, with every product integrable by the bound in step 1.1. If Sigma=0 then A=0 and the law is the point mass at m; no inverse or density is required even when only some directions are null. For d=1 the construction agrees with the scalar affine normal. If dimension zero is admitted, use the unique law on the singleton empty tuple instead. AC is spent in the standard-normal construction, independent-copy realization and scalar uniqueness supplier.

step 1.1step 2.1F1F7F8
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Characteristic function of a multivariate normal law

Statement

Assume AC. If XNd(m,Σ), then ΦX(t):=EeitX=exp(itmtTΣt/2)(tRd). This transform uniquely determines the law, including singular Sigma.

Facts & Assumptions

[F1]

Every linear projection has the specified scalar normal law, and the vector law exists. Multivariate normal law, including singular covariance.

[F2]

A scalar normal has transform exp(ims-sigma^2s^2/2). Characteristic function of a normal law.

[F3]

Under AC scalar laws with equal characteristic functions agree. Uniqueness of a law from its characteristic function.

[F4]

Under AC all linear projection laws determine the Borel vector law. Cramer wold device.

Proof

Given: Assume AC. If XNd(m,Σ), then ΦX(t):=EeitX=exp(itmtTΣt/2)(tRd). This transform uniquely determines the law, including singular Sigma.

1.1

For fixed t, [F1] makes tX scalar normal of mean tm and variance tTΣt. Evaluate its characteristic function from [F2] at scalar frequency one. This gives the displayed formula. If t=0 both sides are one; if tTΣt=0 the scalar law is the point mass at tm and the same formula applies.

F1F2
2.1

Let Y have another Borel probability law with the same displayed vector transform. For every u and scalar s, φuY(s)=ΦY(su)=ΦX(su)=φuX(s). Scalar uniqueness [F3] identifies each pair of projection laws. Then [F4] identifies the vector laws. Thus the construction in [F1] is independent of any realization choices. No determinant or inverse of Sigma is used. AC is inherited from [F1]–[F4]; in dimension zero the single possible law makes the assertion immediate.

step 1.1F1F3F4
TheoremStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-13Open item page →

Multivariate iid central limit theorem

Statement

Assume AC and let d1 be a finite integer. Let (Xk)k1 be iid Rd-valued random vectors with EX12<, mean m and covariance Sigma. Then n1/2k=1n(Xkm)Nd(0,Σ). The covariance may be singular.

Facts & Assumptions

[F1]

The scalar iid CLT applies in each positive-variance projection. Lindeberg-Levy iid central limit theorem.

[F2]

The Gaussian target with a positive semidefinite covariance exists, including singular covariance. Multivariate normal law, including singular covariance.

[F3]

Convergence of every projection to those of a specified Borel probability implies vector weak convergence. Cramer wold device.

[F4]

A nonnegative measurable function of integral zero vanishes almost everywhere. A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere.

[F5]

Finite means and covariance expansions obey linearity. The Lebesgue integral is linear on L1(μ).

[F7]

Continuous scalar scaling preserves convergence in distribution. Continuous mapping theorem.

Proof

Given: Assume AC and let d1 be a finite integer. Let (Xk)k1 be iid Rd-valued random vectors with EX12<, mean m and covariance Sigma. Then n1/2k=1n(Xkm)Nd(0,Σ). The covariance may be singular.

1.1

For each fixed uRd set Yk=u(Xkm). These are iid: inverse images under the continuous projection preserve the finite independence identities and the common law. By [F6], Yk2u2Xkm2; the latter is integrable since Xkm22Xk2+2m2. Each centered coordinate product is integrable by 2aba2+b2, and symmetry of these products gives Σij=Σji. Finite linearity gives EYk=0 and EYk2=uTΣu=:v0. Because this holds for every u, the symmetric matrix Σ is positive semidefinite. Consequently [F2] supplies the target law G=Nd(0,Σ).

F2F5F6
2.1

If v>0, [F1] gives (nv)1/2k=1nYkN(0,1). Scaling by v is continuous; [F7] gives n1/2kYkN(0,v), which is the u-projection of G by [F2]. If v=0, [F4] applied to Yk2 gives Yk=0 almost surely for each k. For each fixed n the union of the finitely many exceptional null sets is null, so the projected row sum is zero almost surely and has exactly the law N(0,0). Thus the same projection convergence holds without dividing by v.

step 1.1F1F2F4F7
3.1

The preceding convergence holds for every fixed u to the projections of the same specified probability G. [F3] therefore proves the vector conclusion. AC is inherited in the scalar CLT, Gaussian construction and Cramer–Wold theorem. A common null set across all u is neither claimed nor needed. When Sigma=0 all projections are in the zero-variance case. For d=1 this agrees with the scalar result after scaling.

step 2.1F3
RemarkRemark: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Central-limit convergence is only in distribution

Remarks

The conclusions of Lindeberg-Levy iid central limit theorem, Lindeberg-Feller central limit theorem: sufficiency and Multivariate iid central limit theorem compare the row-sum laws with a Gaussian law. In Convergence in distribution of random elements, the limit is specified by tests on laws; the theorem does not construct a Gaussian random vector jointly with the original summands. The AC hypotheses of the cited theorems remain in force when applying them.

By contrast, Convergence in probability requires the probabilities of distance-from-the-limit events on a common probability space to tend to zero. Almost-sure convergence of real random variables requires pointwise convergence outside a null set on such a space. Neither conclusion is supplied merely by identifying the Gaussian limit law; a coupling or further argument is required. These statements do not deny that a suitable coupling can sometimes give stronger convergence.

The special result Convergence in distribution to a constant is convergence in probability concerns a point-mass limit. It applies to scalar degenerate normal limits on a common space, but does not turn a positive-variance normal limit into convergence in probability to a newly chosen Gaussian. A multivariate fully degenerate Gaussian limit requires the corresponding vector argument, which that real-valued theorem does not supply; a singular covariance with some positive-variance directions still gives a nonconstant law. No convergence rate or almost-sure version is asserted here.

5 · Examples, counterexamples and false statements

None yet.

Sources