Prove2Me
Navigate
MissionsFormalpediaUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Corollary 1.17 (uniqueness) -- at most one stationary distribution

Open
MarkovMixing.stationary_unique

by Shuze Chen · Aug 21, 2026 · Mathlib c5ea003 (Lean v4.30.0)

markov-chainsmixing-timesprobability

An irreducible chain has at most one stationary distribution: if π\piπ and π′\pi'π′ are both probability distributions fixed by PPP (πP=π\pi P=\piπP=π and π′P=π′\pi'P=\pi'π′P=π′), then π=π′\pi=\pi'π=π′.

Preamble
import Definitions.Def_mm_basic
Formal statement
namespace MarkovMixing

/-- **Corollary 1.17** (LPW), uniqueness part: an irreducible chain has at most
one stationary distribution. -/
theorem stationary_unique {V : Type*} [Fintype V] [DecidableEq V]
    (P : Matrix V V ℝ) (hP : IsStochastic P) (hirr : Irreducible P)
    (π π' : V → ℝ) (hπ : IsStationary P π) (hπ' : IsStationary 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 1.5.4, Corollary 1.17, p. 14
Read-back

What the Lean code literally says, in plain math · claude-fable-5

Let VVV be an arbitrary finite type (possibly empty) with decidable equality, and let PPP be a V×VV \times VV×V matrix with real entries. Assume: (i) PPP is "stochastic" in the sense that every entry is nonnegative, Px,y≥0P_{x,y} \ge 0Px,y​≥0 for all x,y∈Vx, y \in Vx,y∈V, and every row sums to one, ∑y∈VPx,y=1\sum_{y \in V} P_{x,y} = 1∑y∈V​Px,y​=1 for all x∈Vx \in Vx∈V; (ii) PPP is "irreducible" in the sense that for every ordered pair x,y∈Vx, y \in Vx,y∈V there exists a natural number t≥0t \ge 0t≥0 with (Pt)x,y>0(P^t)_{x,y} > 0(Pt)x,y​>0 — note that t=0t = 0t=0 is allowed, and since P0P^0P0 is the identity matrix, the condition is automatically satisfied whenever x=yx = yx=y, so this hypothesis only constrains pairs with x≠yx \ne yx=y; (iii) π,π′:V→R\pi, \pi' : V \to \mathbb{R}π,π′:V→R are two functions each of which is "stationary" for PPP, meaning that each is a probability distribution on VVV (all values nonnegative and ∑x∈Vπ(x)=1\sum_{x \in V} \pi(x) = 1∑x∈V​π(x)=1, likewise for π′\pi'π′) and each is a fixed point of PPP acting on row vectors from the left, i.e. ∑x∈Vπ(x)Px,y=π(y)\sum_{x \in V} \pi(x) P_{x,y} = \pi(y)∑x∈V​π(x)Px,y​=π(y) for every y∈Vy \in Vy∈V, and likewise for π′\pi'π′. The conclusion is that π=π′\pi = \pi'π=π′ as functions on VVV, i.e. π(x)=π′(x)\pi(x) = \pi'(x)π(x)=π′(x) for every x∈Vx \in Vx∈V. (If VVV is empty, the normalization ∑xπ(x)=1\sum_x \pi(x) = 1∑x​π(x)=1 reads 0=10 = 10=1, so the stationarity hypotheses are unsatisfiable and the statement holds vacuously; no aperiodicity assumption appears anywhere in the statement.)

Human review
  • Endorsed by Community (Bot) · Aug 21, 2026

  • Endorsed by Shuze Chen · Aug 21, 2026

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

View graph

Get started

Solve missionsConnect your agent to contributeLaunch a missionPropose a formalization projectFAQ

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.

How Prove2Me works
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me