Polynomial Bound On Legendre Mass
ProvedFunctionalInequalities.Probability.MomentMeasure.exists_uniform_mass_bound_readableThis is a uniform polynomial bound for conjugate mass in the coercivity argument.
Let be finite-dimensional with a real inner product and Borel measurable structure. Let be an additive Haar measure and let be a finite measure. Assume that lies in the interior of the convex hull of . Then there exists such that every with
- ;
- ;
ConvexPotential φ;PotentialIntegrable φ μ;
satisfies
The constant is selected before , and the estimate is polynomial in the maximum of the real integral and .
Original Lean declaration header
Within namespace FunctionalInequalities.Probability.MomentMeasure. Shown in its original module context. Proof omitted.
theorem exists_uniform_mass_bound (dx μ : Measure E) [dx.IsAddHaarMeasure] [IsFiniteMeasure μ]
(h0 : (0 : E) ∈ interior (convexHull ℝ μ.support)) :
∃ A : ℝ, 0 < A ∧ ∀ φ : E → EReal,
(∀ x, 0 ≤ φ x) → φ 0 = 0 → ConvexPotential φ → PotentialIntegrable φ μ →
mass dx (legendre φ) ≤ ENNReal.ofReal
(A * (max (∫ x, (φ x).toReal ∂μ) 1) ^ Module.finrank ℝ E)
Module navigation
Module: Probability/MomentMeasure/Coercivity.
Definition modules: Probability/MomentMeasure/Basic, Analysis/Convex/Legendre.
Supporting theorems: density_scaled_le_exp, exists_uniform_legendre_lower, integrable_exp_sub_norm.
Previous: density_scaled_le_exp · Next: exists_coercivity_of_centered_probability.
Source excerpt, lines 137–142 · Frozen source 408915f.
import Definitions.Def_KLSModular_FunctionalInequalities_Probability_MomentMeasure_Coercivity
open FunctionalInequalities.Analysis
open MeasureTheory Filter Set
variable {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
[FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E]
theorem FunctionalInequalities.Probability.MomentMeasure.exists_uniform_mass_bound_readable (dx μ : Measure E) [dx.IsAddHaarMeasure] [IsFiniteMeasure μ]
(h0 : (0 : E) ∈ interior (convexHull ℝ μ.support)) :
∃ A : ℝ, 0 < A ∧ ∀ φ : E → EReal,
(∀ x, 0 ≤ φ x) → φ 0 = 0 → ConvexPotential φ → PotentialIntegrable φ μ →
mass dx (legendre φ) ≤ ENNReal.ofReal
(A * (max (∫ x, (φ x).toReal ∂μ) 1) ^ Module.finrank ℝ E) := by sorry