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.

Doob maximal bounds for a centered random walk

Statement

Assume AC. Let Sk=j=1kξj, where the independent increments are centered and square-integrable, and put σk2=Eξk2. Then for λ>0, P ⁣(max0knSkλ)λ2k=1nσk2,Emax0knSk24k=1nσk2.

Facts & Assumptions

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

[F1]

Conditioning a known variable and an independent variable turns the centered independent next increment into conditional mean zero.

[F2]

Convex functions of martingales are submartingales makes Sk2 and Sk nonnegative submartingales.

[F3]

Doob L1 maximal inequality and Doob Lp maximal inequality give the two maximal estimates.

[F4]

The Axiom of Choice is inherited from conditioning and the maximal inequalities.

Proof

1.1

In the natural filtration, Sk1 is known and ξk is independent of the past with mean zero. Thus F1 gives E[SkFk1]=Sk1+Eξk=Sk1, so S is a square-integrable martingale.

F1
2.1

Expanding the square gives ESn2=k=1nEξk2+2j<kE(ξjξk). For j<k, independence and centering give E(ξjξk)=EξjEξk=0; hence ESn2=kσk2.

step 1.1
3.1

Apply F3's L1 inequality to the nonnegative submartingale Sk2 at level λ2. The event is exactly {maxknSkλ}, so the first bound follows from step 2.1. Apply the p=2 inequality to Sk to get maxknSk22Sn2; squaring and using step 2.1 gives the second. AC is used exactly through F4.

F2F3F4step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

20 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