Squared Dual Pairing Bound from a Source Identity
ProvedFunctionalInequalities.Probability.Stein.compact_linear_pairing_sq_le_of_source_identity_modularfunctional-inequalitieskls-conjecturekls-modularletwin2026log-concave
This statement gives a squared dual pairing estimate from a latent source identity.
Let be a measurable space with measure , let be a probability measure on , and let . Assume:
- is measurable and
map Z P = μ; - ;
- and is smooth with compact support;
- the source identity holds:
Then
Here the derivative norm is expressed in Lean as ‖fderiv ℝ h x‖. The result is a general latent-space Cauchy–Schwarz bound and does not assume that is invertible.
Superseded upload. This snapshot was replaced by FunctionalInequalities.Probability.Stein.compact_linear_pairing_sq_le_of_source_identity_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_Probability_Stein_SourceDualBound open MeasureTheory Filter open FunctionalInequalities.Analysis.BakryEmery open scoped RealInnerProductSpace Topology ContDiff section CompactSourceDualBound open MeasureTheory Filter open FunctionalInequalities.Analysis.BakryEmery 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.compact_linear_pairing_sq_le_of_source_identity_modular
{Ω : Type*} [MeasurableSpace Ω] {n : ℕ}
(P : Measure Ω) (mu : ProbabilityMeasure (EuclideanSpace ℝ (Fin n)))
(Z F : Ω → EuclideanSpace ℝ (Fin n)) (hZ : Measurable Z)
(hmap : P.map Z = (mu : Measure (EuclideanSpace ℝ (Fin n))))
(hF : MemLp F 2 P) (v : EuclideanSpace ℝ (Fin n))
(h : EuclideanSpace ℝ (Fin n) → ℝ) (hh : ContDiff ℝ ∞ h) (hhc : HasCompactSupport h)
(hid : (∫ x, ⟪x, v⟫ * h x ∂(mu : Measure (EuclideanSpace ℝ (Fin n)))) =
∫ w, ⟪F w, gradient h (Z w)⟫ ∂P) :
(∫ x, ⟪x, v⟫ * h x ∂(mu : Measure (EuclideanSpace ℝ (Fin n)))) ^ 2 ≤
(∫ w, ‖F w‖ ^ 2 ∂P) *
∫ x, ‖fderiv ℝ h x‖ ^ 2 ∂(mu : Measure (EuclideanSpace ℝ (Fin n))) := by sorry
Source
Source: Letwin, The KLS constant is O(log^(1/4) n) (arXiv:2607.24164v1), Lemma 2.9. Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Probability/Stein/SourceDualBound.lean#L22-L63 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Probability.Stein.SourceDualBound`, declaration `FunctionalInequalities.Probability.Stein.compact_linear_pairing_sq_le_of_source_identity`; the repository is private at upload time).