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.

Lp-bounded martingale convergence

Statement

Assume AC. Let p>1. If M is a martingale and C:=sup⁡nE∣Mn∣p<∞, then some M∞∈Lp satisfies Mn→M∞ almost surely and in Lp. Moreover Mn=E[M∞∣Fn]a.s.,∥sup⁡n∣Mn∣∥p≤pp−1sup⁡n∥Mn∥p.

Facts & Assumptions

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

[F1]

Doob submartingale convergence theorem gives almost-sure convergence from a uniform positive-part bound.

[F2]

Doob Lp maximal inequality gives the finite-horizon maximal estimate.

[F3]

Monotone convergence for the integral and Dominated convergence pass respectively to the infinite maximum and to the Lp limit.

[F4]

Conditional lp contraction and Multistep martingale characterization identify the terminal conditional expectations.

[F5]

The Axiom of Choice is inherited from the martingale and conditional-expectation interfaces.

Proof

1.1F1

Since the underlying measure is a probability measure, Hölder gives sup⁡nE∣Mn∣≤C1/p. In particular sup⁡nE(Mn)+≤C1/p. The martingale M is also a submartingale, so F1 applies directly to M and gives Mn→M∞ almost surely for a finite integrable M∞.

1.2F2F3

For each N, F2 gives ∥max⁡k≤N∣Mk∣∥p≤qsup⁡n∥Mn∥p,q=pp−1. The maxima increase to M∗=sup⁡n∣Mn∣, so F3 yields the displayed infinite-horizon bound and M∗∈Lp. In particular ∣M∞∣≤M∗ almost surely, hence M∞∈Lp.

2.1F3step 1.1step 1.2

We have ∣Mn−M∞∣p≤(2M∗)p and pointwise convergence to zero. Dominated convergence gives ∥Mn−M∞∥p→0.

3.1F4F5∎

Fix n and take m≥n. F4 gives Mn=E[Mm∣Fn]. Conditional Lp contraction and step 2.1 imply ∥E[Mm−M∞∣Fn]∥p≤∥Mm−M∞∥p⟶0. The left conditional expectations therefore converge to zero while Mn is fixed, proving Mn=E[M∞∣Fn] almost surely. AC has only the inherited role in F5.

Depends on

Used by

Dependency tree · two levels

42 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