Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 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.

Doob Lp maximal inequality

Statement

Assume AC. Let NN0, p>1, and q=p/(p1). If X=(Xn)n0 is a nonnegative submartingale and XNLp, then max0kNXkpqXNp. In particular, for a martingale M with MNLp, max0kNMkpqMNp.

Facts & Assumptions

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

[F1]

Doob L1 maximal inequality gives the refined level inequality with XN restricted to the crossing event.

[F3]

Holder's inequality for integrals, including the endpoint cases bounds the mixed terminal/maximal moment.

[F5]
[F6]

The Axiom of Choice is inherited from F1 and F5 through conditional expectation.

Proof

1.1

Put XN=maxkNXk and fix r>0. Layer cake and F1 give E(XNr)p=0rpλp1P(XNλ)dλ0rpλp2E[XN1{XNλ}]dλ=qE ⁣[XN(XNr)p1]. The last identity follows by integrating pλp2 up to XNr.

F1F2
2.1

Hölder bounds the last expression by qXNpXNrpp1. If the truncated norm is nonzero, divide by its (p1)st power; if it is zero, the desired inequality is immediate. Thus XNrpqXNp.

F3step 1.1
3.1

Let r. F4 yields XNpqXNp, including the case where a priori the maximal moment might be infinite.

F4step 2.1
4.1

If M is a martingale, Mk is a nonnegative submartingale by F5 and its terminal value is MN. Applying step 3.1 proves the second display. AC is exactly the inherited dependence in F6.

F5F6

Depends on

Used by

Dependency tree · two levels

33 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