Doob's Upcrossing Inequality and the Almost-Sure Martingale Convergence Theorem
Anchor (Master): Williams — Probability with Martingales Ch. 11-14; Durrett §4.2-4.6; Neveu — Discrete-Parameter Martingales (North-Holland, 1975) Ch. II-IV
Intuition Beginner
A martingale is the running fortune in a fair game: given everything seen so far, your best forecast for tomorrow's fortune is exactly today's. The previous unit asked what happens when you stop such a game. This unit asks a different question: what happens if you never stop, and just let the game run forever? Does the fortune settle down to some final number, or can it wander up and down without end?
The surprising answer is that a fair game whose fortune stays bounded on average must settle down. It cannot oscillate forever. To see why, count how many times the fortune crosses from below some low level up past some high level — an "upcrossing" of the band between them. Every full upcrossing means the fortune climbed through the whole band. Doob's insight is that a fair game cannot afford to make many such climbs: each completed climb is, in effect, a guaranteed profit of the band's width, and a fair game forbids guaranteed profit. So the expected number of upcrossings of any fixed band is finite.
Now picture a sequence that fails to settle: it must dip below the low level and rise above the high level again and again, infinitely often, for some band. That would require infinitely many upcrossings of that band. Since every band can only be upcrossed finitely many times on average, no band is crossed infinitely often, and the fortune is trapped into converging to a single limiting value.
The takeaway: bounded fair games converge. But there is a catch that the rest of the unit is about. The fortune converges to a final value, yet that final value need not be the "true" target the fortune was tracking — mass can leak away to infinity. Spotting exactly when this leak happens, and when it does not, is the heart of the matter.
Visual Beginner
Picture a wandering fortune drawn as a jagged line over time, with two horizontal guide lines marking a low level and a high level . An upcrossing is one complete journey of the line from at-or-below up to at-or-above .
Each arrow is one completed upcrossing: a full trip from the lower line to the upper line. Doob's count says that, for a bounded fair game, the average number of such arrows over the whole infinite future is finite. A path that failed to settle would need infinitely many arrows for some choice of band, which the count forbids. So the path flattens to a limit on the right.
The shaded band can be any pair of levels you like. Because no band is crossed infinitely often, the high points and low points of the path eventually stop straddling any fixed band, which is exactly what it means for the path to home in on one value.
Worked example Beginner
We watch a concrete fair game and see both the convergence and the catch. Consider a fortune that starts at and, at each step, either doubles or drops to . Specifically: while the fortune is positive, flip a fair-ish coin that says "survive" with probability and "die" with probability ; on "survive" the fortune doubles, on "die" it goes to and stays there forever.
Step 1. Check it is a fair game. If the current fortune is , the next fortune is with probability and with probability . The average next fortune is , the current value. So the expected next fortune equals the current fortune: this is a martingale, a fair game. If the fortune is already it stays , which is also fair.
Step 2. Find the limit. The fortune survives step after step only as long as every coin says "survive." The chance of surviving the first steps is , which shrinks to . So with probability the game eventually dies, and once dead the fortune is forever. The limiting fortune is therefore , with probability . The bounded-below fair game has converged, exactly as promised.
Step 3. Spot the catch. The starting fortune was , and the average fortune at every single step is also (a fair game keeps its average). Yet the limit is . The average of the limit is , but the limit of the averages is . These two numbers disagree.
Step 4. Where did the dollar go? On the rare surviving paths the fortune is enormous — after survivals it is — and these huge-but-rare values are exactly what keeps the running average at . As grows, the dollar's worth of average is carried by an ever-rarer, ever-larger spike that escapes to infinity. In the limit the spike has vanished from view (probability ), taking the dollar with it.
What this tells us: a bounded fair game always converges to some final value, but the average can leak away to infinity along rare exploding paths. The final value tracks the typical outcome; it need not preserve the mean. The condition that plugs this leak — keeping the rare spikes from carrying away mass — is what the higher tiers call uniform integrability.
Check your understanding Beginner
Formal definition Intermediate+
Fix a filtered probability space . We use the martingale vocabulary of 37.04.01: an adapted integrable process is a supermartingale if a.s., a submartingale if the reverse inequality holds, and a martingale when equality holds. The martingale transform of a predictable against , the stopping-time apparatus, and the optional-stopping theorem are taken as verified there; conditional expectation and its tower/Jensen properties are taken as verified from the Radon-Nikodym theorem 02.07.08.
Definition (upcrossings of an interval). Let be a process and real. Define stopping times by $$ S_1 = \inf{n \ge 0 : X_n \le a}, \qquad T_k = \inf{n \ge S_k : X_n \ge b}, \qquad S_{k+1} = \inf{n \ge T_k : X_n \le a}, $$ with . The interval is the -th upcrossing of once . The number of upcrossings completed by time is $$ U_N([a,b]) = \sup{k \ge 0 : T_k \le N}, $$ a nondecreasing-in-, -measurable random variable; its monotone limit counts all upcrossings over the infinite horizon.
Definition (-boundedness). A process is -bounded if . This is the standing hypothesis of the convergence theorem; it is strictly weaker than uniform integrability.
Definition (uniform integrability). A family is uniformly integrable (UI) if $$ \lim_{c \to \infty} \sup_n \mathbb{E}\big[|X_n|,\mathbf{1}_{{|X_n| > c}}\big] = 0. $$ UI implies -boundedness; the converse fails. The role of UI in this unit is exactly to forbid the escape-of-mass-to-infinity seen in the Beginner worked example.
Definition (closed martingale). A martingale is closed (by ) if there exists with for all . A closed martingale is the Radon-Nikodym density process of 02.07.08; the closure question — whether the a.s. limit closes the martingale — is the central dichotomy below.
Counterexamples to common slips Intermediate+
A.s. convergence does not give . The Beginner game converges to while for all . The mean is not preserved in the limit without uniform integrability; -boundedness alone is too weak.
-bounded is not uniformly integrable. The same game is -bounded () yet not UI: the mass at level on the surviving event of probability refuses to be controlled uniformly in .
Convergence is to a finite limit, but only because of -boundedness. A martingale that is not -bounded, such as the symmetric simple random walk, oscillates and does not converge: and a.s. The upcrossing bound is vacuous there because is unbounded in .
Closure requires more than a limit existing. Even when a.s. with , it can fail that : in the Beginner game on the survival event. A.s. convergence and closure are different statements; UI is the bridge between them.
The interval must be fixed before counting. is finite for each fixed rational pair ; one cannot conclude convergence from finiteness for a single cleverly chosen -dependent band. The argument quantifies over the countable family of rational bands.
Key theorem with proof Intermediate+
Theorem (Doob's upcrossing inequality and almost-sure martingale convergence). Let be a supermartingale and .
(Upcrossing inequality.) For every , $$ (b - a),\mathbb{E}[U_N([a,b])] \le \mathbb{E}[(X_N - a)^-]. $$
(Convergence.) If in addition is -bounded, then a.s. for some . In particular every -bounded martingale converges a.s. to an integrable limit.
Proof. The upcrossing inequality. Build the predictable "buy at , sell at " strategy : set — hold the asset only while below awaiting a rise — and for , $$ C_n = \mathbf{1}{{C{n-1} = 1}}\mathbf{1}{{X{n-1} < b}} + \mathbf{1}{{C{n-1} = 0}}\mathbf{1}{{X{n-1} \le a}}. $$ The first term keeps you holding once bought until the price reaches ; the second buys afresh whenever the price is at or below and you are not holding. Each is a function of , hence -measurable: is predictable, and .
During the -th upcrossing you hold the asset throughout, so the transform accumulates from that completed upcrossing. After the last completed upcrossing there may be one incomplete holding period in progress at time , contributing where at the buy; this contributes at least . Summing the gains,
$$
(C \bullet X)N = \sum{k} (\text{completed upcrossing gains}) + (\text{current incomplete gain}) \ge (b - a),U_N([a,b]) - (X_N - a)^-.
$$
Because is predictable, bounded, and nonnegative and is a supermartingale, the transform is itself a supermartingale 37.04.01, so . Taking expectations of the displayed inequality,
$$
0 \ge \mathbb{E}[(C \bullet X)_N] \ge (b - a),\mathbb{E}[U_N([a,b])] - \mathbb{E}[(X_N - a)^-],
$$
which rearranges to the claimed bound.
From the inequality to convergence. Suppose is -bounded, . Fix rationals . Since , the upcrossing bound gives, for every ,
$$
\mathbb{E}[U_N([a,b])] \le \frac{\mathbb{E}[(X_N - a)^-]}{b - a} \le \frac{\Lambda + |a|}{b - a}.
$$
By monotone convergence , so a.s. Let
$$
\Lambda_{a,b} = {\liminf_n X_n < a < b < \limsup_n X_n}.
$$
On the process dips below and rises above infinitely often, forcing ; hence . The event that fails to converge in is exactly
$$
{\liminf_n X_n < \limsup_n X_n} = \bigcup_{\substack{a < b \ a, b \in \mathbb{Q}}} \Lambda_{a,b},
$$
a countable union of null sets, hence null. So a.s. in . Fatou's lemma 02.07.05 applied to gives , so is a.s. finite and integrable. For a martingale, -boundedness is the hypothesis and the same argument applies verbatim.
Bridge. The upcrossing inequality builds toward the entire convergence theory of martingales and appears again in the and uniform-integrability refinements that decide closure, and it generalises the elementary observation that a bounded monotone sequence converges: where monotonicity forbids any band-crossing outright, the martingale property only forbids too many on average, and the foundational reason is identical — a guaranteed gain of per crossing is incompatible with a fair (or unfavourable) game. This is exactly the discrete shadow of the fact that a bounded local martingale is a genuine martingale that converges, the central insight being that oscillation across a fixed band is a profit machine the supermartingale inequality cannot finance. Putting these together, -boundedness controls , the upcrossing bound converts that single integrability estimate into a.s. convergence simultaneously for every rational band, and the bridge is that almost-sure convergence is, at bottom, a finiteness statement about upcrossing counts. The limit produced here is the candidate that, under the extra hypothesis of uniform integrability, will close the martingale as the Radon-Nikodym density of 02.07.08; without that hypothesis the limit exists but is dual to a loss of mass, which is exactly the dichotomy the Master tier resolves.
Exercises Intermediate+
Advanced results Master
The upcrossing inequality and the a.s. convergence theorem package, together with uniform integrability, into a complete classification of the asymptotics of an -bounded martingale. The convergence dichotomy reads: every -bounded martingale converges a.s. to an integrable , and the following are equivalent — (i) is uniformly integrable; (ii) in ; (iii) is closed, ; (iv) there exists with for all . When these fail, the a.s. limit still exists but for a nonnegative martingale, with the deficit measuring exactly the mass that escapes to infinity. The closed case is the Radon-Nikodym picture of 02.07.08 run to its limit: is the density where , and is its conditional projection onto , so closure is the statement that the consistent system of finite-horizon densities is the restriction of a single limit density on . Lévy's upward theorem a.s. and in is the closed-martingale instance, and Lévy's - law for is its indicator specialisation.
The Galton-Watson process is the canonical proving ground for the dichotomy. With offspring mean and , the normalised population is a nonnegative martingale, hence a.s. with . The Kesten-Stigum theorem (1966) sharpens this: (equivalently is UI, equivalently on the survival event) holds iff ; otherwise a.s. and all the mean leaks to infinity. The case is computed directly: if then is bounded, so is -bounded, UI, and is a genuine nondegenerate limit with — the asymptotic growth rate with a random prefactor.
Polya's urn exhibits the closed case in its purest form. Starting from red and black, the red fraction is a bounded martingale, hence UI and convergent a.s. and in to . The urn sequence is exchangeable, and de Finetti's theorem identifies as the directing random parameter: conditionally on , the draws are i.i.d. Bernoulli. The martingale convergence theorem is thus the analytic engine behind de Finetti's representation of exchangeable sequences, with the running posterior mean of the unknown bias.
These limit theorems also drive a clean proof of the strong law of large numbers via a backward (reversed) martingale: for i.i.d. integrable with , the averages where is a decreasing filtration; a reversed martingale is automatically UI, converges a.s. and in , and the Hewitt-Savage - law identifies the limit as the constant . The same backward-martingale convergence underlies the Lévy downward theorem and the ergodic decomposition.
Synthesis. The foundational reason a bounded fair game converges is that oscillation across any fixed band is a profit engine: each completed upcrossing banks , and the supermartingale inequality caps the expected total bankable to , so this is exactly the mechanism by which -boundedness, through a single negative-part estimate, forbids infinitely many crossings of every rational band simultaneously and pins the path to a limit. Putting these together, a.s. convergence, convergence, and closure are one structure viewed through three integrability lenses: -boundedness buys the a.s. limit via upcrossings and Fatou 02.07.05, uniform integrability upgrades it to convergence via Vitali and is dual to closure as the Radon-Nikodym density of 02.07.08, and -boundedness for forces UI for free through Doob's maximal inequality. This is exactly the central insight that organises the asymptotic theory: a martingale is a consistent system of conditional-expectation densities, the convergence theorem is the time-asymptotic Radon-Nikodym identification of that system with a single limit density when no mass escapes, and the escape of mass — visible in the Galton-Watson regime and the doubling game — is precisely the failure of uniform integrability. The whole optional-stopping calculus of 37.04.01 generalises into this limit theory, and it is dual to the continuous-time martingale convergence that closes Brownian and Itô martingales downstream.
Full proof set Master
The upcrossing inequality and the a.s. convergence theorem are proved in full in the Key theorem section. The remaining Master claims are recorded here.
Proposition (the convergence dichotomy). Let be an -bounded martingale with a.s. limit . The following are equivalent: (i) is uniformly integrable; (ii) in ; (iii) for all ; (iv) for some .
Proof. (i)(ii): UI plus a.s. convergence (which gives convergence in probability) is the hypothesis of Vitali's convergence theorem, yielding . (ii)(iii): for fixed and , the martingale property gives for all ; convergence lets on the left to give , the defining identity . (iii)(iv): take . (iv)(i): for any fixed , the family is uniformly integrable. Indeed by conditional Jensen , and on , $$ \mathbb{E}\big[|\mathbb{E}[Y\mid\mathcal{G}]|,\mathbf{1}{A_c}\big] \le \mathbb{E}\big[\mathbb{E}[|Y|\mid\mathcal{G}]\mathbf{1}{A_c}\big] = \mathbb{E}[|Y|\mathbf{1}_{A_c}], $$ while uniformly in ; absolute continuity of the integral then makes the bound uniformly small.
Proposition (Lévy's upward theorem). For and a filtration with , a.s. and in .
Proof. The process is a martingale (tower property), and by the previous proposition's (iv)(i) it is uniformly integrable, hence -bounded; the convergence theorem gives an a.s. and (by UI) limit . It remains to identify . For , (the last equality since for by definition of conditional expectation). The collection of with is a -system containing the -system , hence contains by Dynkin's lemma. As is -measurable, a.s.
Proposition (Galton-Watson regime). Let be a Galton-Watson process with , offspring mean and variance . Then is an -bounded martingale; consequently a.s. and in with and .
Proof. Write with i.i.d. copies of independent of . Then , so : a martingale, nonnegative with . For the second moment, and , so dividing by , $$ \mathbb{E}[W_{n+1}^2] = \mathbb{E}[W_n^2] + \frac{\sigma^2}{m^{n+2}}\mathbb{E}[W_n], m^{n} \cdot m^{-n}!\cdot m^{n} = \mathbb{E}[W_n^2] + \sigma^2 m^{-(n+2)}, $$ using . Summing the geometric series from gives . So is -bounded, hence UI; the convergence theorem (Exercise 8) gives a.s. and convergence, , and , whence .
Proposition (a.s. convergence does not imply convergence). There is a nonnegative martingale with a.s., , yet and .
Proof. Take the product martingale with i.i.d., , and (Exercise 7). It is a nonnegative martingale, . The event has probability , and on it eventually, so a.s. Then , and on , an event of probability where . The family is not uniformly integrable: for every , so .
Connections Master
Discrete-time martingales, stopping times, and optional stopping 37.04.01 are the immediate prerequisite and the source of the proof machinery: the upcrossing inequality is proved by applying the martingale-transform / supermartingale-stability lemma of that unit to the predictable "buy low, sell high" strategy, and the convergence dichotomy here is the limit companion of the optional-sampling theorem there — both are governed by the single dividing line of uniform integrability.
Absolute continuity and the Radon-Nikodym theorem 02.07.08 supply the meaning of closure: a uniformly integrable martingale is exactly the Radon-Nikodym density process , so the convergence theorem in its closed form is the time-asymptotic Radon-Nikodym identification of a consistent system of finite-horizon densities with a single limit density on ; the failure of closure is the failure of this density to integrate to the right total mass.
Fatou's lemma and dominated convergence 02.07.05 are the analytic engine: integrability of the a.s. limit is Fatou applied to , the -convergence half of the dichotomy is Vitali (a uniform-integrability strengthening of dominated convergence), and the convergence theorem closes by dominated convergence against the Doob-maximal majorant .
The strong law of large numbers 37.02.02 is both a downstream application and an alternative vantage point: the reversed-martingale proof of the SLLN runs the convergence theorem on the decreasing filtration , where converges a.s. and in to the constant by the Hewitt-Savage - law.
Historical & philosophical context Master
The almost-sure convergence theorem and the upcrossing inequality are due to Joseph Doob, who introduced the systematic measure-theoretic theory of martingales and proved both results in his 1940 paper Regularity properties of certain families of chance variables (Trans. Amer. Math. Soc. 47, 455) [Doob 1940] and codified them in Stochastic Processes (Wiley, 1953). The upcrossing argument — counting completed band-crossings via a predictable betting strategy — is Doob's signature device, replacing the earlier compactness and oscillation arguments of Lévy with a single combinatorial-probabilistic estimate. The term "martingale" for the underlying fair-game object was attached by Jean Ville in his 1939 Étude critique de la notion de collectif, building on Paul Lévy's 1930s study of conditioned sums.
The branching-process application has its own lineage: Galton and Watson posed the family-extinction problem in 1874, and the normalised-population martingale with its almost-sure limit was studied by Harris in The Theory of Branching Processes (1963); the sharp uniform-integrability criterion for is the Kesten-Stigum theorem (Ann. Math. Statist. 37, 1966, 1211). Polya's urn dates to Eggenberger and Polya (1923), and the identification of its limit with the directing measure of an exchangeable sequence is de Finetti's representation theorem (de Finetti, 1931). The gap between almost-sure and convergence — a limit that exists pathwise while the mean leaks to infinity — is the precise probabilistic content of the distinction between pointwise and dominated convergence, and uniform integrability is the named hypothesis under which the two coincide [Williams 1991].
Bibliography Master
@book{williams1991,
author = {Williams, David},
title = {Probability with Martingales},
publisher = {Cambridge University Press},
series = {Cambridge Mathematical Textbooks},
year = {1991}
}
@article{doob1940,
author = {Doob, Joseph L.},
title = {Regularity properties of certain families of chance variables},
journal = {Transactions of the American Mathematical Society},
volume = {47},
number = {3},
pages = {455--486},
year = {1940}
}
@book{doob1953,
author = {Doob, Joseph L.},
title = {Stochastic Processes},
publisher = {John Wiley \& Sons, New York},
year = {1953}
}
@book{durrett2019,
author = {Durrett, Rick},
title = {Probability: Theory and Examples},
edition = {5th},
series = {Cambridge Series in Statistical and Probabilistic Mathematics},
publisher = {Cambridge University Press},
year = {2019}
}
@book{harris1963,
author = {Harris, Theodore E.},
title = {The Theory of Branching Processes},
publisher = {Springer-Verlag, Berlin},
year = {1963}
}
@article{kestenstigum1966,
author = {Kesten, Harry and Stigum, Bernt P.},
title = {A limit theorem for multidimensional Galton-Watson processes},
journal = {Annals of Mathematical Statistics},
volume = {37},
number = {5},
pages = {1211--1223},
year = {1966}
}
@book{neveu1975,
author = {Neveu, Jacques},
title = {Discrete-Parameter Martingales},
publisher = {North-Holland, Amsterdam},
year = {1975}
}