Weak Law of Large Numbers
Statement
Let be i.i.d. random variables with finite mean and finite variance . Define the sample mean:
Theorem (Weak Law of Large Numbers): For any :
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 to estimate .
“Power of Averaging”: Repeated samples allow us to estimate with increasing precision.
Proof (Using Chebyshev)
By Chebyshev’s inequality:
As : .
Therefore:
Convergence in Probability
The WLLN says (converges in probability).
This means: for any , there exists such that for all :
Example: Coin Flips
Flip a fair coin times. Let if heads, 0 otherwise. .
The sample proportion estimates the true probability.
For :
At most 25% chance the sample proportion deviates by more than 0.1 from 0.5.
For :
Only 0.25% chance of such deviation.
What WLLN Does NOT Say
-
Not “almost all” sequences: WLLN doesn’t say will eventually stay close to for almost every sequence (that’s the Strong Law)
-
Doesn’t give rate: WLLN says probability goes to 0, but not how fast (CLT gives the rate)
-
Requires finite variance: The proof using Chebyshev needs (though WLLN holds with only finite mean)
Visualisation
As increases, the distribution of becomes more concentrated around .
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
| Property | Statement |
|---|---|
| Assumptions | i.i.d. with finite , |
| Conclusion | |
| Rate | $P( |
| Application | Justifies sample mean as estimator |