Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem A.1, p. 746 — ℰ(|f|, |f|) ≤ ℰ(f, f)

Proved
LogSobolevMC.TwoPoint.dirichlet_abs_le

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

dirichlet-formmarkov-chainsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let KKK be a Markov kernel on a finite set X\mathcal XX with invariant probability π>0\pi>0π>0, and E(f,g)=⟨(I−K)f,g⟩π\mathcal E(f,g)=\langle (I-K)f,g\rangle_\piE(f,g)=⟨(I−K)f,g⟩π​ its Dirichlet form. For every real function fff on X\mathcal XX,

E(∣f∣,∣f∣)≤E(f,f).\mathcal E(|f|,|f|)\le\mathcal E(f,f).E(∣f∣,∣f∣)≤E(f,f).

Since also L(∣f∣)=L(f)\mathcal L(|f|)=\mathcal L(f)L(∣f∣)=L(f), the infimum defining the log-Sobolev constant may be taken over nonnegative functions only; this is the first step of the proof of Theorem A.1.

Preamble
import Mathlib
import Definitions.Def_mm_basic
import Definitions.Def_mm_lower
import Definitions.Def_LogSobolevMC_TwoPoint_Setting
Formal statement
namespace LogSobolevMC.TwoPoint

open MarkovMixing

/-- Proof of Theorem A.1, p. 746: `ℰ(|f|, |f|) ≤ ℰ(f, f)` for every real function `f`. -/
theorem dirichlet_abs_le {V : Type*} [Fintype V] [DecidableEq V]
    (K : Matrix V V ℝ) (hK : IsStochastic K) (π : V → ℝ) (hπ : IsStationary K π)
    (hπpos : ∀ x, 0 < π x) (f : V → ℝ) :
    LogSobolevMC.ChiSquare.dirichlet K π (fun x => |f x|) (fun x => |f x|) ≤ LogSobolevMC.ChiSquare.dirichlet K π f f := by sorry

end LogSobolevMC.TwoPoint
Source
Diaconis and Saloff-Coste, Logarithmic Sobolev inequalities for finite Markov chains, Ann. Appl. Probab. 6 (1996), p. 746, proof of Theorem A.1, first paragraph after (A.2)
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