Skip to content

The central limit theorem

Average enough draws from a lopsided shape and the averages pile into a bell around the mean, narrowing as the square root of n grows.

Helps to know first
This topic

First, the picture

Average 30 draws from a lopsided shape, 2000 times. What shape does the pile of averages take? Pick a sketch, then watch.

Average enough draws and a bell appears

Draws from Exp(1), averaged in samples of n; 2000 samples per setting (seed 4200 + n).

Averages of n = 1 draw: each average is just one draw from the shape at the top. 2000 of them fall into the pile.

n
1
off the scale
0
spread of the averages
–
spread predicted, 1/√n
1.000

Predict first. Average 30 draws from the lopsided shape above, 2000 times. What does the pile look like?

0.00 / 29.00 s
Describe this picture

Before the clip, three small sketches ask for a guess: “lopsided like the top”, “a bell” or “flat”; a tap starts the clip, and Play starts it without a guess. Then three panels, stacked, on one horizontal scale. The top panel, “every draw”, shows the lopsided curve fX(x)=e−xf_X(x)=e^{-x} from 0 to 5 with its mean marked at 1; it never changes. The middle panel, “one sample of n”, shows the n draws of one sample as dots on a strip, with their average as a triangle. The bottom panel, “the averages”, is a histogram from 0 to 4 in bins 0.1 wide, filled by 2000 averages. The clip runs n through 1, 2, 5, 10 and 30, about 5 s each. Each time the first 20 averages fall one by one from the middle panel’s triangle while their samples flash there, and stack as dots on their bars; the other 1980 pour in, and a dotted bell with the same centre and spread, labelled “bell, same centre and spread”, is drawn over the pile. The captions say: at n = 1, “each average is one draw, so the pile copies the lopsided shape above; the dotted bell does not fit”; at n = 2, the peak has moved off zero, to the bar from 0.4 to 0.5, and a long tail still runs right; at n = 5, the peak is the bar from 0.8 to 0.9 and the tail is shorter; at n = 10, the peak is still that bar, and the pile is narrower; at n = 30, “a nearly symmetric bell around 1, spread 0.183, as 1/√30 = 0.183 predicts”. Readouts give n, “spread of the averages” as measured, “spread predicted, 1/√n”, and “off the scale”, the averages above 4. From the start of n = 30 your guess is drawn over the pile as a dashed outline labelled “your guess”, and the last caption adds “You expected …; at n = 30 the pile is a nearly symmetric bell.” After the clip a slider, “Draws per average, n”, sets n from 1 to 50.

One draw, one sample, many averages

What did you pick? Many people pick the lopsided sketch, because the draws are lopsided. Others pick the bell, because they have heard that “data is bell-shaped”. The pile at n = 30 is a bell, but not because the data became one.

Look at the top panel again. It is the shape every single draw comes from, and it never moves. I chose an exponential shape, the kind that describes waiting times: most waits are short, a few are long, and none is below zero. Its curve is fX(x)=e−xf_X(x)=e^{-x} for x≥0x\ge0. Here XX is one draw, and fXf_X is its density, as in Continuous random variables. This shape is called Exp(1)\mathrm{Exp}(1); the 1 is its rate, one arrival per unit of time on average. Its mean is μX=1\mu_X=1 and its standard deviation is σX=1\sigma_X=1; the subscript names the random number they belong to. A bare μ\mu or σ\sigma appears only inside a bell’s name, N(μ,σ2)\mathcal{N}(\mu,\sigma^2), and signal processing pages use a bare σ\sigma for something else.

The middle panel is one sample: nn draws, and their average. The bottom panel collects m=2000m=2000 such averages, one sample at a time. Only the bottom panel changes when nn grows. The draws stay lopsided. One sample stays a scatter of lopsided draws. It is the pile of averages that rounds into a bell.

So keep the three things apart: the shape of one draw, one sample of nn draws, and the pile of many averages. Mixing them up is a common mistake with this theorem. After the clip, drag nn from 1 to 50 and watch only the bottom panel.

How wide the pile is

Why does the pile narrow? Write the average of nn draws as

Xˉn=X1+X2+⋯+Xnn.\bar X_n=\frac{X_1+X_2+\cdots+X_n}{n}.

The bar marks an average of draws, and Xˉn\bar X_n is random: a new sample gives a new value. Each draw has mean μX\mu_X, so the average has mean μX\mu_X too, (μX+⋯+μX)/n=μX(\mu_X+\cdots+\mu_X)/n=\mu_X. The pile stays centred on 1.

For the spread, I use the rule from Sums of random variables: for draws that do not affect one another, the variances add. The sum of nn draws has variance nσX2n\sigma_X^2. Dividing by nn divides the variance by n2n^2. So

E{Xˉn}=μX,Var{Xˉn}=σX2n,spread of Xˉn=σXn.\mathbb{E}\{\bar X_n\}=\mu_X,\qquad \mathrm{Var}\{\bar X_n\}=\frac{\sigma_X^2}{n},\qquad \text{spread of }\bar X_n=\frac{\sigma_X}{\sqrt n}.

This is the spread you met in The law of large numbers. With σX=1\sigma_X=1, the predicted spreads at the clip’s five steps are:

Draws per averagePredicted spread
n=1n=11.000
n=2n=20.707
n=5n=50.447
n=10n=100.316
n=30n=300.183

The readout “spread of the averages” is measured from the 2000 averages on screen, so it wobbles a little around these values. Four times as many draws halve the spread: that square root is why.

The bell

The spread is only half of the story. The surprise is the shape. As nn grows, the pile looks more and more like the bell of The normal distribution, whatever shape the draws came from.

To compare shapes I need one scale. Subtract the mean and divide by the spread:

Zn=Xˉn−μXσX/n.Z_n=\frac{\bar X_n-\mu_X}{\sigma_X/\sqrt n}.

Now ZnZ_n always has mean 0 and spread 1. The central limit theorem says that if the draws are independent, all come from one shape, and that shape has a finite standard deviation σX\sigma_X, then as nn grows

Pr⁡{Zn≤z} → Φ(z)for every z,\Pr\{Z_n\le z\}\ \to\ \Phi(z)\quad\text{for every } z,

where Φ\Phi is the distribution function of the standard bell N(0,1)\mathcal{N}(0,1). In words: the average is close to N(μX,σX2/n)\mathcal{N}(\mu_X,\sigma_X^2/n), a bell with the same centre and spread as the pile. That is the dotted bell in the picture. The sum of the draws, which I’ll write Sn=X1+⋯+XnS_n=X_1+\cdots+X_n (a sum, not the sample space SS), is nn times the average, so it is close to N(nμX, nσX2)\mathcal{N}(n\mu_X,\,n\sigma_X^2).

This is not the law of large numbers again. That law says the average settles at μX\mu_X, so the pile shrinks towards one spike. This theorem says what shape the pile has on the way, once you zoom in by n\sqrt n.

How fast the bell arrives

How large must nn be? It depends on how lopsided the start is. One measure of lopsidedness is the skewness: zero for a shape that is the same on both sides, positive when a long tail runs to the right. The exponential shape has skewness 2. The average of nn of its draws has skewness 2/n2/\sqrt n, so the lean fades, but slowly.

01020304050n, draws per average012skewness of the average, 2/√n
Fig. The lean of the averages fades as 2/√n. The dots are the clip’s steps, n = 1, 2, 5, 10 and 30.

At n = 30 the skewness is still 0.37, so the pile in the picture leans a little to the right, even though it looks like a bell. The worked example below shows what that lean costs in a tail.

Counting heads with a bell

Toss a fair coin nn times and count the heads. The count is a sum of nn draws, each 1 for a head and 0 for a tail. Each draw has mean 12\tfrac12 and standard deviation 12\tfrac12. So the count is close to a bell with mean n/2n/2 and variance n/4n/4, as the sum rule above says.

In general the count KK of successes in nn tries with chance pp follows Bin(n,p)\mathrm{Bin}(n,p), from Discrete random variables, and

K ≈ N(np, np(1−p)).K\ \approx\ \mathcal{N}\big(np,\ np(1-p)\big).

A usual rule of thumb asks for np≥10np\ge10 and n(1−p)≥10n(1-p)\ge10 before you trust it.

There is one catch. The count is a whole number, drawn as bars, and the bell is a smooth curve. Watch the bars of Bin(n,12)\mathrm{Bin}(n,\tfrac12) and the bell together, with the bars at or above 0.6n0.6n filled.

Half a bar makes the bell fit

Heads in n fair flips: the exact bars and the bell with the same centre and spread.

20 fair flips, 12 heads or more: the filled bars add to 0.2517. The bell from 11.5, half a bar early, gives 0.2512; from 12 it gives only 0.1855.

flips n
20
exact
0.2517
bell with half-bar
0.2512
bell without
0.1855
0.00 / 13.00 s
Describe this picture

Bars of the chance of each count of heads, from 0 to n, with the bell N(n/2, n/4)\mathcal{N}(n/2,\,n/4) drawn over them. The bars at or above 0.6n0.6n are filled, the bell’s area from half a unit below the first filled bar is shaded, and a bracket on that bar marks its width, labelled from half a unit below the count to half a unit above (“59.5 to 60.5” at n = 100). A key names the filled bars, the bell and the shaded area. In the clip n steps from 20 to 100 in steps of 20, resting on each. Three readouts give the chance of 0.6n0.6n heads or more: “exact”, “bell with half-bar” and “bell without”. At n = 20 they read 0.2517, 0.2512 and 0.1855; at n = 100, 0.0284, 0.0287 and 0.0228. When the clip has finished, a slider sets n to 20, 40, 60, 80 or 100.

Each bar is one unit wide: the bar for 60 heads stands on the stretch from 59.5 to 60.5. So “60 heads or more” is the area of the bars from 59.5 upwards, and the bell’s area should start there too, not at 60. Starting half a bar early is the continuity correction:

Pr⁡{K≥k} ≈ 1−Φ ⁣(k−12−npnp(1−p)).\Pr\{K\ge k\}\ \approx\ 1-\Phi\!\left(\frac{k-\tfrac12-np}{\sqrt{np(1-p)}}\right).

After the clip, step n through its values and compare the three readouts. The half-bar bell stays close to the exact chance even at n = 20; the bell without it is far off there.

Worked example

Waiting at a counter. Service times at a counter follow an exponential shape with mean 2 minutes, so the standard deviation is 2 minutes too. What is the chance that 36 customers average more than 2.5 minutes?

  1. The average of 36 has mean 2 and spread 2/36=2/6=0.33332/\sqrt{36}=2/6=0.3333 minutes.
  2. Standardise: z=(2.5−2)/0.3333=1.5z=(2.5-2)/0.3333=1.5.
  3. By the bell: Pr⁡{Xˉ36>2.5}≈1−Φ(1.5)=0.0668\Pr\{\bar X_{36}>2.5\}\approx1-\Phi(1.5)=0.0668.
  4. Computed exactly, without the bell, the chance is 0.0742. The bell is too low by about a tenth.
  5. Why too low? The averages still lean right: their skewness is 2/36=0.332/\sqrt{36}=0.33. A lean to the right means a heavier right tail than the bell’s.

Sixty heads. Toss a fair coin 100 times. What is the chance of 60 heads or more?

  1. The mean is 100⋅12=50100\cdot\tfrac12=50 and the spread is 100⋅12⋅12=5\sqrt{100\cdot\tfrac12\cdot\tfrac12}=5.
  2. Exactly, from the binomial: 0.0284.
  3. Bell with the half-bar: z=(59.5−50)/5=1.9z=(59.5-50)/5=1.9, and 1−Φ(1.9)=0.02871-\Phi(1.9)=0.0287.
  4. Bell without it: z=(60−50)/5=2z=(60-50)/5=2, and 1−Φ(2)=0.02281-\Phi(2)=0.0228.
  5. The same question at 20 tosses, 12 heads or more: exactly 263 950/220=0.2517263\,950/2^{20}=0.2517; with the half-bar, z=1.5/5z=1.5/\sqrt5 and the bell gives 0.2512; without it, z=2/5z=2/\sqrt5 and the bell gives 0.1855.

Try these before you read the answers.

  • The average of 25 draws from Exp(1)\mathrm{Exp}(1): what is its spread? 1/25=0.21/\sqrt{25}=0.2.
  • How many draws would halve that spread? Four times as many, 100.
  • Do the 30 draws of one sample look like a bell? No. Only their average does; the top panel never moves.

Where you’ll meet this

An opinion poll asks 1000 people a yes-or-no question. The share who say yes is an average of 1000 draws of 0 or 1, so it is close to a bell. Its spread is p(1−p)/1000\sqrt{p(1-p)/1000}, where pp is the true share, and that is largest at an even split: 0.25/1000=0.016\sqrt{0.25/1000}=0.016. About 95 % of a bell lies within 1.96 spreads of its centre, which is where the familiar “plus or minus 3 points” comes from.

A factory weighs five bags each hour and plots their average. Because the average of five is close to a bell, with a spread 5\sqrt5 times smaller than one bag’s, the chart can warn when the average leaves its usual band, long before single bags look strange.

The hiss of an amplifier is the sum of very many tiny, independent pushes from moving electrons. That is why electronic noise follows a bell so closely, and why noise in signal processing is usually modelled as Gaussian, which is another name for the bell.

In signal processing · repeated convolution

Adding two independent random numbers convolves their densities, as Sums of random variables shows. So this theorem also says something about signals: convolve a pulse that never goes negative with itself again and again, and the shape of the result tends to a bell. The page Transforms of common signals shows that a bell is its own transform. One difference in writing: signal processing pages write a random signal in lower case, x[n]x[n], and a density as px(α)p_x(\alpha); here a random number is a capital XX and its density is fX(x)f_X(x).

The page Confidence intervals uses exactly this spread, σX/n\sigma_X/\sqrt n, and this bell.

Reference card

QuantityFormulaNotes
AverageXˉn=(X1+⋯+Xn)/n\bar X_n=(X_1+\cdots+X_n)/nrandom: a new sample, a new value
Its meanE{Xˉn}=μX\mathbb{E}\{\bar X_n\}=\mu_Xthe pile stays centred
Its spreadσX/n\sigma_X/\sqrt nfour times the draws, half the spread
StandardisedZn=(Xˉn−μX)/(σX/n)Z_n=(\bar X_n-\mu_X)/(\sigma_X/\sqrt n)tends to N(0,1)\mathcal{N}(0,1)
SumSn≈N(nμX, nσX2)S_n\approx\mathcal{N}(n\mu_X,\,n\sigma_X^2)independent draws, one shape, finite σX\sigma_X
Leanskewness 2/n2/\sqrt n for Exp(1)\mathrm{Exp}(1)lopsided starts need larger nn
BinomialBin(n,p)≈N(np, np(1−p))\mathrm{Bin}(n,p)\approx\mathcal{N}(np,\,np(1-p))when np≥10np\ge10 and n(1−p)≥10n(1-p)\ge10
Half-barPr⁡{K≥k}≈1−Φ((k−12−np)/np(1−p))\Pr\{K\ge k\}\approx1-\Phi\big((k-\tfrac12-np)/\sqrt{np(1-p)}\big)start half a bar early

Keep reading with a free account.

By creating an account you accept the terms of use.

Sign in

Already have an account? Use the service you signed up with.

Or keep reading: get new lessons by email

Are you 13 or over?

Accounts and email updates are for people aged 13 or over. We keep only your answer, never your date of birth.

End of the lesson

Where to go next.

Phasorium

Account

Sign inKeep your place on any device

Subjects

Site

Look