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 — Examples

1 · Prerequisites

2 · Summary

The examples calculate the moments and tail bounds behind the central limit theorems. Binomial interval probabilities illustrate raw and half-unit corrected normal approximations, with the correction explicitly separated from any error guarantee. Uniform summands give mean one half and variance one twelfth by polynomial integration.

Weighted symmetric signs satisfy Lyapunov despite distinct laws within a row. A centered Bernoulli array has growing total variance and uniformly bounded entries, making every Lindeberg tail event eventually empty. Perfectly correlated coordinates give a concrete Gaussian limit supported on a diagonal, with rank-one covariance.

Two counterexamples locate the hypotheses. The Cauchy density has infinite second moment, and its square-root-n normalized sums have no weak probability limit; its transform is computed using real density inversion. An array with one Gaussian entry and the rest zero has exactly normal row sums but fails Lindeberg, because its maximal variance never becomes small. Each construction states the inherited choice assumptions.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

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

Normal approximation to binomial probabilities

Example

Assume AC and fix 0<p<1. Write Φ(x)=xey2/2/2πdy. For fixed real a<b and BnBin(n,p) for every integer n1, P ⁣(aBnnpnp(1p)b)Φ(b)Φ(a). For a finite integer interval, continuity correction is a numerical approximation, not an error bound supplied by this theorem.

Facts & Assumptions

[F1]

Under AC standardized binomial laws converge to N(0,1). De Moivre-Laplace central limit theorem.

[F2]

Weak convergence gives probabilities of target continuity sets. Portmanteau theorem.

[F3]

The standard normal has density exp(-x^2/2)/sqrt(2pi). Standard normal and normal laws.

[F4]

Finite endpoint sets are Lebesgue null under countable choice. Every at most countable subset of Rn is Lebesgue null; in particular λ1(Q)=0.

Verification

Given: Assume AC and fix 0<p<1. Write Φ(x)=xey2/2/2πdy. For fixed real a<b and BnBin(n,p) for every integer n1, P ⁣(aBnnpnp(1p)b)Φ(b)Φ(a). For a finite integer interval, continuity correction is a numerical approximation, not an error bound supplied by this theorem.

1.1

The normal law assigns zero mass to each singleton: its bounded density integrates to zero on a Lebesgue-null singleton by [F3]–[F4]. The boundary of [a,b] is contained in the two endpoints, so it is a continuity set. Apply [F1] and the continuity-set implication of [F2] to get the displayed limit. Open, closed or half-open choices of the two fixed standardized endpoints have the same limit. If a=b the closed singleton has limiting probability zero; if a>b the event is empty.

F1F2F3F4
2.1

Take n=100,p=1/2 and the event 45B10055. Its mean is 50 and standard deviation is 100/4=5. Raw standardization gives endpoints -1 and 1, and the corresponding normal probability is Φ(1)Φ(1)0.68268949. The half-unit cell endpoints 89/2 and 111/2 give corrected standardized endpoints -1.1 and 1.1, and the corrected normal probability is Φ(1.1)Φ(1.1)0.72866788. These decimal evaluations are of the displayed normal integrals. The theorem does not bound either finite-n approximation error or prove that the correction always improves it. AC is inherited through [F1] and the normal-density and null-set construction.

step 1.1F1F3
ExampleConstruction: AI-adaptedVerification: AI-adaptedaudited 2026-09-13Open item page →

CLT for sums of uniform random variables

Example

Assume AC. If (Uk) are iid with density 1[0,1], then 12/n(k=1nUkn/2)N(0,1).

Facts & Assumptions

[F1]

The indicator density of [0,1] defines a measure. The indefinite integral of a nonnegative measurable function is a measure.

[F2]

For nonnegative measurable functions, integration under this law equals integration of the function times its density. Integrating against a density agrees with integrating the product.

[F5]
[F6]

Under DC and countable choice a given law has countably many independent copies. Countably many independent copies of a prescribed law exist.

[F7]

AC implies the two choice principles required for independent copies. AC supplies countable selections and prescribed serial paths.

[F8]

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

[F10]

A real integral is the integral of the positive part minus the integral of the negative part. Integrable real and complex functions, and their integrals.

Verification

Given: Assume AC. If (Uk) are iid with density 1[0,1], then 12/n(k=1nUkn/2)N(0,1).

1.1

The nonnegative Borel density 1[0,1] defines a measure by [F1]. On [0,1] the primitives x, x2/2 and x3/3 have derivatives 1,x and x2 by [F4]. Those derivatives are continuous and integrable by [F9], so [F3] and [F5] give integrals 1,1/2 and 1/3 respectively. Thus the measure is a probability. Apply [F2] separately to the globally nonnegative functions x+=max{x,0} and x=max{x,0}. Their products with the density are respectively x1[0,1] and zero, so [F10] gives EU=1/20=1/2. Applying [F2] to the nonnegative function x2 gives EU2=1/3, hence Var(U)=1/31/4=1/12. The density-supported integrands are bounded, so no tail or improper integral is involved.

F1F2F3F4F5F9F10
2.1

If copies need realization, [F7] lets AC supply the DC and countable choice in [F6]; the resulting coordinate variables have exactly this density law and are iid. For given iid U_k the same moment computation applies. [F8] gives (kUkn/2)/n/12N(0,1), and 1/n/12=12/n proves the displayed form. The variance is strictly positive and n>=1, so the normalization is defined. AC is used in the integral bridge, copy construction when needed, and CLT supplier.

step 1.1F6F7F8
ExampleConstruction: AI-adaptedVerification: AI-adaptedaudited 2026-09-13Open item page →

Lyapunov condition for nonidentical summands

Example

Assume AC. Take independent symmetric signs ϵn,k{1,1}, 1kn, and set Xn,k=kϵn,k. With sn2=k=1nk2, the Lyapunov condition holds for δ=1, and sn1k=1nXn,kN(0,1). In every row of length at least two the summand laws are distinct.

Facts & Assumptions

[F1]

The normalized third-moment condition implies the CLT with delta=1. Lyapunov central limit theorem.

[F2]

Under DC and countable choice independent copies of a two-point law exist. Countably many independent copies of a prescribed law exist.

[F3]

Verification

Given: Assume AC. Take independent symmetric signs ϵn,k{1,1}, 1kn, and set Xn,k=kϵn,k. With sn2=k=1nk2, the Lyapunov condition holds for δ=1, and sn1k=1nXn,kN(0,1). In every row of length at least two the summand laws are distinct.

1.1

Use [F2]–[F3] on the law assigning mass 1/2 to each sign, and index its coordinates by n(n1)/2+k for 1kn. These indices are distinct across the array and exhaust the positive integers. Thus the required signs exist and are independent. Direct two-point integration gives EXn,k=(kk)/2=0, EXn,k2=k2 and EXn,k3=k3. Different k have disjoint supports {k,k}, so their laws differ.

F2F3
2.1

At least n/2 integers k in the row satisfy kn/2, so sn2(n/2)(n/2)2=n3/8. Also k=1nk3nn3=n4. Hence sn3kEXn,k383/2/n0. These bounds remain valid for n=1. The rows are centered, independent and have finite moments and positive s_n, so [F1] with delta=1 proves the assertion. AC is used by the copy construction and inherited in [F1].

step 1.1F1
ExampleConstruction: AI-adaptedVerification: AI-adaptedaudited 2026-09-13Open item page →

A Lindeberg array with no identically distributed row

Example

Assume AC. For 1kn, take independent Bernoulli variables Bn,k with pn,k=k/(2n+2) and put Xn,k=Bn,kpn,k. The centered laws are distinct within each row of length at least two, yet the array satisfies Lindeberg and sn1kXn,kN(0,1).

Facts & Assumptions

[F1]

Under DC and countable choice the specified countable family of probability spaces has a product probability. Assuming countable and dependent choice, countable products of arbitrary probability spaces.

[F2]

The product coordinates are independent and have the specified laws. Coordinate random elements of a countable product are independent.

[F3]

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

[F5]

Under AC the Lindeberg condition gives a standard-normal limit. Lindeberg-Feller central limit theorem: sufficiency.

Verification

Given: Assume AC. For 1kn, take independent Bernoulli variables Bn,k with pn,k=k/(2n+2) and put Xn,k=Bn,kpn,k. The centered laws are distinct within each row of length at least two, yet the array satisfies Lindeberg and sn1kXn,kN(0,1).

1.1

Each 0<pn,k<1/2 defines a two-point probability. Index the pairs by n(n1)/2+k and use [F1]–[F3] to construct all coordinates independently. By [F4], the centered entry has mean zero and variance pn,k(1pn,k). Its values are pn,k and 1pn,k, both of absolute value less than one. Distinct p have distinct negative support points with positive mass, hence distinct centered laws. Normalizing every entry in a fixed row by the same positive s_n also preserves this distinction.

F1F2F3F4
2.1

Since 1pn,k>1/2, sn212k=1nk/(2n+2)=n/8. Here k=1nk=n(n+1)/2, obtained by pairing k with n+1-k and adding the n equal pair sums. Thus s_n is positive and tends to infinity. For any fixed epsilon>0, eventually εsn>1, so every event Xn,k>εsn is empty. The Lindeberg sum is then exactly zero. All second moments are finite, so [F5] gives the claimed limit. AC is used only through the stated product construction and CLT suppliers; no cross-row independence is needed by the theorem.

step 1.1F5
ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

A degenerate multivariate Gaussian limit

Example

Assume AC. Let Yk be centered iid real variables of variance σ2>0 and set Xk=(Yk,Yk). Then n1/2k=1nXk(Z,Z),ZN(0,σ2). The limit covariance is Σ=σ2(1111), a singular matrix of rank one.

Facts & Assumptions

[F1]

Iid vectors with finite second moments have the Gaussian covariance limit, even if singular. Multivariate iid central limit theorem.

[F2]

A Gaussian law is characterized by its normal projections. Multivariate normal law, including singular covariance.

[F3]

The projection-defined Gaussian law is unique. Characteristic function of a multivariate normal law.

[F4]

Scalar affine images have the stated characteristic functions. Characteristic functions under affine maps and independent sums.

[F5]

Scalar normals have the specified transform and variance. Characteristic function of a normal law.

[F6]

Equal scalar characteristic functions imply equal laws under AC. Uniqueness of a law from its characteristic function.

Verification

Given: Assume AC. Let Yk be centered iid real variables of variance σ2>0 and set Xk=(Yk,Yk). Then n1/2k=1nXk(Z,Z),ZN(0,σ2). The limit covariance is Σ=σ2(1111), a singular matrix of rank one.

1.1

The vector has mean (0,0), second norm moment 2EYk2=2σ2, and each covariance entry equals EYk2=σ2. The two columns of Sigma agree and are nonzero, so its rank is one and determinant zero. Its eigenvectors (1,1) and (1,-1) have eigenvalues 2σ2 and zero. [F1] therefore gives convergence to N2(0,Σ).

F1
2.1

For a scalar ZN(0,σ2), every projection of (Z,Z) is (u1+u2)Z. By [F4]–[F6], this has law N(0,σ2(u1+u2)2), including a negative coefficient and coefficient zero. Since uTΣu=σ2(u1+u2)2, [F2]–[F3] identify (Z,Z) with the target law. It is supported on the diagonal, and the (1,-1) projection is identically zero both before and after the limit. If the optional case sigma=0 is allowed, all centered Y_k vanish almost surely and the example reduces to the point mass (0,0). AC is inherited from the Gaussian and multivariate CLT suppliers.

step 1.1F2F3F4F5F6
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Infinite variance can defeat square-root-n CLT scaling

Statement refuted

Assume AC. There are iid real variables with density c(x)=1/[π(1+x2)] and infinite second moment such that n1/2k=1nXk has no weak limit. In particular square-root-n scaling need not produce a normal limit when finite variance is dropped.

Facts & Assumptions

[F2]

Compact continuous Riemann integrals agree with Lebesgue integrals under countable choice. A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral.

[F3]

The real exponential differentiates to itself. The exponential function is smooth and (exp)=exp.

[F4]

Trigonometric derivatives justify real-component exponential antiderivatives. The derivatives of sine and cosine are cosine and minus sine.

[F6]

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

[F7]

Integrable density majorants allow complex truncation limits. Dominated convergence.

[F8]

A nonnegative measurable density defines a measure. The indefinite integral of a nonnegative measurable function is a measure.

[F9]

For nonnegative measurable f and g, integration against the density measure fdμ satisfies gd(fdμ)=gfdμ. Integrating against a density agrees with integrating the product.

[F11]

Arctangent takes its values strictly between -pi/2 and pi/2. The principal inverse tangent arctan:R(π/2,π/2).

[F12]

An integrable transform gives a continuous probability density by inversion under AC. Density inversion from an integrable characteristic function.

[F14]

Independent copies of a given law exist under DC and countable choice. Countably many independent copies of a prescribed law exist.

[F15]

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

[F16]

Independent sums and scalar scaling give product transforms. Characteristic functions under affine maps and independent sums.

[F17]

Weak convergence would force convergence of every characteristic-function value. Levy continuity theorem forward direction.

[F18]

Every characteristic function is continuous at zero and equals one there. Basic properties of characteristic functions.

[F20]

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

[F21]

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

Counterexample

Given: Assume AC. There are iid real variables with density c(x)=1/[π(1+x2)] and infinite second moment such that n1/2k=1nXk has no weak limit. In particular square-root-n scaling need not produce a normal limit when finite variance is dropped.

1.1

First construct the symmetric Laplace density l(x)=ex/2. On [0,R] the primitive of ex is ex, so [F1]–[F3], [F5] and [F20] give integral 1eR; the other half interval gives the same value by the primitive ex. The bridge [F2] and MCT [F6] yield l=1. The elementary exponential series bound eR1+R makes eR0. Thus [F8] defines a probability with density l. For every bounded measurable complex h=u+iv, apply [F9] to u+,u,v+,v; these four functions are bounded by h, so their products with l have finite integral. The real/imaginary definition [F21] then gives hd(ldλ)=hldλ. In particular the characteristic function of the constructed law is its density integral. For real t, componentwise differentiation using [F3]–[F5] gives the primitive e(1+it)x/(1+it) on the positive half-line and e(1+it)x/(1+it) on the negative half-line. Their nonzero denominators have modulus at least one. Taking integer R limits with DCT majorant ex and [F19] gives φl(t)=12((1it)1+(1+it)1)=1/(1+t2).

F1F2F3F4F5F6F7F8F9F19F20F21
2.1

By [F10]–[F11], RR(1+t2)1dt=arctanRarctan(R)<π. The integrands are continuous, so the bridge and MCT make φl Lebesgue integrable. [F12] supplies the continuous density f(y)=(2π)1eity/(1+t2)dt for the Laplace law. It equals l everywhere: both are continuous and have the same integral on every interval, whereas any nonzero value of f-l would, by continuity, have one strict sign bounded away from zero on a nonempty interval, contradicting that integral equality and [F13]. At y=0 this identity gives (1+t2)1dt=π. Therefore [F8] makes c a probability density. At y=-u the same identity, multiplied by two, gives eiuxc(x)dx=eu. No contour integral is used.

step 1.1F1F2F6F8F10F11F12F13F20
3.1

For R>=1, 1Rx2c(x)dx(R1)/(2π) because x2/(1+x2)1/2 for x>=1. Nonnegative integral monotonicity and [F13] give this lower bound, tending to infinity; [F9] identifies the second moment as infinite. By [F14]–[F15], AC realizes iid copies of the c law. By [F16], their normalized-sum characteristic function is (et/n)n=ent. It tends to zero for t different from zero and stays one at zero.

step 2.1F9F13F14F15F16
4.1

If those row laws had any weak limit probability, [F17] would make its characteristic function equal to the pointwise limit just calculated. That function is discontinuous at zero, contradicting [F18]. Thus there is no weak probability limit, and in particular no normal limit. AC was used through the Lebesgue bridge, density inversion and independent-copy construction; the direct moment lower bound and discontinuity argument make no additional selections.

step 3.1F17F18
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedaudited 2026-09-13Open item page →

Feller negligibility cannot be removed from the converse

Statement refuted

Assume AC. A centered row-wise independent triangular array can have total row variance one and row-sum law N(0,1) for every n, while its maximum summand variance stays one and Lindeberg fails. Thus Feller negligibility cannot be omitted from the converse theorem.

Facts & Assumptions

[F1]

A variable with standard normal law has mean zero and variance one. Characteristic function of a normal law.

[F2]

Normalized Lindeberg quantities are the summed tail second moments. Total row variance and the Lindeberg condition.

[F3]

The normal tail second moment is an integral against its positive density. Integrating against a density agrees with integrating the product.

[F5]

The exponential is positive and increasing on the real line. The exponential function is strictly increasing.

[F6]

A positive pointwise lower bound gives a positive integral lower bound. Monotonicity and nonnegative homogeneity of the nonnegative integral.

[F7]

Under AC, the standard normal density defines a probability measure N(0,1) on R. Standard normal and normal laws.

Counterexample

Given: Assume AC. A centered row-wise independent triangular array can have total row variance one and row-sum law N(0,1) for every n, while its maximum summand variance stays one and Lindeberg fails. Thus Feller negligibility cannot be omitted from the converse theorem.

1.1

On the standard-normal probability space supplied by [F7], let Z be its coordinate and define Xn,1=Z, Xn,k=0 for 2kn. By [F1], every entry is centered and the total variance is one. Each row is independent: if an event for a zero coordinate excludes zero, both the intersection probability and the product are zero; otherwise all those events are the full space and the identity reduces to the event for Z. Thus the row sum is exactly Z for every n, its law is N(0,1), and the maximum summand variance equals one. Independence between rows is not required.

F1F7
2.1

For each fixed epsilon>0, [F2] gives the Lindeberg quantity E[Z21{Z>ε}], independent of n. On [ε+1,ε+2], the integrand against the normal density is at least (ε+1)2e(ε+2)2/2/2π>0, by [F3] and [F5]. Integrating this bound over the length-one interval with [F4]–[F6] proves strict positivity. Hence the Lindeberg limit is not zero for any epsilon>0, despite exact normality of all row sums. The example works for n=1 as well. AC is inherited solely through construction of the normal law and its Lebesgue density; one Z is reused and no independent sequence across rows is constructed.

step 1.1F2F3F4F5F6

Sources