Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

An Lp-bounded martingale with an Lp terminal value

Statement

Assume AC. If p>1, XLp, (Fn) is a filtration, and F is a sigma-algebra containing every Fn, then Mn=E[XFn] is Lp-bounded and converges almost surely and in Lp to an F-measurable M. If F=σ(nFn), then M=E[XF].

Facts & Assumptions

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

[F1]

Conditional expectation process is a martingale makes (Mn) a martingale.

[F2]

Conditional lp contraction gives MnpXp.

[F3]

Lp-bounded martingale convergence gives almost-sure and Lp convergence.

[F4]

Levy upward convergence of conditional expectations identifies the generated-σ-algebra limit.

[F5]

The Axiom of Choice states AC, assumed here because F1--F4 use conditional expectations and chosen representatives.

Proof

1.1

F1 makes (Mn) a martingale, and F2 gives supnMnpXp<. F3 therefore supplies MLp with both asserted modes of convergence. As a pointwise limit of variables measurable for F, it has an F-measurable version.

F1F2F3
2.1

When F=σ(nFn), F4 gives almost-sure and L1 convergence of the same sequence to E[XF]. Limits in probability are unique, so it equals the Lp limit M almost surely. AC is used exactly through F5.

F4F5step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

23 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