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 initial law makes a Markov chain stationary
Statement
Assume AC (The Axiom of Choice). Let be a probability kernel on a measurable space , let be an invariant probability for (Invariant and stationary distribution for a Markov kernel), and let be a -chain with initial law (Initial distribution of a Markov chain). Then every finite-dimensional law of is invariant under every nonnegative integer time shift: for every , every and every ,
Equivalently, the canonical path law on is invariant under the left shift .
Facts & Assumptions
Given: AC, a probability kernel on , an invariant probability for , and a -chain with initial law .
Every family of nonempty sets has a choice function; AC is assumed and is used exactly through the finite-dimensional-law supplier [F3] below. (The Axiom of Choice)
is invariant for when for every , so as measures. (Invariant and stationary distribution for a Markov kernel)
The initial law of is , that is, for all . (Initial distribution of a Markov chain)
Assume Choice. For a -chain with initial law , times and bounded measurable real , , the factor being evaluation at ; taking indicators gives the joint probability of the cylinder . (Finite-dimensional laws of a Markov chain)
is the identity kernel and in chronological composition; each is a probability kernel and products of copies of are unambiguous by associativity. (Iterated transition kernels)
If a lambda-system on contains a pi-system , then ; in particular two probability measures that agree on a pi-system generating the whole sigma-algebra agree on that sigma-algebra. (Dynkin's pi-lambda theorem)
The law of the process is the pushforward of under the coordinate map, a probability measure on the product space with its product sigma-algebra; its finite-dimensional distributions are the pushforward laws of the tuples . (Stochastic processes and their finite-dimensional distributions)
Proof
Given: AC, a probability kernel on , an invariant probability with , and a -chain with initial law .
Proof technique: first show by induction, then compare the iterated-integral formulas for shifted and unshifted cylinder probabilities, and extend cylinder invariance to the product sigma-algebra by Dynkin's theorem.
For every one has as probability measures: for this is , and if then associativity of iterated kernel composition gives by [F1].
For fixed the family is a lambda-system: it contains , and together with for pairwise disjoint families give closure under complements and disjoint countable unions by additivity of the probability measure of [F6].
Fix , times and bounded measurable . [F3] applied to the shifted tuple , whose successive gaps are again , expresses as , while [F3] applied to gives the same expression with in place of ; associativity [F4] gives , so step 1.1 gives , the two outermost integrals over coincide, and all remaining factors are identical.
Taking in step 2.1 shows for all measurable ; measurable rectangles form a pi-system generating , and by [F5] two probability measures agreeing on it agree on the whole product sigma-algebra, so , which is the asserted shift invariance of every finite-dimensional law.
Let be the canonical path law on [F6], and fix ; for the cylinder one has , so step 3.1 gives .
By step 4.1 the family contains every finite-dimensional cylinder, and cylinders form a pi-system generating , so [F5] gives ; hence for every measurable , and for the left shift preserves the canonical path law.
Boundary and axiom cases: if is a singleton the canonical path law is the point mass at the constant path and every shift preserves it; if and the identities in steps 2.1–3.1 are trivial; the equivalence between the finite-dimensional and canonical formulations is proved in both directions, steps 1.1–3.1 giving the finite-dimensional statement and steps 4.1–5.1 the path-space statement; and AC [A1] enters exactly through the finite-dimensional-law supplier [F3], whose statement itself assumes Choice, while the induction, the rectangle comparison and the lambda-system computation are ordinary measure-theoretic algebra.
Depends on
Used by
Dependency tree · two levels
25 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–5.6 and §6.2, stationary chains (standard reference, not scraped)