The Central Limit Theorem (CLT) states that for i.i.d. samples X1,…,Xn with finite mean μ and variance σ2<∞, the standardized sample mean converges in distribution to a standard normal: σ/nXˉ−μdN(0,1), at rate O(1/n); the underlying samples need not be normal.
💡Use Cases
normal approximation for probabilities and quantiles of Xˉ when its exact distribution is intractable — the theoretical basis of Z-tests, CI formulas and Bootstrap; interviews typically probe “why n”, the convergence rate and when it breaks.
⚡Key Problems Solved
the LLN only asserts Xˉ→μ and Chebyshev gives only a crude O(1/n) bound; the CLT gives distribution-level precision: fluctuations cancel in the sum, so the standard error decays as 1/n — halving the error costs 4x the samples, and going from n=100 to n=10000 shrinks the error only 10x.
🎯5 High-Frequency Exam Points
1
State the CLT. What conditions are required (i.i.d., finite variance)?
2
Why does the standardized mean converge at rate 1/n? Explain via fluctuation cancellation.
3
What is the standard error of Xˉ? How many more samples halve the error?
4
How does the CLT differ from and relate to Chebyshev's inequality and the LLN?
5
Why does the CLT fail for infinite variance (e.g. Cauchy)? What happens to the sample mean?