Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Integrated Hessian Increment Energy Bound

Proved
FunctionalInequalities.Analysis.integral_mul_hessian_increment_le_readable

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

functional-inequalitieskls-conjecturekls-modularkls-readableletwin2026log-concave

This formalizes part of Theorem 2.5 of Letwin (arXiv:2607.24164v1), in the weak route.

Let u,V,η:Rn→Ru,V,\eta:\mathbb R^n\to\mathbb Ru,V,η:Rn→R. Assume: (1) u,V∈C1u,V\in C^1u,V∈C1 and are convex; (2) ∇u\nabla u∇u is Lipschitz; (3) −u+V∘∇u-u+V\circ\nabla u−u+V∘∇u is Lipschitz; (4) for some K>0K>0K>0, almost everywhere ∇2u(x)\nabla^2u(x)∇2u(x) is positive definite, log⁡det⁡∇2u(x)=−u(x)+V(∇u(x))\log\det\nabla^2u(x)=-u(x)+V(\nabla u(x))logdet∇2u(x)=−u(x)+V(∇u(x)), and KI−∇2u(x)K I-\nabla^2u(x)KI−∇2u(x) is positive semidefinite; (5) η∈Cc2\eta\in C_c^2η∈Cc2​ and η≥0\eta\ge0η≥0; and (6) for some D∈RD\in\mathbb RD∈R and every x,hx,hx,h, u(x+h)+u(x−h)−2u(x)≤D∥h∥2u(x+h)+u(x-h)-2u(x)\le D\|h\|^2u(x+h)+u(x−h)−2u(x)≤D∥h∥2.

For every h∈Rnh\in\mathbb R^nh∈Rn,

∫η(x)(∥H(x+h)−H(x)∥F2+∥H(x−h)−H(x)∥F2)e−u(x) dx\int \eta(x)\left(\|H(x+h)-H(x)\|_F^2+\|H(x-h)-H(x)\|_F^2\right)e^{-u(x)}\,dx∫η(x)(∥H(x+h)−H(x)∥F2​+∥H(x−h)−H(x)∥F2​)e−u(x)dx ≤2K2D∥h∥2∫∣η(x)+Lη(x)∣e−u(x) dx,\le 2K^2D\|h\|^2\int\left|\eta(x)+L\eta(x)\right|e^{-u(x)}\,dx,≤2K2D∥h∥2∫∣η(x)+Lη(x)∣e−u(x)dx,

where H=hessianMatrix⁡(u)H=\operatorname{hessianMatrix}(u)H=hessianMatrix(u) and Lη=tr⁡(H−1hessianMatrix⁡(η))−DV(∇u)[∇η]L\eta=\operatorname{tr}(H^{-1}\operatorname{hessianMatrix}(\eta))-DV(\nabla u)[\nabla\eta]Lη=tr(H−1hessianMatrix(η))−DV(∇u)[∇η].

The result is a weak integrated Hessian-increment estimate supporting, but not proving, the cited paper theorem.

Original Lean declaration header

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

theorem integral_mul_hessian_increment_le {n : ℕ} {u V η : EuclideanSpace ℝ (Fin n) → ℝ}
    (hu : ContDiff ℝ 1 u) (hconv : ConvexOn ℝ univ u) {G : NNReal}
    (hG : LipschitzWith G (gradient u)) (hV : ContDiff ℝ 1 V) (hVc : ConvexOn ℝ univ V)
    {LF : NNReal} (hF : LipschitzWith LF (fun x => -u x + V (gradient u x))) {K : ℝ} (hK : 0 < K)
    (hdata : ∀ᵐ x ∂(volume : Measure (EuclideanSpace ℝ (Fin n))),
      (hessianMatrix u x).PosDef ∧
      Real.log (hessianMatrix u x).det = -u x + V (gradient u x) ∧
      (K • (1 : Matrix (Fin n) (Fin n) ℝ) - hessianMatrix u x).PosSemidef)
    (hη : ContDiff ℝ 2 η) (hηc : HasCompactSupport η) (hη0 : ∀ x, 0 ≤ η x) {D : ℝ}
    (h : EuclideanSpace ℝ (Fin n)) (hw : ∀ x, u (x + h) + u (x - h) - 2 * u x ≤ D * ‖h‖ ^ 2) :
    ∫ x, η x * ((∑ i, ∑ j, (hessianMatrix u (x + h) - hessianMatrix u x) i j ^ 2) +
        ∑ i, ∑ j, (hessianMatrix u (x - h) - hessianMatrix u x) i j ^ 2) * Real.exp (-u x)
        ∂(volume : Measure (EuclideanSpace ℝ (Fin n))) ≤
      2 * K ^ 2 * (D * ‖h‖ ^ 2) *
        ∫ x, |η x + (((hessianMatrix u x)⁻¹ * hessianMatrix η x).trace -
          fderiv ℝ V (gradient u x) (gradient η x))| * Real.exp (-u x)
          ∂(volume : Measure (EuclideanSpace ℝ (Fin n)))

Module navigation

Module: Analysis/Convex/HessianIncrement.

Definition modules: Analysis/BakryEmery/HessianOperator, Analysis/Operator/Coordinates.

Selected supporting theorems: ae_hessian_increment_le_generator, centeredDifference_contDiff_lipschitz_gradient, centeredDifference_nonneg_le, integrable_hessian_increment_energy, integrable_weak_generator_densities.

Previous: integrable_hessian_increment_energy · Next: exists_hessian_cutoff_sq_difference_bound.

Source excerpt, lines 116–132 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_Convex_HessianIncrement

open MeasureTheory Set Filter
open FunctionalInequalities.Probability.Stein
Formal statement

theorem FunctionalInequalities.Analysis.integral_mul_hessian_increment_le_readable {n : ℕ} {u V η : EuclideanSpace ℝ (Fin n) → ℝ}
    (hu : ContDiff ℝ 1 u) (hconv : ConvexOn ℝ univ u) {G : NNReal}
    (hG : LipschitzWith G (gradient u)) (hV : ContDiff ℝ 1 V) (hVc : ConvexOn ℝ univ V)
    {LF : NNReal} (hF : LipschitzWith LF (fun x => -u x + V (gradient u x))) {K : ℝ} (hK : 0 < K)
    (hdata : ∀ᵐ x ∂(volume : Measure (EuclideanSpace ℝ (Fin n))),
      (hessianMatrix u x).PosDef ∧
      Real.log (hessianMatrix u x).det = -u x + V (gradient u x) ∧
      (K • (1 : Matrix (Fin n) (Fin n) ℝ) - hessianMatrix u x).PosSemidef)
    (hη : ContDiff ℝ 2 η) (hηc : HasCompactSupport η) (hη0 : ∀ x, 0 ≤ η x) {D : ℝ}
    (h : EuclideanSpace ℝ (Fin n)) (hw : ∀ x, u (x + h) + u (x - h) - 2 * u x ≤ D * ‖h‖ ^ 2) :
    ∫ x, η x * ((∑ i, ∑ j, (hessianMatrix u (x + h) - hessianMatrix u x) i j ^ 2) +
        ∑ i, ∑ j, (hessianMatrix u (x - h) - hessianMatrix u x) i j ^ 2) * Real.exp (-u x)
        ∂(volume : Measure (EuclideanSpace ℝ (Fin n))) ≤
      2 * K ^ 2 * (D * ‖h‖ ^ 2) *
        ∫ x, |η x + (((hessianMatrix u x)⁻¹ * hessianMatrix η x).trace -
          fderiv ℝ V (gradient u x) (gradient η x))| * Real.exp (-u x)
          ∂(volume : Measure (EuclideanSpace ℝ (Fin n))) := by sorry
Source
Source: Letwin, The KLS constant is O(log^(1/4) n) (arXiv:2607.24164v1), Theorem 2.5. Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/Convex/HessianIncrement.lean#L111-L236 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.Convex.HessianIncrement`, declaration `FunctionalInequalities.Analysis.integral_mul_hessian_increment_le`; 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