Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Almost-Everywhere Hessian Chain Rule for a Profile

Proved
FunctionalInequalities.Analysis.ae_hessianMatrix_comp_profile_readable

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

functional-inequalitieskls-conjecturekls-modularkls-readablelog-concave

This is an almost-everywhere chain rule for Hessians.

Let u:Rn→Ru:\mathbb R^n\to\mathbb Ru:Rn→R be C1C^1C1 with Lipschitz gradient, and let ζ:R→R\zeta:\mathbb R\to\mathbb Rζ:R→R be C2C^2C2. Then, for almost every xxx and all i,j∈Fin⁡ni,j\in\operatorname{Fin} ni,j∈Finn,

∂ij2(ζ∘u)(x)=ζ′(u(x)) ∂ij2u(x)+ζ′′(u(x)) ∂iu(x) ∂ju(x).\partial_{ij}^2(\zeta\circ u)(x) =\zeta'(u(x))\,\partial_{ij}^2u(x) +\zeta''(u(x))\,\partial_i u(x)\,\partial_j u(x).∂ij2​(ζ∘u)(x)=ζ′(u(x))∂ij2​u(x)+ζ′′(u(x))∂i​u(x)∂j​u(x).

In Lean, the Hessian is the coordinate matrix hessianMatrix, and the first derivatives are expressed using fderiv on the Euclidean basis. This identity supports the inverse-Hessian cutoff calculations.

Original Lean declaration header

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

private theorem ae_hessianMatrix_comp_profile {n : ℕ}
    {u : EuclideanSpace ℝ (Fin n) → ℝ} {ζ : ℝ → ℝ} {G : NNReal}
    (hu : ContDiff ℝ 1 u) (hG : LipschitzWith G (gradient u))
    (hζ : ContDiff ℝ 2 ζ) :
    ∀ᵐ x ∂(volume : Measure (EuclideanSpace ℝ (Fin n))), ∀ i j : Fin n,
      hessianMatrix (fun y => ζ (u y)) x i j =
        deriv ζ (u x) * hessianMatrix u x i j +
          deriv (deriv ζ) (u x) *
            fderiv ℝ u x (EuclideanSpace.basisFun (Fin n) ℝ i) *
            fderiv ℝ u x (EuclideanSpace.basisFun (Fin n) ℝ j)

Module navigation

Module: Analysis/BakryEmery/IntegrationByParts/InverseHessian/WeakCutoff.

Definition modules: Analysis/BakryEmery/HessianOperator.

Previous: integral_profile_inverse_energy_eq_drift · Next: exists_C1_height_generator_defect_bound.

Source excerpt, lines 373–382 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_BakryEmery_IntegrationByParts_InverseHessian_WeakCutoff

open MeasureTheory Filter Set Metric Matrix
open FunctionalInequalities.Probability.Stein
Formal statement
 theorem FunctionalInequalities.Analysis.ae_hessianMatrix_comp_profile_readable {n : ℕ}
    {u : EuclideanSpace ℝ (Fin n) → ℝ} {ζ : ℝ → ℝ} {G : NNReal}
    (hu : ContDiff ℝ 1 u) (hG : LipschitzWith G (gradient u))
    (hζ : ContDiff ℝ 2 ζ) :
    ∀ᵐ x ∂(volume : Measure (EuclideanSpace ℝ (Fin n))), ∀ i j : Fin n,
      hessianMatrix (fun y => ζ (u y)) x i j =
        deriv ζ (u x) * hessianMatrix u x i j +
          deriv (deriv ζ) (u x) *
            fderiv ℝ u x (EuclideanSpace.basisFun (Fin n) ℝ i) *
            fderiv ℝ u x (EuclideanSpace.basisFun (Fin n) ℝ j) := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/BakryEmery/IntegrationByParts/InverseHessian/WeakCutoff.lean#L373-L426 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.BakryEmery.IntegrationByParts.InverseHessian.WeakCutoff`, declaration `_private.FunctionalInequalities.Analysis.BakryEmery.IntegrationByParts.InverseHessian.WeakCutoff.0.FunctionalInequalities.Analysis.ae_hessianMatrix_comp_profile`; 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