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.
Invariant and stationary distribution for a Markov kernel
Definition
Let be a probability kernel on a measurable space (Measure kernel and probability kernel), and let be a probability measure on (Probability measures and probability spaces). The probability measure is invariant for , and is a stationary distribution of , when
The set function is again a probability measure: for fixed the map is measurable and lies in , so the integral exists in ; for pairwise disjoint the identity of the measure and the monotone convergence theorem for nonnegative functions (Monotone convergence for the integral) give -additivity of ; and for every gives . Thus is an identity between two probability measures evaluated at .
A -chain whose initial law is is called stationary when . Stationarity of the process is a statement about all of its finite-dimensional laws and is proved, not assumed, from ; see Invariant initial law makes a Markov chain stationary.
On a countable state space with sigma-algebra and transition matrix (Transition matrices and n-step probabilities), a measure on is its weighted sum of Dirac masses at singletons (Every measure on a countable discrete space is its weighted sum of Dirac measures), so invariance is equivalent to the matrix identity
The definition fixes no irreducibility, aperiodicity or uniqueness hypothesis, and it selects no conditional-expectation versions; the display defines a single measure and asserts an identity for it. A transient, periodic or reducible chain may have several invariant probability measures or none.
Depends on
Used by
- A null recurrent chain has no stationary probability Counterexample
- A stationary chain need not be ergodic Counterexample
- An invariant law need not be reversible Counterexample
- Positive recurrence without aperiodicity does not imply total-variation convergence Counterexample
- A periodic chain has Cesaro but not ordinary convergence Example
- Stationary law of a two-state chain Example
- Uniform law for a finite doubly stochastic matrix Example
- Detailed balance implies invariance Lemma
- Every transition matrix on a nonempty finite state space has a stationary distribution Theorem
- Invariant initial law makes a Markov chain stationary Theorem
- Kac return-time formula for a positive-mass set Theorem
- Kac return-time formula for a state Theorem
- Positive recurrence and stationary probability for irreducible countable chains Theorem
- Time reversal of a stationary Markov chain Theorem
Dependency tree · two levels
22 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, fifth edition, §5.5 (standard reference, not scraped)
- Levin, Peres and Wilmer, Markov Chains and Mixing Times, second edition, §21.3 and Appendix C.1 (standard reference, not scraped)