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.
IID sequences as Markov chains with state-independent kernel
Statement
Assume Choice. If is IID with common law on , then relative to its natural filtration it is a Markov chain with the state-independent kernel
Facts & Assumptions
Given: Choice and the IID sequence in the statement.
IID means that the entire family is mutually independent and every coordinate has the same law. (Identical distribution and IID families)
Sigma-algebras generated by disjoint blocks of an independent family are independent. (Disjoint groups of an independent sigma-algebra family remain independent)
The indicator and bounded-function versions of the Markov property are equivalent. (Bounded-function form of the Markov property)
Verification
For each , is a probability measure; for each [given] , is constant and measurable. Thus is a probability kernel, including and and a one-point state space.
Put . By [F1]--[F2], [F1, F2, F3, step 1.1] is independent of . Hence, for and , Therefore the constant is a version of the indicated conditional probability. By [F3], equivalently for every bounded measurable . This verifies the claim at and all later times. Choice is used only for those conditional-expectation classes.
Depends on
Used by
- Identical one-time marginals do not determine a Markov chain Counterexample
- The Markov property can fail for a larger filtration Counterexample
Dependency tree · two levels
28 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
- Durrett, Probability: Theory and Examples, Section 5.1 (standard reference, not scraped)