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.

Doob L1 maximal inequality

Statement

Assume AC. If $X$ is a nonnegative submartingale, $λ > 0$ , and $N \in N_{0}$ , then $λ P ⁣ (\max_{0 \leq k \leq N} X_{k} \geq λ) \leq E ⁣ [X_{N} 1_{{\max_{k \leq N} X_{k} \geq λ}}] \leq E X_{N} .$

Facts & Assumptions

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

[F1]

Martingale submartingale and supermartingale makes each first-crossing event measurable at its crossing time.

[F2]

Multistep martingale characterization gives $X_{k} \leq E [X_{N} ∣ F_{k}]$ for $k \leq N$ .

[F3]

Conditional expectation as an ae class supplies the integral identity on $F_{k}$ events, and The Lebesgue integral is linear on $L^{1} (μ)$ sums the finite partition.

[F4]

The Axiom of Choice is used only through the chosen conditional-expectation representatives in F2, F3.

Proof

1.1

Define the disjoint first-crossing events $A_{k} = {X_{0} < λ, \dots, X_{k - 1} < λ, X_{k} \geq λ}, 0 \leq k \leq N,$ with the preceding string empty for $k = 0$ . Each $A_{k} \in F_{k}$ , and their union is $A = {\max_{j \leq N} X_{j} \geq λ}$ .

1.2

On $A_{k}$ , $X_{k} \geq λ$ . By F2 and the conditional-expectation identity, $λ P (A_{k}) \leq E [X_{k} 1_{A_{k}}] \leq E [X_{N} 1_{A_{k}}] .$

F2F3

2.1

Sum over the finite disjoint partition to get $λ P (A) \leq E [X_{N} 1_{A}] .$ Since $X_{N} \geq 0$ , the latter is at most $E X_{N}$ . This finite-time proof does not presuppose stopping-time or optional-sampling results. AC has exactly the inherited use in F4.

F3F4step 1.1step 1.2∎

Depends on

Used by

Doob maximal bounds for a centered random walk Example
Doob Lp maximal inequality Theorem

Dependency tree · two levels

19 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

van der Vaart, Martingales, Diffusions and Financial Mathematics, Lemma 2.43, p. 22 (standard reference, not scraped)