Optional Stopping Theorem
Statement
Let be a martingale on a probability space . A stopping time is a -valued random variable with for all .
The stopped process is again a martingale. Under boundedness ( a.s. for some fixed , or a.s.):
More generally (for submartingales with bounded stopping time ):
Visualization
Simple random walk , . Set first time for .
Sample path with a=2, b=3:
S
3| * ← absorbed at b=+3
2| * *
1| * * * *
0|──*─*─*───────────→ n
-1| *
-2| (barrier, not hit)
τ = first hitting time of {-2, +3}
E[Sτ] = E[S₀] = 0 (OST, since τ is bounded by a·b steps)
More precisely: P(Sτ = b) = a/(a+b), P(Sτ = -a) = b/(a+b)
Check: b · a/(a+b) + (-a) · b/(a+b) = (ab - ab)/(a+b) = 0 ✓
For a=2, b=3: P(hit +3) = 2/5 = 0.4, P(hit -2) = 3/5 = 0.6
E[Sτ] = 3·(2/5) + (-2)·(3/5) = 6/5 - 6/5 = 0 ✓
Proof Sketch
- Stopped process is a (sub)martingale. For , express .
- Write as a predictable integral. Define which is -measurable (since are stopping times). Then .
- Take expectations. By the martingale property for martingales, or for submartingales.
- Sum the telescoping differences to conclude (or ).
Connections
Optional stopping is the engine behind the classical gambling ruin calculation and the Doob's Martingale ConvergenceDoob's Martingale ConvergenceAn L1-bounded submartingale converges almost surely to an integrable limitRead more → theory. Combined with the Strong Law of Large NumbersStrong Law of Large NumbersThe sample mean of i.i.d. integrable random variables converges almost surely to the population meanRead more →, it characterises recurrence of random walks.
Lean4 Proof
import Mathlib.Probability.Martingale.OptionalStopping
open MeasureTheory
/-- Optional stopping theorem: for a submartingale, the expected stopped value
is monotone in the stopping time.
Mathlib: `MeasureTheory.Submartingale.expected_stoppedValue_mono`. -/
theorem optional_stopping_alias
{Ω : Type*} {m0 : MeasurableSpace Ω}
{μ : Measure Ω} [SigmaFiniteFiltration μ (𝒢 : Filtration ℕ m0)]
{f : ℕ → Ω → ℝ}
{τ π : Ω → ℕ}
{N : ℕ}
(hf : Submartingale f 𝒢 μ)
(hτ : IsStoppingTime 𝒢 τ)
(hπ : IsStoppingTime 𝒢 π)
(hle : τ ≤ π)
(hbdd : ∀ ω, π ω ≤ N) :
μ[stoppedValue f τ] ≤ μ[stoppedValue f π] :=
hf.expected_stoppedValue_mono hτ hπ hle hbddReferenced by
- Doob's Martingale ConvergenceProbability