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.
Four notions of convergence
Let and be random variables on a common probability space.
- almost surely () if .
- in probability () if for every .
- in () if .
- in distribution () if at every where 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.
None of the reverse implications holds in general, and almost-sure and convergence do not imply each other.
The law of large numbers
Let be uncorrelated with common mean and variance at most , and let . Then ; quantitatively,
Assumptions
Note exactly what was used: uncorrelated (not independent), finite variance, common mean. The conclusion is a decay of the failure probability, which is polynomial — much weaker than the exponential decay available under stronger assumptions on the concentration page.
If are i.i.d. with and , then . Conversely, if then 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
Let be i.i.d. with mean and variance . Then
The characteristic-function proof is standard and is not reproduced here. The structure worth remembering is: , expand the inner characteristic function to second order, and recognise .
Under the hypotheses above with additionally , there is an absolute constant (one may take ) with
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 . That is exactly the problem.
Empirical observation — a regularity seen in experiments. No theorem on this page establishes it in general.
It is tempting to argue: " is approximately by the CLT, therefore ." 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 . Berry–Esseen says the error in that approximation is of order uniformly. So when the true tail probability is itself smaller than — which is the regime every generalisation bound and every "with probability " claim lives in — the CLT approximation carries an error larger than the quantity being estimated. It tells you nothing.
Concretely: for the Berry–Esseen error is on the order of , so the CLT cannot distinguish a tail probability of from one of . Yet those are exactly the probabilities one needs for a confidence statement.
This is why the entire machinery of the concentration inequalities page exists. Hoeffding's inequality gives a non-asymptotic, valid-for-every- 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.
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 minReferences
- BookRick Durrett (2019). Probability: Theory and Examples
- BookRoman Vershynin (2018). High-Dimensional Probability: An Introduction with Applications in Data ScienceSection 2.1 makes the case, at length, for why the CLT is the wrong tool for tail estimates.
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
- TheoremImplications between modes of convergenceproof includedAlmost sure and Lp convergence both imply convergence in probability, which implies convergence in distribution; no other implication holds in general.
- TheoremWeak law of large numbersproof includedFor i.i.d. variables with finite variance the sample mean converges to the mean in probability.
- TheoremStrong law of large numbersFor i.i.d. integrable variables the sample mean converges almost surely.
- TheoremCentral limit theoremThe standardised sample mean of i.i.d. variables with finite variance converges in distribution to a standard normal.
- TheoremBerry–Esseen boundA quantitative CLT with an explicit n^{-1/2} rate in Kolmogorov distance.
- Empirical observationThe CLT does not license Gaussian tail estimatesPointwise convergence of the CDF says nothing about the far tail at finite n, which is why concentration inequalities are needed.