Skip to content

Almost-Sure Convergence

Definition

Let X1,X2,…X_1,X_2,\ldots and XX be random variables defined on one probability space, that is, one sample space with one probability function. The sequence XnX_n converges almost surely to XX if

P(lim⁡n→∞Xn=X)=1.\begin{aligned} \mathbb{P}(\lim_{n\to\infty}X_n=X)=1. \end{aligned}

The set of outcomes on which XnX_n does not converge to XX need not be empty, but it must have probability zero. This is written as Xn→a.s.XX_n\xrightarrow{a.s.} X. One also says that XnX_n converges to XX with probability one, abbreviated w.p.1.

For each outcome outside the exceptional null set, the Limit of a Sequence is taken for the numerical values Xn(ω)X_n(\omega); the probability-one condition refers to the set of outcomes where that limit equals X(ω)X(\omega).


Interpretation

Almost-sure convergence looks at one outcome at a time. For a fixed outcome, X1,X2,…X_1,X_2,\ldots is an ordinary sequence of numbers, the sample path of that outcome, and the question is whether it tends to the value of XX. Outside a set of outcomes of probability zero, the answer must be yes: this is pointwise convergence on the sample space, with a negligible exceptional set allowed.

Three rows of dots for n = 1 to 20, one row per outcome of U. Each path X n equals 1 for the first few n and then drops to 0 for good, sooner for larger U.

The figure follows Xn=𝟙1{U<1/n}X_n=\indicator_{\{U<1/n\}} from the second Example for the three outcomes U=0.4U=0.4, 0.150.15 and 0.060.06. Each path equals 11 while n<1/Un<1/U and 00 from then on: the last 11 occurs at n=2n=2, 66 and 1616 respectively. Smaller UU drops later, but every outcome with U>0U>0 eventually reaches 00 and stays there. The only exception, U=0U=0, has probability zero, so Xn→a.s.0X_n\xrightarrow{a.s.}0.

Almost-sure convergence is about whole paths: each simulated path of Xˉn\bar X_n settles at μ\mu. The red dot marks the last time a path leaves the band.

The word "almost" allows that exceptional set; see almost surely. The probability in the definition is taken once, for the set of outcomes whose whole path converges, not separately for each nn. That is the difference with convergence in probability, which only asks that P(∣Xn−X∣>ε)\mathbb{P}(|X_n-X|>\varepsilon) be small for each large nn and still allows the paths to keep making occasional large errors forever. Almost-sure convergence is the stronger of the two, and it is the mode of convergence in the strong law of large numbers.


Key Results

  • Almost-sure convergence implies convergence in probability.
  • Changing any of the variables on a common event of probability zero does not change almost-sure convergence.

Examples

  • If XX is finite almost surely and Xn=X/nX_n=X/n, then Xn→0X_n\to0 on every outcome where XX is finite, so convergence is almost sure.
  • For a single U∼Unif⁡(0,1)U\sim\operatorname{Unif}(0,1) and Xn=𝟙1{U<1/n}X_n=\indicator_{\{U<1/n\}}, each outcome with U>0U>0 eventually has Xn=0X_n=0, so Xn→0X_n\to0 almost surely.

Prerequisites

Sources

Aliases: almost sure convergence, convergence with probability one, convergence almost surely, convergence with probability 1 Keywords: a.s. convergence Symbols: epsilon, infinity, mu, omega

Last updated: 20 October 2026 03:02