Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.11 -- comparing d(t)d(t)d(t) and dˉ(t)\bar d(t)dˉ(t)

Proved
MarkovMixing.dist_le_distPairs

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

markov-chainsmixing-timesprobability

Let PPP be the transition matrix of a Markov chain on a finite state space VVV with stationary distribution π\piπ (that is, ∑xπ(x)P(x,y)=π(y)\sum_x\pi(x)P(x,y)=\pi(y)∑x​π(x)P(x,y)=π(y) for all yyy), and 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. Chapter 4 of Levin–Peres–Wilmer measures convergence by two quantities: the worst-case distance to stationarity and the worst pairwise distance,

d(t)=max⁡x∈V∥Pt(x,⋅)−π∥TV,dˉ(t)=max⁡x,y∈V∥Pt(x,⋅)−Pt(y,⋅)∥TV.d(t)=\max_{x\in V}\bigl\|P^t(x,\cdot)-\pi\bigr\|_{TV},\qquad \bar d(t)=\max_{x,y\in V}\bigl\|P^t(x,\cdot)-P^t(y,\cdot)\bigr\|_{TV}.d(t)=x∈Vmax​​Pt(x,⋅)−π​TV​,dˉ(t)=x,y∈Vmax​​Pt(x,⋅)−Pt(y,⋅)​TV​.

The theorem (Lemma 4.11) asserts that for every time ttt these are equivalent up to a factor of two:

d(t)  ≤  dˉ(t)  ≤  2 d(t).d(t)\;\le\;\bar d(t)\;\le\;2\,d(t).d(t)≤dˉ(t)≤2d(t).

The left inequality holds because π\piπ is an average of the rows Pt(y,⋅)P^t(y,\cdot)Pt(y,⋅); the right is the triangle inequality through π\piπ. The point of dˉ\bar ddˉ is that, unlike ddd, it is submultiplicative — the subject of the companion lemma.

Preamble
import Definitions.Def_mm_mixing
Formal statement
namespace MarkovMixing

/-- **Lemma 4.11** (LPW): `d(t) ≤ d̄(t) ≤ 2 d(t)`. -/
theorem dist_le_distPairs {V : Type*} [Fintype V] [DecidableEq V] [Nonempty V]
    (P : Matrix V V ℝ) (hP : IsStochastic P)
    (π : V → ℝ) (hπ : IsStationary P π) (t : ℕ) :
    distStationary P π t ≤ distPairs P t ∧
    distPairs P t ≤ 2 * distStationary P π 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.4, Lemma 4.11, p. 53

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