Probability theory and stochastic processes Martingales Theorem
Doob's martingale convergence theorems
Builds on SubmartingaleMartingaleSupermartingaleAlmost sure convergenceConditional expectation
Statement
Let be a sequence of real random variables, adapted to a filtration . A family of random variables is uniformly integrable if as .
- If is a submartingale and , then converges almost surely to a random variable with .
- If is a non-negative supermartingale, then converges almost surely to a random variable with .
- Let be a martingale. These are equivalent: is uniformly integrable; converges almost surely and in ; for an integrable . In this case for all , where is the limit.
Remarks
The proof of part 1 uses Doob's upcrossing inequality. The bound on makes the number of upcrossings of each rational interval finite almost surely, so the limit exists in . Fatou's lemma shows that the limit is finite and integrable. Part 2 follows from part 1 applied to , and part 3 uses that uniform integrability upgrades almost sure convergence to convergence. Example: for independent with , the product is a non-negative martingale with . It converges almost surely to but not in , so it is not uniformly integrable, which shows that part 3 needs its hypothesis. The bound in part 1 is needed: the simple symmetric random walk is a martingale with , and it does not converge. The same statements hold in continuous time for submartingales with right-continuous paths.
Going deeper
For a student
These theorems are the main reason martingales are useful in analysis and probability. They give short proofs of the strong law of large numbers, of Lévy's upward theorem and of Kolmogorov's zero–one law. They also give almost sure convergence of likelihood ratios, of branching process normalisations and of the Radon–Nikodym derivatives on finer and finer partitions. The version, for , says that a martingale bounded in converges almost surely and in , by Doob's martingale inequality.
Reading path
To understand this page from the ground up, read these 55 pages in order. The foundations come first.
- Adapted process concept
- Almost sure convergence concept
- Construction of the reals from Cauchy sequences concept
- Convex function definition
- Element definition
- Filtration concept
- Integers object
- Ordered field definition
- Proposition concept
- Random experiment concept
- Rational numbers object
- Real numbers object
- Jensen's inequality statement
- Set definition
- Ring of integers statement
- Disjunction definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Union definition
- Existential quantifier definition
- Sample space definition
- Universal quantifier definition
- The rationals form a field statement
- Cartesian product definition
- Uniqueness quantifier definition
- Subset definition
- The rationals form an ordered field statement
- Binary relation definition
- Universal set definition
- Power set definition
- Order on the reals definition
- Function definition
- Complement definition
- Interval definition
- Injective function definition
- Preimage of a set definition
- Sigma-algebra definition
- Countable set definition
- Event definition
- Borel sigma-algebra definition
- Probability axioms concept
- Probability measure definition
- Probability space definition
- Conditional probability definition
- Random variable definition
- Discrete random variable definition
- Stochastic process concept
- Random variable with a density definition
- Expected value definition
- Conditional expectation definition
- Martingale definition
- Submartingale definition
- Supermartingale definition
- Doob's martingale convergence theorems statement
Further reading
About this page
| Tag | MRXBC4ZNRR |
|---|---|
| URI | m2://MRXBC4ZNRR |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 60G42, 60G44 |
| Status | This copy of the site has no build data. Run m2 status MRXBC4ZNRR. |
| About | Martingale, Submartingale |
| Uses | Submartingale, Martingale, Supermartingale, Almost sure convergence, Conditional expectation |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.