Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(A.3), p. 747 — a minimizer u of (A.2) solves 2u log u − 2u log‖u‖₂ − (1/α)(I − K)u = 0

Proved
LogSobolevMC.TwoPoint.eq_A_3

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

euler-lagrangelog-sobolev-inequalitymarkov-chainsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let KKK be a Markov kernel on a finite set X\mathcal XX, reversible with respect to its invariant probability π>0\pi>0π>0 (that is, π(x)K(x,y)=π(y)K(y,x)\pi(x)K(x,y)=\pi(y)K(y,x)π(x)K(x,y)=π(y)K(y,x)), and suppose its log-Sobolev constant α\alphaα is positive. Let uuu be a positive function with L(u)≠0\mathcal L(u)\neq0L(u)=0 that attains the infimum (A.2), E(u,u)=αL(u)\mathcal E(u,u)=\alpha\mathcal L(u)E(u,u)=αL(u). Then at every point of X\mathcal XX

2ulog⁡u−2ulog⁡∥u∥2−1α(I−K)u=0.(A.3)2u\log u-2u\log\|u\|_2-\frac1\alpha(I-K)u=0. \tag{A.3}2ulogu−2ulog∥u∥2​−α1​(I−K)u=0.(A.3)

This Euler–Lagrange equation is what makes a minimizer for K(x,y)=π(y)K(x,y)=\pi(y)K(x,y)=π(y) take at most two values, reducing Theorem A.1 to the two-point Theorem A.2.

Formalization Note The page says "any minimizer u of (A.2)" in a context where minimizers are nonnegative. Three hypotheses are added and disclosed: reversibility (for a nonreversible kernel the variational equation involves the symmetric part 12(K+K∗)\tfrac12(K+K^*)21​(K+K∗) rather than KKK; the page applies (A.3) only to the reversible chain K(x,y)=π(y)K(x,y)=\pi(y)K(x,y)=π(y)); positivity of uuu (the logarithm at a zero of uuu would take Lean's default value); and α>0\alpha>0α>0 (so that 1/α1/\alpha1/α is meaningful).

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

/-- (A.3), p. 747: a positive minimizer `u` of (A.2) for a reversible chain satisfies
`2u log u − 2u log ‖u‖₂ − (1/α)(I − K)u = 0`. -/
theorem eq_A_3 {V : Type*} [Fintype V] [DecidableEq V]
    (K : Matrix V V ℝ) (hK : IsStochastic K) (π : V → ℝ) (hπ : IsStationary K π)
    (hπpos : ∀ x, 0 < π x) (hrev : DetailedBalance K π)
    (u : V → ℝ) (hu : ∀ x, 0 < u x) (hne : LogSobolevMC.ChiSquare.entL π u ≠ 0)
    (hmin : LogSobolevMC.ChiSquare.dirichlet K π u u = LogSobolevMC.ChiSquare.logSobolev K π * LogSobolevMC.ChiSquare.entL π u)
    (hα : 0 < LogSobolevMC.ChiSquare.logSobolev K π) :
    ∀ x, 2 * u x * Real.log (u x) - 2 * u x * Real.log (LogSobolevMC.ChiSquare.lpNorm π 2 u)
      - (1 / LogSobolevMC.ChiSquare.logSobolev K π) * (u x - K.mulVec u x) = 0 := by sorry

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