Skip to content

Strong Law of Large Numbers

Theorem

Let X1,X2,…X_1,X_2,\ldots be i.i.d. with E∣X1∣<∞\mathbb{E}|X_1|<\infty and mean μ=EX1\mu=\mathbb{E}X_1. Then the sample mean Xˉn=1n∑i=1nXi\displaystyle \bar X_n=\frac{1}{n}\sum_{i=1}^n X_i satisfies

Xˉn→a.s.μ.\begin{aligned} \bar X_n\xrightarrow{a.s.}\mu. \end{aligned}

The i.i.d. assumption gives one common integrable law and independence. The conclusion is Almost-Sure Convergence: outside one probability-zero exceptional set, the entire sequence of sample averages tends to μ\mu.


Interpretation

The running average of an integrable i.i.d. sequence settles at the population mean with probability one. Fix one outcome and follow the whole sequence of averages Xˉ1,Xˉ2,…\bar X_1,\bar X_2,\ldots: for almost every outcome this sequence of numbers converges to μ\mu.

Running averages of three simulated sequences of fair die rolls over 400 rolls, each wandering early on and then settling near the horizontal line at the mean 3.5.

The figure shows three simulated sequences of fair die rolls, so μ=3.5\mu=3.5. Each line is one sample path n↦Xˉnn\mapsto\bar X_n. Early on the paths wander, because a single roll still moves the average noticeably: after the first roll the three averages are 11, 33 and 44. After a few hundred rolls each path stays close to 3.53.5. The strong law says that on almost every path the average does not only come close but converges to 3.53.5.

Each path is one sequence of draws. Almost every path eventually enters the band μ±ε\mu\pm\varepsilon and stays there; show more steps or narrow the band to test it.

The hypotheses are an i.i.d. sequence and E∣X1∣<∞\mathbb{E}|X_1|<\infty; finite variance is not needed, as the second Example shows. Independence cannot simply be dropped: if every XiX_i equals the first die roll X1X_1, the variables are identically distributed but Xˉn=X1\bar X_n=X_1 for every nn, which never approaches 3.53.5. Without a finite mean there is no μ\mu to converge to.

Almost-sure convergence implies convergence in probability, so the strong law implies the weak law. Applied to indicators 𝟙1A\indicator_A of independent repetitions of an experiment, it says that the relative frequency of AA converges to P(A)\mathbb{P}(A) almost surely. This justifies reading probabilities as long-run frequencies.


Key Results

  • Finite E∣X1∣\mathbb{E}|X_1| is sufficient; finite variance is not required.
  • The almost-sure conclusion also implies Xˉn→Pμ\bar X_n\xrightarrow{P}\mu.

Examples

  • For i.i.d. fair die rolls, the running average converges almost surely to 3.53.5.
  • For i.i.d. variables with density f(x)=32x−5/2f(x)=\frac{3}{2}x^{-5/2} for x≥1x\ge1 and zero elsewhere, the mean is 33 and the second moment is infinite; the running average still converges almost surely to 33.

Prerequisites

Sources

Aliases: SLLN, strong law, Kolmogorov's strong law Symbols: epsilon, infinity, mu, sum

Last updated: 20 October 2026 03:02