Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Directional Cumulants of the Centered Log-Laplace Gradient

Proved
FunctionalInequalities.Analysis.BakryEmery.directional_centeredGradient_logLaplace_zero_of_compact_readable

by Lazyfill · Oct 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

bkl2026functional-inequalitieskls-conjecturekls-modularkls-readablelog-concave

This is a finite-dimensional directional-derivative identity for a centered log-Laplace gradient.

Let EEE be a finite-dimensional real inner-product space with its Borel measurable structure, and let μ\muμ be a compactly supported probability measure on EEE. For every finite list lll of vectors in EEE, set Λ=log⁡Laplace⁡(μ)\Lambda=\log\operatorname{Laplace}(\mu)Λ=logLaplace(μ). The directional derivative indexed by lll of z↦∇Λ(z)−∇Λ(0)z\mapsto\nabla\Lambda(z)-\nabla\Lambda(0)z↦∇Λ(z)−∇Λ(0) at 000 is zero when lll is empty, and otherwise is the cumulant vector associated with lll:

directional⁡ l (∇Λ−∇Λ(0))(0)={0,l=[]cumulantVector⁡(μ,l),l≠[].\operatorname{directional}\,l\,(\nabla\Lambda-\nabla\Lambda(0))(0)= \begin{cases}0,&l=[]\\ \operatorname{cumulantVector}(\mu,l),&l\ne[]. \end{cases}directionall(∇Λ−∇Λ(0))(0)={0,cumulantVector(μ,l),​l=[]l=[].​

This result packages the corresponding iterated-derivative identity in list form for reuse in multilinear expansions.

Original Lean declaration header

Within namespace FunctionalInequalities.Analysis.BakryEmery. Shown in its original module context. Proof omitted.

theorem directional_centeredGradient_logLaplace_zero_of_compact (μ : ProbabilityMeasure E)
    (hc : IsCompact (μ : Measure E).support) (l : List E) :
    directional l (fun z : E =>
        gradient (logLaplace (μ : Measure E)) z - gradient (logLaplace (μ : Measure E)) 0) 0 =
      if l = [] then 0 else cumulantVector (μ : Measure E) l

Module navigation

Module: Analysis/BakryEmery/Cumulant/Leibniz.

Definition modules: Analysis/BakryEmery/Cumulant/Basic, Analysis/BakryEmery/Cumulant/Local, Analysis/IteratedDerivative/Symmetry.

Supporting theorems: iteratedFDeriv_centeredGradient_logLaplace_zero_of_compact.

Next: iteratedFDeriv_inner_centeredGradient_zero_of_compact.

Source excerpt, lines 30–34 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_BakryEmery_Cumulant_Leibniz

open MeasureTheory
variable {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
  [FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E]
Formal statement

theorem FunctionalInequalities.Analysis.BakryEmery.directional_centeredGradient_logLaplace_zero_of_compact_readable (μ : ProbabilityMeasure E)
    (hc : IsCompact (μ : Measure E).support) (l : List E) :
    directional l (fun z : E =>
        gradient (logLaplace (μ : Measure E)) z - gradient (logLaplace (μ : Measure E)) 0) 0 =
      if l = [] then 0 else cumulantVector (μ : Measure E) l := by sorry
Source
Source: Bizeul–Klartag–Lehec, Presenting a proof of the Kannan–Lovász–Simonovits conjecture (arXiv:2610.05474v1), Theorem 4.1, p. 18. Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/BakryEmery/Cumulant/Leibniz.lean#L29-L58 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.BakryEmery.Cumulant.Leibniz`, declaration `FunctionalInequalities.Analysis.BakryEmery.directional_centeredGradient_logLaplace_zero_of_compact`; the repository is private at upload time).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me