Coordinate Chain Rule Through the Gradient Map
ProvedFunctionalInequalities.Probability.Stein.chain_coordinate_of_differentiableAt_gradient_modularfunctional-inequalitieskls-conjecturekls-modularletwin2026log-concave
This statement gives a coordinate chain rule for a composition with a gradient map.
Let and let be . At a point , assume that is differentiable at . For every coordinate ,
Here hessianMatrix u y is the matrix used for the weak Hessian coordinates. The result is a finite-dimensional pointwise identity and makes no global invertibility claim about .
Superseded upload. This snapshot was replaced by FunctionalInequalities.Probability.Stein.chain_coordinate_of_differentiableAt_gradient_readable: open the readable replacement. The replacement preserves the frozen source and mathematical statement, with a compact declaration context. This historical node remains available for existing imports.
Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_BakryEmery_WeakHessian open MeasureTheory open FunctionalInequalities.Analysis.BakryEmery open scoped RealInnerProductSpace ContDiff noncomputable section open MeasureTheory Set open scoped Topology ContDiff section C1GradientChain open MeasureTheory Matrix open scoped ContDiff Topology RealInnerProductSpace section namespace FunctionalInequalities end FunctionalInequalities open FunctionalInequalities section namespace FunctionalInequalities.Probability end FunctionalInequalities.Probability open FunctionalInequalities FunctionalInequalities.Probability section namespace FunctionalInequalities.Probability.Stein end FunctionalInequalities.Probability.Stein open FunctionalInequalities FunctionalInequalities.Probability FunctionalInequalities.Probability.Stein set_option maxHeartbeats 400000
Formal statement
theorem FunctionalInequalities.Probability.Stein.chain_coordinate_of_differentiableAt_gradient_modular {n : ℕ}
{u f : EuclideanSpace ℝ (Fin n) → ℝ} (hu : ContDiff ℝ 1 u)
(hf : ContDiff ℝ 1 f) {y : EuclideanSpace ℝ (Fin n)}
(hy : DifferentiableAt ℝ (gradient u) y) (i : Fin n) :
fderiv ℝ (f ∘ gradient u) y (EuclideanSpace.basisFun (Fin n) ℝ i) =
∑ j, hessianMatrix u y i j * gradient f (gradient u y) j := by sorry
Source
Source: Letwin, The KLS constant is O(log^(1/4) n) (arXiv:2607.24164v1), Lemma 2.7 (Fathi [29, Theorem 2.3]). Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/BakryEmery/WeakHessian.lean#L501-L535 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.BakryEmery.WeakHessian`, declaration `FunctionalInequalities.Probability.Stein.chain_coordinate_of_differentiableAt_gradient`; the repository is private at upload time).