- Art Gallery -


In probability theory, the central limit theorem (CLT) states that, given certain conditions, the mean of a sufficiently large number of independent random variables, each with finite mean and variance, will be approximately normally distributed.[1] The central limit theorem has a number of variants. In its common form, the random variables must be identically distributed. In variants, convergence of the mean to the normal distribution also occurs for non-identical distributions, given that they comply with certain conditions.

In more general probability theory, a central limit theorem is any of a set of weak-convergence theories. They all express the fact that a sum of many independent and identically distributed (i.i.d.) random variables, or alternatively, random variables with specific types of dependence, will tend to be distributed according to one of a small set of attractor distributions. When the variance of the i.i.d. variables is finite, the attractor distribution is the normal distribution. In contrast, the sum of a number of i.i.d. random variables with power law tail distributions decreasing as 1/|x|α + 1 where 0 < α < 2 (and therefore having infinite variance) will tend to an alpha-stable distribution with stability parameter (or index of stability) of α as the number of variables grows.[2]

Central limit theorems for independent sequences
A distribution being "smoothed out" by summation, showing original density of distribution and three subsequent summations; see Illustration of the central limit theorem for further details.
Classical CLT

Let \( \{X_1,\ldots,X_n\} \) be a random sample of size n—that is, a sequence of independent and identically distributed random variables drawn from distributions of expected values given by µ and finite variances given by σ2. Suppose we are interested in the sample average

\( S_n:=(X_1+\cdots+X_n)/n \)

of these random variables. By the law of large numbers, the sample averages converge in probability and almost surely to the expected value µ as n tends to infinity. The classical central limit theorem describes the size and the distributional form of the stochastic fluctuations around the deterministic number µ during this convergence. More precisely, it states that as n gets larger, the distribution of the difference between the sample average Sn and its limit µ, when blown up by the factor √n (that is √n(Sn − µ)), approximates the normal distribution with mean 0 and variance σ2. For fixed large n one can also say that the distribution of Sn is close to the normal distribution with mean µ and variance 1nσ2. The true strength of the theorem is that the distribution of √n(Sn − µ) approaches normality regardless of the shape of the distribution of the individual Xi’s. Formally, the theorem can be stated as follows:

Lindeberg–Lévy CLT: Suppose {Xi}i∈ℕ is a sequence of i.i.d. random variables with E[Xi] = µ and Var[Xi] = σ2 < ∞. Then as n approaches infinity, the random variables √n(Sn − µ) converge in distribution to a normal N(0, σ2):[3]

\( \sqrt{n}\bigg(\bigg(\frac{1}{n}\sum_{i=1}^n X_i\bigg) - \mu\bigg)\ \xrightarrow{d}\ \mathcal{N}(0,\;\sigma^2). \)

In the case σ > 0, convergence in distribution means that the cumulative distribution functions of √n(Sn − µ) converge pointwise to the cdf of the N(0, σ2) distribution: for every real number z,

\( \lim_{n\to\infty} \Pr[\sqrt{n}(S_n-\mu) \le z] = \Phi(z/\sigma), \)

where Φ(x) is the standard normal cdf evaluated at x. Note that the convergence is uniform in z in the sense that

\( \lim_{n\to\infty}\sup_{z\in{\mathbb R}}\bigl|\Pr[\sqrt{n}(S_n-\mu) \le z] - \Phi(z/\sigma)\bigr| = 0. \)

where \( \sup \) denotes the least upper bound (or supremum) of the set.

Lyapunov CLT

The theorem is named after a Russian mathematician Aleksandr Lyapunov. In this variant of the central limit theorem the random variables Xi have to be independent, but not necessarily identically distributed. The theorem also requires that random variables |Xi| have moments of some order (2 + δ), and that the rate of growth of these moments is limited by the Lyapunov condition given below.

Lyapunov CLT:[4] let {Xi} be a sequence of independent random variables, each having a finite expected value μi and variance σ 2
i .

Define \( s_{n}^{2 } = \sum_{i=1}^{n} \sigma^{2 } \). If for some δ > 0, the Lyapunov’s condition

\( \lim_{n\to\infty} \frac{1}{s_{n}^{2+\delta}} \sum_{i=1}^{n} \operatorname{E}\big[\,|X_{i} - \mu_{i}|^{2+\delta}\,\big] = 0 \)

is satisfied, then a sum of (Xi − μi)/sn converges in distribution to a standard normal random variable, as n goes to infinity:

\( \frac{1}{s_n} \sum_{i=1}^{n} (X_i - \mu_i) \ \xrightarrow{d}\ \mathcal{N}(0,\;1). \)

In practice it is usually easiest to check the Lyapunov’s condition for δ = 1. If a sequence of random variables satisfies Lyapunov’s condition, then it also satisfies Lindeberg’s condition. The converse implication, however, does not hold.
Lindeberg CLT
Main article: Lindeberg's condition

In the same setting and with the same notation as above, the Lyapunov condition can be replaced with the following weaker one (from Lindeberg in 1920). For every ε > 0

\( \lim_{n \to \infty} \frac{1}{s_n^2}\sum_{i = 1}^{n} \operatorname{E}\big[ (X_i - \mu_i)^2 \cdot \mathbf{1}_{\{ | X_i - \mu_i | > \varepsilon s_n \}} \big] = 0 \)

where 1{…} is the indicator function. Then the distribution of the standardized sums \( \frac{1}{s_n}\sum_{i = 1}^n \left( X_i - \mu_i \right) \) converges towards the standard normal distribution N(0,1).
Multidimensional CLT

Proofs that use characteristic functions can be extended to cases where each individual \( X_1, X_2, X_3, ..., X_n \) is an independent and identically distributed random vector in \( \mathbb{R}^k \), with mean vector \( \mu=E\left ( X_i\right ) \) and covariance matrix Σ (amongst the individual components of the vector). Now, if we take the summations of these vectors as being done componentwise, then the multidimensional central limit theorem states that when scaled, these converge to a multivariate normal distribution.[5]


\( \mathbf{X_i}=\begin{bmatrix} X_{i(1)} \\ \vdots \\ X_{i(k)} \end{bmatrix} \) be the i-vector. The bold in \( \( \mathbf{X_i} \) means that it is a random vector, not a random (univariate) variable.

Then the sum of the random vectors will be

\( \begin{bmatrix} X_{1(1)} \\ \vdots \\ X_{1(k)} \end{bmatrix}+\begin{bmatrix} X_{2(1)} \\ \vdots \\ X_{2(k)} \end{bmatrix}+...+\begin{bmatrix} X_{n(1)} \\ \vdots \\ X_{n(k)} \end{bmatrix}= \begin{bmatrix} \sum_{i=1}^{n} \left [ X_{i(1)} \right ] \\ \vdots \\ \sum_{i=1}^{n} \left [ X_{i(k)} \right ] \end{bmatrix} =\sum_{i=1}^{n} \left [ \mathbf{X_i} \right ] \)

and the average will be

\(\left (\frac{1}{n}\right)\sum_{i=1}^{n} \left [ \mathbf{X_i} \right ]= \frac{1}{n}\begin{bmatrix} \sum_{i=1}^{n} \left [ X_{i(1)} \right ] \\ \vdots \\ \sum_{i=1}^{n} \left [ X_{i(k)} \right ] \end{bmatrix}=\begin{bmatrix} \bar X_{i(1)} \\ \vdots \\ \bar X_{i(k)} \end{bmatrix}=\mathbf{\bar X_n} \)

and therefore

\( \frac{1}{\sqrt{n}} \sum_{i=1}^{n} \left [ \mathbf{X_i} - E\left ( X_i\right ) \right ]=\frac{1}{\sqrt{n}}\sum_{i=1}^{n} \left [ \mathbf{X_i} - \mu \right ]=\sqrt{n}\left(\mathbf{\overline{X}}_n - \mu\right) . \)

The multivariate central limit theorem states that

\( \sqrt{n}\left(\mathbf{\overline{X}}_n - \mu\right)\ \stackrel{D}{\rightarrow}\ \mathcal{N}_k(0,\Sigma) \)

where the covariance matrix \( \Sigma \) is equal to

\( \Sigma=\begin{bmatrix} {\color{Red}Var \left (X_{1(1)} \right)} & {\color{OliveGreen}Cov \left (X_{1(1)},X_{1(2)} \right)} & Cov \left (X_{1(1)},X_{1(3)} \right) & \cdots & Cov \left (X_{1(1)},X_{1(n)} \right) \\ {\color{OliveGreen}Cov \left (X_{1(2)},X_{1(1)} \right)} & {\color{Turquoise}Var \left (X_{1(2)} \right)} & {\color{RubineRed}Cov \left (X_{1(2)},X_{1(3)} \right)} & \cdots & Cov \left (X_{1(2)},X_{1(k)} \right) \\ Cov \left (X_{1(3)},X_{1(1)} \right) & {\color{RubineRed}Cov \left (X_{1(3)},X_{1(2)} \right)} & Var \left (X_{1(3)} \right) & \cdots & Cov \left (X_{1(3)},X_{1(k)} \right) \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ Cov \left (X_{1(k)},X_{1(1)} \right) & Cov \left (X_{1(k)},X_{1(2)} \right) & Cov \left (X_{1(k)},X_{1(3)} \right) & \cdots & Var \left (X_{1(k)} \right) \\ \end{bmatrix}. \)

Central limit theorems for dependent processes
CLT under weak dependence

A useful generalization of a sequence of independent, identically distributed random variables is a mixing random process in discrete time; "mixing" means, roughly, that random variables temporally far apart from one another are nearly independent. Several kinds of mixing are used in ergodic theory and probability theory. See especially strong mixing (also called α-mixing) defined by α(n) → 0 where α(n) is so-called strong mixing coefficient.

A simplified formulation of the central limit theorem under strong mixing is given in (Billingsley 1995, Theorem 27.4):

Theorem. Suppose that X1, X2, … is stationary and α-mixing with αn = O(n−5) and that E(Xn) = 0 and E(Xn12) < ∞. Denote Sn = X1 + … + Xn, then the limit σ2 = lim nn − 1E(Sn2) exists, and if σ ≠ 0 then \( S_n / (\sigma \sqrt n) \) converges in distribution to N(0, 1).

In fact, σ2 = E(X12) + 2∑k=1E(X1X1+k), where the series converges absolutely.

The assumption σ ≠ 0 cannot be omitted, since the asymptotic normality fails for Xn = Yn − Yn−1 where Yn are another stationary sequence.

For the theorem in full strength see (Durrett 1996, Sect. 7.7(c), Theorem (7.8)); the assumption E(Xn12) < ∞ is replaced with E(|Xn|2 + δ) < ∞, and the assumption αn = O(n − 5) is replaced with \( \sum_n \alpha_n^{\frac\delta{2(2+\delta)}} < \infty \) . Existence of such δ > 0 ensures the conclusion. For encyclopedic treatment of limit theorems under mixing conditions see (Bradley 2005).

Martingale difference CLT
Main article: Martingale central limit theorem

Theorem. Let a martingale Mn satisfy

\( \frac1n \sum_{k=1}^n \mathrm{E} ((M_k-M_{k-1})^2 | M_1,\dots,M_{k-1}) \to 1 \) in probability as n tends to infinity,
for every ε > 0, \( \frac1n \sum_{k=1}^n \mathrm{E} \Big( (M_k-M_{k-1})^2; |M_k-M_{k-1}| > \varepsilon \sqrt n \Big) \to 0 \) as n tends to infinity,

then \( M_n / \sqrt n converges in distribution to N(0,1) as n tends to infinity.[6][7]

Caution: The restricted expectation[clarification needed] E(X; A) should not be confused with the conditional expectation E(X|A) = E(X; A)/P(A).
Proof of classical CLT

For a theorem of such fundamental importance to statistics and applied probability, the central limit theorem has a remarkably simple proof using characteristic functions. It is similar to the proof of a (weak) law of large numbers. For any random variable, Y, with zero mean and a unit variance (var(Y) = 1), the characteristic function of Y is, by Taylor's theorem,

\( \varphi_Y(t) = 1 - {t^2 \over 2} + o(t^2), \quad t \rightarrow 0 \)

where o (t2 ) is "little o notation" for some function of t  that goes to zero more rapidly than t2. Letting Yi be (Xi − μ)/σ, the standardized value of Xi, it is easy to see that the standardized mean of the observations X1, X2, ..., Xn is

\( Z_n = \frac{n\overline{X}_n-n\mu}{\sigma \sqrt{n}} = \sum_{i=1}^n {Y_i \over \sqrt{n}}. \)

By simple properties of characteristic functions, the characteristic function of Zn is

\( \left[\varphi_Y\left({t \over \sqrt{n}}\right)\right]^n = \left[ 1 - {t^2 \over 2n} + o\left({t^2 \over n}\right) \right]^n \, \rightarrow \, e^{-t^2/2}, \quad n \rightarrow \infty. \)

But this limit is just the characteristic function of a standard normal distribution N(0, 1), and the central limit theorem follows from the Lévy continuity theorem, which confirms that the convergence of characteristic functions implies convergence in distribution.

Convergence to the limit

The central limit theorem gives only an asymptotic distribution. As an approximation for a finite number of observations, it provides a reasonable approximation only when close to the peak of the normal distribution; it requires a very large number of observations to stretch into the tails.

If the third central moment E((X1 − μ)3) exists and is finite, then the above convergence is uniform and the speed of convergence is at least on the order of 1/n1/2 (see Berry-Esseen theorem).

The convergence to the normal distribution is monotonic, in the sense that the entropy of Zn increases monotonically to that of the normal distribution, as proven in Artstein, Ball, Barthe and Naor (2004).

The central limit theorem applies in particular to sums of independent and identically distributed discrete random variables. A sum of discrete random variables is still a discrete random variable, so that we are confronted with a sequence of discrete random variables whose cumulative probability distribution function converges towards a cumulative probability distribution function corresponding to a continuous variable (namely that of the normal distribution). This means that if we build a histogram of the realisations of the sum of n independent identical discrete variables, the curve that joins the centers of the upper faces of the rectangles forming the histogram converges toward a Gaussian curve as n approaches infinity, this relation is known as de Moivre–Laplace theorem. The binomial distribution article details such an application of the central limit theorem in the simple case of a discrete variable taking only two possible values.

Relation to the law of large numbers

The law of large numbers as well as the central limit theorem are partial solutions to a general problem: "What is the limiting behavior of Sn as n approaches infinity?"[citation needed] In mathematical analysis, asymptotic series are one of the most popular tools employed to approach such questions.

Suppose we have an asymptotic expansion of ƒ(n):

\( f(n)= a_1 \varphi_{1}(n)+a_2 \varphi_{2}(n)+O(\varphi_{3}(n)) \qquad (n \rightarrow \infty). \)

Dividing both parts by φ1(n) and taking the limit will produce a1, the coefficient of the highest-order term in the expansion, which represents the rate at which ƒ(n) changes in its leading term.

\( \lim_{n\to\infty}\frac{f(n)}{\varphi_{1}(n)}=a_1. \)

Informally, one can say: "ƒ(n) grows approximately as a1 φ(n)". Taking the difference between ƒ(n) and its approximation and then dividing by the next term in the expansion, we arrive at a more refined statement about ƒ(n):

\( \lim_{n\to\infty}\frac{f(n)-a_1 \varphi_{1}(n)}{\varphi_{2}(n)}=a_2 . \)

Here one can say that the difference between the function and its approximation grows approximately as a2 φ2(n). The idea is that dividing the function by appropriate normalizing functions, and looking at the limiting behavior of the result, can tell us much about the limiting behavior of the original function itself.

Informally, something along these lines is happening when the sum, Sn, of independent identically distributed random variables, X1, ..., Xn, is studied in classical probability theory. If each Xi has finite mean μ, then by the law of large numbers, Sn/n → μ.[8] If in addition each Xi has finite variance σ2, then by the central limit theorem,

\( \frac{S_n-n\mu}{\sqrt{n}} \rightarrow \xi , \)

where ξ is distributed as N(0, σ2). This provides values of the first two constants in the informal expansion

\( S_n \approx \mu n+\xi \sqrt{n}. \, \)

In the case where the Xi's do not have finite mean or variance, convergence of the shifted and rescaled sum can also occur with different centering and scaling factors:

\( \frac{S_n-a_n}{b_n} \rightarrow \Xi, \)

or informally

\( S_n \approx a_n+\Xi b_n. \, \)

Distributions Ξ which can arise in this way are called stable.[9] Clearly, the normal distribution is stable, but there are also other stable distributions, such as the Cauchy distribution, for which the mean or variance are not defined. The scaling factor bn may be proportional to nc, for any c ≥ 1/2; it may also be multiplied by a slowly varying function of n.[10][11]

The law of the iterated logarithm specifies what is happening "in between" the law of large numbers and the central limit theorem. Specifically it says that the normalizing function \sqrt{n\log\log n} intermediate in size between n of the law of large numbers and √n of the central limit theorem provides a non-trivial limiting behavior.
Alternative statements of the theorem
Density functions

The density of the sum of two or more independent variables is the convolution of their densities (if these densities exist). Thus the central limit theorem can be interpreted as a statement about the properties of density functions under convolution: the convolution of a number of density functions tends to the normal density as the number of density functions increases without bound, under the conditions stated above.
Characteristic functions

Since the characteristic function of a convolution is the product of the characteristic functions of the densities involved, the central limit theorem has yet another restatement: the product of the characteristic functions of a number of density functions becomes close to the characteristic function of the normal density as the number of density functions increases without bound, under the conditions stated above. However, to state this more precisely, an appropriate scaling factor needs to be applied to the argument of the characteristic function.

An equivalent statement can be made about Fourier transforms, since the characteristic function is essentially a Fourier transform.

Extensions to the theorem
Products of positive random variables

The logarithm of a product is simply the sum of the logarithms of the factors. Therefore when the logarithm of a product of random variables that take only positive values approaches a normal distribution, the product itself approaches a log-normal distribution. Many physical quantities (especially mass or length, which are a matter of scale and cannot be negative) are the products of different random factors, so they follow a log-normal distribution.

Whereas the central limit theorem for sums of random variables requires the condition of finite variance, the corresponding theorem for products requires the corresponding condition that the density function be square-integrable (see Rempala 2002).
Beyond the classical framework

Asymptotic normality, that is, convergence to the normal distribution after appropriate shift and rescaling, is a phenomenon much more general than the classical framework treated above, namely, sums of independent random variables (or vectors). New frameworks are revealed from time to time; no single unifying framework is available for now.
Convex body

Theorem (Klartag 2007, Theorem 1.2). There exists a sequence εn ↓ 0 for which the following holds. Let n ≥ 1, and let random variables X1, …, Xn have a log-concave joint density f such that ƒ(x1, …, xn) = ƒ(|x1|, …, |xn|) for all x1, …, xn, and E(Xk2) = 1 for all k = 1, …, n. Then the distribution of (X_1+\dots+X_n)/\sqrt n is εn-close to N(0, 1) in the total variation distance.

These two εn-close distributions have densities (in fact, log-concave densities), thus, the total variance distance between them is the integral of the absolute value of the difference between the densities. Convergence in total variation is stronger than weak convergence.

An important example of a log-concave density is a function constant inside a given convex body and vanishing outside; it corresponds to the uniform distribution on the convex body, which explains the term "central limit theorem for convex bodies".

Another example: ƒ(x1, …, xn) = const · exp ( − (|x1|α + … + |xn|α)β) where α > 1 and αβ > 1. If β = 1 then ƒ(x1, …, xn) factorizes into const · exp ( − |x1|α)…exp ( − |xn|α), which means independence of X1, …, Xn. In general, however, they are dependent.

The condition ƒ(x1, …, xn) = ƒ(|x1|, …, |xn|) ensures that X1, …, Xn are of zero mean and uncorrelated; still, they need not be independent, nor even pairwise independent. By the way, pairwise independence cannot replace independence in the classical central limit theorem (Durrett 1996, Section 2.4, Example 4.5).

Here is a Berry-Esseen type result.

Theorem (Klartag 2008, Theorem 1). Let X1, …, Xn satisfy the assumptions of the previous theorem, then

\( \bigg| \mathbb{P} \Big( a \le \frac{ X_1+\dots+X_n }{ \sqrt n } \le b \Big) - \frac1{\sqrt{2\pi}} \int_a^b \mathrm{e}^{-t^2/2} \, \mathrm{d} t \bigg| \le \frac C n \)

for all a < b; here C is a universal (absolute) constant. Moreover, for every c1, …, cn ∈ R such that c12 + … + cn2 = 1,

\( \bigg| \mathbb{P} ( a \le c_1 X_1+\dots+c_n X_n \le b ) - \frac1{\sqrt{2\pi}} \int_a^b \mathrm{e}^{-t^2/2} \, \mathrm{d} t \bigg| \le C ( c_1^4+\dots+c_n^4 ). \)

A more general case is treated in (Klartag 2007, Theorem 1.1). The condition ƒ(x1, …, xn) = ƒ(|x1|, …, |xn|) is replaced with much weaker conditions: E(Xk) = 0, E(Xk2) = 1, E(XkX) = 0 for 1 ≤ k < n. The distribution of \( (X_1+\dots+X_n)/\sqrt n \) need not be approximately normal (in fact, it can be uniform). However, the distribution of c1X1 + … + cnXn is close to N(0,1) (in the total variation distance) for most of vectors (c1, …, cn) according to the uniform distribution on the sphere c12 + … + cn2 = 1.

Theorem (Salem - Zygmund). Let U be a random variable distributed uniformly on (0, 2π), and Xk = rk cos(nkU + ak), where

nk satisfy the lacunarity condition: there exists q > 1 such that nk+1 ≥ qnk for all k,

  • rk are such that
  • \( r_1^2 + r_2^2 + \cdots = \infty \text{ and } \frac{ r_k^2 }{ r_1^2+\cdots+r_k^2 } \to 0, \)

    0 ≤ ak < 2π.


    \( \frac{ X_1+\cdots+X_k }{ \sqrt{r_1^2+\cdots+r_k^2} } \)

    converges in distribution to N(0, 1/2).

    See (Zygmund 1959, Sect. XVI.5, Theorem (5-5)) or (Gaposhkin 1966, Theorem 2.1.13).
    Gaussian polytopes

    Theorem (Barany & Vu 2007, Theorem 1.1). Let A1, ..., An be independent random points on the plane R2 each having the two-dimensional standard normal distribution. Let Kn be the convex hull of these points, and Xn the area of Kn Then

    \( \frac{ X_n - \mathrm{E} X_n }{ \sqrt{\operatorname{Var} X_n} } \)

    converges in distribution to N(0,1) as n tends to infinity.

    The same holds in all dimensions (2, 3, ...).

    The polytope Kn is called Gaussian random polytope.

    A similar result holds for the number of vertices (of the Gaussian polytope), the number of edges, and in fact, faces of all dimensions (Barany & Vu 2007, Theorem 1.2).
    Linear functions of orthogonal matrices

    A linear function of a matrix M is a linear combination of its elements (with given coefficients), M ↦ tr(AM) where A is the matrix of the coefficients; see Trace_(linear_algebra)#Inner product.

    A random orthogonal matrix is said to be distributed uniformly, if its distribution is the normalized Haar measure on the orthogonal group O(n,R); see Rotation matrix#Uniform random rotation matrices.

    Theorem (Meckes 2008). Let M be a random orthogonal n×n matrix distributed uniformly, and A a fixed n×n matrix such that tr(AA*) = n, and let X = tr(AM). Then the distribution of X is close to N(0,1) in the total variation metric up to 2\sqrt3 / (n-1).


    Theorem (Gaposhkin 1966, Sect. 1.5). Let random variables X1, X2, … ∈ L2(Ω) be such that Xn → 0 weakly in L2(Ω) and Xn2 → 1 weakly in L1(Ω). Then there exist integers n1 < n2 < … such that \( ( X_{n_1}+\cdots+X_{n_k} ) / \sqrt k \) converges in distribution to N(0, 1) as k tends to infinity.

    A generalized q-analog of the classical central limit theorem has been described by Umarov, Tsallis and Steinberg[12] in which the independence constraint for the i.i.d. variables is relaxed to an extent defined by the q parameter, with independence being recovered as q->1. In analogy to the classical central limit theorem, such random variables with fixed mean and variance tend towards the q-Gaussian distribution, which maximizes the Tsallis entropy under these constraints. Umarov, Tsallis, Gell-Mann and Steinberg have defined q-analogs of all symmetric alpha-stable distributions, and have formulated a number of conjectures regarding their relevance to an even more general Central limit theorem.[13]

    Applications and examples
    Simple example

    Comparison of probability density functions, p(k) for the sum of n fair 6-sided dice to show their convergence to a normal distribution with increasing n, in accordance to the central limit theorem. In the bottom-right graph, smoothed profiles of the previous graphs are rescaled, superimposed and compared with a normal distribution (black curve).

    A simple example of the central limit theorem is rolling a large number of identical, unbiased dice. The distribution of the sum (or average) of the rolled numbers will be well approximated by a normal distribution. Since real-world quantities are often the balanced sum of many unobserved random events, the central limit theorem also provides a partial explanation for the prevalence of the normal probability distribution. It also justifies the approximation of large-sample statistics to the normal distribution in controlled experiments.
    This figure demonstrates the central limit theorem. The sample means are generated using a random number generator, which draws numbers between 1 and 100 from a uniform probability distribution. It illustrates that increasing sample sizes result in the 500 measured sample means being more closely distributed about the population mean (50 in this case). It also compares the observed distributions with the distributions that would be expected for a normalized Gaussian distribution, and shows the chi-squared values that quantify the goodness of the fit (the fit is good if the reduced chi-squared value is less than or approximately equal to one). The input into the normalized Gaussian function is the mean of sample means (~50) and the mean sample standard deviation divided by the square root of the sample size ( \( ~28.87/ \scriptstyle \sqrt{n} ) \), which is called the standard deviation of the mean (since it refers to the spread of sample means).

    Real applications
    A histogram plot of monthly accidental deaths in the US, between 1973 and 1978 exhibits normality, due to the central limit theorem

    Published literature contains a number of useful and interesting examples and applications relating to the central limit theorem.[14] One source[15] states the following examples:

    The probability distribution for total distance covered in a random walk (biased or unbiased) will tend toward a normal distribution.
    Flipping a large number of coins will result in a normal distribution for the total number of heads (or equivalently total number of tails).

    From another viewpoint, the central limit theorem explains the common appearance of the "Bell Curve" in density estimates applied to real world data. In cases like electronic noise, examination grades, and so on, we can often regard a single measured value as the weighted average of a large number of small effects. Using generalisations of the central limit theorem, we can then see that this would often (though not always) produce a final distribution that is approximately normal.

    In general, the more a measurement is like the sum of independent variables with equal influence on the result, the more normality it exhibits. This justifies the common use of this distribution to stand in for the effects of unobserved variables in models like the linear model.
    Other illustrations
    Main article: Illustration of the central limit theorem

    Given its importance to statistics, a number of papers and computer packages are available that demonstrate the convergence involved in the central limit theorem. [16]

    Tijms (2004, p. 169) writes:
    “ The central limit theorem has an interesting history. The first version of this theorem was postulated by the French-born mathematician Abraham de Moivre who, in a remarkable article published in 1733, used the normal distribution to approximate the distribution of the number of heads resulting from many tosses of a fair coin. This finding was far ahead of its time, and was nearly forgotten until the famous French mathematician Pierre-Simon Laplace rescued it from obscurity in his monumental work Théorie Analytique des Probabilités, which was published in 1812. Laplace expanded De Moivre's finding by approximating the binomial distribution with the normal distribution. But as with De Moivre, Laplace's finding received little attention in his own time. It was not until the nineteenth century was at an end that the importance of the central limit theorem was discerned, when, in 1901, Russian mathematician Aleksandr Lyapunov defined it in general terms and proved precisely how it worked mathematically. Nowadays, the central limit theorem is considered to be the unofficial sovereign of probability theory. ”

    Sir Francis Galton (Natural Inheritance, 1889) described the Central Limit Theorem as:
    “ I know of scarcely anything so apt to impress the imagination as the wonderful form of cosmic order expressed by the "Law of Frequency of Error". The law would have been personified by the Greeks and deified, if they had known of it. It reigns with serenity and in complete self-effacement, amidst the wildest confusion. The huger the mob, and the greater the apparent anarchy, the more perfect is its sway. It is the supreme law of Unreason. Whenever a large sample of chaotic elements are taken in hand and marshaled in the order of their magnitude, an unsuspected and most beautiful form of regularity proves to have been latent all along. ”

    The actual term "central limit theorem" (in German: "zentraler Grenzwertsatz") was first used by George Pólya in 1920 in the title of a paper.[17][18] Pólya referred to the theorem as "central" due to its importance in probability theory. According to Le Cam, the French school of probability interprets the word central in the sense that "it describes the behaviour of the centre of the distribution as opposed to its tails".[18] The abstract of the paper On the central limit theorem of calculus of probability and the problem of moments by Pólya[17] in 1920 translates as follows.
    “ The occurrence of the Gaussian probability density e−x2 in repeated experiments, in errors of measurements, which result in the combination of very many and very small elementary errors, in diffusion processes etc., can be explained, as is well-known, by the very same limit theorem, which plays a central role in the calculus of probability. The actual discoverer of this limit theorem is to be named Laplace; it is likely that its rigorous proof was first given by Tschebyscheff and its sharpest formulation can be found, as far as I am aware of, in an article by Liapounoff. [...] ”

    A thorough account of the theorem's history, detailing Laplace's foundational work, as well as Cauchy's, Bessel's and Poisson's contributions, is provided by Hald.[19] Two historical accounts, one covering the development from Laplace to Cauchy, the second the contributions by von Mises, Pólya, Lindeberg, Lévy, and Cramér during the 1920s, are given by Hans Fischer.[20][21] Le Cam describes a period around 1935.[18] See Bernstein (1945) for a historical discussion focusing on the work of Pafnuty Chebyshev and his students Andrey Markov and Aleksandr Lyapunov that led to the first proofs of the CLT in a general setting.

    A curious footnote to the history of the Central Limit Theorem is that a proof of a result similar to the 1922 Lindeberg CLT was the subject of Alan Turing's 1934 Fellowship Dissertation for King's College at the University of Cambridge. Only after submitting the work did Turing learn it had already been proved. Consequently, Turing's dissertation was never published.[22][23][24]
    See also

    Delta method – to compute the limit distribution of a function of a random variable.
    Berry–Esseen theorem – error bounds on normal approximations based on the central limit theorem
    Chernoff bound – better error bounds on normal approximations for the tails for certain distributions
    Illustration of the central limit theorem
    Law of large numbers – weaker conclusion in the same context
    Theorem of de Moivre–Laplace
    Sample size – required sample size for applying the central limit theorem
    Fisher–Tippett–Gnedenko theorem – limit theorem for extremum values (such as max{Xn})
    Central limit theorem for directional statistics - Central limit theorem applied to the case of directional statistics
    Erdős-Kac theorem - connects the number of prime factors of an integer with the normal probability distribution
    Stable distribution - distributions s.t. linear combinations of i.i.d. samples lead to samples with the same distribution


    ^ Rice (1995)
    ^ Voit, Johannes (2003). The Statistical Mechanics of Financial Markets. Springer-Verlag. p. 124. ISBN 3-540-00978-7.
    ^ Billingsley (1995, p. 357)
    ^ Billingsley (1995, p. 362)
    ^ Van der Vaart, A. W. (1998), Asymptotic statistics, New York: Cambridge University Press, ISBN 978-0-521-49603-2, LCCN .V22 1998 QA276 .V22 1998
    ^ (Durrett 1996, Sect. 7.7, Theorem (7.4))
    ^ (Billingsley 1995, Theorem 35.12)
    ^ Rosenthal, Jeffrey Seth (2000) A first look at rigorous probability theory, World Scientific, ISBN 981-02-4322-7.(Theorem 5.3.4, p. 47)
    ^ Johnson, Oliver Thomas (2004) Information theory and the central limit theorem, Imperial College Press, 2004, ISBN 1-86094-473-6. (p. 88)
    ^ Vladimir V. Uchaikin and V. M. Zolotarev (1999) Chance and stability: stable distributions and their applications, VSP. ISBN 90-6764-301-7.(pp. 61–62)
    ^ Borodin, A. N. ; Ibragimov, Il'dar Abdulovich; Sudakov, V. N. (1995) Limit theorems for functionals of random walks, AMS Bookstore, ISBN 0-8218-0438-3. (Theorem 1.1, p. 8 )
    ^ Umarov, Sabir; Tsallis, Constantino and Steinberg, Stanly (2008), "On a q-Central Limit Theorem Consistent with Nonextensive Statistical Mechanics", Milan j. Math. (Birkhauser Verlag) 76: 307–328, doi:10.1007/s00032-008-0087-y, retrieved 2011-07-27.
    ^ Umarov, Sabir; Tsallis, Constantino, Gell-Mann, Murray and Steinberg, Stanly (2010), "Generalization of symmetric α-stable Lévy distributions for q>1", J Math Phys. (American Institute of Physics) 51 (3): 033502, doi:10.1063/1.3305292, PMC 2869267, PMID 20596232.
    ^ Dinov, Christou & Sanchez (2008)
    ^ SOCR CLT Activity wiki
    ^ Marasinghe, M., Meeker, W., Cook, D. & Shin, T.S.(1994 August), "Using graphics and simulation to teach statistical concepts", Paper presented at the Annual meeting of the American Statistician Association, Toronto, Canada.
    ^ a b Pólya, George (1920), "Über den zentralen Grenzwertsatz der Wahrscheinlichkeitsrechnung und das Momentenproblem" (in German), Mathematische Zeitschrift 8 (3–4): 171–181, doi:10.1007/BF01206525
    ^ a b c (Le Cam 1986)
    ^ Hald, Andreas History of Mathematical Statistics from 1750 to 1930, Ch.17. [Full citation needed]
    ^ Fischer (2011, Chapter 2: The Central Limit Theorem from Laplace to Cauchy: Changes in Stochastic Objectives and in Analytical Methods)
    ^ Fischer (2011, Chapter 5.2: The Central Limit Theorem in the Twenties)
    ^ Hodges, Andrew (1983) Alan Turing: the enigma. London: Burnett Books., pp. 87-88.[Full citation needed]
    ^ Zabell, S.L., (2005) Symmetry and its discontents: essays on the history of inductive probability,Cambridge University Press. ISBN 0-521-44470-5. (pp. 199 ff.)
    ^ Aldrich, John (2009) "England and Continental Probability in the Inter-War Years", Electronic Journ@l for History of Probability and Statistics, vol. 5/2, Decembre 2009. (Section 3)


    S. Artstein, K. Ball, F. Barthe and A. Naor (2004), "Solution of Shannon's Problem on the Monotonicity of Entropy", Journal of the American Mathematical Society 17, 975–982. Also author's site.
    Barany, Imre; Vu, Van (2007), "Central limit theorems for Gaussian polytopes", The Annals of Probability (Institute of Mathematical Statistics) 35 (4): 1593–1621, doi:10.1214/009117906000000791. Also arXiv.
    Bernstein, S.N. (1945) On the work of P.L.Chebyshev in Probability Theory, Nauchnoe Nasledie P.L.Chebysheva. Vypusk Pervyi: Matematika. (Russian) [The Scientific Legacy of P. L. Chebyshev. First Part: Mathematics, Edited by S. N. Bernstein.] Academiya Nauk SSSR, Moscow-Leningrad, 174 pp.
    Billingsley, Patrick (1995), Probability and Measure (Third ed.), John Wiley & sons, ISBN 0-471-00710-2
    Bradley, Richard (2007), Introduction to Strong Mixing Conditions (First ed.), Heber City, UT: Kendrick Press, ISBN 0-9740427-9-X
    Bradley, Richard (2005), "Basic Properties of Strong Mixing Conditions. A Survey and Some Open Questions", Probability Surveys 2: 107–144, arXiv:math/0511078v1, doi:10.1214/154957805100000104
    Dinov, Ivo; Christou, Nicolas; Sanchez, Juana (2008), "Central Limit Theorem: New SOCR Applet and Demonstration Activity", Journal of Statistics Education (ASA) 16 (2). Also at ASA/JSE.
    Durrett, Richard (1996), Probability: theory and examples (Second ed.)
    Fischer, Hans (2011), A History of the Central Limit Theorem: From Classical to Modern Probability Theory, Sources and Studies in the History of Mathematics and Physical Sciences, New York: Springer, doi:10.1007/978-0-387-87857-7, ISBN 978-0-387-87856-0, MR 2743162, Zbl 1226.60004
    Gaposhkin, V.F. (1966), "Lacunary series and independent functions", Russian Math. Surveys 21 (6): 1–82, doi:10.1070/RM1966v021n06ABEH001196.
    Klartag, Bo'az (2007), "A central limit theorem for convex sets", Inventiones Mathematicae 168, 91–131.doi:10.1007/s00222-006-0028-8 Also arXiv.
    Klartag, Bo'az (2008), "A Berry-Esseen type inequality for convex bodies with an unconditional basis", Probability Theory and Related Fields. doi:10.1007/s00440-008-0158-6 Also arXiv.
    Le Cam, Lucien (1986), "The central limit theorem around 1935", Statistical Science 1:1, 78–91.
    Meckes, Elizabeth (2008), "Linear functions on the classical matrix groups", Transactions of the American Mathematical Society 360 (10): 5355–5366, doi:10.1090/S0002-9947-08-04444-9. Also arXiv.
    Rempala, G. and J. Wesolowski, (2002) "Asymptotics of products of sums and U-statistics", Electronic Communications in Probability, 7, 47–54.
    Rice, John (1995), Mathematical Statistics and Data Analysis (Second ed.), Duxbury Press, ISBN 0-534-20934-3
    Tijms, Henk (2004) Understanding Probability: Chance Rules in Everyday Life, Cambridge: Cambridge University Press. ISBN 0-521-54036-4
    Zygmund, Antoni (1959), Trigonometric series, Volume II, Cambridge. (2003 combined volume I,II: ISBN 0-521-89053-5)

    External links

    Animated examples of the CLT
    Central Limit Theorem interactive simulation to experiment with various parameters
    CLT in NetLogo (Connected Probability - ProbLab) interactive simulation w/ a variety of modifiable parameters
    General Central Limit Theorem Activity & corresponding SOCR CLT Applet (Select the Sampling Distribution CLT Experiment from the drop-down list of SOCR Experiments)
    Generate sampling distributions in Excel Specify arbitrary population, sample size, and sample statistic.
    MIT OpenCourseWare Lecture 18.440 Probability and Random Variables, Spring 2011, Scott Sheffield Another proof. Retrieved 2012-04-08.
    CAUSEweb.org is a site with many resources for teaching statistics including the Central Limit Theorem
    The Central Limit Theorem by Chris Boucher, Wolfram Demonstrations Project.
    Weisstein, Eric W., "Central Limit Theorem" from MathWorld.
    Animations for the Central Limit Theorem by Yihui Xie using the R package animation
    Teaching demonstrations of the CLT: clt.examp function in Greg Snow (2012). TeachingDemos: Demonstrations for teaching and learning. R package version 2.8..

    Mathematics Encyclopedia

    Retrieved from "http://en.wikipedia.org/"
    All text is available under the terms of the GNU Free Documentation License

    Home - Hellenica World