Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 5.5.11 — the stationary probability is the reciprocal mean return time

Proved
DurrettProbability.stationary_eq_inv_mean_return

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

markov-chainprobabilitystochastic-systems

Let ppp be irreducible with stationary distribution π\piπ. Then for every state xxx the mean return time ExTx=∑n≥1n fn(x,x)\mathbb{E}_xT_x=\sum_{n\ge1}n\,f^n(x,x)Ex​Tx​=∑n≥1​nfn(x,x) is finite, and

π(x)⋅ExTx=1,that isπ(x)=1ExTx.\pi(x)\cdot\mathbb{E}_xT_x=1,\qquad\text{that is}\qquad \pi(x)=\frac{1}{\mathbb{E}_xT_x}.π(x)⋅Ex​Tx​=1,that isπ(x)=Ex​Tx​1​.

This gives the stationary probability a second meaning, and a purely local one. As a fixed point of the transition matrix, π(x)\pi(x)π(x) is a global object computed from the whole chain; as a reciprocal mean return time it is determined by the excursions from xxx alone. Durrett's own remark — that the identity "seems incredible" — is a fair reaction, and the reason it holds is that the chain spends, on average, one visit per excursion, so the long-run fraction of time at xxx is one over the mean excursion length.

The identity is the engine of renewal-reward arguments throughout applied probability: it converts a stationary probability, which is often hard to compute, into an expected return time, which is often easy, and conversely.

Formalization Note Finiteness of the mean return time is asserted explicitly, as summability of n fn(x,x)n\,f^n(x,x)nfn(x,x), rather than left to a division convention: the mean return time is an unconditional sum, which would silently be zero for a divergent series, and 1/01/01/0 would then read as the correct value for the wrong reason. The identity itself is stated as a product equal to one for the same reason. Irreducibility and the existence of a stationary distribution together force positive recurrence, which is what makes both halves true.

Preamble
import Mathlib
import Definitions.Def_DurrettProbability_MarkovChain

open Filter
Formal statement
namespace DurrettProbability

theorem stationary_eq_inv_mean_return {S : Type*} [Countable S] [DecidableEq S]
    (p : S → S → ℝ) (hp : IsTransition p) (hirr : Irreducible p)
    (π : S → ℝ) (hπ : StationaryDist p π) (x : S) :
    Summable (fun n : ℕ => ((n : ℝ) + 1) * firstPassage p (n + 1) x x)
      ∧ π x * meanReturnTime p x = 1 := by sorry

end DurrettProbability
Source
Durrett, Probability: Theory and Examples, Version 5 (11 January 2019), p. 306 (PDF p. 314), Theorem 5.5.11: 'If p is irreducible and has stationary distribution pi, then pi(x) = 1/E_x T_x.' Remark: 'we note that the proof will make pi(x) = 1/E_x T_x obvious, but it seems incredible.' 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