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 be countable, let be a transition matrix with generator , and let be an -valued process adapted to . Then is a -chain if and only if, for every bounded , is an -martingale (the empty sum at is zero).
Facts & Assumptions
Given: Choice, countable , , , and the adapted -valued process .
For bounded , and . (Discrete generator of a countable-state transition matrix)
The -chain property is equivalent to for every bounded . (Bounded-function form of the Markov property)
An integrable adapted process is a martingale exactly when for every . (Martingale submartingale and supermartingale)
Proof
Suppose is a -chain. By [F1], [F1, F2, F3] so is integrable; it is adapted because is. Its increment is By [F2] this increment has conditional mean zero given . Therefore [F3] makes a martingale. This includes and constant , for which the compensator vanishes.
Conversely, suppose every is a martingale. The finite preceding sum [F1, F2, F3] in its definition is -measurable and integrable. Expanding the identity in [F3] and cancelling that sum gives By [F2], is a -chain. Equivalently, choosing for every gives the conditional transition probability ; and give zero and one. This proves both implications. Choice is used precisely for the conditional expectations in [F2]--[F3].
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
- Roch, Markov Chains: Martingale Methods, Theorem 24.2 (standard reference, not scraped)