Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

Martingales and martingale differences correspond

Statement

Assume AC. If M is a martingale, then Dn=MnMn1, n1, is a martingale difference sequence. Conversely, given a martingale difference sequence D and any integrable F0-measurable real M0, the process Mn=M0+k=1nDk is a martingale. For fixed M0 these constructions are inverse.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

Conditional expectation is linear, order preserving and expectation preserving. Basic algebra and order properties of conditional expectation.

[F2]

An integrable variable measurable for the conditioning sigma-algebra conditions to itself. Conditioning a known variable and an independent variable.

[F3]

Finite linear combinations remain integrable and their integrals are linear. The Lebesgue integral is linear on L1(μ).

[F4]

Finite real sums, differences and products are measurable. Arithmetic and lattice operations preserve measurability whenever they are defined.

[F5]

AC supplies the inherited conditional-expectation existence and any stated choice of versions. The Axiom of Choice.

[F6]

A martingale difference is integrable and has zero conditional mean given the preceding sigma-algebra. Martingale difference sequence.

Proof

technique · direct
1.1

First reconstruct the finite-integral interface used below. Augment every finite disjoint display of a nonnegative simple function by the complement of its displayed sets with coefficient 0. Intersections of two augmented displays partition the whole space, and equality of the functions makes their coefficients agree on every nonempty cell. Finite additivity and 0(+)=0 therefore prove representation independence. Common augmented refinements give monotonicity and additivity term by term; homogeneity is direct when the scalar is zero and termwise when it is positive. Taking suprema over simple minorants gives nonnegative monotonicity, and increasing simple approximations together with the sets {fjcs}, 0<c<1, give monotone convergence. Applying this to sums of increasing simple approximants gives nonnegative additivity. Positive/negative and real/imaginary decompositions now give the finite real and complex L1 linearity used in [F3]. With this replacement for the affected foundation, the event-integral construction and uniqueness proof of the cited conditional-expectation algebra apply. For a martingale M, both Mn and Mn1 are Fn-measurable. Their difference Dn is measurable and integrable, with EDnEMn+EMn1<. By linearity and conditioning the known Mn1, E[DnFn1]=Mn1Mn1=0. This meets the difference definition.

givenF1F2F3F4F6construct
1.2

Conversely every summand Dk for kn is Fn-measurable, as is M0. The finite sum is adapted and integrable by [F3]–[F4]. Its next increment is Dn+1, so E[Mn+1Fn]=E[Mn+Dn+1Fn]=Mn+0=Mn. Thus it is a martingale Martingale submartingale and supermartingale. AC is inherited from the conditional classes; if versions of a class sequence are to be chosen, AC permits those countably many selections.

givenF1F2F3F4F5F6
2.1

The finite identities k=1n(MkMk1)=MnM0 and (M0+k=1nDk)(M0+k=1n1Dk)=Dn prove inverse reconstruction. For n=0 the sum is empty and equals zero, so the initial value is exactly the prescribed M0. For class representatives these finite equalities hold almost surely.

step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

21 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