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

Reverse martingale convergence

Statement

Assume AC. If (Xn,Gn) is a reverse martingale, then XnE[X0G] almost surely and in L1.

Facts & Assumptions

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

[F1]

Reverse filtration and reverse martingale gives Xn=E[X0Gn].

[F2]
[F3]

Doob upcrossing inequality bounds crossings of each finite reversed martingale segment.

[F6]

The Axiom of Choice has exactly the inherited conditional-expectation/version use in F1, F2, F3, F4, F5.

Proof

1.1

Fix N. Read XN,XN1,,X0 in that order with filtration GNG0; F1 makes this a finite ordinary martingale. An upcrossing of X0,,XN becomes a downcrossing of the reversed list, hence an upcrossing of its negative through [b,a]. F3 bounds its expectation by endpoint positive parts, uniformly in N, because F2 gives uniform L1 bounds. The same argument directly bounds downcrossings.

F1F2F3
2.1

For every rational a<b, the total upcrossing and downcrossing counts are finite almost surely. Intersecting these countably many full-measure events, the usual rational-interval argument gives a finite or extended-real limit. Uniform integrability bounds the positive and negative tails uniformly, so Fatou excludes both infinite values. Denote the finite almost-sure limit by X.

F2F3step 1.1
3.1

The almost-sure convergence from step 2.1 gives convergence in probability by F4. Using the uniformly integrable family from F2, F4 then upgrades it to XnX in L1.

F2F4step 2.1
4.1

Fix r. For all nr, Xn is Gn-measurable and GnGr, so F5 makes X measurable for Gr. This holds for every r, hence X is G-measurable. If AG, then AGn for every n and F1 gives AXndP=AX0dP. The L1 limit passes through the left integral, so F5 identifies X=E[X0G]. AC is used exactly as recorded in F6.

F1F5F6step 3.1

Depends on

Used by

Dependency tree · two levels

34 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