Skip to content
Part IA Easter Term

Weak Law of Large Numbers

Statement

Let X1,X2,X_1, X_2, \ldots be i.i.d. random variables with finite mean μ\mu and finite variance σ2\sigma^2. Define the sample mean:

Xˉn=1ni=1nXi\bar{X}_n = \frac{1}{n} \sum_{i=1}^n X_i

Theorem (Weak Law of Large Numbers): For any ϵ>0\epsilon > 0:

limnP(Xˉnμ>ϵ)=0\lim_{n \to \infty} P(|\bar{X}_n - \mu| > \epsilon) = 0

The sample mean converges in probability to the true mean.

Interpretation

As we collect more data, the sample mean gets arbitrarily close to the true mean with high probability. This justifies using Xˉn\bar{X}_n to estimate μ\mu.

“Power of Averaging”: Repeated samples allow us to estimate μ\mu with increasing precision.

Proof (Using Chebyshev)

E[Xˉn]=μ,Var(Xˉn)=σ2nE[\bar{X}_n] = \mu, \quad \text{Var}(\bar{X}_n) = \frac{\sigma^2}{n}

By Chebyshev’s inequality:

P(Xˉnμϵ)Var(Xˉn)ϵ2=σ2nϵ2P(|\bar{X}_n - \mu| \geq \epsilon) \leq \frac{\text{Var}(\bar{X}_n)}{\epsilon^2} = \frac{\sigma^2}{n\epsilon^2}

As nn \to \infty: σ2nϵ20\frac{\sigma^2}{n\epsilon^2} \to 0.

Therefore:

limnP(Xˉnμϵ)=0\lim_{n \to \infty} P(|\bar{X}_n - \mu| \geq \epsilon) = 0

Convergence in Probability

The WLLN says XˉnPμ\bar{X}_n \xrightarrow{P} \mu (converges in probability).

This means: for any ϵ>0,δ>0\epsilon > 0, \delta > 0, there exists NN such that for all nNn \geq N:

P(Xˉnμ<ϵ)>1δP(|\bar{X}_n - \mu| < \epsilon) > 1 - \delta

Example: Coin Flips

Flip a fair coin nn times. Let Xi=1X_i = 1 if heads, 0 otherwise. μ=0.5\mu = 0.5.

The sample proportion Xˉn\bar{X}_n estimates the true probability.

For n=100n = 100:

P(Xˉ1000.50.1)0.25100×0.01=0.251=0.25P(|\bar{X}_{100} - 0.5| \geq 0.1) \leq \frac{0.25}{100 \times 0.01} = \frac{0.25}{1} = 0.25

At most 25% chance the sample proportion deviates by more than 0.1 from 0.5.

For n=10000n = 10000:

P(Xˉ100000.50.1)0.0025P(|\bar{X}_{10000} - 0.5| \geq 0.1) \leq 0.0025

Only 0.25% chance of such deviation.

What WLLN Does NOT Say

  1. Not “almost all” sequences: WLLN doesn’t say Xˉn\bar{X}_n will eventually stay close to μ\mu for almost every sequence (that’s the Strong Law)

  2. Doesn’t give rate: WLLN says probability goes to 0, but not how fast (CLT gives the rate)

  3. Requires finite variance: The proof using Chebyshev needs σ2<\sigma^2 < \infty (though WLLN holds with only finite mean)

Visualisation

As nn increases, the distribution of Xˉn\bar{X}_n becomes more concentrated around μ\mu.

WLLN convergence

Weaker Conditions

WLLN holds under weaker conditions:

  • Finite mean suffices (proof more subtle)
  • Variance need not be finite

Historical Quote

“For even the most stupid of men, by some instinct of nature, by himself and without any instruction (which is a remarkable thing), is convinced that the more observations have been made, the less danger there is of wandering from one’s goal.” — Jacob Bernoulli (1655-1705)

Summary

PropertyStatement
AssumptionsXiX_i i.i.d. with finite μ\mu, σ2\sigma^2
ConclusionXˉnPμ\bar{X}_n \xrightarrow{P} \mu
Rate$P(
ApplicationJustifies sample mean as estimator