Regular Moment Witness with Bounded Cutoff Testing
ProvedFunctionalInequalities.Analysis.exists_regular_moment_bounded_weak_cutoff_testing_modularThis formalizes the regular moment construction together with bounded weak cutoff testing associated with Lemma A.5 of Letwin (arXiv:2607.24164v1), locator Lemma A.5.
Under the same assumptions as the regular moment witness—, , compact convex with nonempty interior, smooth , convexity of , the density representation of an isotropic probability measure , and the stated measure identity—there exist carrying the full regular moment, weak Hessian evolution, bounded weak Hessian testing, and weak cutoff payloads.
In particular, there are and cutoffs with all properties listed for exists_regular_moment_weak_cutoffs_modular, including , compact support, pointwise monotonicity and convergence to , tilted-measure integrability of the generator, and the bound .
Furthermore, for every , every locally integrable globally bounded weak function , every family of compact-locally weak coordinate derivatives , and every bound , the products are integrable and the rough cutoff identity holds:
This is an existential package retaining the common witness and cutoff family while adding the universal bounded weak-test identity.
Superseded upload. This snapshot was replaced by FunctionalInequalities.Analysis.exists_regular_moment_bounded_weak_cutoff_testing_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_CEK_MomentRegularity_Cutoff
section RegularSource
open MeasureTheory Set
open scoped ContDiff
variable {n : ℕ} (hn : 0 < n)
{K : Set (EuclideanSpace ℝ (Fin n))} {W : EuclideanSpace ℝ (Fin n) → ℝ}
{κ : ℝ} (hκ : 0 < κ) (hK : IsCompact K) (hKc : Convex ℝ K)
(hKint : (interior K).Nonempty) (hW : ContDiff ℝ ∞ W)
(hstrong : ConvexOn ℝ univ (fun y => W y - (κ / 2) * ‖y‖ ^ 2))
(μ : ProbabilityMeasure (EuclideanSpace ℝ (Fin n)))
(hμ : (μ : Measure (EuclideanSpace ℝ (Fin n))) =
(volume : Measure (EuclideanSpace ℝ (Fin n))).withDensity
(K.indicator fun p => ENNReal.ofReal (Real.exp (-W p))))
(hiso : FunctionalInequalities.KLS.Isotropic μ)
noncomputable section
open MeasureTheory Set Filter
open scoped RealInnerProductSpace ContDiff Topology
open FunctionalInequalities.Probability.Stein
section RegularMomentBoundedWeakCutoffTesting
open MeasureTheory Filter Set Metric Matrix
open FunctionalInequalities.Probability.Stein
open scoped ContDiff Topology RealInnerProductSpace
section
namespace FunctionalInequalities
end FunctionalInequalities
open FunctionalInequalities
section
namespace FunctionalInequalities.Analysis
end FunctionalInequalities.Analysis
open FunctionalInequalities FunctionalInequalities.Analysis
include hn hκ hK hKc hKint hW hstrong hμ hiso
theorem FunctionalInequalities.Analysis.exists_regular_moment_bounded_weak_cutoff_testing_modular :
∃ (u : EuclideanSpace ℝ (Fin n) → ℝ) (L LF : NNReal)
(T : EuclideanSpace ℝ (Fin n) → Fin n → Fin n → Fin n → ℝ),
(ConvexOn ℝ univ u ∧ LipschitzWith L u ∧
(∫ x, Real.exp (-u x) ∂(volume : Measure (EuclideanSpace ℝ (Fin n)))) = 1 ∧
((volume : Measure (EuclideanSpace ℝ (Fin n))).tilted (-u)).map (gradient u) =
(μ : Measure (EuclideanSpace ℝ (Fin n))) ∧
ContDiff ℝ 1 u ∧ LipschitzWith (Real.toNNReal (16 / κ)) (gradient u) ∧
LipschitzWith LF (fun x => -u x + W (gradient u x)) ∧
(∀ x h, u (x + h) + u (x - h) - 2 * u x ≤ (4 / κ) * ‖h‖ ^ 2) ∧
(∀ᵐ x ∂(volume : Measure (EuclideanSpace ℝ (Fin n))),
(hessianMatrix u x).PosDef ∧
Real.log (hessianMatrix u x).det = -u x + W (gradient u x) ∧
((16 / κ) • (1 : Matrix (Fin n) (Fin n) ℝ) - hessianMatrix u x).PosSemidef) ∧
(∀ k i j,
HasWeakDerivAlong (fun x => hessianMatrix u x i j) (fun x => T x k i j)
(EuclideanSpace.basisFun (Fin n) ℝ k) ∧
∀ S : Set (EuclideanSpace ℝ (Fin n)), IsCompact S →
MemLp (fun x => T x k i j) 2 ((volume : Measure (EuclideanSpace ℝ (Fin n))).restrict S)) ∧
(∃ LE : NNReal,
LipschitzWith LE (fun x => Real.exp (-u x + W (gradient u x)))) ∧
(∀ k : Fin n,
HasWeakDerivAlong (fun x => (hessianMatrix u x).det)
(fun x => (hessianMatrix u x).det *
((hessianMatrix u x)⁻¹ * (Matrix.of fun i j => T x k i j)).trace)
(EuclideanSpace.basisFun (Fin n) ℝ k) ∧
(∀ S : Set (EuclideanSpace ℝ (Fin n)), IsCompact S →
MemLp (fun x => (hessianMatrix u x).det *
((hessianMatrix u x)⁻¹ * (Matrix.of fun i j => T x k i j)).trace)
2 ((volume : Measure (EuclideanSpace ℝ (Fin n))).restrict S)) ∧
HasWeakDerivAlong (fun x => Real.log (hessianMatrix u x).det)
(fun x => ((hessianMatrix u x)⁻¹ * (Matrix.of fun i j => T x k i j)).trace)
(EuclideanSpace.basisFun (Fin n) ℝ k) ∧
(∀ᵐ x ∂(volume : Measure (EuclideanSpace ℝ (Fin n))),
((hessianMatrix u x)⁻¹ * (Matrix.of fun i j => T x k i j)).trace =
fderiv ℝ (fun y => -u y + W (gradient u y)) x
(EuclideanSpace.basisFun (Fin n) ℝ k)) ∧
(∀ᵐ x ∂(volume : Measure (EuclideanSpace ℝ (Fin n))),
((hessianMatrix u x)⁻¹ * (Matrix.of fun i j => T x k i j)).trace =
-fderiv ℝ u x (EuclideanSpace.basisFun (Fin n) ℝ k) +
∑ a : Fin n, hessianMatrix u x k a *
fderiv ℝ W (gradient u x) (EuclideanSpace.basisFun (Fin n) ℝ a))) ∧
(∀ k i j : Fin n,
HasWeakDerivAlong (fun x => (hessianMatrix u x)⁻¹ i j)
(fun x => -(((hessianMatrix u x)⁻¹ *
(Matrix.of fun a b => T x k a b) * (hessianMatrix u x)⁻¹) i j))
(EuclideanSpace.basisFun (Fin n) ℝ k) ∧
(∀ S : Set (EuclideanSpace ℝ (Fin n)), IsCompact S →
MemLp (fun x => -(((hessianMatrix u x)⁻¹ *
(Matrix.of fun a b => T x k a b) * (hessianMatrix u x)⁻¹) i j)) 2
((volume : Measure (EuclideanSpace ℝ (Fin n))).restrict S)) ∧
∀ S : Set (EuclideanSpace ℝ (Fin n)), IsCompact S →
MemLp (fun x => (hessianMatrix u x)⁻¹ i j) (⊤ : ENNReal)
((volume : Measure (EuclideanSpace ℝ (Fin n))).restrict S)) ∧
(∀ i j : Fin n,
Integrable (fun x => hessianMatrix u x i j)
((volume : Measure (EuclideanSpace ℝ (Fin n))).tilted (-u)) ∧
(∫ x, hessianMatrix u x i j
∂((volume : Measure (EuclideanSpace ℝ (Fin n))).tilted (-u))) =
(1 : Matrix (Fin n) (Fin n) ℝ) i j) ∧
(∀ i j : Fin n,
HasWeakDerivAlong
(fun x => ((hessianMatrix u x)⁻¹ * (Matrix.of fun a b => T x i a b)).trace)
(fun x => -hessianMatrix u x j i +
∑ a : Fin n,
(T x j i a * fderiv ℝ W (gradient u x)
(EuclideanSpace.basisFun (Fin n) ℝ a) +
hessianMatrix u x i a *
∑ b : Fin n, hessianMatrix u x j b * hessianMatrix W (gradient u x) b a))
(EuclideanSpace.basisFun (Fin n) ℝ j) ∧
∀ S : Set (EuclideanSpace ℝ (Fin n)), IsCompact S →
MemLp
(fun x => -hessianMatrix u x j i +
∑ a : Fin n,
(T x j i a * fderiv ℝ W (gradient u x)
(EuclideanSpace.basisFun (Fin n) ℝ a) +
hessianMatrix u x i a *
∑ b : Fin n, hessianMatrix u x j b * hessianMatrix W (gradient u x) b a))
2 ((volume : Measure (EuclideanSpace ℝ (Fin n))).restrict S)) ∧
(let Q := fun x i j => -hessianMatrix u x j i +
∑ a : Fin n,
(T x j i a * fderiv ℝ W (gradient u x)
(EuclideanSpace.basisFun (Fin n) ℝ a) +
hessianMatrix u x i a *
∑ b : Fin n, hessianMatrix u x j b * hessianMatrix W (gradient u x) b a)
let R := fun x => (hessianMatrix u x)⁻¹
let D := fun x k b a => -((R x * (Matrix.of fun c d => T x k c d) * R x) b a)
let J := fun x i j a => ∑ b : Fin n, R x b a * T x b i j
let C := fun x i j => Q x i j -
(∑ a : Fin n, ∑ b : Fin n, T x i a b * D x j b a) +
∑ b : Fin n, T x b i j * (∑ a : Fin n, D x a b a)
∀ i j : Fin n,
(∀ a : Fin n, ∀ S : Set (EuclideanSpace ℝ (Fin n)), IsCompact S →
MemLp (fun x => J x i j a) 2
((volume : Measure (EuclideanSpace ℝ (Fin n))).restrict S)) ∧
LocallyIntegrable (fun x => C x i j)
(volume : Measure (EuclideanSpace ℝ (Fin n))) ∧
∀ ψ : EuclideanSpace ℝ (Fin n) → ℝ,
ContDiff ℝ 1 ψ → HasCompactSupport ψ →
(∫ x, ∑ a : Fin n, J x i j a *
fderiv ℝ ψ x (EuclideanSpace.basisFun (Fin n) ℝ a)
∂(volume : Measure (EuclideanSpace ℝ (Fin n)))) =
-(∫ x, C x i j * ψ x ∂(volume : Measure (EuclideanSpace ℝ (Fin n))))) ∧
( let R := fun x => (hessianMatrix u x)⁻¹
let J := fun x i j a => ∑ b : Fin n, R x b a * T x b i j
let E := fun x i j => -hessianMatrix u x i j +
(hessianMatrix u x * hessianMatrix W (gradient u x) * hessianMatrix u x) i j +
(R x * (Matrix.of fun a b => T x i a b) * R x *
(Matrix.of fun a b => T x j a b)).trace
∀ i j : Fin n,
(∀ a : Fin n, ∀ S : Set (EuclideanSpace ℝ (Fin n)), IsCompact S →
MemLp (fun x => J x i j a) 2
((volume : Measure (EuclideanSpace ℝ (Fin n))).restrict S)) ∧
LocallyIntegrable (fun x => E x i j)
(volume : Measure (EuclideanSpace ℝ (Fin n))) ∧
LocallyIntegrable (fun x => Real.exp (-u x) * E x i j)
(volume : Measure (EuclideanSpace ℝ (Fin n))) ∧
∀ ψ : EuclideanSpace ℝ (Fin n) → ℝ,
ContDiff ℝ 1 ψ → HasCompactSupport ψ →
(∫ x, Real.exp (-u x) * (∑ a : Fin n, J x i j a *
fderiv ℝ ψ x (EuclideanSpace.basisFun (Fin n) ℝ a))
∂(volume : Measure (EuclideanSpace ℝ (Fin n)))) =
-(∫ x, Real.exp (-u x) * E x i j * ψ x
∂(volume : Measure (EuclideanSpace ℝ (Fin n))))) ∧
let R := fun x => (hessianMatrix u x)⁻¹
let J := fun x i j a => ∑ b : Fin n, R x b a * T x b i j
let E := fun x i j => -hessianMatrix u x i j +
(hessianMatrix u x * hessianMatrix W (gradient u x) * hessianMatrix u x) i j +
(R x * (Matrix.of fun a b => T x i a b) * R x *
(Matrix.of fun a b => T x j a b)).trace
∀ ψ : EuclideanSpace ℝ (Fin n) → ℝ,
ContDiff ℝ 1 ψ → HasCompactSupport ψ → ∀ l k i j : Fin n,
(∀ b : Fin n, Integrable (fun x => Real.exp (-u x) * J x i j b * (ψ x * T x b l k + fderiv ℝ ψ x (EuclideanSpace.basisFun (Fin n) ℝ b) * hessianMatrix u x l k))
(volume : Measure (EuclideanSpace ℝ (Fin n)))) ∧
Integrable (fun x => Real.exp (-u x) * E x i j * (ψ x * hessianMatrix u x l k))
(volume : Measure (EuclideanSpace ℝ (Fin n))) ∧
(∫ x, Real.exp (-u x) * (∑ b : Fin n, J x i j b * (ψ x * T x b l k + fderiv ℝ ψ x (EuclideanSpace.basisFun (Fin n) ℝ b) * hessianMatrix u x l k))
∂(volume : Measure (EuclideanSpace ℝ (Fin n)))) =
-(∫ x, Real.exp (-u x) * E x i j * (ψ x * hessianMatrix u x l k)
∂(volume : Measure (EuclideanSpace ℝ (Fin n))))) ∧
∃ c C : ℝ, 0 ≤ C ∧ (∀ x, 1 ≤ u x - c) ∧
let χ := fun R x => Real.smoothTransition (2 - (u x - c) / R)
let Lχ := fun R x => ((hessianMatrix u x)⁻¹ * hessianMatrix (χ R) x).trace -
fderiv ℝ W (gradient u x) (gradient (χ R) x)
(∀ R : ℝ, 1 ≤ R → ContDiff ℝ 1 (χ R) ∧ HasCompactSupport (χ R) ∧
(∃ K : NNReal, LipschitzWith K (gradient (χ R))) ∧
∀ x, 0 ≤ χ R x ∧ χ R x ≤ 1) ∧
(∀ x, MonotoneOn (fun R => χ R x) (Ici 1)) ∧
(∀ x, Tendsto (fun R => χ R x) atTop (𝓝 1)) ∧
(∀ R : ℝ, 1 ≤ R → Integrable (Lχ R)
((volume : Measure (EuclideanSpace ℝ (Fin n))).tilted (-u))) ∧
(∀ R : ℝ, 1 ≤ R → (∫ x, |Lχ R x|
∂((volume : Measure (EuclideanSpace ℝ (Fin n))).tilted (-u))) ≤ C / R) ∧
Tendsto (fun R : ℝ => ∫ x, |Lχ R x|
∂((volume : Measure (EuclideanSpace ℝ (Fin n))).tilted (-u))) atTop (𝓝 0) ∧
∀ r : ℝ, 1 ≤ r → ∀ (η : EuclideanSpace ℝ (Fin n) → ℝ)
(a : Fin n → EuclideanSpace ℝ (Fin n) → ℝ) (Cη : ℝ),
LocallyIntegrable η (volume : Measure (EuclideanSpace ℝ (Fin n))) →
(∀ x, ‖η x‖ ≤ Cη) →
(∀ i : Fin n, HasWeakDerivAlong η (a i) (EuclideanSpace.basisFun (Fin n) ℝ i)) →
(∀ i : Fin n, ∀ S : Set (EuclideanSpace ℝ (Fin n)), IsCompact S →
MemLp (a i) 2 ((volume : Measure (EuclideanSpace ℝ (Fin n))).restrict S)) →
Integrable (fun x => η x * Lχ r x * Real.exp (-u x))
(volume : Measure (EuclideanSpace ℝ (Fin n))) ∧
Integrable (fun x => (∑ i : Fin n, ∑ j : Fin n, (hessianMatrix u x)⁻¹ i j *
a i x * fderiv ℝ (χ r) x (EuclideanSpace.basisFun (Fin n) ℝ j)) * Real.exp (-u x))
(volume : Measure (EuclideanSpace ℝ (Fin n))) ∧
(∫ x, η x * Lχ r x * Real.exp (-u x)
∂(volume : Measure (EuclideanSpace ℝ (Fin n)))) =
-(∫ x, (∑ i : Fin n, ∑ j : Fin n, (hessianMatrix u x)⁻¹ i j *
a i x * fderiv ℝ (χ r) x (EuclideanSpace.basisFun (Fin n) ℝ j)) * Real.exp (-u x)
∂(volume : Measure (EuclideanSpace ℝ (Fin n)))) := by sorry