Skip to content
nonconvexcard

Modes of Convergence, LLN and CLT

The four notions of convergence for random variables, which implications hold between them, and the two limit theorems everything downstream depends on.

ProbabilityCore⏱ 3 hours9 min readconvergencealmost surein probabilityin distributionlln
3 problems →

Four notions of convergence

DefinitionThe four modes

Let X1,X2,…X_1, X_2, \dots and XX be random variables on a common probability space.

  • Xn→XX_n \to X almost surely (Xn→a.s.XX_n \xrightarrow{a.s.} X) if P(lim⁡nXn=X)=1\P\big(\lim_n X_n = X\big) = 1.
  • Xn→XX_n \to X in probability (Xn→PXX_n \xrightarrow{\P} X) if P(∣Xn−X∣>ε)→0\P(|X_n - X| > \eps) \to 0 for every ε>0\eps>0.
  • Xn→XX_n \to X in LpL^p (Xn→LpXX_n \xrightarrow{L^p} X) if E∣Xn−X∣p→0\E|X_n - X|^p \to 0.
  • Xn→XX_n \to X in distribution (Xn⇝XX_n \rightsquigarrow X) if FXn(t)→FX(t)F_{X_n}(t) \to F_X(t) at every tt where FXF_X is continuous.

Only the last is a statement about laws alone; the other three compare the random variables themselves and require them to live on the same space.

TheoremImplications between modes
Xn→a.s.X  ⟹  Xn→PX,Xn→LpX  ⟹  Xn→PX,Xn→PX  ⟹  Xn⇝X.X_n \xrightarrow{a.s.} X \;\Longrightarrow\; X_n \xrightarrow{\P} X, \qquad X_n \xrightarrow{L^p} X \;\Longrightarrow\; X_n \xrightarrow{\P} X, \qquad X_n \xrightarrow{\P} X \;\Longrightarrow\; X_n \rightsquigarrow X .

None of the reverse implications holds in general, and almost-sure and LpL^p convergence do not imply each other.

The law of large numbers

TheoremWeak law of large numbers

Let X1,X2,…X_1, X_2, \dots be uncorrelated with common mean μ\mu and variance at most σ2<∞\sigma^2 < \infty, and let Xˉn=1n∑i≤nXi\bar X_n = \frac1n\sum_{i\le n}X_i. Then Xˉn→Pμ\bar X_n \xrightarrow{\P} \mu; quantitatively,

P(∣Xˉn−μ∣≥t)≤σ2nt2for every t>0.\P\big(|\bar X_n - \mu| \ge t\big) \le \frac{\sigma^2}{nt^2}\quad\text{for every } t>0 .

Assumptions

Note exactly what was used: uncorrelated (not independent), finite variance, common mean. The conclusion is a 1/n1/n decay of the failure probability, which is polynomial — much weaker than the exponential decay available under stronger assumptions on the concentration page.

TheoremStrong law of large numbers

If X1,X2,…X_1, X_2, \dots are i.i.d. with E∣X1∣<∞\E|X_1| < \infty and EX1=μ\E X_1 = \mu, then Xˉn→a.s.μ\bar X_n \xrightarrow{a.s.} \mu. Conversely, if E∣X1∣=∞\E|X_1| = \infty then lim sup⁡n∣Xˉn∣=∞\limsup_n |\bar X_n| = \infty almost surely.

Kolmogorov's strong law is quoted rather than proved: the standard proofs (via truncation and Kolmogorov's maximal inequality, or via the ergodic theorem) are longer than this page warrants, and the references give them properly. What is worth stressing is the hypothesis gap: the strong law needs only a first moment, while the elementary weak law above needed a second.

The central limit theorem

TheoremCentral limit theorem (Lindeberg–Lévy)

Let X1,X2,…X_1, X_2,\dots be i.i.d. with mean μ\mu and variance σ2∈(0,∞)\sigma^2 \in (0,\infty). Then

n (Xˉn−μ)σ⇝N(0,1).\frac{\sqrt{n}\,(\bar X_n - \mu)}{\sigma} \rightsquigarrow \Ncal(0,1) .

The characteristic-function proof is standard and is not reproduced here. The structure worth remembering is: φn(Xˉn−μ)/σ(t)=(φ(X1−μ)/σ(t/n))n\varphi_{\sqrt n(\bar X_n - \mu)/\sigma}(t) = \big(\varphi_{(X_1-\mu)/\sigma}(t/\sqrt n)\big)^n, expand the inner characteristic function to second order, and recognise (1−t2/2n+o(1/n))n→e−t2/2(1 - t^2/2n + o(1/n))^n \to e^{-t^2/2}.

TheoremBerry–Esseen bound

Under the hypotheses above with additionally ρ=E∣X1−μ∣3<∞\rho = \E|X_1 - \mu|^3 < \infty, there is an absolute constant CC (one may take C≤0.5C \le 0.5) with

sup⁡t∈R∣P(n(Xˉn−μ)σ≤t)−Φ(t)∣≤Cρσ3n.\sup_{t\in\R}\left|\P\left(\frac{\sqrt n(\bar X_n - \mu)}{\sigma} \le t\right) - \Phi(t)\right| \le \frac{C\rho}{\sigma^3\sqrt n} .

This is the quantitative form of the CLT, quoted from the literature. Read the bound carefully: it controls the uniform error in the CDF by something of order n−1/2n^{-1/2}. That is exactly the problem.

Empirical observationThe CLT does not license Gaussian tail estimates

Empirical observation — a regularity seen in experiments. No theorem on this page establishes it in general.

It is tempting to argue: "Xˉn\bar X_n is approximately N(μ,σ2/n)\Ncal(\mu, \sigma^2/n) by the CLT, therefore P(∣Xˉn−μ∣>t)≈2(1−Φ(tn/σ))≤e−nt2/2σ2\P(|\bar X_n - \mu| > t) \approx 2\big(1 - \Phi(t\sqrt n/\sigma)\big) \le e^{-nt^2/2\sigma^2}." This step is not valid as stated, and the reason is quantitative rather than philosophical.

What this does not say

The CLT is a statement about pointwise convergence of the CDF at fixed tt. Berry–Esseen says the error in that approximation is of order n−1/2n^{-1/2} uniformly. So when the true tail probability is itself smaller than n−1/2n^{-1/2} — which is the regime every generalisation bound and every "with probability 1−δ1-\delta" claim lives in — the CLT approximation carries an error larger than the quantity being estimated. It tells you nothing.

Concretely: for n=100n = 100 the Berry–Esseen error is on the order of 10−110^{-1}, so the CLT cannot distinguish a tail probability of 10−310^{-3} from one of 10−610^{-6}. Yet those are exactly the probabilities one needs for a δ=0.001\delta = 0.001 confidence statement.

This is why the entire machinery of the concentration inequalities page exists. Hoeffding's inequality gives a non-asymptotic, valid-for-every-nn Gaussian-type tail bound under a boundedness hypothesis; the CLT gives an asymptotic shape with no error control in the tail. They are not substitutes.

Run it: Concentration inequalities, side by sideEmpirical tail probabilities of a sample mean against the Markov, Chebyshev, Hoeffding and Bernstein bounds.

Problems

Separating the four modes of convergenceProof · Intermediate · 30 min The weak law needs only uncorrelatednessProof · Beginner · 15 min Why the CLT cannot be used for tail boundsNumerical · Advanced · 30 min

References

These works are cited as sources to read, not reproduced. All exposition, examples and problems on this site are written independently; where an argument is standard, the citation points to a canonical treatment.

Results stated on this page

Problems (3)

All problems

Papers that use this mathematics