Almost sure convergence
Xₙ→X almost surely means P({ω: Xₙ(ω)→X(ω)})=1. Variables are defined on a common probability space.
REFERENCE SHEET
Distinguish pathwise behavior, small error probabilities, average error, and convergence of laws.
Before this Random variables & moments, Convergence theorems & iterated integrals
Xₙ→X almost surely means P({ω: Xₙ(ω)→X(ω)})=1. Variables are defined on a common probability space.
Convergence in probability means P(|Xₙ−X|>ε)→0 for every ε>0. For 1≤p<∞, Lᵖ convergence means E|Xₙ−X|ᵖ→0.
For real random variables, Xₙ converges in distribution to X if their distribution functions converge at every continuity point of the distribution function of X. A common probability space is not required.
Almost sure convergence implies convergence in probability. Lᵖ convergence implies convergence in probability by Markov’s inequality. Convergence in probability implies convergence in distribution.
Convergence in distribution to a constant c implies convergence in probability to c.
If Xₙ→X almost surely and |Xₙ|≤Y for all n, with E[Yᵖ]<∞, then Xₙ→X in Lᵖ. Apply dominated convergence to |Xₙ−X|ᵖ≤2ᵖYᵖ.
The strong law concerns almost sure convergence of averages; the central limit theorem concerns convergence in distribution of rescaled errors.
L¹ convergence guarantees E[Xₙ]→E[X]. Convergence in probability alone does not control rare, large values.
01 / Counterexample
Fix a positive ω first, then compute the area under the spike.
For any ω>0, eventually n>1/ω, so Xₙ(ω)=0. Thus Xₙ→0 almost surely, but E[Xₙ]=n·(1/n)=1. There is no convergence in L¹.
02 / Prove
Apply Markov’s inequality to |Xₙ−X|ᵖ.
For ε>0, P(|Xₙ−X|>ε)≤E|Xₙ−X|ᵖ/εᵖ→0. The bound controls each fixed error threshold.
03 / Counterexample
Compare the distributions and then |Xₙ−X|.
Every Xₙ has the same distribution as X, so convergence in distribution holds. But |Xₙ−X|=2 surely, so convergence in probability fails.
Further reading and full-length treatments: