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

Countable-state martingale-problem characterization

Statement

Assume Choice. Let S be countable, let p be a transition matrix with generator L=PI, and let X be an S-valued process adapted to (Fn). Then X is a p-chain if and only if, for every bounded f:SR, Mnf=f(Xn)m=0n1Lf(Xm),n0, is an (Fn)-martingale (the empty sum at n=0 is zero).

Facts & Assumptions

Given: Choice, countable S, p, L, and the adapted S-valued process X.

[F1]

For bounded f, Lf=Pff and Lf2f. (Discrete generator of a countable-state transition matrix)

[F2]

The p-chain property is equivalent to E[f(Xn+1)Fn]=Pf(Xn) for every bounded f. (Bounded-function form of the Markov property)

[F3]

An integrable adapted process is a martingale exactly when E[Mn+1Fn]=Mn for every n. (Martingale submartingale and supermartingale)

Proof

1.1

Suppose X is a p-chain. By [F1], [F1, F2, F3] Mnf(1+2n)f, so Mf is integrable; it is adapted because X is. Its increment is Mn+1fMnf=f(Xn+1)f(Xn)Lf(Xn)=f(Xn+1)Pf(Xn). By [F2] this increment has conditional mean zero given Fn. Therefore [F3] makes Mf a martingale. This includes n=0 and constant f=0,1, for which the compensator vanishes.

F1F2F3
2.1

Conversely, suppose every Mf is a martingale. The finite preceding sum [F1, F2, F3] in its definition is Fn-measurable and integrable. Expanding the identity in [F3] and cancelling that sum gives E[f(Xn+1)Fn]=f(Xn)+Lf(Xn)=Pf(Xn). By [F2], X is a p-chain. Equivalently, choosing f=1A for every AS gives the conditional transition probability p(Xn,A)=yAp(Xn,y); A= and A=S give zero and one. This proves both implications. Choice is used precisely for the conditional expectations in [F2]--[F3].

F1F2F3

Depends on

Used by

Dependency tree · two levels

16 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