Central limit theorem – Wikipedia

In probability theory, the central limit theorem (CLT) establishes that, in many situations, when independent random variables are summed up, their properly normalized sum tends toward a normal distribution even if the original variables themselves are not normally distributed.

The theorem is a key concept in probability theory because it implies that probabilistic and statistical methods that work for normal distributions can be applicable to many problems involving other types of distributions .

This theorem has seen many changes during the formal development of probability theory. Previous versions of the theorem date back to 1811, but in its modern general form, this fundamental result in probability theory was precisely stated as late as 1920,[1] thereby serving as a bridge between classical and modern probability theory.

If

X

1

,

X

2

,
…
,

X

n

,
…

{\textstyle X_{1},X_{2},\dots ,X_{n},\dots }

are random samples drawn from a population with overall mean

μ

{\textstyle \mu }

σ

2

{\textstyle \sigma ^{2}}

, and if

X
¯

n

{\textstyle {\bar {X}}_{n}}

n

{\textstyle n}

samples, then the limiting form of the distribution,

Z
=

lim

n
→
∞

(

X
¯

n

−
μ

σ

X
¯

)

{\textstyle Z=\lim _{n\to \infty }{\left({\frac {{\bar {X}}_{n}-\mu }{\sigma _{\bar {X}}}}\right)}}

, with

σ

X
¯

=
σ

/

n

{\displaystyle \sigma _{\bar {X}}=\sigma /{\sqrt {n}}}

, is a standard normal distribution.[2]

For example, suppose that a sample is obtained containing many observations, each observation being randomly generated in a way that does not depend on the values of the other observations, and that the arithmetic mean of the observed values is computed. If this procedure is performed many times, the central limit theorem says that the probability distribution of the average will closely approximate a normal distribution. A simple example of this is that if one flips a coin many times, the probability of getting a given number of heads will approach a normal distribution, with the mean equal to half the total number of flips. At the limit of an infinite number of flips, it will equal a normal distribution .The central limit theorem has several variants. In its common form, the random variables must be independent and identically distributed ( i. i. d. ). In variants, convergence of the mean to the normal distribution also occurs for non-identical distributions or for non-independent observations, if they comply with certain conditions .The earliest version of this theorem, that the normal distribution may be used as an approximation to the binomial distribution, is the de Moivre – Laplace theorem .

Let

{

X

1

,
…
,

X

n

,
…
}

{\textstyle \{X_{1},\ldots ,X_{n},\ldots \}}

be a sequence of random samples — that is, a sequence of i.i.d. random variables drawn from a distribution of expected value given by

μ

{\textstyle \mu }

and finite variance given by

σ

2

{\textstyle \sigma ^{2}}

. Suppose we are interested in the sample average

of the firstsamples .

By the law of large numbers, the sample averages converge almost surely (and therefore also converge in probability) to the expected value

μ

{\textstyle \mu }

as

n
→
∞

{\textstyle n\to \infty }

.

The classical central limit theorem describes the size and the distributional form of the stochastic fluctuations around the deterministic number

μ

{\textstyle \mu }

during this convergence. More precisely, it states that as

n

{\textstyle n}

gets larger, the distribution of the difference between the sample average

X
¯

n

{\textstyle {\bar {X}}_{n}}

and its limit

μ

{\textstyle \mu }

, when multiplied by the factor

n

{\textstyle {\sqrt {n}}}

(that is

n

(

X
¯

n

−
μ
)

{\textstyle {\sqrt {n}}({\bar {X}}_{n}-\mu )}

) approximates the normal distribution with mean 0 and variance

σ

2

{\textstyle \sigma ^{2}}

. For large enough n, the distribution of

X
¯

n

{\textstyle {\bar {X}}_{n}}

gets arbitrarily close to the normal distribution with mean

μ

{\textstyle \mu }

and variance

σ

2

/

n

{\textstyle \sigma ^{2}/n}

.

The usefulness of the theorem is that the distribution of

n

(

X
¯

n

−
μ
)

{\textstyle {\sqrt {n}}({\bar {X}}_{n}-\mu )}

approaches normality regardless of the shape of the distribution of the individual

X

i

{\textstyle X_{i}}

. Formally, the theorem can be stated as follows:

In the case

σ
>
0

{\textstyle \sigma >0}

distribution: for every real number

z

{\textstyle z}

,

whereis the standard normal cdf evaluatedThe convergence is uniform inin the sense thatwheredenotes the least upper bound ( or supremum ) of the set .

The theorem is named after Russian mathematician Aleksandr Lyapunov. In this variant of the central limit theorem the random variables

X

i

{\textstyle X_{i}}

have to be independent, but not necessarily identically distributed. The theorem also requires that random variables

|

X

i

|

{\textstyle \left|X_{i}\right|}

have moments of some order

(
2
+
δ
)

{\textstyle (2+\delta )}

, and that the rate of growth of these moments is limited by the Lyapunov condition given below.

In practice it is usually easiest to check Lyapunov’s condition for

δ
=
1

{\textstyle \delta =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 .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 ) .

Suppose that for every

ε
>
0

{\textstyle \varepsilon >0}

is a random vector in

R

k

{\textstyle \mathbb {R} ^{k}}

, with mean vector

μ

=

E

[

X

i

]

{\textstyle {\boldsymbol {\mu }}=\mathbb {E} [\mathbf {X} _{i}]}

and covariance matrix

Σ

{\textstyle \mathbf {\Sigma } }

(among the components of the vector), and these random vectors are independent and identically distributed. Summation of these vectors is being done component-wise. The multidimensional central limit theorem states that when scaled, sums converge to a multivariate normal distribution.[7]

Letkbe the-vector. The bold inmeans that it is a random vector, not a random ( univariate ) variable. Then the sum of the random vectors will beand the average isand thereforeThe multivariate central limit theorem states thatwhere the covariance matrix is equal toThe rate of convergence is given by the following Berry – Esseen type result :

It is unknown whether the factor

d

1

/

4

{\textstyle d^{1/4}}

is necessary.[9]

The central limit theorem states that the sum of a number of independent and identically distributed random variables with finite variances will tend to a normal distribution as the number of variables grows. A generalization due to Gnedenko and Kolmogorov states that the sum of a number of random variables with a power-law tail (Paretian tail) distributions decreasing as

|

x

|

−
α
−
1

{\textstyle {|x|}^{-\alpha -1}}

where

0
< α < 2 {\textstyle 0<\alpha <2} (and therefore having infinite variance) will tend to a stable distribution

f
(
x
;
α
,
0
,
c
,
0
)

{\textstyle f(x;\alpha ,0,c,0)}

as the number of summands grows.[10][11] If

α
>
2

{\textstyle \alpha >2}

where

α
(
n
)

{\textstyle \alpha (n)}

is so-called strong mixing coefficient.

A simplified formulation of the central limit theorem under strong mixing is : [ 13 ]In fact ,where the series converges absolutely .

The assumption

σ
≠
0

{\textstyle \sigma \neq 0}

cannot be omitted, since the asymptotic normality fails for

X

n

=

Y

n

−

Y

n
−
1

{\textstyle X_{n}=Y_{n}-Y_{n-1}}

where

Y

n

{\textstyle Y_{n}}

are another stationary sequence.

There is a stronger version of the theorem:[14] the assumption

E

[

X

n

12

]

< ∞ {\textstyle \mathbb {E} \left[{X_{n}}^{12}\right]<\infty } is replaced with

E

[

|

X

n

|

2
+
δ

]

< ∞ {\textstyle \mathbb {E} \left[{\left|X_{n}\right|}^{2+\delta }\right]<\infty } , and the assumption

α

n

=
O

(

n

−
5

)

{\textstyle \alpha _{n}=O\left(n^{-5}\right)}

is replaced with

Existence of such

δ
>
0

{\textstyle \delta >0}

has mean

n
μ

{\textstyle n\mu }

and variance

n

σ

2

{\textstyle n\sigma ^{2}}

. Consider the random variable

where in the last step we defined the new random variableseach with zero mean and unit varianceThe characteristic function ofis given bywhere in the last step we used the fact that all of theare identically distributed. The characteristic function ofis, by Taylor’s theorem whereis ” little o notation ” for some function ofthat goes to zero more rapidly thanBy the limit of the exponential function the characteristic function ofequals

All of the higher order terms vanish in the limit

n
→
∞

{\textstyle n\to \infty }

. The right hand side equals the characteristic function of a standard normal distribution

N
(
0
,
1
)

{\textstyle N(0,1)}

, which implies through Lévy’s continuity theorem that the distribution of

Z

n

{\textstyle Z_{n}}

will approach

N
(
0
,
1
)

{\textstyle N(0,1)}

as

n
→
∞

{\textstyle n\to \infty }

. Therefore, the sample average

is such thatconverges to the normal distributionfrom which the central limit theorem follows .

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.[citation needed]

The convergence in the central limit theorem is uniform because the limiting cumulative distribution function is continuous. If the third central moment

E
⁡

[

(

X

1

−
μ

)

3

]

{\textstyle \operatorname {E} \left[(X_{1}-\mu )^{3}\right]}

exists and is finite, then the speed of convergence is at least on the order of

1

/

n

{\textstyle 1/{\sqrt {n}}}

(see Berry–Esseen theorem). Stein’s method[18] can be used not only to prove the central limit theorem, but also to provide bounds on the rates of convergence for selected metrics.[19]

The convergence to the normal distribution is monotonic, in the sense that the entropy of Z n { \ textstyle Z_ { n } } increases monotonically to that of the normal distribution. [ 20 ]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 realizations 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 .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 ? ” In mathematical analysis, asymptotic series are one of the most popular tools employed to approach such questions .

Suppose we have an asymptotic expansion of

f
(
n
)

{\textstyle f(n)}

:

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 f(n) changes in its leading term.

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

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 happens when the sum, Sn, of independent identically distributed random variables, X1, …, Xn, is studied in classical probability theory.[citation needed] If each Xi has finite mean μ, then by the law of large numbers, Sn/n → μ.[21] If in addition each Xi has finite variance σ2, then by the central limit theorem,

ξ

N(0,σ2)

whereis distributed as. This provides values of the first two constants in the informal expansionIn the case where the Xi do not have finite mean or variance, convergence of the shifted and rescaled sum can also occur with different centering and scaling factors :or informally

Distributions Ξ which can arise in this way are called stable.[22] 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.[12][23]

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 √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.

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. Thes e theorems require stronger hypotheses than the forms of the central limit theorem given above. Theorems of this type are often called local limit theorems. See Petrov [ 24 ] for a particular local limit theorem for sums of independent and identically distributed random variables .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. Specifically, 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 .

Let Sn be the sum of n random variables. Many central limit theorems provide conditions such that Sn/√Var(Sn) converges in distribution to N(0,1) (the normal distribution with mean 0, variance 1) as n → ∞. In some cases, it is possible to find a constant σ2 and function f(n) such that Sn/(σ√n⋅f(n)) converges in distribution to N(0,1) as n→ ∞.

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. This multiplicative version of the central limit theorem is sometimes called Gibrat’s law .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. [ 26 ]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 .Thes e 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 toàn thân and vanishing outside ; it corresponds to the uniform distribution on the convex body toàn thân, which explains the term ” central limit theorem for convex bodies ” .

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

The condition f(x1, …, xn) = f(|x1|, …, |xn|) ensures that X1, …, Xn are of zero mean and uncorrelated;[citation needed] still, they need not be independent, nor even pairwise independent.[citation needed] By the way, pairwise independence cannot replace independence in the classical central limit theorem.[28]

Here is a Berry – Esseen type result .

The distribution of X1 + ⋯ + Xn/√n need not be approximately normal (in fact, it can be uniform).[30] However, the distribution of c1X1 + ⋯ + cnXn is close to N(0,1) (in the total variation distance) for most vectors (c1, …, cn) according to the uniform distribution on the sphere c2
1 + ⋯ + c2
n = 1.

The same also holds in all dimensions greater than 2 .The polytope Kn is called a 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. [ 34 ]

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.

The central limit theorem may be established for the simple random walk on a crystal lattice ( an infinite-fold abelian covering graph over a finite graph ), and is used for design of crystal structures. [ 37 ] [ 38 ]A simple example of the central limit theorem is rolling many 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 .Published literature contains a number of useful and interesting examples and applications relating to the central limit theorem. [ 39 ] One source [ 40 ] states the following examples :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 many 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 Mã Sản Phẩm .Regression analysis and in particular ordinary least squares specifies that a dependent variable depends according to some function upon one or more independent variables, with an additive error term. Various types of statistical inference on the regression assume that the error term is normally distributed. This assumption can be justified by assuming that the error term is actually the sum of many independent error terms ; even if the individual error terms are not normally distributed, by the central limit theorem their sum can be well approximated by a normal distribution .Given its importance to statistics, a number of papers and computer packages are available that demonstrate the convergence involved in the central limit theorem. [ 41 ]Dutch mathematician Henk Tijms writes : [ 42 ]Sir Francis Galton described the Central Limit Theorem in this way : [ 43 ]

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.[44][45] 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”.[45] The abstract of the paper On the central limit theorem of calculus of probability and the problem of moments by Pólya[44] in 1920 translates as follows.

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. [ 46 ] 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 1920 s, are given by Hans Fischer. [ 47 ] Le Cam describes a period around 1935. [ 45 ] Bernstein [ 48 ] presents 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 not published. [ 49 ]