Central Limit Theorem Article Index for
Central
Limousines in
Central
Website Links For
Central
 

Information About

Central Limit Theorem




Since many real processes yield distributions with finite Variance , this explains the ubiquity of the normal probability distribution.



Then the distribution of ''Z''''n'' Converges towards the Standard Normal Distribution N(0,1)
as ''n'' approaches ∞ (this is of N(0,1), then for every Real Number ''z'', we have

:\lim_{n o \infty} \mbox{P}(Z_n \le z) = \Phi(z),
or, equivalently,

:\lim_{n ightarrow\infty}\mbox{P}\left( rac{\overline{X}_n-\mu}{\sigma/\sqrt{n}}\leq z ight)=\Phi(z)
where
:\overline{X}_n=S_n/n=(X_1+\cdots+X_n)/n
is the Sample Mean .


Proof of the central limit theorem

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 unit variance (var(''Y'') = 1), the characteristic function of ''Y'' is, by Taylor's Theorem ,

: arphi_Y(t) = 1 - {t^2 \over 2} + o(t^2), \quad t ightarrow 0

where ''o'' (''t2'' ) is " Little O Notation " for some function of ''t''  that goes to zero more rapidly than ''t2''. Letting ''Y''''i'' be (''X''''i'' − μ)/σ, the standardised value of ''X''''i'', it is easy to see that the standardised mean of the observations ''X1'', ''X2'', ..., ''Xn'' is just

:Z_n = rac{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 ''Z''''n'' is

:\left \over \sqrt{n}} ight) ight ^n = \left[ 1 - {t^2
\over 2n} + o\left({t^2 \over n} ight) ight]^n \, ightarrow \, e^{-t^2/2}, \quad n ightarrow \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

If the third central Moment E((''X''1 − μ)3) exists and is finite, then the above convergence is Uniform and the speed of convergence is at least on the order of 1/''n''½ (see Berry-Esséen Theorem ).

The convergence normal is monotonic, in the sense that the Entropy of Z_n increases Monotonically to that of the normal distribution, as proven by Artstein, Ball, Barthe and Naor.

Pictures of a distribution being "smoothed out" by Summation (showing original Density Of Distribution and three subsequent summations, obtained by Convolution of density functions):

(See Illustration Of The Central Limit Theorem for further details on these images.)


An equivalent formulation of this limit theorem starts with ''A''''n'' = (''X''1 + ... + ''X''''n'') / ''n'' which can be interpreted as the mean of a Random Sample of size ''n''. The expected value of ''A''''n'' is μ and the standard deviation is σ / ''n''½. If we standardize ''A''''n'' by setting ''Z''''n'' = (''A''''n'' - μ) / (σ / ''n''½), we obtain the same variable ''Z''''n'' as above, and it approaches a standard normal distribution.

The Central Limit Theorem, as an approximation for a finite number of observations, 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.

The Central Limit theorem also applies to sums of independent and identical s is still a Discrete Random Variable , so that we are confronted to a Series of Discrete Random Variable s whose probability distribution converges towards a Probability Density Function corresponding to a continuous variable (namely 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 \infty. 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

is one of the most popular tools employed to approach such questions.

Suppose we have an asymptotic expansion of ''f(n)'':

f(n)= a_1 arphi_{1}(n)+a_2 arphi_{2}(n)+O( arphi_{3}(n)) \ (n ightarrow \infty).

dividing both parts by arphi_{1}(n) and taking the limit will produce a_{1} - the coefficient at the highest-order term in the expansion representing the rate at which f(n) changes in its leading term.

\lim_{n o\infty} rac{f(n)}{ arphi_{1}(n)}=a_1.

Informally, one can say: " f(n) grows approximately as a_1 arphi_{1}(n) ". Taking the difference between f(n) and its approximation and then dividing by the next term in the expansion we arrive to a more refined statement about f(n) :

\lim_{n o\infty} rac{f(n)-a_1 arphi_{1}(n)}{ arphi_{2}(n)}=a_2

here one can say that: "the difference between the function and its approximation grows approximately as a_2 arphi_{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 ''S''''n'' is being studied in classical probability theory. Under certain regularity conditions, by The Law of Large Numbers, rac{S_n}{n} ightarrow \mu and by The Central Limit Theorem, rac{S_n-n\mu}{\sqrt{n}} ightarrow \xi
where \xi is distributed as N(0,\sigma^2) which provide values of first two constants in informal expansion:

S_n \approx \mu n+\xi \sqrt{n}.