Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.1, p. 698 — the Metropolis chain for the binomial distribution satisfies ‖M_xˡ − π‖_TV ≤ e^{1−c} for l ≥ (n/2)(log n + 2c)

Proved
LogSobolevMC.Metropolis.theorem_1_1

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

binomial-distributionmarkov-chainsmetropolis-algorithmmixing-timep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1total-variation

Fix n≥1n\ge 1n≥1 and let π(x)=2−n(nx)\pi(x)=2^{-n}\binom nxπ(x)=2−n(xn​) be the binomial distribution on {0,1,…,n}\{0,1,\dots,n\}{0,1,…,n}. Let MMM be the Metropolis chain (1.9): starting from xxx, propose x±1x\pm1x±1 with probability 1/21/21/2 each (a proposal outside {0,…,n}\{0,\dots,n\}{0,…,n} is a hold), and accept a proposed move to yyy with probability min⁡{1,π(y)/π(x)}\min\{1,\pi(y)/\pi(x)\}min{1,π(y)/π(x)}, otherwise stay. Write Mxl=Ml(x,⋅)M^l_x=M^l(x,\cdot)Mxl​=Ml(x,⋅) for the law of the chain after lll steps from xxx and ∥μ−ν∥TV=max⁡A⊆X∣μ(A)−ν(A)∣\|\mu-\nu\|_{TV}=\max_{A\subseteq\mathcal X}|\mu(A)-\nu(A)|∥μ−ν∥TV​=maxA⊆X​∣μ(A)−ν(A)∣. Then for every xxx, every c>0c>0c>0 and every integer lll,

∥Mxl−π∥TV≤e1−cfor l≥n2(log⁡n+2c).\|M^l_x-\pi\|_{TV}\le e^{1-c}\qquad\text{for } l\ge\frac n2(\log n+2c).∥Mxl​−π∥TV​≤e1−cfor l≥2n​(logn+2c).

So the Metropolis algorithm for the binomial distribution is close to stationarity after n2log⁡n+O(n)\frac n2\log n+O(n)2n​logn+O(n) steps, while the spectral gap λ(M)≍1/n\lambda(M)\asymp 1/nλ(M)≍1/n alone only gives order n2n^2n2.

Formalization Note This is the first (upper bound) statement of Theorem 1.1. The converse, max⁡x∥Mxl−π∥TV≥1/4+o(1)\max_x\|M^l_x-\pi\|_{TV}\ge 1/4+o(1)maxx​∥Mxl​−π∥TV​≥1/4+o(1) for l≤(n/8)log⁡nl\le (n/8)\log nl≤(n/8)logn, is asymptotic, proved in the paper only by citation, and not part of this statement. The paper's derivation (Example 3.4) reaches l≥n2(log⁡n+2c)+1l\ge\frac n2(\log n+2c)+1l≥2n​(logn+2c)+1 in chi-square distance; the goal is the statement as printed, without the +1+1+1.

Preamble
import Mathlib
import Definitions.Def_mm_mixing
import Definitions.Def_LogSobolevMC_Metropolis_Chains
Formal statement
namespace LogSobolevMC.Metropolis

/-- Theorem 1.1, p. 698 (upper bound): the Metropolis chain `M` of (1.9) for the binomial
distribution `π(x) = 2⁻ⁿ C(n, x)` on `{0, …, n}` satisfies
`‖M_xˡ − π‖_TV ≤ e^{1−c}` for every starting state `x`, every `c > 0` and every
`l ≥ (n/2)(log n + 2c)`. -/
theorem theorem_1_1 (n : ℕ) (hn : 1 ≤ n) (c : ℝ) (hc : 0 < c) (x : Fin (n + 1)) (l : ℕ)
    (hl : (n : ℝ) / 2 * (Real.log n + 2 * c) ≤ (l : ℝ)) :
    MarkovMixing.tvDist (MarkovMixing.rowDist (binomMetropolis n) l x) (binomPi n) ≤
      Real.exp (1 - c) := by sorry

end LogSobolevMC.Metropolis
Source
Diaconis and Saloff-Coste, Logarithmic Sobolev inequalities for finite Markov chains, Ann. Appl. Probab. 6 (1996), p. 698, Theorem 1.1 (first statement)
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