Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Bounded predictable transforms preserve martingales

Statement

Assume AC. Let M be a martingale and H a finite real predictable process. If HkCk a.s. for each k1, with finite deterministic constants Ck, then HM is a martingale starting at zero. Uniform boundedness is a special case. More generally the same conclusion holds whenever every Hk(MkMk1) is integrable, without a bound on Hk.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

Product integrability makes the transform an adapted integrable finite sum; timewise bounds imply this domain. Discrete martingale transform.

[F2]

A finite measurable factor may be taken out when its product with the integrable input is integrable. Taking out what is known.

[F3]

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

[F4]

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

[F5]

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

[F6]

Conjugate-moment hypotheses on two real variables imply integrability of their product. Holder's inequality for random variables.

Proof

technique · direct
1.1

Put Dk=MkMk1. It is integrable since EDkEMk+EMk1. In the bounded case [F1] gives EHkDkCk(EMk+EMk1)<; in the general case this is assumed. Consequently Z=HM is adapted, integrable, and Z0=0. This is verified before conditioning any product.

givenF1
2.1

For each n0, Hn+1 is finite Fn-measurable and Dn+1,Hn+1Dn+1 are integrable. The unbounded clause of [F2] therefore gives E[Hn+1Dn+1Fn]=Hn+1E[Dn+1Fn]=Hn+1(MnMn)=0. Linearity and known-variable conditioning now give E[Zn+1Fn]=Zn. This proves the martingale assertion Martingale submartingale and supermartingale even for signed H. AC is inherited from the conditional classes in this calculation.

givenF2F3F4F5step 1.1
3.1

If a uniform bound C is supplied, choose Ck=C in step 1.1. Another sufficient domain condition at a fixed k is HkLp and DkLq with conjugate p,q under the clauses of [F6]: then EHkDkHkpDkq<. The proof of step 2.1 only needs the resulting product integrability.

F6step 1.1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

24 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