Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.9 -- the Convergence Theorem

Proved
MarkovMixing.convergence_theorem

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

markov-chainsmixing-timesprobability

Let PPP be the transition matrix of an irreducible and aperiodic Markov chain on a finite state space VVV — irreducible meaning every state can reach every other in some number of steps, aperiodic meaning the return times to a state have greatest common divisor one — and let π\piπ be a stationary distribution for PPP, i.e. ∑xπ(x)P(x,y)=π(y)\sum_x\pi(x)P(x,y)=\pi(y)∑x​π(x)P(x,y)=π(y) for all yyy. Write Pt(x,⋅)P^t(x,\cdot)Pt(x,⋅) for the distribution of the chain at time ttt started at xxx, and ∥μ−ν∥TV=max⁡A⊆V∣μ(A)−ν(A)∣\|\mu-\nu\|_{TV}=\max_{A\subseteq V}|\mu(A)-\nu(A)|∥μ−ν∥TV​=maxA⊆V​∣μ(A)−ν(A)∣ for the total variation distance.

The theorem — the Convergence Theorem (Theorem 4.9 of Levin–Peres–Wilmer), the capstone of Chapter 4 — asserts that the chain converges to π\piπ geometrically fast, uniformly in the starting state: there exist a rate α∈(0,1)\alpha\in(0,1)α∈(0,1) and a constant C>0C>0C>0 such that

max⁡x∈V ∥Pt(x,⋅)−π∥TV  ≤  C αtfor every t∈N.\max_{x\in V}\,\bigl\|P^t(x,\cdot)-\pi\bigr\|_{TV}\;\le\;C\,\alpha^{t}\qquad\text{for every }t\in\mathbb N.x∈Vmax​​Pt(x,⋅)−π​TV​≤Cαtfor every t∈N.

In particular the stationary distribution of an irreducible aperiodic chain is unique and is reached from every starting point, with an error decaying exponentially in time — the statement that gives the mixing time its meaning, and the result all later chapters quantify.

Preamble
import Definitions.Def_mm_mixing
Formal statement
namespace MarkovMixing

/-- **Theorem 4.9, the Convergence Theorem** (LPW), the capstone of
Chapter 4: an irreducible, aperiodic finite chain converges to its stationary
distribution geometrically fast in total variation:
`max_x ‖P^t(x,·) − π‖_TV ≤ C αᵗ` for some `α ∈ (0,1)` and `C > 0`. -/
theorem convergence_theorem {V : Type*} [Fintype V] [DecidableEq V] [Nonempty V]
    (P : Matrix V V ℝ) (hP : IsStochastic P) (hirr : Irreducible P)
    (hap : Aperiodic P) (π : V → ℝ) (hπ : IsStationary P π) :
    ∃ α : ℝ, α ∈ Set.Ioo (0 : ℝ) 1 ∧ ∃ C : ℝ, 0 < C ∧
      ∀ t : ℕ, distStationary P π t ≤ C * α ^ t := 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 4.3, Theorem 4.9, p. 52

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me