Positive recurrence stationary distribution
ProvedMarkovMixing.positive_recurrent_iff_stationaryLet be an irreducible Markov chain on a countable state space (nonnegative entries, rows summing to one as convergent series, every state reaching every other). A state is positive recurrent when its expected return time is finite: with , the tail-sum formula converges. A stationary distribution is a nonnegative summing to one with for every (all as convergent series).
The theorem (Theorem 21.12 of Levin–Peres–Wilmer) asserts: a state is positive recurrent if and only if the chain admits a stationary distribution.
On infinite state spaces, existence of a stationary distribution — automatic in the finite theory of Mission I — becomes a genuine dichotomy: simple random walk on is recurrent but has infinite expected return times and no stationary distribution, while a positively drifting queue may fail even to be recurrent. The proof constructs from expected visit counts during one excursion from (normalized by , finite exactly under positive recurrence), and conversely reads finiteness of off Kac's lemma. Since positive recurrence of one state is thereby equivalent to a state-free condition, it too is a class property.
import Definitions.Def_mm_countable
namespace MarkovMixing
/-- **Theorem 21.12** (LPW): an irreducible chain on a countable state space
is positive recurrent if and only if it has a stationary (probability)
distribution. -/
theorem positive_recurrent_iff_stationary {V : Type*} [Countable V]
[DecidableEq V] (P : V → V → ℝ) (hP : IsStochasticC P)
(hirr : IrreducibleC P) (x : V) :
PositiveRecurrent P x ↔ ∃ π : V → ℝ, IsStationaryC P π := by
sorry
end MarkovMixing