Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 5.5.10 — the support of a stationary distribution is recurrent

Proved
DurrettProbability.stationary_support_recurrent

by naimengye · Sep 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

markov-chainprobability

If ppp has a stationary distribution π\piπ, then every state yyy with π(y)>0\pi(y)>0π(y)>0 is recurrent.

The contrast Durrett draws just before this result is the point of it. Stationary measures exist for transient chains — counting measure is stationary for simple random walk on Zd\mathbb{Z}^dZd in every dimension, including the transient ones d≥3d\ge3d≥3. What rules out transience is not stationarity but normalizability: a stationary measure with finite total mass cannot be supported on transient states.

The proof is a computation with the renewal identity. Stationarity gives π(y)=∑xπ(x)pn(x,y)\pi(y)=\sum_x\pi(x)p^n(x,y)π(y)=∑x​π(x)pn(x,y) for every nnn, so summing over nnn and using that ∑npn(x,y)\sum_n p^n(x,y)∑n​pn(x,y) is finite at a transient yyy forces π(y)\pi(y)π(y) to be zero.

Formalization Note The hypothesis is a stationary distribution, a probability vector, not a stationary measure; that is where the finiteness that drives the argument comes from. Only π(y)>0\pi(y)>0π(y)>0 is assumed at the state in question — nothing about the rest of the support.

Preamble
import Mathlib
import Definitions.Def_DurrettProbability_MarkovChain

open Filter
Formal statement
namespace DurrettProbability

theorem stationary_support_recurrent {S : Type*} [Countable S] [DecidableEq S]
    (p : S → S → ℝ) (hp : IsTransition p) (π : S → ℝ) (hπ : StationaryDist p π)
    (y : S) (hy : 0 < π y) : Recurrent p y := by sorry

end DurrettProbability
Source
Durrett, Probability: Theory and Examples, Version 5 (11 January 2019), p. 305 (PDF p. 313), Theorem 5.5.10: 'If there is a stationary distribution then all states y that have pi(y) > 0 are recurrent.' Durrett precedes it with the remark that stationary measures can exist for transient chains, e.g., random walks in d >= 3. sha256 aeac36cbf5e44c53d69fa60a2d29a393e2d0e8c955ee103bd845d925fd910886
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 2026

    Confirmed by the mission captain (proposal self-audit).

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