A bounded stopping time applied to an integrable martingale has the same expected value as the start. Keeping the exact identity in view prevents the geometric or probabilistic intuition from drifting.
Definitions first
A process \((M_n,\mathcal F_n)\) is a martingale when \(\mathbf E[M_{n+1}\mid\mathcal F_n]=M_n\). Its baseline \(M_0\) models fair evolution relative to the information currently available.
The typography mirrors the proof: first declare \(\mathsf D\), then state \(\mathsf C\). The symbol \(\Longrightarrow\) below is a logical dependency, not extra mathematical structure.
A small case in full
A worked instance is useful here because it exposes every index that the compressed statement hides.
The reusable statement
What survives the example is not its particular numbers but the relation encoded by the two rows below. That relation is the part worth transporting to a new setting.
A nearby false statement
Optional stopping is not valid for every stopping time. Boundedness, integrability, or uniform-integrability conditions prevent hidden mass from escaping at infinity.
The important habit is to remember what was fixed before the calculation began and what was proved only afterward. The final display preserves that order.