Squared Dual Pairing Bound from a Source Identity
ProvedFunctionalInequalities.Probability.Stein.compact_linear_pairing_sq_le_of_source_identity_readablefunctional-inequalitieskls-conjecturekls-modularkls-readableletwin2026log-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.
Original Lean declaration header
Within namespace FunctionalInequalities.Probability.Stein. Shown in its original module context. Proof omitted.
theorem compact_linear_pairing_sq_le_of_source_identity
{Ω : 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)))
Module navigation
Module: Probability/Stein/SourceDualBound.
Source excerpt, lines 26–37 · Frozen source 408915f.
Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Probability_Stein_SourceDualBound open MeasureTheory Filter open scoped ContDiff Topology RealInnerProductSpace set_option maxHeartbeats 400000
Formal statement
theorem FunctionalInequalities.Probability.Stein.compact_linear_pairing_sq_le_of_source_identity_readable
{Ω : 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).