Solution: Proving the Weak LLN from Chebyshev
Exercise: Proving the Weak LLN from Chebyshev
Part 1
By linearity of expectation (no independence required):
For the variance, expand:
Pairwise uncorrelated means for , so the second sum vanishes, leaving:
This is the step — and the only step — that needs the uncorrelatedness assumption.
Part 2
Chebyshev's inequality. For a random variable with finite variance and any :
Apply with , , :
Part 3
For any fixed , the RHS as . By the definition of convergence in probability, .
Part 4
With for , the covariance sum has terms:
As , the first term vanishes but the second approaches . The variance of does not go to zero; Chebyshev gives a floor, not a shrinking bound.
Why this matters for time series. Daily returns on most momentum signals are positively autocorrelated (otherwise the signal would have no forecasting power). If we mechanically apply the LLN to a time series and report , we ignore the autocorrelation and underestimate the true standard error of . The corrected formula — the "effective sample size" or "Newey-West standard error" — replaces with the long-run variance, which can be an order of magnitude larger.
Practical takeaway: the sample mean of an autocorrelated series converges (under weaker conditions like ergodicity), but more slowly than naïve LLN would suggest.
Takeaways
- Uncorrelated suffices for the weak LLN — full independence is overkill. Chebyshev is the workhorse because it asks only for a second moment.
- Variance of the sample mean is the foundational formula of frequentist statistics. Every standard error calculation descends from it.
- Positive autocorrelation breaks the formula. Use HAC / Newey-West standard errors for backtested time series, not the naive IID formula.
- Chebyshev is loose but universal. Sharper bounds (Bernstein, Hoeffding, Cramér) exist for sub-Gaussian or bounded variables, but they require stronger distributional assumptions.