Unit 11, lesson 70

The Central Limit Theorem

How the central limit theorem describes the standardized sum of IID variables with finite positive variance through convergence in distribution, how to use the normal approximation for an average, and why heavy tails matter.

  • Video 70
  • Limit Theorems for Averages

In a constructed model, 100100 waits at a service desk are independent exponential times with rate 11 per minute. A single wait is strongly skewed, often short and occasionally long, and the law of large numbers says that the average wait is probably close to 11 minute. It does not say how the remaining fluctuation is distributed, for example how likely the average is to land between 0.80.8 and 1.21.2 minutes. The central limit theorem gives an approximate answer once the sum or the average is centered and scaled. This lesson states the theorem precisely, uses it for sums and averages, and marks where it gives no guarantee.

Key terms

Standardized sum

Definition Let X1,…,XnX_1, \dots, X_n be IID with mean μ\mu and variance σ2\sigma^2, where 0<σ2<∞0 < \sigma^2 < \infty, and let Sn=X1+⋯+XnS_n = X_1 + \cdots + X_n and Xˉn=Sn/n\bar{X}_n = S_n/n. Then E[Sn]=nμE[S_n] = n\mu and SD⁡(Sn)=σn\operatorname{SD}(S_n) = \sigma\sqrt{n}, while E[Xˉn]=μE[\bar{X}_n] = \mu and SD⁡(Xˉn)=σ/n\operatorname{SD}(\bar{X}_n) = \sigma/\sqrt{n}, the standard error of the sample mean. The standardized sum is

Zn=Sn−nμσn=Xˉn−μσ/n,\begin{aligned} Z_n &= \frac{S_n - n\mu}{\sigma\sqrt{n}} \\[0.4em] &= \frac{\bar{X}_n - \mu}{\sigma/\sqrt{n}}, \end{aligned}

so the standardized sum and the standardized average are the same random variable. It has E[Zn]=0E[Z_n] = 0 and Var⁡(Zn)=1\operatorname{Var}(Z_n) = 1 for every nn.

In plain words Measure the distance of the sum from its mean in units of its own standard deviation. Without this rescaling the spread of the sum grows like n\sqrt{n} and the spread of the average shrinks like 1/n1/\sqrt{n}, so neither keeps a fixed scale on which a shape could settle. Three distributions must be kept apart, the population distribution of one observation, the distribution of the sum and the sampling distribution of the average.

Example In the waiting model Xi∼Exp⁡(1)X_i \sim \operatorname{Exp}(1) in minutes, so μ=1\mu = 1 and σ=1\sigma = 1. For n=100n = 100 the total wait S100S_{100} has mean 100100 and standard deviation 1010, and the average Xˉ100\bar{X}_{100} has mean 11 and standard error 0.10.1. A total of 120120 minutes and an average of 1.21.2 minutes describe the same outcome, and both standardize to

120−10010=1.2−10.1=2.\frac{120 - 100}{10} = \frac{1.2 - 1}{0.1} = 2.

Each single wait still has the exponential distribution, whatever nn is.

Convergence in distribution

Definition Random variables Y1,Y2,…Y_1, Y_2, \dots with CDFs F1,F2,…F_1, F_2, \dots converge in distribution to a random variable YY with CDF FF if

lim⁡n→∞Fn(y)=F(y)\lim_{n \to \infty} F_n(y) = F(y)

at every real yy where FF is continuous. When the limit is standard normal, its CDF Φ\Phi is continuous everywhere, so the convergence holds at every real number. Then also P(a<Yn≤b)→Φ(b)−Φ(a)P(a < Y_n \le b) \to \Phi(b) - \Phi(a) for all a<ba < b, with the same limit for open or closed endpoints. Convergence in distribution is a statement about probabilities, not a claim that the values of YnY_n approach the values of some particular random variable.

In plain words Away from the jumps of the limiting CDF, the CDFs settle down to it, and so do probabilities of intervals whose endpoints avoid those jumps. The jump points are excused, because probability that approaches a jump point from the right is never counted at that point along the way.

Example Let Yn=1/nY_n = 1/n with probability 11, which ought to converge to the constant 00. For y>0y > 0 the CDF Fn(y)F_n(y) equals 11 once 1/n≤y1/n \le y, and for y<0y < 0 it equals 00, matching the CDF of the constant 00. At y=0y = 0, however, Fn(0)=P(1/n≤0)=0F_n(0) = P(1/n \le 0) = 0 for every nn, while the limiting CDF has F(0)=1F(0) = 1. The point 00 is where FF jumps, so the definition does not test it, and YnY_n converges in distribution to 00.

Central limit theorem

Definition Let X1,X2,…X_1, X_2, \dots be IID with mean μ\mu and variance σ2\sigma^2, where 0<σ2<∞0 < \sigma^2 < \infty, and let Sn=X1+⋯+XnS_n = X_1 + \cdots + X_n. Then for every real zz

P(Sn−nμσn≤z)→Φ(z)as n→∞.\begin{aligned} &P\Bigl(\frac{S_n - n\mu}{\sigma\sqrt{n}} \le z\Bigr) \\[0.4em] &\quad \to \Phi(z) \quad \text{as } n \to \infty. \end{aligned}

That is, the standardized sum ZnZ_n, which equals the standardized average, converges in distribution to a standard normal variable. The theorem is a limit statement. For a fixed nn the distribution of ZnZ_n is generally not exactly normal, and the theorem by itself gives no bound on the error at any particular nn. Independence and a finite positive variance are part of the hypothesis. Other central limit theorems cover some dependent observations or observations with different distributions, under conditions of their own.

In plain words Once centered and scaled, the sum of many independent copies of a random variable with finite positive variance has probabilities of intervals close to standard normal ones, whatever the shape of a single observation. How close depends on the distribution, on nn and on the event.

Example For the 100100 exponential waits, the event 0.8<Xˉ100<1.20.8 < \bar{X}_{100} < 1.2 is the event −2<Z100<2-2 < Z_{100} < 2, so

P(0.8<Xˉ100<1.2)≈Φ(2)−Φ(−2)≈0.9545.\begin{aligned} &P(0.8 < \bar{X}_{100} < 1.2) \\[0.4em] &\quad \approx \Phi(2) - \Phi(-2) \\[0.4em] &\quad \approx 0.9545. \end{aligned}

The exact value under the exponential model, from the distribution of a sum of independent exponential waits, is about 0.95500.9550, so here the approximation is off by about 0.00050.0005. Independence matters. If every observation equals the same wait W∼Exp⁡(1)W \sim \operatorname{Exp}(1), then Sn=nWS_n = nW has standard deviation nn, which exceeds n\sqrt{n} for every n≥2n \ge 2. The formula above then gives n (W−1)\sqrt{n}\,(W - 1), whose variance nn grows without bound, and standardizing with the true standard deviation gives W−1W - 1, which keeps the skewed exponential shape for every nn.

Normal approximation for an average

Definition Under the hypotheses of the central limit theorem and for large nn, the sample mean is approximately normal,

Xˉn≈N(μ,σ2n).\bar{X}_n \approx N\Bigl(\mu, \frac{\sigma^2}{n}\Bigr).

This means that for a<ba < b

P(a<Xˉn<b)≈Φ(zb)−Φ(za),\begin{aligned} &P(a < \bar{X}_n < b) \\[0.4em] &\quad \approx \Phi(z_b) - \Phi(z_a), \end{aligned}

with the standardized endpoints

za=a−μσ/n,zb=b−μσ/n.\begin{gathered} z_a = \frac{a - \mu}{\sigma/\sqrt{n}}, \\[0.4em] z_b = \frac{b - \mu}{\sigma/\sqrt{n}}. \end{gathered}

Equivalently, SnS_n is approximately N(nμ,nσ2)N(n\mu, n\sigma^2). Both statements are approximations. When the observations are themselves normal, Xˉn\bar{X}_n is exactly N(μ,σ2/n)N(\mu, \sigma^2/n) for every n≥1n \ge 1, which is a separate fact about sums of independent normal variables. For a discrete population the average stays discrete, and an endpoint adjustment can improve the approximation, as the next lesson shows.

In plain words Turn the event about the average into an event about the standardized variable, then read the probability from Φ\Phi. The approximation describes the average of many observations, not a single observation. It is usually least accurate, relative to the size of the probability, far out in the tails.

Example A rule such as n≥30n \ge 30 cannot guarantee accuracy for every distribution and every event. For 3030 IID Exp⁡(1)\operatorname{Exp}(1) waits the standard error is 1/30≈0.18261/\sqrt{30} \approx 0.1826. The table compares the normal approximation with exact values from the distribution of the sum.

EventNormal approximationExact
0.8<Xˉ30<1.20.8 < \bar{X}_{30} < 1.20.72670.72670.73000.7300
Xˉ30>1.5\bar{X}_{30} > 1.50.00310.00310.00730.0073
Xˉ30<0.5\bar{X}_{30} < 0.50.00310.00310.00040.0004

Near the center the approximation is close. In the upper tail it gives less than half the true value, and in the lower tail it is about seven times too large, because the skew of the exponential distribution is still visible at n=30n = 30.

Finite positive variance

Definition The theorem requires 0<σ2<∞0 < \sigma^2 < \infty. A finite variance means E[X2]<∞E[X^2] < \infty, which also makes the mean finite, and it is needed so that σ\sigma exists for the standardization. A positive variance rules out a constant observation. If σ2=0\sigma^2 = 0, each XiX_i equals μ\mu with probability 11, the sum equals nμn\mu with probability 11, and the standardization would divide by 00.

In plain words The theorem describes fluctuations measured in units of σ\sigma, so σ\sigma must be a genuine positive number. With no fluctuation there is nothing to describe, and with infinite variance there is no unit to measure in.

Example For Exp⁡(λ)\operatorname{Exp}(\lambda) the variance 1/λ21/\lambda^2 is finite and positive for every rate λ>0\lambda > 0, and for Uniform⁡(a,b)\operatorname{Uniform}(a, b) the variance (b−a)2/12(b - a)^2/12 is finite and positive. A Bernoulli variable with p=1p = 1 has variance 00, and then Sn=nS_n = n with probability 11. The density f(x)=2/x3f(x) = 2/x^3 for x≥1x \ge 1 has mean

∫1∞x⋅2x3 dx=2,\int_1^\infty x \cdot \frac{2}{x^3}\,dx = 2,

but E[X2]=∫1∞2/x dx=∞E[X^2] = \int_1^\infty 2/x \, dx = \infty. Its variance is infinite, so the theorem as stated does not apply to it.

Heavy tails

Definition Heavy tails is an informal description rather than one precise condition. A distribution is called heavy-tailed when it puts comparatively much probability far from its center, often with tail probabilities that shrink like a power of tt, such as P(X>t)=t−3P(X > t) = t^{-3} for t≥1t \ge 1, rather than exponentially fast. Some heavy-tailed distributions have finite variance, and then the central limit theorem applies, although a large nn may be needed. Others have infinite variance, and then this theorem does not apply. For the standard Cauchy density 1/(π(1+x2))1/(\pi(1 + x^2)), which has no mean at all, the average of nn IID copies has the same standard Cauchy distribution for every nn, so averaging does not concentrate it.

In plain words A few rare, very large values can dominate a sum. Before using a normal approximation, check that the variance exists, and do not rely on a rule of thumb for the sample size when extreme values are plausible.

Example The density f(x)=3/x4f(x) = 3/x^4 for x≥1x \ge 1 has P(X>t)=t−3P(X > t) = t^{-3} for t≥1t \ge 1, mean 32\tfrac32, E[X2]=3E[X^2] = 3 and variance 3−94=343 - \tfrac94 = \tfrac34. It is heavy-tailed, since P(X>10)=0.001P(X > 10) = 0.001, while a normal variable with the same mean and variance exceeds 1010 with probability about 5×10−235 \times 10^{-23}. Its variance is finite, so the theorem applies to its averages. The density 2/x32/x^3 of the previous card has P(X>t)=t−2P(X > t) = t^{-2} for t≥1t \ge 1 and infinite variance, so the theorem stated here does not apply to it.

Check yourself

  1. Waits are IID exponential with mean 33 minutes, and n=225n = 225. Find the mean and the standard error of the average, approximate P(2.6<Xˉ<3.4)P(2.6 < \bar{X} < 3.4), and give the equivalent event for the sum S225S_{225}.
Show the answer

An exponential wait with mean 33 has rate 13\tfrac13, variance 99 and standard deviation 33. The average has mean 33 and standard error 3/225=3/15=0.23/\sqrt{225} = 3/15 = 0.2 minutes. The standardized endpoints are (2.6−3)/0.2=−2(2.6 - 3)/0.2 = -2 and (3.4−3)/0.2=2(3.4 - 3)/0.2 = 2, so

P(2.6<Xˉ<3.4)≈Φ(2)−Φ(−2)≈0.9545.\begin{aligned} &P(2.6 < \bar{X} < 3.4) \\[0.4em] &\quad \approx \Phi(2) - \Phi(-2) \\[0.4em] &\quad \approx 0.9545. \end{aligned}

Multiplying by 225225 gives the same event for the sum, 585<S225<765585 < S_{225} < 765. The sum has mean 675675 and standard deviation 3⋅15=453 \cdot 15 = 45, and (585−675)/45=−2(585 - 675)/45 = -2 and (765−675)/45=2(765 - 675)/45 = 2 give the same approximation. Both answers are approximations. The exact probability under the exponential model is about 0.95470.9547.

  1. In the example with 100100 waits from Exp⁡(1)\operatorname{Exp}(1), a student concludes that a single wait satisfies P(0.8<X1<1.2)≈0.9545P(0.8 < X_1 < 1.2) \approx 0.9545. Find the actual probability and explain the mistake.
Show the answer

A single wait has P(X1>t)=e−tP(X_1 > t) = e^{-t} for t≥0t \ge 0, so

P(0.8<X1<1.2)=e−0.8−e−1.2≈0.1481.\begin{aligned} &P(0.8 < X_1 < 1.2) \\[0.4em] &\quad = e^{-0.8} - e^{-1.2} \\[0.4em] &\quad \approx 0.1481. \end{aligned}

The central limit theorem describes the average of many waits, which has standard error 0.10.1. A single wait keeps its exponential distribution with standard deviation 11, whatever the number of waits in the sample, so the population distribution and the sampling distribution of the average must not be confused.

  1. Decide in each case whether the central limit theorem of this lesson justifies a normal approximation for Xˉn\bar{X}_n when nn is large. (a) IID Uniform⁡(0,1)\operatorname{Uniform}(0, 1) observations. (b) Observations X1=⋯=Xn=WX_1 = \cdots = X_n = W with W∼Exp⁡(1)W \sim \operatorname{Exp}(1). (c) IID observations with density 2/x32/x^3 for x≥1x \ge 1. (d) IID Bernoulli observations with p=1p = 1.
Show the answer

Case (a) qualifies, since the observations are IID with variance 112\tfrac{1}{12}, which is finite and positive. Case (b) does not, because the observations are not independent. The average equals WW for every nn, so it keeps the exponential distribution and never becomes approximately normal. Case (c) does not, because the variance is infinite, so there is no σ\sigma for the standardization, and other limit theorems with different scaling are needed for such sums. Case (d) does not, because the variance is 00. The average equals 11 with probability 11, so there is nothing to approximate and the standardization would divide by 00.

How this lesson connects