Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1, p. 715 — 2α ≤ λ for any chain

Proved
LogSobolevMC.Metropolis.lemma_3_1

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

log-sobolev-inequalitymarkov-chainsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1spectral-gap

Let KKK be a Markov kernel on a finite set X\mathcal XX with an invariant probability π\piπ charging every point. Its log-Sobolev constant α\alphaα and spectral gap λ\lambdaλ satisfy

2α≤λ.2\alpha\le\lambda.2α≤λ.

Together with a lower bound on α\alphaα obtained otherwise, this caps the log-Sobolev constant by the spectral gap; in Example 3.3 it turns the bound α(P)≥1/n\alpha(P)\ge 1/nα(P)≥1/n and the known gap λ(P)=2/n\lambda(P)=2/nλ(P)=2/n into the equality α(P)=1/n\alpha(P)=1/nα(P)=1/n.

Formalization Note The page's section assumes irreducibility; the statement does not need it and is stated without it (a stronger statement). On a one-point space both sides are 000 in Lean.

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

/-- Lemma 3.1, p. 715: for any finite chain `K` with positive invariant probability `π`,
the log-Sobolev constant and the spectral gap satisfy `2α ≤ λ`. -/
theorem lemma_3_1 {V : Type*} [Fintype V] [DecidableEq V]
    (K : Matrix V V ℝ) (hK : MarkovMixing.IsStochastic K)
    (π : V → ℝ) (hπ : MarkovMixing.IsStationary K π) (hπpos : ∀ x, 0 < π x) :
    2 * LogSobolevMC.ChiSquare.logSobolev K π ≤ LogSobolevMC.ChiSquare.gap K π := by sorry

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