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.
Positive recurrence and stationary probability for irreducible countable chains
Statement
Assume AC (The Axiom of Choice). Let be an irreducible transition matrix on a nonempty countable state space (Accessibility, communication, and irreducibility), and for let be the return-cycle occupation measure of Return-cycle occupation measure and minimality. Then the following three statements are equivalent:
- some state is positive recurrent;
- every state is positive recurrent (Positive and null recurrence of a state);
- there is an invariant probability for (Invariant and stationary distribution for a Markov kernel).
Moreover, if is positive recurrent then is finite, the measure is an invariant probability, and . Conversely, if is an invariant probability, then and for every .
Facts & Assumptions
Given: AC, a nonempty countable state space , an irreducible transition matrix on , and a state .
Every family of nonempty sets has a choice function; AC is assumed and is used through the chain-law and occupation-measure supplier [F4]. (The Axiom of Choice)
means for some , with , and is irreducible when every pair of states communicates; in particular for all there is with . (Accessibility, communication, and irreducibility)
for all and . (Matrix Chapman–Kolmogorov equations)
A recurrent state is positive recurrent when ; a finite mean forces . (Positive and null recurrence of a state)
Assume AC. For a countable -chain started at : ; ; for every ; is pointwise minimal among nonnegative solutions of , ; and if is recurrent then . (Return-cycle occupation measure and minimality)
On a countable state space a probability vector is invariant exactly when for every . (Invariant and stationary distribution for a Markov kernel)
For every double sequence in , the two iterated sums and the supremum of the finite partial sums coincide, so the order of summation of nonnegative terms may be exchanged even when the common value is . (Tonelli's theorem for double series of nonnegative extended real numbers)
Proof
Given: AC, a nonempty countable state space , an irreducible transition matrix on , a state , and the return-cycle occupation measure of [F4].
Proof technique: from an invariant probability build the normalized candidate , use the pointwise minimality of the return-cycle measure to bound the expected return time, and reverse the implication by normalizing in the positive-recurrent case.
For every one has whenever is an invariant probability, where : the case is , and if , then for every , using [F2] with , and the interchange of the two nonnegative series in [F6].
Conversely, assume some state is positive recurrent. Then and ; by [F4] the measure satisfies , and with ; hence defines a probability vector with , i.e. an invariant probability by [F5].
Assume there is an invariant probability . Then for every : by [F1] irreducibility gives with for an arbitrary fixed , and step 1.1 gives , so if then for every , contradicting .
With invariant, define for ; this is well defined and finite by step 2.1, , , and for the invariance identity [F5] gives .
The pointwise minimality of [F4] applied to yields for every ; summing and using from [F4] gives , so is recurrent with finite expected return time, i.e. positive recurrent by [F3]. Since was arbitrary, every state is positive recurrent.
The three statements are equivalent: every state positive recurrent implies some state positive recurrent because ; some state positive recurrent implies the existence of an invariant probability by step 1.2; and the existence of an invariant probability implies every state positive recurrent by steps 2.1–4.1. In the construction of step 1.2, and , which are the two displayed formulas of the statement, while the bound for an invariant is step 4.1.
Boundary and axiom cases: if is a singleton then , every state is positive recurrent with , and is the invariant probability, consistent with all three clauses; no state is transient here, so the alternatives of [F3] are exhaustive; the equivalence is proved in both directions through steps 4.1 and 1.2, not assumed; the arguments never subtract infinite quantities, since all sums of occupation masses are nonnegative and are shown finite only after the minimality bound; and AC [A1] is used exactly through [F4], the published chain-law and return-cycle supplier, whose statement assumes AC, while the remaining steps are nonnegative matrix algebra.
Depends on
- The Axiom of Choice
- Invariant and stationary distribution for a Markov kernel
- Positive and null recurrence of a state
- Return-cycle occupation measure and minimality
- Accessibility, communication, and irreducibility
- Matrix Chapman–Kolmogorov equations
- Tonelli's theorem for double series of nonnegative extended real numbers
Used by
- Stationary irreducible Markov shift is ergodic Corollary
- Uniqueness of the stationary law for an irreducible positive-recurrent chain Corollary
- A null recurrent chain has no stationary probability Counterexample
- A periodic chain has Cesaro but not ordinary convergence Example
- Stationary law of a two-state chain Example
- Convergence to stationarity for irreducible aperiodic positive-recurrent chains Theorem
- Kac return-time formula for a positive-mass set Theorem
- Kac return-time formula for a state 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–5.6, positive recurrence and stationary distributions (standard reference, not scraped)
- Levin–Peres–Wilmer, Markov Chains and Mixing Times, second edition, §21.3 and Appendix C.1 (standard reference, not scraped)
- Aldous–Chewi, Probability Theory, Lectures 13–15 (standard reference, not scraped)