Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Cumulant Vectors from Centered Log-Laplace Derivatives

Proved
FunctionalInequalities.Analysis.BakryEmery.iteratedFDeriv_centeredGradient_logLaplace_zero_of_compact_readable

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

functional-inequalitieskls-conjecturekls-modularkls-readablelog-concave

This is a finite-dimensional identity for the derivatives of 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 probability measure on EEE whose support is compact. For every integer r≥1r\ge 1r≥1 and every map h:Fin⁡(r)→Eh:\operatorname{Fin}(r)\to Eh:Fin(r)→E, define Λ=log⁡Laplace⁡(μ)\Lambda=\log\operatorname{Laplace}(\mu)Λ=logLaplace(μ). Then the rrr-th iterated derivative at 000 of the map z↦∇Λ(z)−∇Λ(0)z\mapsto\nabla\Lambda(z)-\nabla\Lambda(0)z↦∇Λ(z)−∇Λ(0), applied to hhh, equals the cumulant Riesz vector associated with the list of directions represented by hhh.

Dr(∇Λ−∇Λ(0))(0)[h]=cumulantVector⁡(μ,List.ofFn⁡(h)).D^r\bigl(\nabla\Lambda-\nabla\Lambda(0)\bigr)(0)[h]=\operatorname{cumulantVector}(\mu,\operatorname{List.ofFn}(h)).Dr(∇Λ−∇Λ(0))(0)[h]=cumulantVector(μ,List.ofFn(h)).

Here iteratedFDeriv is the iterated Fréchet derivative and cumulantVector is the Riesz vector associated with the corresponding cumulant functional. The result is a technical bridge between derivatives of the log-Laplace transform and cumulant tensors.

Original Lean declaration header

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

theorem iteratedFDeriv_centeredGradient_logLaplace_zero_of_compact (μ : ProbabilityMeasure E)
    (hc : IsCompact (μ : Measure E).support) (r : ℕ) (hr : 1 ≤ r) (h : Fin r → E) :
    iteratedFDeriv ℝ r (fun z : E =>
      gradient (logLaplace (μ : Measure E)) z - gradient (logLaplace (μ : Measure E)) 0) 0 h =
      cumulantVector (μ : Measure E) (List.ofFn h)

Module navigation

Module: Analysis/BakryEmery/Cumulant/Local.

Definition modules: Analysis/BakryEmery/Cumulant/Basic.

Supporting theorems: inner_iteratedFDeriv_gradient_apply, iteratedFDeriv_sub_const_of_pos.

Previous: cumulant_two_eq_centered_moment_of_integrable_exp · Next: inner_cumulantVector_single_ringInverse_cumulantVector.

Source excerpt, lines 608–612 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_BakryEmery_Cumulant_Local

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

theorem FunctionalInequalities.Analysis.BakryEmery.iteratedFDeriv_centeredGradient_logLaplace_zero_of_compact_readable (μ : ProbabilityMeasure E)
    (hc : IsCompact (μ : Measure E).support) (r : ℕ) (hr : 1 ≤ r) (h : Fin r → E) :
    iteratedFDeriv ℝ r (fun z : E =>
      gradient (logLaplace (μ : Measure E)) z - gradient (logLaplace (μ : Measure E)) 0) 0 h =
      cumulantVector (μ : Measure E) (List.ofFn h) := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/BakryEmery/Cumulant/Local.lean#L606-L651 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.BakryEmery.Cumulant.Local`, declaration `FunctionalInequalities.Analysis.BakryEmery.iteratedFDeriv_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