Alphabeta Math

Stopping Times and Optional Stopping

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 · Prerequisites
Abstract Algebra
Combinatorics
Linear Algebra
Measure Theory
Probability
Real Analysis
Set Theory
Topology
2 · Logical flowchart

3 · Items

Definition

Discrete stopping time

Lemma

Equivalent event tests for a discrete stopping time

Lemma

First hitting time of an adapted process is a stopping time

Lemma

Minimum, maximum, and bounded shifts of stopping times

Definition

Sigma-algebra at a stopping time

Lemma

The stopping-time sigma-algebra is a sigma-algebra

Definition

Stopped random variable and stopped process

Lemma

A stopped random variable is measurable at the stopping time

Theorem

A stopped martingale is a martingale

Theorem

Optional sampling for bounded stopping times

Theorem

Optional stopping under uniform integrability

Theorem

Optional stopping with integrable time and bounded increments

Theorem

Optional stopping with a dominating integrable variable

Corollary

Wald first equation under integrable stopping

Corollary

Gambler's ruin hitting probability from optional stopping

Corollary

Expected duration of symmetric gambler's ruin

Remark

Optional stopping requires a passage-to-the-limit hypothesis

Sources