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.
Stationary irreducible Markov shift is ergodic
Statement
Assume AC (The Axiom of Choice). Let be an irreducible (Accessibility, communication, and irreducibility) positive-recurrent transition matrix on a nonempty countable state space , let be its invariant probability, and let be the canonical path law on of the -chain with initial law (Invariant initial law makes a Markov chain stationary). Then:
- the invariant probability is unique, so the phrase "the" invariant probability is unambiguous; and
- the left shift preserves and is ergodic for it (Ergodicity relative to an invariant measure): every with satisfies (Strict and mod-null invariant sigma-algebras).
No aperiodicity hypothesis is used anywhere in the proof.
Facts & Assumptions
Given: AC, a nonempty countable , an irreducible positive-recurrent transition matrix on , and the canonical path laws of the chain started at .
Every family of nonempty sets has a choice function; AC is assumed and is used through the chain, statewise Kac, and conditional-expectation suppliers [F3]–[F8], [F11]. (The Axiom of Choice)
A measure-preserving system is ergodic for exactly when every has or . (Ergodicity relative to an invariant measure, Strict and mod-null invariant sigma-algebras)
If is a -chain with invariant initial law , then its canonical path law is invariant under the left shift. (Invariant initial law makes a Markov chain stationary)
Assume AC. For an irreducible countable chain: some state positive recurrent, every state positive recurrent, and existence of an invariant probability are equivalent; if is positive recurrent then is an invariant probability with ; and every invariant probability satisfies and for every . (Positive recurrence and stationary probability for irreducible countable chains)
Assume AC. If is recurrent and , then ; recurrence is a class property. (Recurrence and transience are class properties)
Assume Choice. For bounded product-measurable , the function is measurable and a.s. for every . (Markov property for bounded future path functionals)
Assume Choice. A bounded harmonic function (that is, ) of a countable-state -chain yields the bounded martingale . (Bounded harmonic functions yield Markov-chain martingales)
Assume AC. If is a martingale and are stopping times bounded by a deterministic , then a.s., so in particular . (Optional sampling for bounded stopping times)
Assume AC. If is increasing and , then almost surely and in for every . (Levy upward convergence of conditional expectations)
and is a stopping time because ; hence is a stopping time bounded by , and for all when . (Hitting, return, and visit times)
If is irreducible, then for every there is with . (Accessibility, communication, and irreducibility)
Assume AC. If an irreducible countable transition matrix has invariant probability , then for every , and . (Kac return-time formula for a state)
If measurable functions on a probability space satisfy almost surely and , then dominated convergence applies with the integrable majorant , so . (Dominated convergence)
Proof
Given: AC, an irreducible positive-recurrent on nonempty countable , canonical path laws , and the invariant probability existence from [F3].
Proof technique: first pin down the invariant probability by applying the statewise Kac formula to each invariant law at every state; then for a strictly shift-invariant event use the harmonic function of its hitting probabilities, optional sampling up to the hitting time of a fixed state, and Lévy's upward theorem to force the event to have probability zero or one.
Uniqueness of the invariant probability: [F3] supplies an invariant probability . Let be any invariant probability and fix an arbitrary . Applying [F11] to each of and gives . Since this holds for every , pointwise. Write for this unique invariant probability.
Let be the canonical path law of the chain with initial law ; by [F2] the left shift preserves . Fix a measurable with and define for ; then .
The function is harmonic, : since , the indicator satisfies for every path , so the bounded product-measurable functional obeys with ; applying [F5] with and taking expectations gives for every .
Since is bounded and harmonic, [F6] makes a bounded martingale under every .
Fix and . By [F9] the time is a stopping time bounded by the deterministic , so [F7] applied to the bounded martingale of step 4.1 with and gives .
Positive recurrence makes every state recurrent, and irreducibility [F10] gives , so [F4] gives . Hence almost surely, for all by [F9], and therefore almost surely. The functions are measurable since is measurable by [F5], and bounded by ; applying [F12] under with integrable majorant gives . Step 5.1 identifies these expectations with the constant . Thus , and since were arbitrary, for a single constant .
Under , [F5] gives almost surely for every . The natural filtration satisfies the product sigma-algebra on , which contains , so [F8] gives -almost surely; as an indicator takes only the values almost surely, and .
Every measurable with therefore has , and [F1] says exactly that is ergodic for ; preserves by step 2.1 and is the unique invariant probability by step 1.1, so the corollary holds and no aperiodicity hypothesis was used.
Boundary and axiom cases: if is a singleton the chain is trivially irreducible and positive recurrent, is the point mass at the constant path, and every shift-invariant event has measure or , consistent with steps 7.1–5.1; and give and ; the uniqueness claim and the ergodicity claim are both proved, so the two parts of the statement are not riding on an unproved equivalence; the argument uses the strictly invariant sigma-algebra exactly as in [F1] and never replaces it by the mod-null version; and AC [A1] enters through the chain-law, statewise Kac, and conditional-expectation suppliers [F3]–[F8], [F11], whose statements assume Choice, not through irreducibility itself.
Depends on
- The Axiom of Choice
- Accessibility, communication, and irreducibility
- Strict and mod-null invariant sigma-algebras
- Ergodicity relative to an invariant measure
- Hitting, return, and visit times
- Invariant initial law makes a Markov chain stationary
- Positive recurrence and stationary probability for irreducible countable chains
- Kac return-time formula for a state
- Recurrence and transience are class properties
- Markov property for bounded future path functionals
- Bounded harmonic functions yield Markov-chain martingales
- Optional sampling for bounded stopping times
- Levy upward convergence of conditional expectations
- Dominated convergence
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
62 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.6 and §6.2, ergodicity of stationary irreducible chains (standard reference, not scraped)
- Levin–Peres–Wilmer, Markov Chains and Mixing Times, second edition, §21.3 and Appendix C.1 (standard reference, not scraped)