Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

Conditional expectation process is a martingale

Statement

Assume AC. For XL1(P) on a discrete filtered probability space, choose at each n0 a real Fn-measurable version Mn of E[XFn]. Then M is a martingale.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

Under AC every integrable input has a measurable integrable conditional version. Conditional expectation as an ae class.

[F2]

Conditional expectations on nested sigma-algebras satisfy the tower identity. Tower property of conditional expectation.

[F3]

AC supplies the inherited conditional-expectation existence and any stated choice of versions. The Axiom of Choice.

[F4]

A countable union of measurable null sets is null. Finite and countable subadditivity of measures.

Proof

technique · direct
1.1

By conditional existence the set of real measurable integrable versions at every time is nonempty. AC selects one member for each nN0. Thus each Mn is Fn-measurable and integrable, so M is an integrable adapted process. AC also covers the RN existence assumption.

givenF1F3
2.1

Since FnFn+1, the tower identity gives E[Mn+1Fn]=E[E[XFn+1]Fn]=E[XFn]=Mn a.s. for each n0. This is the martingale condition Martingale submartingale and supermartingale. If representatives of these identities are specified, their measurable failure sets have probability zero; their countable union is measurable and null. This does not complete any Fn or alter its representatives.

F1F2F4step 1.1

Depends on

Used by

Dependency tree · two levels

16 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