The martingale convergence theorem says that if a discrete-time martingale satisfies , then there is an integrable random variable such that
The hypothesis does not by itself ensure convergence in L1.
For each pair of rational numbers , the Doob upcrossing inequality gives . The monotone convergence theorem therefore gives a finite expected value for , so this upcrossing count is finite almost surely. There are only countably many such pairs, hence all their upcrossing counts are simultaneously finite outside one event of probability zero.
If , the density of the rational numbers supplies strictly between them, forcing infinitely many upcrossings. Consequently has a limit in the extended real numbers almost surely. By the Fatou lemma,
A limit of either or would make this lower limit infinite, so the limit is finite almost surely, and the same inequality proves its integrability.
Set and . The independence and zero expected values give , so is a martingale. The variance additivity for independent random variables gives
The Cauchy-Schwarz inequality implies . Applying the martingale convergence theorem from (b),
In fact the L2 martingale convergence theorem also gives convergence in L2. Independently, for the same variance additivity for independent random variables yields , confirming that the partial sums form a Cauchy sequence in .
A sequence of integrable random variables has uniform integrability exactly when
The uniformly integrable martingale convergence theorem states that a uniformly integrable discrete-time martingale has an integrable random variable with
Indeed, uniform integrability implies , so the martingale convergence theorem gives almost sure convergence. The combination of uniform integrability and almost sure convergence gives convergence in L1. For , the martingale identity passes to the limit by the L1 contraction of conditional expectation.
The martingale convergence theorem gives an almost-sure limit , because . The dominated convergence theorem also gives in .
To identify the limit, take . For some , , and for every ,
Passing to the limit preserves this equality. The sets for which form a monotone class containing the algebra , so the equality holds throughout . Since is -measurable, it is . This proves the conditional-expectation convergence along a filtration both almost surely and in .
The martingale convergence theorem states that a discrete-time martingale with uniform integrability has an integrable random variable such that
almost surely and in . Moreover, the martingale is closed by its limit:
For fixed , is a martingale with independent centered increments and
The martingale convergence theorem gives convergence both almost surely and in to a random variable .
For , the defining identity for gives
Part (b) therefore identifies with , so is a martingale.
The atom formula also proves
Let . Then by Markov inequality, while
The uniform absolute continuity for a finite measure makes the right-hand side uniformly small as . Thus is uniformly integrable. The martingale convergence theorem now supplies an integrable random variable such that both almost surely and in .
Assume . For every pair of rationals , Doob upcrossing inequality gives
by monotone convergence theorem. Thus every rational interval is upcrossed only finitely often almost surely. If a real sequence has distinct limit inferior and limit superior, it completes infinitely many upcrossings of some rational interval between them. Hence converges in the extended real line almost surely.
Fatou lemma gives
so the limit is finite almost surely and integrable. This is the -bounded form of the martingale convergence theorem.
Let be a random walk, independent of centered, independent time-space signs , and let . Averaging over the walk gives a positive martingale in the environment filtration: each new time layer has conditional mean-one weight. Hence and the martingale convergence theorem gives a finite nonnegative almost-sure limit. Preserving its mean requires an additional condition such as bounded second moments; positivity of finite-time weights alone does not suffice.
Shannon-McMillan-Breiman theorem Created 2026-10-05 Updated 2026-10-14
For a probability measure-preserving system and a countable measurable partition of finite entropy, converges almost everywhere and in to an invariant function whose integral is . For an ergodic transformation, the limit is the constant . In general it is . The martingale convergence theorem, maximal inequality for conditional information functions, and triangular ergodic averaging lemma prove this directly, without invertibility.