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.

Optional sampling for bounded stopping times

Statement

Assume AC. If M is a martingale and στ are stopping times bounded by a deterministic N, then E[MτFσ]=Mσa.s., so EMτ=EMσ. For a submartingale X the conditional and expectation inequalities point upward; for a supermartingale they point downward.

Facts & Assumptions

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

[F1]

Sigma-algebra at a stopping time gives the events usable in conditional testing.

[F2]

A stopped random variable is measurable at the stopping time gives the required measurability of stopped values.

[F3]

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 X gives the downward sign for supermartingales.

[F4]

Conditional expectation as an ae class identifies a conditional expectation from all event integrals.

[F5]

The Axiom of Choice supplies conditional-expectation representatives.

Proof

1.1

Put Hk=1{σ<kτ} for 1kN. Both {σ<k}={σk1} and {τk} lie in Fk1, so H is nonnegative, bounded, and predictable. On the probability-one event {στN}, the finite pathwise telescope is XτXσ=k=1NHk(XkXk1). The integral identities below use this almost-sure equality; no equality is asserted on a null outcome with τ>N.

F1
2.1

Fix AFσ. On {σk}, Hk=0; hence 1AHk=1A{σk1}Hk, and the first factor on the right is Fk1-measurable by F1. Thus 1AH is another bounded nonnegative predictable process.

F1step 1.1
3.1

Apply F3's one-step conditional calculation and sum: for a submartingale, A(XτXσ)dP0; 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 Fσ-measurability of Xσ. F4 therefore identifies the stated conditional relation. Taking A=Ω gives the expectation relation. AC has exactly the role in F5.

F2F3F4F5step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

21 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