Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3, (1.9), pp. 41–42 — 4‖Pⁿ(x,·) − π‖²_Var ≤ ((1 − π(x))/π(x)) β_*^{2n} for reversible chains

Proved
DiaconisStroock.VarDist.proposition_3

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

eigenvaluemarkov-chainmixing-timep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reversibilitytotal-variation

Let XXX be a finite set with m=∣X∣m = |X|m=∣X∣ elements and P(x,y)P(x,y)P(x,y) the transition matrix of an irreducible Markov chain on XXX, reversible with respect to its stationary probability distribution π\piπ:

π(x)P(x,y)=π(y)P(y,x)(x,y∈X).\pi(x)P(x,y) = \pi(y)P(y,x) \qquad (x,y\in X).π(x)P(x,y)=π(y)P(y,x)(x,y∈X).

The eigenvalues of PPP are real, 1=β0>β1≥⋯≥βm−1≥−11 = \beta_0 > \beta_1 \ge \dots \ge \beta_{m-1} \ge -11=β0​>β1​≥⋯≥βm−1​≥−1; put β∗=max⁡(β1,∣βm−1∣)\beta_* = \max(\beta_1, |\beta_{m-1}|)β∗​=max(β1​,∣βm−1​∣). The variation distance between probability distributions μ,π\mu,\piμ,π on XXX is ∥μ−π∥Var=max⁡A⊂X∣μ(A)−π(A)∣\|\mu-\pi\|_{\mathrm{Var}} = \max_{A\subset X}|\mu(A)-\pi(A)|∥μ−π∥Var​=maxA⊂X​∣μ(A)−π(A)∣.

Proposition 3, (1.9). For every starting state x∈Xx\in Xx∈X and every n∈Nn \in \mathbb Nn∈N,

4 ∥Pn(x,⋅)−π∥Var2  ≤  1−π(x)π(x) β∗2n.4\,\|P^n(x,\cdot)-\pi\|_{\mathrm{Var}}^2 \;\le\; \frac{1-\pi(x)}{\pi(x)}\,\beta_*^{2n}.4∥Pn(x,⋅)−π∥Var2​≤π(x)1−π(x)​β∗2n​.

This is the basic eigenvalue bound on the distance to stationarity of a reversible chain: once β∗\beta_*β∗​ is bounded away from 111 (for instance by the geometric bounds of Propositions 1 and 2 of the same paper), it gives an explicit number of steps after which the chain started at xxx is close to π\piπ in variation distance.

Formalization Note The chain is a real matrix P with IsStochastic P, MarkovMixing.Irreducible P, a stationary probability vector π (IsStationary P π) and detailed balance DetailedBalance P π. ∥Pn(x,⋅)−π∥Var\|P^n(x,\cdot)-\pi\|_{\mathrm{Var}}∥Pn(x,⋅)−π∥Var​ is tvDist (rowDist P n x) π, and β∗\beta_*β∗​ is lambdaStar P, the supremum of ∣λ∣|\lambda|∣λ∣ over real eigenvalues λ≠1\lambda\ne 1λ=1 of PPP, which equals max⁡(β1,∣βm−1∣)\max(\beta_1,|\beta_{m-1}|)max(β1​,∣βm−1​∣) for an irreducible reversible chain (the eigenvalue 111 is simple and all eigenvalues are real). Positivity of π\piπ is not assumed: it follows from irreducibility and stationarity. The case n=0n = 0n=0 is included; there the bound reads 4(1−π(x))2≤(1−π(x))/π(x)4(1-\pi(x))^2 \le (1-\pi(x))/\pi(x)4(1−π(x))2≤(1−π(x))/π(x), which holds because 4π(x)(1−π(x))≤14\pi(x)(1-\pi(x))\le 14π(x)(1−π(x))≤1. On a one-point space both sides are 000 (the eigenvalue set is empty and lambdaStar P = 0), so no hypothesis ∣X∣≥2|X|\ge 2∣X∣≥2 is added.

Preamble
import Mathlib
import Definitions.Def_mm_spectral
open MarkovMixing
Formal statement
namespace DiaconisStroock.VarDist

/-- **Proposition 3, (1.9)** (Diaconis and Stroock, Geometric bounds for eigenvalues of Markov
chains, Ann. Appl. Probab. 1 (1991), pp. 41–42): for an irreducible chain `P` on a finite set,
reversible with respect to its stationary distribution `π`,
`4‖Pⁿ(x, ·) − π‖²_Var ≤ ((1 − π(x))/π(x)) β_*^{2n}` for every state `x` and every `n`, where
`β_* = lambdaStar P = max(β₁, |β_{m−1}|)`. -/
theorem proposition_3 {V : Type*} [Fintype V] [DecidableEq V]
    (P : Matrix V V ℝ) (hP : IsStochastic P) (hirr : MarkovMixing.Irreducible P)
    (π : V → ℝ) (hπ : IsStationary P π) (hrev : DetailedBalance P π) :
    ∀ (x : V) (n : ℕ),
      4 * tvDist (rowDist P n x) π ^ 2 ≤ (1 - π x) / π x * lambdaStar P ^ (2 * n) := by sorry

end DiaconisStroock.VarDist
Source
Diaconis and Stroock, Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab. 1 (1991), pp. 41–42 (PDF pp. 6–7), Proposition 3, (1.9); ‖·‖_Var defined p. 41; standing assumption §1A, (1.1), p. 36
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

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

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