4.9.15 · D4Probability Theory & Statistics

Exercises — Central Limit Theorem — statement, proof sketch, significance

2,961 words13 min readBack to topic

Everything below uses the same cast of symbols, so let us name them once in plain words:

A picture of what "standardize" means geometrically — the lavender curve is the sample mean living near its true centre with spread equal to the standard error; the coral curve is the same thing after subtracting the mean and dividing by the standard error, sliding it to centre 0 with spread 1. The two axes at top and bottom line up value-for-value:

Figure — Central Limit Theorem — statement, proof sketch, significance

Read this figure before Level 2: standardizing is just a slide (subtract the mean) followed by a squeeze (divide by the standard error). Every -value you compute below is measuring a distance in standard-error units on the coral axis.

Handy values used throughout (memorize the shape, not the digits):

0.50 0.6915 1.645 0.9500
1.00 0.8413 1.96 0.9750
1.28 0.8997 2.00 0.9772
1.41 0.9207 2.33 0.9901
Recall Why does

? Total area under the bell is 1. is the area to the left of . Everything not to the left is to the right, so the right-tail area is . ::: .


Level 1 — Recognition

Recall Solution

The CLT needs three things: independent, identically distributed, and finite variance ().

  • (a) ✅ Dice rolls are i.i.d. with . The mean of 200 is beautifully normal.
  • (b) ❌ The Cauchy distribution has no finite mean and infinite variance. The recipe breaks — the average of Cauchy draws is itself Cauchy, never settling. This is the classic CLT counterexample.
  • (c) ✅ Heights are i.i.d. with finite variance, so is approximately normal (and , comfortably past the rule of thumb).
Recall Solution
  • Sample mean : centre , standard error .
  • Sum : centre , spread . Notice the average's spread () is eight times smaller than a single value's spread () — that is at work.

Level 2 — Application

Recall Solution

Standard error . Standardize the boundary : Now convert the "greater than" to a table lookup. The table gives — area to the left. We want the area to the right of , which is everything minus the left part (total area is 1): About a chance the average of 100 draws exceeds 52. (No symmetry was assumed here — just "left area + right area = 1.")

Recall Solution
  • ; .
  • .
  • For a negative we use the bell's mirror symmetry about 0: the left-tail area at equals the right-tail area at , i.e. . Hence About a chance the 100-roll total is below 330. (Here symmetry is used, and stated explicitly, because the table only lists positive .)
Recall Solution

A central 95% region on a bell curve reaches out to standard errors on each side (that is why : it leaves in each tail). So Thus lands in about 95% of the time. This is the seed of Confidence Intervals.


Level 3 — Analysis

Recall Solution
  • ; .
  • Continuity correction — where it comes from. The count can only be a whole number, so its probability lives on isolated spikes at . To draw those spikes as area (so a smooth curve can approximate them), we widen each integer into a bar spanning — a rectangle of width 1 whose area equals . The smooth normal curve is then matched to the tops of these bars. Because the event includes the entire bar at , its area runs up to that bar's right edge, — not to . Look at the figure: the butter-coloured bar at 50 is fully inside the shaded region, and the lavender dashed line sits at its right edge.

The bars-versus-curve picture that derives the (each discrete spike becomes a width-1 bar; the curve tracks the bar tops):

Figure — Central Limit Theorem — statement, proof sketch, significance
Recall Solution

Since and dividing a random variable by divides its variance by : The spread collapses to zero — , a single point. That is the Law of Large Numbers, not a bell curve. Dividing by "squashes too hard." To keep a non-degenerate spread you must divide by , because that exactly cancels the growth of the sum's standard deviation. This is the Goldilocks scaling.

Recall Solution

First, what "skewness" means. Skewness is a single number measuring lopsidedness — how much longer one tail is than the other. Its formula is the standardized third moment: A symmetric distribution has (left and right cancel in the cube); a right-skewed one has (the long right tail makes the cube positive on average). A fair coin's Bernoulli has ; an exponential has . Now the answer: the skewed one (exponential) needs a larger . The CLT's limit throws away everything beyond the first two moments, but for finite the leftover skewness distorts the bell. The approximation error shrinks like (the Berry–Esseen flavour), so a bigger demands a bigger to reach the same closeness. Symmetric input () converges fast; the exponential's makes it slow. Exactly when a sum of many small independent (not necessarily identical) pieces still goes normal is pinned down by the Lindeberg–Feller Condition.


Level 4 — Synthesis

Recall Solution

The 95% margin of error is . Require this : Round up (you can't have too few): . Notice: to halve the margin from 2 to 1 you would need twice as big, i.e. the data — the " diminishing returns."

Recall Solution

Each mean is approximately normal: Variances of independent quantities add even for a difference (subtracting doesn't help the wobble): This standard deviation is the engine of a two-sample z-test.

Recall Solution

Under equal true means, is centred at 0 with . Standardize: Two-sided 5% cutoff is . Since , the observed gap is surprising — we would reject "means equal" at the 5% level. (Two-sided -value .)


Level 5 — Mastery

Recall Solution

Check the mean and variance by integrating the tail.

  • Mean: . Finite.
  • Variance needs . Diverges. ❌ Because , the classical (finite-variance) CLT does not apply. The sample mean does converge to 2 (mean exists, so LLN holds), but its fluctuations are not Gaussian and don't shrink like — they follow a heavy-tailed stable law. Moral: "has a mean" is not enough; you need a finite variance.
Recall Solution

First, a word on the notation ("little-o"). Writing means shrinks strictly faster than as , i.e. . It is a bookkeeping tag for "terms too small to matter in the limit" — here, everything past the second moment. With scaling , the Taylor expansion of the characteristic function near 0 gives so For the limit to be finite and non-zero we need the bracket's correction to behave like , i.e. , hence , so .

  • If : exponent , , limit is a point mass (over-squashed → LLN).
  • If : correction blows up, , no proper limit (under-squashed → diverges). Only lands on , the standard-normal fingerprint. This is the CF-level reason for .
Recall Solution
  • Sum's centre: .
  • Sum's spread: .
  • Standardize the boundary using :
  • We want the right-tail area (being ahead means ), so total minus left: About a 1.2% chance of being ahead after 2500 plays. The tiny per-play edge, multiplied by many plays and shrunk-relative-to-the-mean by the scaling, makes losing almost certain. That is exactly why casinos profit: the CLT concentrates the aggregate around the negative mean.

Recall One-line self-check for the whole page

To standardize an average, divide the deviation by what? ::: the standard error — never by alone.