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
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Equivalent Forms of Completeness
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Further Trigonometric Identities and Inverse Functions
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
- Weak Laws and Series of Independent Random Variables
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
Normal approximation to binomial probabilities
Example
Assume AC and fix . Write . For fixed real and for every integer , For a finite integer interval, continuity correction is a numerical approximation, not an error bound supplied by this theorem.
Facts & Assumptions
Under AC standardized binomial laws converge to N(0,1). De Moivre-Laplace central limit theorem.
Weak convergence gives probabilities of target continuity sets. Portmanteau theorem.
The standard normal has density exp(-x^2/2)/sqrt(2pi). Standard normal and normal laws.
Finite endpoint sets are Lebesgue null under countable choice. Every at most countable subset of is Lebesgue null; in particular .
Verification
Given: Assume AC and fix . Write . For fixed real and for every integer , For a finite integer interval, continuity correction is a numerical approximation, not an error bound supplied by this theorem.
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.
Take n=100,p=1/2 and the event . Its mean is 50 and standard deviation is . Raw standardization gives endpoints -1 and 1, and the corresponding normal probability is . The half-unit cell endpoints and give corrected standardized endpoints -1.1 and 1.1, and the corrected normal probability is . 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.
CLT for sums of uniform random variables
Example
Assume AC. If are iid with density , then
Facts & Assumptions
The indicator density of [0,1] defines a measure. The indefinite integral of a nonnegative measurable function is a measure.
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.
Continuous polynomial derivatives integrate to primitive differences. The second fundamental theorem: if is differentiable on with and is integrable, then .
The derivatives of the relevant integer powers have the usual coefficients. For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term.
The compact Riemann and Lebesgue integrals agree under countable choice. A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral.
Under DC and countable choice a given law has countably many independent copies. Countably many independent copies of a prescribed law exist.
AC implies the two choice principles required for independent copies. AC supplies countable selections and prescribed serial paths.
The iid CLT applies to finite positive variance. Lindeberg-Levy iid central limit theorem.
Continuous compact-interval powers are Riemann integrable. A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion.
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 are iid with density , then
The nonnegative Borel density defines a measure by [F1]. On [0,1] the primitives x, and have derivatives 1,x and 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 and . Their products with the density are respectively and zero, so [F10] gives . Applying [F2] to the nonnegative function gives , hence . The density-supported integrands are bounded, so no tail or improper integral is involved.
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 , and 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.
Lyapunov condition for nonidentical summands
Example
Assume AC. Take independent symmetric signs , , and set . With , the Lyapunov condition holds for , and . In every row of length at least two the summand laws are distinct.
Facts & Assumptions
The normalized third-moment condition implies the CLT with delta=1. Lyapunov central limit theorem.
Under DC and countable choice independent copies of a two-point law exist. Countably many independent copies of a prescribed law exist.
AC supplies those choice principles. AC supplies countable selections and prescribed serial paths.
Verification
Given: Assume AC. Take independent symmetric signs , , and set . With , the Lyapunov condition holds for , and . In every row of length at least two the summand laws are distinct.
Use [F2]–[F3] on the law assigning mass 1/2 to each sign, and index its coordinates by for . 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 , and . Different k have disjoint supports , so their laws differ.
At least n/2 integers k in the row satisfy , so . Also . Hence . 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].
A Lindeberg array with no identically distributed row
Example
Assume AC. For , take independent Bernoulli variables with and put . The centered laws are distinct within each row of length at least two, yet the array satisfies Lindeberg and .
Facts & Assumptions
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.
The product coordinates are independent and have the specified laws. Coordinate random elements of a countable product are independent.
AC supplies dependent and countable choice. AC supplies countable selections and prescribed serial paths.
Bernoulli p has mean p and variance p(1-p). A Bernoulli variable has mean and variance ; a binomial variable has mean and variance .
Under AC the Lindeberg condition gives a standard-normal limit. Lindeberg-Feller central limit theorem: sufficiency.
Verification
Given: Assume AC. For , take independent Bernoulli variables with and put . The centered laws are distinct within each row of length at least two, yet the array satisfies Lindeberg and .
Each defines a two-point probability. Index the pairs by and use [F1]–[F3] to construct all coordinates independently. By [F4], the centered entry has mean zero and variance . Its values are and , 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.
Since , . Here , 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 , so every event 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.
A degenerate multivariate Gaussian limit
Example
Assume AC. Let be centered iid real variables of variance and set . Then The limit covariance is , a singular matrix of rank one.
Facts & Assumptions
Iid vectors with finite second moments have the Gaussian covariance limit, even if singular. Multivariate iid central limit theorem.
A Gaussian law is characterized by its normal projections. Multivariate normal law, including singular covariance.
The projection-defined Gaussian law is unique. Characteristic function of a multivariate normal law.
Scalar affine images have the stated characteristic functions. Characteristic functions under affine maps and independent sums.
Scalar normals have the specified transform and variance. Characteristic function of a normal law.
Equal scalar characteristic functions imply equal laws under AC. Uniqueness of a law from its characteristic function.
Verification
Given: Assume AC. Let be centered iid real variables of variance and set . Then The limit covariance is , a singular matrix of rank one.
The vector has mean (0,0), second norm moment , and each covariance entry equals . 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 and zero. [F1] therefore gives convergence to .
For a scalar , every projection of (Z,Z) is . By [F4]–[F6], this has law , including a negative coefficient and coefficient zero. Since , [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.
Infinite variance can defeat square-root-n CLT scaling
Statement refuted
Assume AC. There are iid real variables with density and infinite second moment such that has no weak limit. In particular square-root-n scaling need not produce a normal limit when finite variance is dropped.
Facts & Assumptions
Continuous derivatives integrate to compact endpoint differences. The second fundamental theorem: if is differentiable on with and is integrable, then .
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.
The real exponential differentiates to itself. The exponential function is smooth and .
Trigonometric derivatives justify real-component exponential antiderivatives. The derivatives of sine and cosine are cosine and minus sine.
The chain rule applies to real linear changes of variable. The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with .
Increasing nonnegative integer truncations converge in integral. Monotone convergence for the integral.
Integrable density majorants allow complex truncation limits. Dominated convergence.
A nonnegative measurable density defines a measure. The indefinite integral of a nonnegative measurable function is a measure.
For nonnegative measurable and , integration against the density measure satisfies . Integrating against a density agrees with integrating the product.
The derivative of arctangent is 1/(1+x^2). Principal arctangent: derivative, integral, power series, and the Gregory–Leibniz series.
Arctangent takes its values strictly between -pi/2 and pi/2. The principal inverse tangent .
An integrable transform gives a continuous probability density by inversion under AC. Density inversion from an integrable characteristic function.
A real interval has Lebesgue measure its length. A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included.
Independent copies of a given law exist under DC and countable choice. Countably many independent copies of a prescribed law exist.
AC supplies dependent and countable choice. AC supplies countable selections and prescribed serial paths.
Independent sums and scalar scaling give product transforms. Characteristic functions under affine maps and independent sums.
Weak convergence would force convergence of every characteristic-function value. Levy continuity theorem forward direction.
Every characteristic function is continuous at zero and equals one there. Basic properties of characteristic functions.
The oscillatory exponential has unit modulus. , , and .
Continuous functions on compact intervals are Riemann integrable. A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion.
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 and infinite second moment such that has no weak limit. In particular square-root-n scaling need not produce a normal limit when finite variance is dropped.
First construct the symmetric Laplace density . On [0,R] the primitive of is , so [F1]–[F3], [F5] and [F20] give integral ; the other half interval gives the same value by the primitive . The bridge [F2] and MCT [F6] yield . The elementary exponential series bound makes . Thus [F8] defines a probability with density l. For every bounded measurable complex , apply [F9] to ; these four functions are bounded by , so their products with have finite integral. The real/imaginary definition [F21] then gives . In particular the characteristic function of the constructed law is its density integral. For real t, componentwise differentiation using [F3]–[F5] gives the primitive on the positive half-line and on the negative half-line. Their nonzero denominators have modulus at least one. Taking integer R limits with DCT majorant and [F19] gives .
By [F10]–[F11], . The integrands are continuous, so the bridge and MCT make Lebesgue integrable. [F12] supplies the continuous density 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 . Therefore [F8] makes c a probability density. At y=-u the same identity, multiplied by two, gives . No contour integral is used.
For R>=1, because 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 . It tends to zero for t different from zero and stays one at zero.
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.
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
A variable with standard normal law has mean zero and variance one. Characteristic function of a normal law.
Normalized Lindeberg quantities are the summed tail second moments. Total row variance and the Lindeberg condition.
The normal tail second moment is an integral against its positive density. Integrating against a density agrees with integrating the product.
An interval of length one has Lebesgue measure one. A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included.
The exponential is positive and increasing on the real line. The exponential function is strictly increasing.
A positive pointwise lower bound gives a positive integral lower bound. Monotonicity and nonnegative homogeneity of the nonnegative integral.
Under AC, the standard normal density defines a probability measure on . 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.
On the standard-normal probability space supplied by [F7], let Z be its coordinate and define , for . 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.
For each fixed epsilon>0, [F2] gives the Lindeberg quantity , independent of n. On , the integrand against the normal density is at least , 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.
Sources
- Durrett, Probability: Theory and Examples, Section 3.1
- Aldous and Chewi, Probability Theory notes, Corollary 6.1
- Durrett, Probability: Theory and Examples, Section 3.4.1
- Aldous and Chewi, Probability Theory notes, Theorem 5.2
- Durrett, Probability: Theory and Examples, exercises after Theorem 3.4.10
- Aldous and Chewi, Probability Theory notes, Corollary 6.2
- Durrett, Probability: Theory and Examples, Examples 3.4.11-3.4.13
- Billingsley, Probability and Measure, Section 27
- Norris, Probability and Measure, Section 8.1
- Aldous and Chewi, Probability Theory notes, Lecture 8
- Durrett, Probability: Theory and Examples, Example 3.3.16
- Billingsley, Probability and Measure, continuity theorem
- Durrett, Probability: Theory and Examples, discussion after Theorem 3.4.14
- Billingsley, Probability and Measure, Example 28.4