Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

A stopped martingale is a martingale

Statement

Assume AC. If M is a martingale and τ is a stopping time, then Mnτ=Mnτ is a martingale with respect to the original filtration.

Facts & Assumptions

Given: The hypotheses, objects, and conventions in the Statement.

[F1]

Stopped random variable and stopped process gives a finite formula for every Mnτ.

[F2]

Equivalent event tests for a discrete stopping time gives {τn}Fn1.

[F3]

Discrete martingale transform interprets the stopped increments as a bounded predictable transform.

[F4]

Martingale submartingale and supermartingale supplies the conditional mean-zero increments.

[F5]

The Axiom of Choice states AC, assumed here because the martingale and conditional-expectation interfaces require it.

[F6]

Taking out what is known permits the bounded Fn1-measurable indicator in step 1.2 to be taken outside conditional expectation.

Proof

1.1

The finite formula in F1 makes Mnτ Fn-measurable and integrable: it is a finite sum of Mk1{τ=k} for k<n and Mn1{τn}.

F1F2
1.2

Pathwise, MnτM(n1)τ=1{τn}(MnMn1). The indicator is bounded and Fn1-measurable by F2, so this is the nth increment of the predictable transform in F3.

F2F3
2.1

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.

F4F5F6step 1.1step 1.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

22 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources