Fair Games Theorem

Lawrence C. Paulson 📧

June 12, 2026

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

This is the optional stopping theorem (or fair games theorem) for real-valued discrete-time stochastic processes on a $\sigma$-finite filtered measure space. A theory of piecewise-constant stopping times – the function taking $i$ on an $\mathcal F_i$-measurable set $S$ and $j$ on its complement – is developed, together with the corresponding decomposition of integrals over the two pieces. The central results then prove both directions of the theorem: if $X$ is a submartingale, then for any bounded stopping times $\tau \le \pi$ the expected stopped values satisfy $\mathbb E[X_\tau] \le \mathbb E[X_\pi]$ (via the telescoping identity and the submartingale set-integral inequality); conversely, monotonicity of expected stopped values over all bounded stopping times characterises submartingales. It is further shown that the stopped process $X^\tau$ of a submartingale is again a submartingale. Throughout, the theorems are cross-referenced to their counterparts in Mathlib's OptionalStopping, from which it was translated by Claude. It was polished manually afterwards. The fair games theorem is #62 on the Top 100 Mathematical Theorems.

License

BSD License

Note

As noted above

Topics

Session Fair_Games_Theorem