Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 3.3, p. 719 — ½P(x, y) ≤ M(x, y) ≤ P(x, y) for x ≠ y, hence ℰ_M ≤ ℰ_P ≤ 2ℰ_M

Proved
LogSobolevMC.Metropolis.example_3_3_compare

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

comparisondirichlet-formehrenfest-chainmarkov-chainsmetropolis-algorithmp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix n≥1n\ge 1n≥1, let MMM be the Metropolis chain (1.9) and PPP the Ehrenfest chain on {0,…,n}\{0,\dots,n\}{0,…,n}, and π(x)=2−n(nx)\pi(x)=2^{-n}\binom nxπ(x)=2−n(xn​). Then

12P(x,y)≤M(x,y)≤P(x,y)(x≠y),\tfrac12P(x,y)\le M(x,y)\le P(x,y)\qquad (x\ne y),21​P(x,y)≤M(x,y)≤P(x,y)(x=y),

and consequently the Dirichlet forms with respect to π\piπ satisfy

EM(f,f)≤EP(f,f)≤2 EM(f,f)for all f.\mathcal E_M(f,f)\le\mathcal E_P(f,f)\le 2\,\mathcal E_M(f,f)\qquad\text{for all } f.EM​(f,f)≤EP​(f,f)≤2EM​(f,f)for all f.

These are the hypotheses of the comparison Lemma 3.3 for the pair (M,P)(M,P)(M,P).

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

/-- Example 3.3, p. 719 (comparison): the Metropolis chain `M` of (1.9) and the Ehrenfest
chain `P` satisfy `½P(x, y) ≤ M(x, y) ≤ P(x, y)` for `x ≠ y`, hence their Dirichlet forms
with respect to the binomial distribution satisfy `ℰ_M ≤ ℰ_P ≤ 2ℰ_M`. -/
theorem example_3_3_compare (n : ℕ) (hn : 1 ≤ n) :
    (∀ x y : Fin (n + 1), x ≠ y →
      1 / 2 * ehrenfest n x y ≤ binomMetropolis n x y ∧
        binomMetropolis n x y ≤ ehrenfest n x y) ∧
    (∀ f : Fin (n + 1) → ℝ,
      LogSobolevMC.ChiSquare.dirichlet (binomMetropolis n) (binomPi n) f f ≤ LogSobolevMC.ChiSquare.dirichlet (ehrenfest n) (binomPi n) f f ∧
        LogSobolevMC.ChiSquare.dirichlet (ehrenfest n) (binomPi n) f f ≤
          2 * LogSobolevMC.ChiSquare.dirichlet (binomMetropolis n) (binomPi n) f f) := by sorry

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