# 13.2: Convergence and the Central Limit Theorem

- Page ID
- 10839

\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

\( \newcommand{\Span}{\mathrm{span}}\)

\( \newcommand{\id}{\mathrm{id}}\)

\( \newcommand{\Span}{\mathrm{span}}\)

\( \newcommand{\kernel}{\mathrm{null}\,}\)

\( \newcommand{\range}{\mathrm{range}\,}\)

\( \newcommand{\RealPart}{\mathrm{Re}}\)

\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

\( \newcommand{\Argument}{\mathrm{Arg}}\)

\( \newcommand{\norm}[1]{\| #1 \|}\)

\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)

\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)

\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vectorC}[1]{\textbf{#1}} \)

\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

\(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)## The Central Limit Theorem

The *central limit theorem* (CLT) asserts that if random variable \(X\) is the sum of a large class of independent random variables, each with reasonable distributions, then \(X\) is approximately normally distributed. This celebrated theorem has been the object of extensive theoretical research directed toward the discovery of the most general conditions under which it is valid. On the other hand, this theorem serves as the basis of an extraordinary amount of applied work. In the statistics of large samples, the sample average is a constant times the sum of the random variables in the sampling process . Thus, for large samples, the sample average is approximately normal—whether or not the population distribution is normal. In much of the theory of errors of measurement, the observed error is the sum of a large number of independent random quantities which contribute additively to the result. Similarly, in the theory of noise, the noise signal is the sum of a large number of random components, independently produced. In such situations, the assumption of a normal population distribution is frequently quite appropriate.

We consider a form of the CLT under hypotheses which are reasonable assumptions in many practical situations. We sketch a proof of this version of the CLT, known as the Lindeberg-Lévy theorem, which utilizes the limit theorem on characteristic functions, above, along with certain elementary facts from analysis. It illustrates the kind of argument used in more sophisticated proofs required for more general cases.

Consider an independent sequence \(\{X_n: 1 \le n\}\) of random variables. Form the sequence of partial sums

\(S_n = \sum_{i = 1}^{n} X_i\) \(\forall n \ge 1\) with \(E[S_n] = \sum_{i = 1}^{n} E[X_i]\) and \(\text{Var} [S_n] = \sum_{i = 1}^{n} \text{Var} [X_i]\)

Let \(S_n^*\) be the standardized sum and let \(F_n\) be the distribution function for \(S_n^*\). The CLT asserts that under appropriate conditions, \(F_n (t) \to \phi(t)\) as \(n \to \infty\) for all \(t\). We sketch a proof of the theorem under the condition the \(X_i\) form an iid class.

*Central Limit Theorem* (Lindeberg-Lévy form)

If \(\{X_n: 1 \le n\}\) is iid, with

\(E[X_i] = \mu\), \(\text{Var} [X_i] = \sigma^2\), and \(S_n^* = \dfrac{S_n - n\mu}{\sigma \sqrt{n}}\)

then

\(F_n (t) \to \phi (t)\) as \(n \to \infty\), for all \(t\)

IDEAS OF A PROOF

There is no loss of generality in assuming \(\mu = 0\). Let \(\phi\) be the common characteristic function for the \(X_i\), and for each \(n\) let \(\phi_n\) be the characteristic function for \(S_n^*\). We have

\(\varphi (t) = E[e^{itX}]\) and \(\varphi_n (t) = E[e^{itS_n^*}] = \varphi^n (t/\sigma \sqrt{n})\)

Using the power series expansion of \(\varphi\) about the origin noted above, we have

\(\varphi (t) = 1 - \dfrac{\sigma^2 t^2}{2} + \beta (t)\) where \(\beta (t) = o (t^2)\) as \(t \to 0\)

This implies

\([\varphi (t/\sigma \sqrt{n}) - (1 - t^2/2n)] = [\beta (t /\sigma \sqrt{n})] = o(t^2/\sigma^2 n)\)

so that

\(n[\varphi (t/\sigma \sqrt{n}) - (1 - t^2/2n)] \to 0\) as \(n \to \infty\)

A standard lemma of analysis ensures

\((1 - \dfrac{t^2}{2n})^n \to e^{-t^2/2}\) as \(n \to \infty\)

so that

\(\varphi (t/\sigma \sqrt{n}) \to e^{-t^2/2}\) as \(n \to \infty\) for all \(t\)

By the convergence theorem on characteristic functions, above, \(F_n(t) \to \phi (t)\).

— □

The theorem says that the distribution functions for sums of increasing numbers of the *X _{i}* converge to the normal distribution function, but it does not tell how fast. It is instructive to consider some examples, which are easily worked out with the aid of our m-functions.

**Demonstration of the central limit theorem**

*Discrete examples*

We first examine the gaussian approximation in two cases. We take the sum of five iid simple random variables in each case. The first variable has six distinct values; the second has only three. The discrete character of the sum is more evident in the second case. Here we use not only the gaussian approximation, but the gaussian approximation shifted one half unit (the so called continuity correction for integer-values random variables). The fit is remarkably good in either case with only five terms.

A principal tool is the m-function *diidsum* (sum of discrete iid random variables). It uses a designated number of iterations of mgsum.

Example \(\PageIndex{1}\) First random variable

X = [-3.2 -1.05 2.1 4.6 5.3 7.2]; PX = 0.1*[2 2 1 3 1 1]; EX = X*PX' EX = 1.9900 VX = dot(X.^2,PX) - EX^2 VX = 13.0904 [x,px] = diidsum(X,PX,5); % Distribution for the sum of 5 iid rv F = cumsum(px); % Distribution function for the sum stairs(x,F) % Stair step plot hold on plot(x,gaussian(5*EX,5*VX,x),'-.') % Plot of gaussian distribution function % Plotting details (seeFigure 13.2.1)

**Figure 13.2.1.** Distribution for the sum of five iid random variables.

Example \(\PageIndex{2}\) Second random variable

X = 1:3; PX = [0.3 0.5 0.2]; EX = X*PX' EX = 1.9000 EX2 = X.^2*PX' EX2 = 4.1000 VX = EX2 - EX^2 VX = 0.4900 [x,px] = diidsum(X,PX,5); % Distribution for the sum of 5 iid rv F = cumsum(px); % Distribution function for the sum stairs(x,F) % Stair step plot hold on plot(x,gaussian(5*EX,5*VX,x),'-.') % Plot of gaussian distribution function plot(x,gaussian(5*EX,5*VX,x+0.5),'o') % Plot with continuity correction % Plotting details (seeFigure 13.2.2)

**Figure 13.2.2.** Distribution for the sum of five iid random variables.

As another example, we take the sum of twenty one iid simple random variables with integer values. We examine only part of the distribution function where most of the probability is concentrated. This effectively enlarges the x-scale, so that the nature of the approximation is more readily apparent.

Example \(\PageIndex{3}\) Sum of twenty-one iid random variables

X = [0 1 3 5 6]; PX = 0.1*[1 2 3 2 2]; EX = dot(X,PX) EX = 3.3000 VX = dot(X.^2,PX) - EX^2 VX = 4.2100 [x,px] = diidsum(X,PX,21); F = cumsum(px); FG = gaussian(21*EX,21*VX,x); stairs(40:90,F(40:90)) hold on plot(40:90,FG(40:90)) % Plotting details (seeFigure 13.2.3)

**Figure 13.2.3.** Distribution for the sum of twenty one iid random variables.

*Absolutely continuous examples*

By use of the discrete approximation, we may get approximations to the sums of absolutely continuous random variables. The results on discrete variables indicate that the more values the more quickly the conversion seems to occur. In our next example, we start with a random variable uniform on (0, 1).

Example \(\PageIndex{4}\) Sum of three iid, uniform random variables.

Suppose \(X\) ~ uniform (0, 1). Then \(E[X] = 0.5\) and \(\text{Var} [X] = 1/12\).

tappr Enter matrix [a b] of x-range endpoints [0 1] Enter number of x approximation points 100 Enter density as a function of t t<=1 Use row matrices X and PX as in the simple case EX = 0.5; VX = 1/12; [z,pz] = diidsum(X,PX,3); F = cumsum(pz); FG = gaussian(3*EX,3*VX,z); length(z) ans = 298 a = 1:5:296; % Plot every fifth point plot(z(a),F(a),z(a),FG(a),'o') % Plotting details (seeFigure 13.2.4)

**Figure 13.2.4.** Distribution for the sum of three iid uniform random variables.

For the sum of only three random variables, the fit is remarkably good. This is not entirely surprising, since the sum of two gives a symmetric triangular distribution on (0, 2). Other distributions may take many more terms to get a good fit. Consider the following example.

Example \(\PageIndex{5}\) Sum of eight iid random variables

Suppose the density is one on the intervals (-1, -0.5) and (0.5, 1). Although the density is symmetric, it has two separate regions of probability. From symmetry. \(E[X] = 0\). Calculations show \(\text{Var}[X] = E[X^2] = 7/12\). The MATLAB computations are:

tappr Enter matrix [a b] of x-range endpoints [-1 1] Enter number of x approximation points 200 Enter density as a function of t (t<=-0.5)|(t>=0.5) Use row matrices X and PX as in the simple case [z,pz] = diidsum(X,PX,8); VX = 7/12; F = cumsum(pz); FG = gaussian(0,8*VX,z); plot(z,F,z,FG) % Plottting details (seeFigure 13.2.5)

**Figure 13.2.5**. Distribution for the sum of eight iid uniform random variables.

Although the sum of eight random variables is used, the fit to the gaussian is not as good as that for the sum of three in __Example 13.2.4__. In either case, the convergence is remarkable fast—only a few terms are needed for good approximation.

## Convergence phenomena in probability theory

The central limit theorem exhibits one of several kinds of convergence important in probability theory, namely convergence *in distribution* (sometimes called *weak* convergence). The increasing concentration of values of the sample average random variable *A _{n}*with increasing \(n\) illustrates convergence

*in probability*. The convergence of the sample average is a form of the so-called

*weak law of large numbers*. For large enough

*n*the probability that \(A_n\) lies within a given distance of the population mean can be made as near one as desired. The fact that the variance of \(A_n\) becomes small for large

*n*illustrates convergence

*in the mean*(of order 2).

\(E[|A_n - \mu|^2] \to 0\) as \(n \to \infty\)

In the calculus, we deal with sequences of numbers. If \(\{a_n: 1 \le n\}\) s a sequence of real numbers, we say the sequence converges iff for \(N\) sufficiently large \(a_n\) approximates arbitrarily closely some number \(L\) for all \(n \ge N\). This unique number \(L\) is called the limit of the sequence. Convergent sequences are characterized by the fact that for large enough \(N\), the distance \(|a_n - a_m|\) between any two terms is arbitrarily small for all \(n\), \(m \ge N\). Such a sequence is said to be *fundamental* (or *Cauchy*). To be precise, if we let \(\epsilon > 0\) be the error of approximation, then the sequence is

- Convergent iff there exists a number \(L\) such that for any \(\epsilon > 0\) there is an \(N\) such that

\(|L - a_n| \le \epsilon\) for all \(n \ge N\)

- Fundamental iff for any \(\epsilon > 0\) there is an \(N\) such that

\(|a_n - a_m| \le \epsilon\) for all \(n, m \ge N\)

As a result of the completeness of the real numbers, it is true that any fundamental sequence converges (i.e., has a limit). And such convergence has certain desirable properties. For example the limit of a linear combination of sequences is that linear combination of the separate limits; and limits of products are the products of the limits.

The notion of convergent and fundamental sequences applies to sequences of real-valued functions with a common domain. For each \(x\) in the domain, we have a sequence

\(\{f_n (x): 1 \le n\}\) of real numbers. The sequence may converge for some \(x\) and fail to converge for others.

A somewhat more restrictive condition (and often a more desirable one) for sequences of functions is *uniform* convergence. Here the uniformity is over values of the argument \(x\). In this case, for any \(\epsilon > 0\) there exists an \(N\) which works for all \(x\) (or for some suitable prescribed set of \(x\)).

*These concepts may be applied to a sequence of random variables*, which are real-valued functions with domain \(\Omega\) and argument \(\omega\). Suppose \(\{X_n: 1 \le n\}\) is is a sequence of real random variables. For each argument \(\omega\) we have a sequence \(\{X_n (\omega): 1 \le n\}\) of real numbers. It is quite possible that such a sequence converges for some *ω* and diverges (fails to converge) for others. As a matter of fact, in many important cases the sequence converges for all \(\omega\) except possibly a set (event) of probability zero. In this case, we say the seqeunce converges *almost surely* (abbreviated a.s.). The notion of uniform convergence also applies. In probability theory we have the notion of *almost uniform* convergence. This is the case that the sequence converges uniformly for all \(\omega\) except for a set of arbitrarily small probability.

The notion of convergence *in probability* noted above is a quite different kind of convergence. Rather than deal with the sequence on a pointwise basis, it deals with the random variables as such. In the case of sample average, the “closeness” to a limit is expressed in terms of the probability that the observed value \(X_n (\omega)\) should lie close the the value \(X(\omega)\) of the limiting random variable. We may state this precisely as follows:

A sequence \(\{X_n: 1 \le n\}\) converges to *X**in** probability*, designated \(X_n \stackrel{P}\longrightarrow X\) iff for any \(\epsilon > 0\).

\(\text{lim}_n P(|X - X_n| > \epsilon) = 0\)

There is a corresponding notion of a sequence fundamental in probability.

The following schematic representation may help to visualize the difference between almost-sure convergence and convergence in probability. In setting up the basic probability model, we think in terms of “balls” drawn from a jar or box. Instead of balls, consider for each possible outcome \(\omega\) a “tape” on which there is the sequence of values \(X_1 (\omega)\), \(X_2 (\omega)\), \(X_3 (\omega)\), \(\cdot\cdot\cdot\).

- If the sequence of random variable converges a.s. to a random variable \(X\), then there is an set of “exceptional tapes” which has zero probability. For all other tapes, \(X_n (\omega) \to X(\omega)\). This means that by going far enough out on
*any*such tape, the values \(X_n (\omega)\) beyond that point all lie within a prescribed distance of the value \(X(\omega)\) of the limit random variable. - If the sequence converges in probability, the situation may be quite different. A tape is selected. For \(n\) sufficiently large, the probability is arbitrarily near one that the observed value \(X_n (\omega)\) lies within a prescribed distance of \(X(\omega)\). This says nothing about the values \(X_m (\omega)\) on the selected tape for any larger \(m\). In fact, the sequence on the selected tape may very well diverge.

It is not difficult to construct examples for which there is convergence in probability but pointwise convergence for *no *\(\omega\). It is easy to confuse these two types of convergence. The kind of convergence noted for the sample average is convergence in probability (a “weak” law of large numbers). What is really desired in most cases is a.s. convergence (a “strong” law of large numbers). It turns out that for a sampling process of the kind used in simple statistics, the convergence of the sample average is almost sure (i.e., the strong law holds). To establish this requires much more detailed and sophisticated analysis than we are prepared to make in this treatment.

The notion of mean convergence illustrated by the reduction of \(\text{Var} [A_n]\) with increasing \(n\) may be expressed more generally and more precisely as follows. A sequence \(\{X_n: 1 \le n\}\) converges in the mean of order \(p\) to \(X\) iff

\(E[|X - X_n|^p] \to 0\) as \(n \to \infty\) designated \(X_n \stackrel{L^p}\longrightarrow X\); as \(n \to \infty\)

If the order \(p\) is one, we simply say the sequence converges in the mean. For \(p = 2\), we speak of *mean-square convergence*.

The introduction of a new type of convergence raises a number of questions.

- There is the question of fundamental (or Cauchy) sequences and convergent sequences.
- Do the various types of limits have the usual properties of limits? Is the limit of a linear combination of sequences the linear combination of the limits? Is the limit of products the product of the limits?
- What conditions imply the various kinds of convergence?
- What is the relation between the various kinds of convergence?

Before sketching briefly some of the relationships between convergence types, we consider one important condition known as *uniform integrability*. According to the property __(E9b)__ for integrals

\(X\) is integrable iff \(E[I_{\{|X_i|>a\}} |X_t|] \to 0\) as \(a \to \infty\)

Roughly speaking, to be integrable a random variable cannot be too large on too large a set. We use this characterization of the integrability of a single random variable to define the notion of the uniform integrability of a class.

Definition

An arbitray class \(\{X_t: t \in T\}\) is *uniformly integrable* (abbreviated u.i.) with respect to probability measure \(P\) iff

\(\text{sup}_{t \in T} E[I_{\{|X_i| > a\}} | X_t|] \to 0\) as \(a \to \infty\)

This condition plays a key role in many aspects of theoretical probability.

The relationships between types of convergence are important. Sometimes only one kind can be established. Also, it may be easier to establish one type which implies another of more immediate interest. We simply state informally some of the important relationships. A somewhat more detailed summary is given in PA, Chapter 17. But for a complete treatment it is necessary to consult more advanced treatments of probability and measure.

*Relationships between types of convergence for probability measures*

Consider a sequence \(\{X_n: 1 \le n\}\) of random variables.

It converges almost surely iff it converges almost uniformly.

If it converges almost surely, then it converges in probability.

It converges in mean, order \(p\), iff it is uniformly integrable and converges in probability.

If it converges in probability, then it converges in distribution (i.e. weakly).

Various chains of implication can be traced. For example

- Almost sure convergence
*implies*convergence in probability*implies*convergence in distribution. - Almost sure convergence and uniform integrability
*implies*convergence in mean \(p\).

We do not develop the underlying theory. While much of it could be treated with elementary ideas, a complete treatment requires considerable development of the underlying measure theory. However, it is important to be aware of these various types of convergence, since they are frequently utilized in advanced treatments of applied probability and of statistics.