How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Stopping Times and Optional Stopping
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conditional Expectation
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Darboux, L'Hôpital, and Taylor's Theorem
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Martingale Inequalities and Convergence
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Laws and Series of Independent Random Variables
2 · Summary
Stopping times are defined by literal finite-horizon events, with boundedness kept distinct from almost-sure finiteness. Minimum, maximum, and shift formulas record the exact filtration in which each shifted time is stopping. A stopped random variable has an explicit cemetery value on , while the finite stopped process never evaluates that value.
The sigma-algebra at a stopping time is verified directly, including under pointwise order. Bounded optional sampling is proved through the finite predictable-transform identity and includes martingale equality plus both submartingale/supermartingale directions.
Each unbounded extension supplies its own valid limit mechanism: uniform integrability and a terminal conditional representation, bounded increments together with integrable time, or a direct integrable dominator. Wald's equation instead uses an absolute tail-series/Tonelli calculation and remains choice-free. Gambler's ruin derives both hitting probability and expected duration without assuming duration integrability in advance.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Discrete stopping time
Definition
For a filtration , a map is a stopping time if for every . It is bounded if some deterministic satisfies almost surely, and finite if . These notions are distinct: finite does not mean bounded.
The event condition is literal, not merely modulo null sets; no completion of the filtration is assumed. Measurability as an extended-integer-valued random variable follows from the equivalent event tests below.
Equivalent event tests for a discrete stopping time
Statement
For a filtration and , the following are equivalent:
- for every ;
- for every ;
- for every .
Under any of them, for .
Facts & Assumptions
Given: The hypotheses, objects, and conventions in the Statement.
Discrete stopping time is condition (1).
Sigma-algebras supplies closure under complements, differences, and finite unions.
Proof
Conditions (1) and (3) are equivalent because and is closed under complements.
From (1), and, for , using . Thus (1) implies (2).
From (2), since each summand lies in . Thus (2) implies (1), completing the equivalence.
Finally, for , The value is automatically included in this event.
First hitting time of an adapted process is a stopping time
Statement
If is adapted and is Borel, then is a stopping time.
Facts & Assumptions
Given: The hypotheses, objects, and conventions in the Statement.
Equivalent event tests for a discrete stopping time reduces the claim to the finite-horizon events.
Proof
For each , Every term is in by F1, and the union is finite.
Hence the event belongs to , so F2 proves that is a stopping time. If the path never enters , it belongs to none of these events and the convention gives exactly .
Minimum, maximum, and bounded shifts of stopping times
Statement
If are stopping times, then and are stopping times. If , then is a stopping time for , with . More generally, if is stopping for , then is stopping for . The earlier shift is stopping for but need not be stopping for . Finally, for every deterministic , is a bounded stopping time.
Facts & Assumptions
Given: The hypotheses, objects, and conventions in the Statement.
Discrete stopping time supplies the finite-horizon test.
Equivalent event tests for a discrete stopping time supplies the complementary tests.
Proof
The identities prove the first two claims by F1.
If , ; if , it is . If is stopping for , the same event is in .
For the earlier shift, so it is stopping for the shifted filtration. The right side need not lie in , which is why no unshifted assertion is made.
A deterministic is a stopping time, so step 1.1 makes a stopping time, and it is bounded by . All empty and infinite-value cases follow from the displayed identities.
Sigma-algebra at a stopping time
Definition
For a stopping time , define It represents the events observable by time . The definition applies when may equal and treats events as literal sets, not modulo null sets. Its closure and comparison properties are proved in the next lemma.
The stopping-time sigma-algebra is a sigma-algebra
Statement
For every stopping time , is a -algebra contained in . For deterministic it equals . If pointwise, then .
Facts & Assumptions
Given: The hypotheses, objects, and conventions in the Statement.
Sigma-algebra at a stopping time gives the defining intersection tests.
Sigma-algebras supplies closure operations.
Proof
Since , passes every test. If passes, then If all pass, distributivity gives Thus is a -algebra, and containment in is part of F1.
If , all tests below are vacuous and the test at is ; upward nesting then supplies every later test. Hence .
Suppose and . For each , On the condition is automatic, so the equality is exact. Each term belongs to , proving . The order hypothesis is not weakened to an untracked almost-sure order.
Stopped random variable and stopped process
Definition
For an adapted real process , a stopping time , and a fixed real cemetery value , define The level events are disjoint and exactly one displayed term is active, so the value is unambiguous. If an actual terminal variable is separately supplied, it may replace on , but that convention must be stated.
The stopped process is Because , this expression never evaluates the cemetery value and equals the finite sum
A stopped random variable is measurable at the stopping time
Statement
If is adapted, is a stopping time, and the value on is a fixed real number, then is -measurable. In particular, is -measurable.
Facts & Assumptions
Given: The hypotheses, objects, and conventions in the Statement.
Stopped random variable and stopped process gives the disjoint level-set formula.
Sigma-algebra at a stopping time gives the event tests for .
Proof
For Borel , All finite-level terms lie in , and is the complement of their countable union, so the inverse image is in .
Intersecting that inverse image with deletes the infinity term and all levels above , leaving Thus every inverse image passes F2's tests and is -measurable. Apply the same proof to the bounded stopping time for the final assertion.
A stopped martingale is a martingale
Statement
Assume AC. If is a martingale and is a stopping time, then is a martingale with respect to the original filtration.
Facts & Assumptions
Given: The hypotheses, objects, and conventions in the Statement.
Stopped random variable and stopped process gives a finite formula for every .
Discrete martingale transform interprets the stopped increments as a bounded predictable transform.
Martingale submartingale and supermartingale supplies the conditional mean-zero increments.
The Axiom of Choice states AC, assumed here because the martingale and conditional-expectation interfaces require it.
Taking out what is known permits the bounded -measurable indicator in step 1.2 to be taken outside conditional expectation.
Proof
The finite formula in F1 makes -measurable and integrable: it is a finite sum of for and .
Pathwise, The indicator is bounded and -measurable by F2, so this is the th increment of the predictable transform in F3.
Taking the conditional expectation of step 1.2 and pulling out the indicator by F6 gives zero by F4. Together with adaptedness and integrability from step 1.1, this is exactly the martingale condition. The stopped process never evaluates a value at infinity; AC has only the role in F5.
Optional sampling for bounded stopping times
Statement
Assume AC. If is a martingale and are stopping times bounded by a deterministic , then so . For a submartingale the conditional and expectation inequalities point upward; for a supermartingale they point downward.
Facts & Assumptions
Given: The hypotheses, objects, and conventions in the Statement.
Sigma-algebra at a stopping time gives the events usable in conditional testing.
A stopped random variable is measurable at the stopping time gives the required measurability of stopped values.
Bounded predictable transforms preserve martingales gives zero expected martingale transforms. Nonnegative predictable transforms preserve submartingale gains gives the upward sign for submartingales and nonnegative holdings; applying it to gives the downward sign for supermartingales.
Conditional expectation as an ae class identifies a conditional expectation from all event integrals.
The Axiom of Choice supplies conditional-expectation representatives.
Proof
Put for . Both and lie in , so is nonnegative, bounded, and predictable. On the probability-one event , the finite pathwise telescope is The integral identities below use this almost-sure equality; no equality is asserted on a null outcome with .
Fix . On , ; hence and the first factor on the right is -measurable by F1. Thus is another bounded nonnegative predictable process.
Apply F3's one-step conditional calculation and sum: for a submartingale, for a martingale equality holds, and for a supermartingale the inequality reverses. Almost-sure boundedness identifies every stopped value almost surely with a finite sum of integrable variables, while F2 gives -measurability of . F4 therefore identifies the stated conditional relation. Taking gives the expectation relation. AC has exactly the role in F5.
Optional stopping under uniform integrability
Statement
Assume AC. Let be a uniformly integrable martingale and let be pointwise ordered, almost-surely finite stopping times. Define and using the fixed cemetery value on the respective null events where the stopping time is infinite. Then and
Facts & Assumptions
Given: The hypotheses, objects, and conventions in the Statement.
Closed martingale characterization supplies with and makes conditional expectations of this fixed variable uniformly integrable.
Optional sampling for bounded stopping times handles every truncated time.
Stopped random variable and stopped process gives pointwise stabilization at an almost-surely finite time.
Sigma-algebra at a stopping time gives the stopped-event tests, and Tower property of conditional expectation applies to nested sigma-algebras.
The Axiom of Choice records the background AC hypothesis. The conditional-expectation and representative properties used here are supplied by [F1], [F2], and [F4].
The stopping-time sigma-algebra is a sigma-algebra proves for pointwise .
Proof
Fix a stopping time equal to either or . For , F2 applied to gives Let in using F1 and conditional contraction to obtain
The sigma-algebras increase with . Thus the sequence in step 1.1 is a closed, hence uniformly integrable, martingale by F1. Since almost surely, F3 gives almost surely; F1's UI convergence implication upgrades this to , proving .
For , the event belongs to (check the defining finite-level intersections). Apply the conditional identity in step 1.1 on this event, then let . The left side converges by step 2.1; the right side converges by dominated convergence for . Hence so .
Since pointwise, F6 gives . Apply the tower property in F4 to the two representations from step 3.1: Taking expectations finishes. AC is the background hypothesis recorded in F5; the conditional-expectation identities come from F1 and F4.
Optional stopping with integrable time and bounded increments
Statement
Assume AC. Let be a martingale with almost surely for every , for deterministic . If is a stopping time with , define on the null event . Then and .
Facts & Assumptions
Given: The hypotheses, objects, and conventions in the Statement.
Expectation of a nonnegative or integrable random variable defines as an extended nonnegative integral; Markov's inequality for random variables bounds by for each .
Dominated convergence passes the stopped values in .
The Axiom of Choice is inherited from the martingale and bounded optional-sampling theorem.
Proof
For every positive integer , F2 gives . Since , letting shows almost surely. On that event, because the difference telescopes over at most increments. It tends pointwise to zero and has the integrable dominator .
F3 gives in ; in particular is integrable. F1 gives for every , so taking the limit proves the equality. Bounded increments and integrability of are used exactly in step 1.1. AC has only the role in F4.
Optional stopping with a dominating integrable variable
Statement
Assume AC. Let be a martingale and an almost-surely finite stopping time. If and almost surely for every , define on and on . Then and .
Facts & Assumptions
Given: The hypotheses, objects, and conventions in the Statement.
Optional sampling for bounded stopping times gives the expectation identity at .
Dominated convergence passes to the finite-time limit.
The Axiom of Choice is inherited from the martingale and optional-sampling interfaces.
Proof
Since almost surely, eventually equals almost surely. On the null event the stipulated cemetery value makes the stopped variable total; all limit assertions are almost-sure assertions. The assumed bound passes to , proving integrability, and also gives F2 therefore yields convergence.
F1 gives for every . Pass to the limit from step 1.1 to get . AC has exactly the inherited role in F3.
Wald first equation under integrable stopping
Statement
Let be iid integrable real random variables with mean , let , and let be an -stopping time with . Then is integrable and
Facts & Assumptions
Given: The hypotheses, objects, and conventions in the Statement.
Expectations factor over finite products of independent random variables factors the tail-event products.
Monotone convergence for the integral, Dominated convergence, and The Lebesgue integral is linear on justify the infinite sums.
Proof
Pointwise, The first identity is understood through finite partial sums; the integrability calculation below shows that is null.
By F1, F2, F3, MCT applied to the nonnegative partial sums and to the second identity in step 1.1 gives Thus the stopped series is absolutely integrable and almost surely.
The signed partial sums are dominated by the integrable absolute series in step 2.1. DCT and finite linearity therefore give where F3 gives the middle factorization. This argument is choice-free: the given iid sequence and stopping time supply all indexed objects, and no conditional-expectation version is chosen.
Gambler's ruin hitting probability from optional stopping
Statement
Assume AC. Let and be integers, let , where the independent increments take and with probability , and use the natural filtration , with trivial. For is almost surely finite; use the cemetery value on . Then .
Facts & Assumptions
Given: The hypotheses, objects, and conventions in the Statement.
First hitting time of an adapted process is a stopping time makes a stopping time.
Conditioning a known variable and an independent variable verifies that is a martingale.
Optional stopping with a dominating integrable variable passes from the bounded stopped times to .
The Axiom of Choice is inherited from martingale conditioning and optional stopping.
Proof
Adaptedness and F1 make a stopping time. At the start of any block of fresh increments, conditional on not yet having exited, the event that all increments are has probability and forces an upper exit within that block. Independence of successive increments therefore gives inductively Thus almost surely.
Since and is independent of the past, F2 gives . Before and at exit the nearest-neighbour path stays in , so . F3 with dominator yields .
At the finite exit time, ; the chosen value zero on the null event preserves this assertion everywhere. Therefore which gives the result. AC is used exactly through F4.
Expected duration of symmetric gambler's ruin
Statement
Assume AC. In the symmetric gambler's ruin setting with and absorbing levels , the exit time satisfies
Facts & Assumptions
Given: The hypotheses, objects, and conventions in the Statement.
Gambler's ruin hitting probability from optional stopping gives almost-sure finiteness and .
Square minus predictable quadratic variation is a martingale makes a martingale for unit-variance increments.
Optional sampling for bounded stopping times applies at .
Dominated convergence and Monotone convergence for the integral pass the two stopped terms separately.
The Axiom of Choice is inherited from the martingale and optional-sampling interfaces.
Proof
The predictable quadratic variation of the symmetric walk is , since every increment has conditional square one. Thus F2 and bounded optional sampling give
The stopped position lies in and converges almost surely to by F1. DCT gives Meanwhile , so MCT gives , initially allowing infinity.
Taking limits in step 1.1 forces the latter value to be finite and gives The argument does not assume integrability of before proving it. AC has exactly the role in F5.
Optional stopping requires a passage-to-the-limit hypothesis
Remark
Assume AC. Bounded optional sampling proves ; almost-sure convergence does not by itself permit expectations to pass to the limit. Almost-sure finiteness of alone is insufficient, and even is insufficient when the martingale increments are unrestricted.
Three valid mechanisms established here are distinct:
- Optional stopping under uniform integrability supplies uniform integrability of the stopped family;
- Optional stopping with integrable time and bounded increments supplies the dominator for the stopped family (and for its difference from );
- Optional stopping with a dominating integrable variable assumes a direct integrable dominator.
The companion counterexamples witness both advertised failures. This remark adds no new optional-stopping theorem. AC is exactly the conditional-expectation dependence inherited from the three cited results.
5 · Examples, counterexamples and false statements
None yet.
Sources
- van der Vaart, Martingales, Diffusions and Financial Mathematics, §2.3, pp. 9–11
- Durrett, Probability: Theory and Examples, 5th ed., §4.4
- van der Vaart, Martingales, Diffusions and Financial Mathematics, Definition 2.36, p. 20
- van der Vaart, Martingales, Diffusions and Financial Mathematics, Exercises 2.37–2.39 and Lemma 2.41, pp. 20–21
- van der Vaart, Martingales, Diffusions and Financial Mathematics, §§2.3 and 2.8
- van der Vaart, Martingales, Diffusions and Financial Mathematics, Exercise 2.40, p. 20
- van der Vaart, Martingales, Diffusions and Financial Mathematics, Theorem 2.42 and proof, pp. 21–22
- Durrett, Probability: Theory and Examples, 5th ed., optional stopping criteria in §4.8
- Durrett, Probability: Theory and Examples, 5th ed., Wald's equation in §4.8
- van der Vaart, Martingales, Diffusions and Financial Mathematics, optional-stopping examples in §2.3
- Durrett, Probability: Theory and Examples, 5th ed., gambler's ruin and optional stopping in §4.8
- van der Vaart, Martingales, Diffusions and Financial Mathematics, warning after Theorem 2.42, p. 22