Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1D, proof of Proposition 3, p. 42 — Cauchy–Schwarz bound 4‖Pⁿ(x,·) − π‖²_Var ≤ P^{2n}(x,x)/π(x) − 1

Proved
DiaconisStroock.VarDist.four_tvDist_sq_le

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

cauchy-schwarzmarkov-chainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1total-variation

Let XXX be a finite set and PPP the transition matrix of an irreducible Markov chain on XXX, reversible with respect to its stationary probability distribution π\piπ. For probability distributions μ,π\mu, \piμ,π on XXX the variation distance is

∥μ−π∥Var=max⁡A⊂X∣μ(A)−π(A)∣=12∑x∈X∣μ(x)−π(x)∣.\|\mu-\pi\|_{\mathrm{Var}} = \max_{A\subset X} |\mu(A)-\pi(A)| = \tfrac12 \sum_{x\in X}|\mu(x)-\pi(x)|.∥μ−π∥Var​=A⊂Xmax​∣μ(A)−π(A)∣=21​x∈X∑​∣μ(x)−π(x)∣.

Then for every starting state x∈Xx \in Xx∈X and every n∈Nn\in\mathbb Nn∈N, the distribution Pn(x,⋅)P^n(x,\cdot)Pn(x,⋅) of the chain after nnn steps satisfies

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

This is the first half of the proof of Proposition 3: it bounds the variation distance by an L2(1/π)L^2(1/\pi)L2(1/π) quantity (a χ2\chi^2χ2 distance) and then by a diagonal entry of P2nP^{2n}P2n.

Formalization Note ∥μ−π∥Var\|\mu-\pi\|_{\mathrm{Var}}∥μ−π∥Var​ is MarkovMixing.tvDist μ π, defined as the supremum over subsets AAA of ∣μ(A)−π(A)∣|\mu(A)-\pi(A)|∣μ(A)−π(A)∣, and Pn(x,⋅)P^n(x,\cdot)Pn(x,⋅) is rowDist P n x. The square binds before the factor 444. Positivity of π\piπ is not assumed; it follows from irreducibility and stationarity. n=0n = 0n=0 is included.

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

/-- The Cauchy–Schwarz step in the proof of Proposition 3 (Diaconis and Stroock, Geometric bounds
for eigenvalues of Markov chains, Ann. Appl. Probab. 1 (1991), §1D, proof of Proposition 3, p. 42):
for an irreducible chain `P` reversible with respect to its stationary distribution `π`,
`4‖Pⁿ(x, ·) − π‖²_Var ≤ (1/π(x)) P^{2n}(x, x) − 1` for every state `x` and every `n`. -/
theorem four_tvDist_sq_le {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 ≤ (P ^ (2 * n)) x x / π x - 1 := by sorry

end DiaconisStroock.VarDist
Source
Diaconis and Stroock, Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab. 1 (1991), p. 42 (PDF p. 7), §1D, proof of Proposition 3, the displayed chain 4‖Pⁿ(x, ·) − π(·)‖² = … ≤ … = (1/π(x))P^{2n}(x, x) − 1; ‖·‖_Var defined p. 41 (PDF p. 6)
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