Quant Memo
Advanced

Convergence in Distribution

The weakest, most common notion of a sequence of random variables "settling down" — it's what the central limit theorem actually promises, and it is not the same as individual outcomes getting close to each other.

Prerequisites: Monotone and Dominated Convergence Theorems

The central limit theorem says a sample mean, suitably rescaled, "converges to a normal distribution." But converges how, exactly? It is tempting to picture individual numbers homing in on individual target values, the way 1/n01/n \to 0. That picture is wrong here, and getting it wrong causes real confusion about what the CLT actually promises. What actually settles down is the shape of the whole distribution — the histogram, not any individual draw.

The analogy: a histogram that stops changing shape

Imagine rolling a die nn times and plotting a histogram of the average of those rolls, then repeating the whole experiment thousands of times to build up that histogram. For small nn the histogram is lumpy and asymmetric. As nn grows, the histogram smooths into a bell shape and that bell shape stabilises — draw the histogram for n=1000n=1000 and n=2000n=2000 and they look nearly identical in shape (once you rescale for the shrinking spread). Individual averages are still bouncing around, never sitting still — but the overall picture, the histogram's shape, has settled. That settling of the shape, not of any single number, is convergence in distribution.

Writing it down

A sequence of random variables XnX_n converges in distribution to XX, written XndXX_n \xrightarrow{d} X, if

limnFXn(x)=FX(x)for every x where FX is continuous.\lim_{n\to\infty} F_{X_n}(x) = F_X(x) \quad \text{for every } x \text{ where } F_X \text{ is continuous} .

In words: the CDFs of the sequence get closer and closer to the CDF of the limit, at every ordinary point — the shape of the distribution stabilises. Crucially, this says nothing about individual outcomes Xn(ω)X_n(\omega) for a specific random draw ω\omega getting close to X(ω)X(\omega); it is entirely a statement about the two curves FXnF_{X_n} and FXF_X matching up. This is the weakest of the standard modes of convergence — weaker than convergence in probability, which is itself weaker than almost-sure convergence — precisely because it only constrains aggregate behaviour, not individual paths.

limiting F(x), normal shape n=10 (dashed) → n=100 → n=1000 (solid), converging shape
Three CDFs for growing sample size — each successive curve sits closer to the smooth limiting curve. It is the curves that converge, not any single realised value.

Worked example 1: sample proportions converging to a normal shape

Flip a fair coin nn times and look at Zn=p^n0.50.25/nZ_n = \dfrac{\hat p_n - 0.5}{\sqrt{0.25/n}}, the standardised sample proportion of heads. For n=10n=10: possible values of p^n\hat p_n are multiples of 0.10.1, so the distribution of ZnZ_n is lumpy — e.g. P(p^10=0.5)=(105)(0.5)100.246P(\hat p_{10}=0.5) = \binom{10}{5}(0.5)^{10} \approx 0.246, a sizeable spike at the centre. For n=1000n=1000: the same standardised quantity has P(0.49p^10000.51)P(0.49 \leq \hat p_{1000} \leq 0.51) computable via the normal approximation as P(0.63Z0.63)0.472P(-0.63 \leq Z \leq 0.63) \approx 0.472, and by this point the whole curve of ZnZ_n's distribution — not just this one probability — closely tracks the standard normal CDF to several decimal places at every xx. This is the CLT in action: ZndN(0,1)Z_n \xrightarrow{d} N(0,1), and the shape has essentially converged well before n=1000n=1000, even though p^n\hat p_n itself is still a genuinely random, bouncing quantity at every nn.

Worked example 2: why individual values don't converge, only the shape

Let Xn=(1)nZX_n = (-1)^n Z for a fixed standard normal ZZ (so XnX_n literally flips sign each step, alternating between ZZ and Z-Z forever). Does XndN(0,1)X_n \xrightarrow{d} N(0,1)? Check the definition: FXn(x)=P((1)nZx)F_{X_n}(x) = P((-1)^nZ \leq x). When nn is even this is P(Zx)=Φ(x)P(Z\leq x) = \Phi(x); when nn is odd it's P(Zx)=P(Zx)=Φ(x)P(-Z \leq x) = P(Z \geq -x) = \Phi(x) too, since the standard normal is symmetric. Both cases give exactly Φ(x)\Phi(x) for every nn, so trivially FXn(x)Φ(x)F_{X_n}(x) \to \Phi(x): yes, XndN(0,1)X_n \xrightarrow{d} N(0,1). But individually, XnX_n never settles at all — it swings deterministically between ZZ and Z-Z every single step, with Xn+1Xn=2Z|X_{n+1}-X_n| = 2|Z| forever, never shrinking. The distribution's shape converges (trivially, since it's the same shape at every step) while the actual sequence of values does nothing resembling settling down — the cleanest possible illustration that convergence in distribution says nothing about individual paths.

What this means in practice

Every confidence interval built from "the sample mean is approximately normal for large nn" is invoking convergence in distribution, not a claim that any individual sample mean has homed in on the truth — that stronger claim is what the law of large numbers provides instead, and it's a different, complementary statement. Backtest significance tests, asymptotic standard errors, and bootstrap confidence bands all lean on convergence in distribution results to justify treating a finite-sample statistic as approximately normal.

Convergence in distribution means the CDFs of a sequence converge pointwise to a limiting CDF — the shape of the distribution stabilises. It is the weakest standard mode of convergence and makes no claim that individual random values are getting close to anything; worked example 2 exhibits convergence in distribution with a sequence that never settles at all.

The classic confusion is treating "XnX_n converges in distribution to XX" as meaning XnX_n and XX become close as random variables — that individual draws of XnX_n approach individual draws of XX. They need not even be defined on a related basis; XndXX_n \xrightarrow{d} X is purely a statement about two CDF curves getting close, not about outcome-by-outcome closeness. Confusing this with the stronger notion of convergence in probability (where XnX|X_n - X| itself shrinks) leads to incorrectly assuming a large-nn CLT approximation says anything about how close this particular sample's statistic is to its target — it doesn't, on its own; that requires a separate error bound.

Related concepts

Practice in interviews

Further reading

  • Billingsley, Convergence of Probability Measures (ch. 1)
  • Van der Vaart, Asymptotic Statistics (ch. 2)
ShareTwitterLinkedIn