Alphabeta Math
Pipeline-generated
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.

Martingale Inequalities and Convergence — Examples

1 · Prerequisites

2 · Summary

Centered random walks illustrate both Doob maximal bounds, and dyadic and reverse conditional-expectation martingales identify their limiting sigma-algebras. A nonnegative martingale is shown to converge almost surely without an unjustified equality of expectations.

The nested-interval martingale supplies two explicit boundary failures: L1 boundedness need not give L1 convergence or preserve expectation, and its finite closed versions have maximal L1 norm n/2+1, ruling out a horizon-independent p=1 analogue. The final random-walk calculation specializes Azuma to the Gaussian-scale bound 2et2/(2n).

3 · Logical flowchart

4 · Definitions, theorems and proofs

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

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
ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

A nonnegative martingale converges almost surely

Statement

Assume AC. Every nonnegative martingale M has an almost-sure finite integrable limit M, with EMEM0. Equality and L1 convergence are not asserted without uniform integrability.

Facts & Assumptions

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

[F1]

Doob submartingale convergence theorem gives a finite integrable almost-sure limit from bounded positive-part expectations.

[F2]

Fatou's lemma compares its expectation with the constant martingale expectations.

[F3]

The Axiom of Choice states AC, assumed here because F1 and the martingale interface require it.

Proof

1.1

Since Mn0, Mn+=Mn, and the martingale identity gives EMn=EM0 for every n. Thus F1 applies and gives MnM almost surely with M finite and integrable.

F1
2.1

Fatou gives EMlim infnEMn=EM0. The inequality can be strict, so neither equality nor L1 convergence follows from nonnegativity alone. AC has only the role in F3.

F2F3step 1.1
ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

A dyadic martingale converges to the original L1 variable

Statement

Assume AC. On ([0,1],B,λ), let Fn be generated by the dyadic half-open intervals of length 2n, using ((j1)2n,j2n] and the null singleton {0}. For every XL1, Mn=E[XFn]X almost surely and in L1.

Facts & Assumptions

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

[F2]

Levy upward convergence of conditional expectations gives the limit along an increasing filtration.

[F3]

Conditioning a known variable and an independent variable identifies conditioning a measurable variable with itself.

[F4]

The Axiom of Choice is inherited from conditional expectation.

Proof

1.1

Every positive-length level-n cell is the union of its two level-(n+1) children, while the singleton {0} is itself a generator at every level. Hence FnFn+1. Dyadic half-open intervals form a countable base for the relative topology of [0,1]: every open interval is the countable union of dyadic cells whose closures lie inside it, with endpoints handled by the stated convention. Thus F1 gives σ(nFn)=B.

F1
2.1

F2 gives MnE[XB] almost surely and in L1. Since X is B-measurable, F3 identifies the latter conditional expectation with X. The singleton endpoint convention changes no L1 or almost-sure statement. AC is used exactly through F4.

F2F3F4step 1.1
ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-14Open item page →

A reverse martingale and the tail sigma-algebra

Statement

Assume AC. Let Z0,Z1, be integrable random variables, Gn=σ(Zn,Zn+1,), and XL1. The process Yn=E[XGn] is a reverse martingale with respect to the decreasing filtration (Gn). Moreover, E[XGn]E[XT] almost surely and in L1, where T=nGn is the tail σ-algebra.

Facts & Assumptions

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

[F1]

Tail sigma-algebra of a sequence identifies the intersection as T.

[F2]
[F4]

The Axiom of Choice is inherited from conditional expectation.

[F5]

Tower property of conditional expectation gives E[E[XGn]Gn+1]=E[XGn+1] almost surely.

Proof

1.1

Deleting the first generator gives Gn+1Gn, and F1 gives nGn=T. Each Yn is integrable and Gn-measurable by the conditional-expectation interface in F5. The tower identity in F5 gives E[YnGn+1]=Yn+1 almost surely, which is the reverse-martingale identity. F2 now applies directly to X, proving both modes of convergence.

F1F2F5
2.1

If the Zn are independent and AT, take X=1A. F3 gives P(A){0,1}, so 1A and therefore E[1AT] is almost surely constant. This extra conclusion is asserted only under independence. AC has exactly the inherited role in F4.

F3F4
ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

An Lp-bounded martingale with an Lp terminal value

Statement

Assume AC. If p>1, XLp, (Fn) is a filtration, and F is a sigma-algebra containing every Fn, then Mn=E[XFn] is Lp-bounded and converges almost surely and in Lp to an F-measurable M. If F=σ(nFn), then M=E[XF].

Facts & Assumptions

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

[F1]

Conditional expectation process is a martingale makes (Mn) a martingale.

[F2]

Conditional lp contraction gives MnpXp.

[F3]

Lp-bounded martingale convergence gives almost-sure and Lp convergence.

[F4]

Levy upward convergence of conditional expectations identifies the generated-σ-algebra limit.

[F5]

The Axiom of Choice states AC, assumed here because F1--F4 use conditional expectations and chosen representatives.

Proof

1.1

F1 makes (Mn) a martingale, and F2 gives supnMnpXp<. F3 therefore supplies MLp with both asserted modes of convergence. As a pointwise limit of variables measurable for F, it has an F-measurable version.

F1F2F3
2.1

When F=σ(nFn), F4 gives almost-sure and L1 convergence of the same sequence to E[XF]. Limits in probability are unique, so it equals the Lp limit M almost surely. AC is used exactly through F5.

F4F5step 1.1
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-14Open item page →

An L1-bounded martingale need not converge in L1

Statement

Assume AC. On ([0,1],B,λ) put An=(0,2n] for n1, let F0={,[0,1]} and Fn=σ(A1,,An), and define M0=1 and Mn=2n1An for n1. Then M is a nonnegative martingale with EMn=1 for every n, hence supnEMn=1, but Mn0 almost surely and not in L1.

Facts & Assumptions

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

[F1]

Martingale submartingale and supermartingale defines a martingale through conditional expectations.

[F2]

Conditional expectation given a sigma algebra supplies the event-integral characterization of conditional expectation.

[F3]

Expectation of a nonnegative or integrable random variable evaluates the displayed simple variables.

[F4]

The Axiom of Choice is assumed because the conditional-expectation and martingale interfaces used here require it.

Counterexample

1.1

The displayed process is nonnegative and EMn=2nλ(An)=1 for n1, while EM0=1.

F3
2.1

For n1, the atoms of Fn are An, the shells AjAj+1 for 1j<n, and the outside atom B=[0,1]A1={0}(1/2,1]. The singleton {0} is not a separate atom of this sigma-algebra. On An, An+1 occupies half the measure and 1λ(An)AnMn+1dλ=2n=MnAn; on every shell and on B, both Mn and Mn+1 vanish. For n=0 the same calculation uses total mean one. Thus the event-integral characterization in F2 and the definition in F1 give E[Mn+1Fn]=Mn.

F1F2step 1.1
3.1

The sets An decrease to the empty set, so Mn(x) is eventually zero for every x[0,1] and Mn0 pointwise. But Mn01=1 for every n. Hence the martingale is L1-bounded without L1 convergence. AC is used only as recorded in F4.

F3F4step 1.1step 2.1
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Almost-sure martingale convergence need not preserve expectation

Statement

Assume AC. On ([0,1],B,λ) with F0={,[0,1]} and Fn=σ((0,21],,(0,2n]), take M0=1 and Mn=2n1(0,2n] for n1. This integrable martingale has EMn=1 for every n but almost-sure limit M=0 with expectation zero. Thus almost-sure convergence need not preserve expectations.

Facts & Assumptions

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

[F1]

An L1-bounded martingale need not converge in L1 verifies this process is a nonnegative martingale, computes its means, and proves its pointwise limit.

[F2]

Closed martingale characterization explains the missing uniform-integrability hypothesis.

[F3]

The Axiom of Choice is inherited from the martingale construction.

Counterexample

1.1

By F1, Mn0 almost surely while EMn=1 for every n. Therefore limnEMn=10=E[limnMn]. This is the required explicit failure.

F1
2.1

If (Mn) were uniformly integrable, F2 would force L1 convergence to its almost-sure limit. That would imply EMn0, contradicting the computed value one. Thus the failure is exactly outside the closed/UI regime. AC has only the inherited role in F3.

F2F3step 1.1
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

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
ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-14Open item page →

Azuma bound for simple random walk

Statement

Assume AC. For a simple symmetric random walk Sn with S0=0 and independent increments taking values 1 and 1, P(Snt)2et2/(2n) for every integer n1 and every t>0.

Facts & Assumptions

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

[F1]

Conditioning a known variable and an independent variable verifies the martingale property from independent centered increments.

[F2]

Symmetric bounded-increment Azuma bound supplies the two-sided concentration estimate.

[F3]

The Axiom of Choice is inherited from conditional expectation and Azuma.

Proof

1.1

Let ξk=SkSk1{1,1} and use the natural filtration. Symmetry gives Eξk=0, and independence from the past plus F1 yields E[SkFk1]=Sk1. Thus S is a martingale and SkSk1=1.

F1
2.1

For the stated n1, apply F2 with ck=1. Since k=1nck2=n>0, it gives exactly 2et2/(2n). At t=xn the exponent is x2/2; the prefactor and lack of lattice correction show this is a robust bound, not the exact binomial tail. AC is used only through F3.

F2F3step 1.1

5 · Examples, counterexamples and false statements

None yet.

Sources