Maths●●●●●Difficulty 3 of 5

Why does the bell curve keep showing up, even when nothing is bell-shaped?

Drop beads through a forest of pegs and a bell curve builds itself. Alan Turing once proved a version of the theorem behind it, only to learn that it had already been proved.

▶ Start the story

Drop a bead into a forest of pegs and, at each peg, it bounces left or right. Do that with hundreds of beads and they collect in bins at the bottom, the columns forming a bell curve. This is the Galton board, a device invented by Francis Galton to demonstrate the central limit theorem: with a large enough sample, the binomial distribution, which counts left and right bounces, approximates a normal distribution. Lay Pascal's triangle over the pegs and it shows the number of different paths a bead can take to each bin.

How a Galton board builds a bell
  1. Step 1: Drop a bead

    From the top, onto a peg

  2. Step 2: Left or right, peg after peg

    A string of bounces

  3. Step 3: Beads gather in bins

    At the bottom

  4. Step 4: The columns form a bell curve

    The binomial approximates the normal

The theorem itself says something remarkable. Take the average of many independent observations. Repeat that many times, and the collection of averages will closely approximate a normal distribution, even if the original variables are not normally distributed. Roll many dice, and the sum or average of the numbers is well approximated by a normal distribution. Since real-world quantities are often the balanced sum of many unobserved random events, the theorem partly explains why the normal distribution is so common.

Its history is a story of being ignored. Abraham de Moivre postulated the first version in 1733, using the normal distribution to approximate the number of heads in many tosses of a fair coin. The finding was far ahead of its time and nearly forgotten until Laplace rescued it from obscurity in 1812. Only at the end of the nineteenth century, in 1901, did Aleksandr Lyapunov define it in general terms and prove precisely how it worked.

Even Alan Turing met the theorem late. His 1934 Fellowship Dissertation at King's College, Cambridge, proved a result similar to Lindeberg's central limit theorem, and only after submitting it did he learn it had already been proved.

Quiz me

0/3

  1. 1.What does the central limit theorem say about averages of many independent samples?
  2. 2.Why did Kapteyn's log-normal board use triangles instead of ordinary pegs?
  3. 3.Why did the Galton board sit uneasily with Galton's wish to show that extreme intelligence comes from heredity?

Recap

Add up many small independent random pushes and the total tends to a bell curve, whatever the shape of each push, as long as each has a finite mean and variance.

💡 A trick to remember it · Many small bounces, one big bell: pile up the left-rights and the beads sketch the curve for you.

Surprising fact · De Moivre found it for coin tosses in 1733, and it was nearly forgotten until Laplace rescued it in 1812.

Sources (3)

No source, no claim. Every fact in this lesson (16 claims) cites at least one of these.

  1. [1]Galton board · Wikipedia
  2. [2]Central limit theorem · Wikipedia
  3. [3]Normal distribution · Wikipedia
More lessons in ➗ Maths (3) See all maths lessons →

One more light on your map.

Get one lesson like this every day, about the things you love. Free, in two or five minutes.

Get the share card for this lesson ↗