Theorem 5.5.11 — the stationary probability is the reciprocal mean return time
ProvedDurrettProbability.stationary_eq_inv_mean_returnLet be irreducible with stationary distribution . Then for every state the mean return time is finite, and
This gives the stationary probability a second meaning, and a purely local one. As a fixed point of the transition matrix, is a global object computed from the whole chain; as a reciprocal mean return time it is determined by the excursions from 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 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 , 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 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.
import Mathlib import Definitions.Def_DurrettProbability_MarkovChain open Filter
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 DurrettProbabilityConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.