Weak Hessian Trace Bound
ProvedFunctionalInequalities.KLS.LogConcave.integral_trace_quadratic_le_two_mul_trace_sq_modularThis formalizes the weak form of Theorem 2.5 of Letwin (arXiv:2607.24164v1), cited as “Key moment-map Hessian bound.”
Let be a probability measure on with , where is convex, , globally Lipschitz, has Lipschitz gradient, and satisfies . Assume is positive definite almost everywhere. Let be a weak derivative tensor for the Hessian entries, locally on compact sets, and assume compact-local integrability of the inverse Hessian entries. Assume every Hessian entry is -integrable with mean equal to the identity matrix. For a positive-semidefinite matrix , assume the corresponding inverse-Hessian tensor energy is integrable and satisfies the half-energy bound
Then is integrable and
The statement is a weak Hessian-trace estimate with all differentiability and local integrability hypotheses explicit.
Superseded upload. This snapshot was replaced by FunctionalInequalities.KLS.LogConcave.integral_trace_quadratic_le_two_mul_trace_sq_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.
import Definitions.Def_KLSModular_FunctionalInequalities_KLS_LogConcave_HessianTrace noncomputable section section HessianTraceBound open MeasureTheory Matrix open FunctionalInequalities.Analysis open FunctionalInequalities.Analysis.BakryEmery open FunctionalInequalities.Probability.Stein open scoped ContDiff MatrixOrder section namespace FunctionalInequalities end FunctionalInequalities open FunctionalInequalities section namespace FunctionalInequalities.KLS end FunctionalInequalities.KLS open FunctionalInequalities FunctionalInequalities.KLS section namespace FunctionalInequalities.KLS.LogConcave end FunctionalInequalities.KLS.LogConcave open FunctionalInequalities FunctionalInequalities.KLS FunctionalInequalities.KLS.LogConcave set_option maxHeartbeats 4000000
theorem FunctionalInequalities.KLS.LogConcave.integral_trace_quadratic_le_two_mul_trace_sq_modular {n : ℕ}
{nu : ProbabilityMeasure (EuclideanSpace ℝ (Fin n))}
{U : EuclideanSpace ℝ (Fin n) → ℝ}
(hnuU : (nu : Measure (EuclideanSpace ℝ (Fin n))) =
(volume : Measure (EuclideanSpace ℝ (Fin n))).tilted (-U))
(hconv : ConvexOn ℝ Set.univ U) (hU : ContDiff ℝ 1 U)
{G : NNReal} (hG : LipschitzWith G (gradient U)) {L : NNReal} (hL : LipschitzWith L U)
(hnorm : (∫ x, Real.exp (-U x) ∂(volume : Measure (EuclideanSpace ℝ (Fin n)))) = 1)
(hPD : ∀ᵐ x ∂(volume : Measure (EuclideanSpace ℝ (Fin n))), (hessianMatrix U x).PosDef)
(T : EuclideanSpace ℝ (Fin n) → Fin n → Matrix (Fin n) (Fin n) ℝ)
(hT : ∀ k i j : Fin n,
HasWeakDerivAlong (fun x => hessianMatrix U x i j) (fun x => T x k i j)
(EuclideanSpace.basisFun (Fin n) ℝ k) ∧
∀ K : Set (EuclideanSpace ℝ (Fin n)), IsCompact K →
MemLp (fun x => T x k i j) 2 ((volume : Measure (EuclideanSpace ℝ (Fin n))).restrict K))
(hR : ∀ i j : Fin n, ∀ K : Set (EuclideanSpace ℝ (Fin n)), IsCompact K →
MemLp (fun x => (hessianMatrix U x)⁻¹ i j) (⊤ : ENNReal)
((volume : Measure (EuclideanSpace ℝ (Fin n))).restrict K))
(hmean : ∀ i j : Fin n,
Integrable (fun x => hessianMatrix U x i j) (nu : Measure (EuclideanSpace ℝ (Fin n))) ∧
(∫ x, hessianMatrix U x i j ∂(nu : Measure (EuclideanSpace ℝ (Fin n)))) =
(1 : Matrix (Fin n) (Fin n) ℝ) i j)
(B : Matrix (Fin n) (Fin n) ℝ) (hB : B.PosSemidef)
(hD : Integrable (fun x => ∑ k : Fin n, ∑ l : Fin n, (hessianMatrix U x)⁻¹ k l *
(B * T x k * B * T x l).trace) (nu : Measure (EuclideanSpace ℝ (Fin n))))
(hhalf : (∫ x, (∑ k : Fin n, ∑ l : Fin n, (hessianMatrix U x)⁻¹ k l *
(B * T x k * B * T x l).trace) ∂(nu : Measure (EuclideanSpace ℝ (Fin n)))) ≤
(1 / 2 : ℝ) * ∫ x, (B * hessianMatrix U x * B * hessianMatrix U x).trace
∂(nu : Measure (EuclideanSpace ℝ (Fin n)))) :
Integrable (fun x => (B * hessianMatrix U x * B * hessianMatrix U x).trace)
(nu : Measure (EuclideanSpace ℝ (Fin n))) ∧
(∫ x, (B * hessianMatrix U x * B * hessianMatrix U x).trace
∂(nu : Measure (EuclideanSpace ℝ (Fin n)))) ≤ 2 * (B * B).trace := by sorry