Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.12 -- submultiplicativity of dˉ\bar ddˉ

Proved
MarkovMixing.distPairs_submultiplicative

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

markov-chainsmixing-timesprobability

Let PPP be any stochastic matrix on a finite state space VVV (nonnegative entries, rows summing to one), write Pt(x,⋅)P^t(x,\cdot)Pt(x,⋅) for the row of the ttt-th matrix power — the distribution at time ttt of the chain started at xxx — and let

dˉ(t)=max⁡x,y∈V∥Pt(x,⋅)−Pt(y,⋅)∥TV,∥μ−ν∥TV=max⁡A⊆V∣μ(A)−ν(A)∣,\bar d(t)=\max_{x,y\in V}\bigl\|P^t(x,\cdot)-P^t(y,\cdot)\bigr\|_{TV},\qquad \|\mu-\nu\|_{TV}=\max_{A\subseteq V}|\mu(A)-\nu(A)|,dˉ(t)=x,y∈Vmax​​Pt(x,⋅)−Pt(y,⋅)​TV​,∥μ−ν∥TV​=A⊆Vmax​∣μ(A)−ν(A)∣,

be the worst pairwise total variation distance between two copies of the chain at time ttt.

The theorem (Lemma 4.12 of Levin–Peres–Wilmer) asserts that dˉ\bar ddˉ is submultiplicative:

dˉ(s+t)  ≤  dˉ(s)⋅dˉ(t)for all s,t∈N.\bar d(s+t)\;\le\;\bar d(s)\cdot\bar d(t)\qquad\text{for all }s,t\in\mathbb N.dˉ(s+t)≤dˉ(s)⋅dˉ(t)for all s,t∈N.

No irreducibility or aperiodicity is needed. Combined with the comparison d≤dˉ≤2dd\le\bar d\le 2dd≤dˉ≤2d to the distance to stationarity, submultiplicativity is what makes distances decay geometrically past the mixing time, and hence what makes the mixing time a meaningful single parameter of a chain.

Preamble
import Definitions.Def_mm_mixing
Formal statement
namespace MarkovMixing

/-- **Lemma 4.12** (LPW): `d̄` is submultiplicative:
`d̄(s + t) ≤ d̄(s) · d̄(t)`. -/
theorem distPairs_submultiplicative {V : Type*} [Fintype V] [DecidableEq V]
    [Nonempty V] (P : Matrix V V ℝ) (hP : IsStochastic P) (s t : ℕ) :
    distPairs P (s + t) ≤ distPairs P s * distPairs 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.12, p. 54

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