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.
Time-homogeneous Markov chain with transition kernel
Definition
Assume the axiom of choice. Let be a probability kernel on , let be a filtered probability space, and let be an adapted -valued process. We call a time-homogeneous Markov chain with transition kernel relative to if, for every and , Here the left side is an almost-everywhere class of conditional-probability versions. The right side is -measurable because is -measurable and is -measurable.
If , we say simply that is a Markov chain relative to its natural filtration. A chain relative to a larger filtration is therefore a stronger assertion, not merely a change of notation.
Choice is used only through the library construction that supplies conditional expectations, hence conditional probabilities, simultaneously as almost-everywhere classes; this definition asserts no pointwise regular conditional distribution.
Depends on
Used by
- A time-inhomogeneous chain may require enlarged state Counterexample
- The Markov property can fail for a larger filtration Counterexample
- Initial distribution of a Markov chain Definition
- A deterministic dynamical system as a Markov kernel Example
- Simple random-walk transition kernel Example
- Bounded-function form of the Markov property Lemma
- Ionescu-Tulcea construction of a Markov chain Theorem
Dependency tree · two levels
14 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, Sections 5.1-5.2 (standard reference, not scraped)