Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Positive recurrence   ⟺  \iff⟺ stationary distribution

Proved
MarkovMixing.positive_recurrent_iff_stationary

by Shuze Chen · Aug 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

markov-chainsmixing-timesprobability

Let PPP be an irreducible Markov chain on a countable state space VVV (nonnegative entries, rows summing to one as convergent series, every state reaching every other). A state xxx is positive recurrent when its expected return time is finite: with τx+=min⁡{t≥1:Xt=x}\tau^+_x=\min\{t\ge1:X_t=x\}τx+​=min{t≥1:Xt​=x}, the tail-sum formula Ex(τx+)=∑t≥0Px{τx+>t}\mathbb E_x(\tau^+_x)=\sum_{t\ge0}\mathbb P_x\{\tau^+_x>t\}Ex​(τx+​)=∑t≥0​Px​{τx+​>t} converges. A stationary distribution is a nonnegative π\piπ summing to one with ∑xπ(x)P(x,y)=π(y)\sum_x\pi(x)P(x,y)=\pi(y)∑x​π(x)P(x,y)=π(y) for every yyy (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 Z\mathbb ZZ 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 π\piπ from expected visit counts during one excursion from xxx (normalized by Ex(τx+)\mathbb E_x(\tau^+_x)Ex​(τx+​), finite exactly under positive recurrence), and conversely reads finiteness of Ex(τx+)=1/π(x)\mathbb E_x(\tau^+_x)=1/\pi(x)Ex​(τx+​)=1/π(x) off Kac's lemma. Since positive recurrence of one state is thereby equivalent to a state-free condition, it too is a class property.

Preamble
import Definitions.Def_mm_countable
Formal statement
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
Source
D. A. Levin, Y. Peres, E. L. Wilmer, Markov Chains and Mixing Times, AMS 2009, https://documents.epfl.ch/groups/i/ip/ipg/www/2013-2014/Random_Walks/markovmixing.pdf, Section 21.3, Theorem 21.12, p. 280

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me