Nonnegativity Of A Compact-Test Dual Constant
ProvedFunctionalInequalities.KLS.LogConcave.nonneg_of_forall_sq_integral_le_mul_integral_norm_fderiv_sq_modularThis theorem states the sign condition needed for a compact-test dual gradient bound.
Let , let be an additive Haar measure on , let be a probability measure, and let be continuous with . If and satisfy, for every smooth compactly supported ,
then
The conclusion requires positive dimension and uses no convexity assumption on . The derivative is the Fréchet derivative fderiv ℝ h and the energy has no factor .
Superseded upload. This snapshot was replaced by FunctionalInequalities.KLS.LogConcave.nonneg_of_forall_sq_integral_le_mul_integral_norm_fderiv_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_HminusOne noncomputable section open MeasureTheory open scoped ContDiff 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
theorem FunctionalInequalities.KLS.LogConcave.nonneg_of_forall_sq_integral_le_mul_integral_norm_fderiv_sq_modular {n : ℕ} (hn : 0 < n)
(m : Measure (EuclideanSpace ℝ (Fin n))) [m.IsAddHaarMeasure]
{ν : ProbabilityMeasure (EuclideanSpace ℝ (Fin n))}
{W : EuclideanSpace ℝ (Fin n) → ℝ} (hνW : (ν : Measure _) = m.tilted (-W))
(hW : Continuous W) {F : EuclideanSpace ℝ (Fin n) → ℝ} {K : ℝ}
(hK : ∀ h : EuclideanSpace ℝ (Fin n) → ℝ, ContDiff ℝ ∞ h → HasCompactSupport h →
(∫ x, F x * h x ∂(ν : Measure _)) ^ 2 ≤
K * ∫ x, ‖fderiv ℝ h x‖ ^ 2 ∂(ν : Measure _)) :
0 ≤ K := by sorry