Alphabeta Math

Stopping Times and Optional Stopping — Examples

About this page
Pipeline-generated
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.

✓ 1 result · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.
1 · Prerequisites
Abstract Algebra
Combinatorics
Linear Algebra
Measure Theory
Probability
Real Analysis
Set Theory
Topology
2 · Logical flowchart

3 · Items

Example

First exit time from an interval

Example

Gambler's ruin probability for a biased walk

Example

Expected duration of simple gambler's ruin

Example

Wald's equation for a bounded stopping time

Example

Stopping a likelihood-ratio martingale

Counterexample

A last exit time need not be a stopping time

Counterexample

Optional stopping fails for an unbounded simple-random-walk hitting time

Counterexample

Almost-surely finite stopping does not imply integrable stopping

Counterexample

Integrable stopping time alone does not suffice for arbitrary martingale increments

Sources