Alphabeta Math
CounterexampleConstruction: 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 Lp maximal inequality excludes p equals one

Statement

Assume AC. There is no universal C such that Emax0knMkCEMn for every integrable martingale and horizon n.

Facts & Assumptions

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

[F1]

Conditional expectation process is a martingale makes finite conditional-expectation processes martingales.

[F2]

Expectation of a nonnegative or integrable random variable evaluates the shell-simple functions below.

[F3]

The Axiom of Choice is inherited from conditional expectation.

Counterexample

1.1

Fix n. On [0,1] put Ak=(0,2k] for 1kn, A0=[0,1], and Fk=σ(A1,,Ak). For X=2n1An, direct averaging on Ak gives Mk:=E[XFk]=2k1Ak(0kn) up to the null endpoint. F1 verifies the martingale, and EMn=2n2n=1.

F1F2
2.1

On the shell AjAj+1 for 0j<n, the maximum is 2j and the shell has measure 2(j+1). On An the maximum is 2n and the measure is 2n. Therefore EmaxknMk=j=0n12j2(j+1)+2n2n=n2+1.

F2step 1.1
3.1

If a horizon-independent C existed, step 1.1, step 2.1 would give n/2+1C for every n, impossible. Thus the p>1 restriction cannot be extended to this strong L1 form. AC has exactly the inherited role in F3.

F3step 1.1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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