Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Variance Bound From Partial Dual Estimates

Proved
FunctionalInequalities.KLS.LogConcave.variance_le_sum_of_partial_dual_bounds_readable

by Lazyfill · Oct 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

functional-inequalitieskls-conjecturekls-modularkls-readableletwin2026log-concave

This formalizes the H−1H^{-1}H−1 variance inequality of Letwin (arXiv:2607.24164v1) (Proposition 2.8, partial relation).

Let n∈Nn\in\mathbb Nn∈N, let mmm be an additive Haar measure on E=EuclideanSpace⁡(R,Fin⁡(n))E=\operatorname{EuclideanSpace}(\mathbb R,\operatorname{Fin}(n))E=EuclideanSpace(R,Fin(n)), and let ν\nuν be log-concave with

ν=m.tilted⁡(−W).\nu=m.\operatorname{tilted}(-W).ν=m.tilted(−W).

Assume:

  1. WWW is C2C^2C2 and convex on all of EEE.
  2. f:E→Rf:E\to\mathbb Rf:E→R is C1C^1C1 and belongs to L2(ν)L^2(\nu)L2(ν).
  3. Every coordinate derivative x↦Df(x)[ei]x\mapsto Df(x)[e_i]x↦Df(x)[ei​] belongs to L2(ν)L^2(\nu)L2(ν), where ei=single⁡(i,1)e_i=\operatorname{single}(i,1)ei​=single(i,1).
  4. For each iii and every smooth compactly supported hhh,
(∫EDf(x)[ei]h(x) dν(x))2≤Ki∫E∥Dh(x)∥2 dν(x).\left(\int_E Df(x)[e_i]h(x)\,d\nu(x)\right)^2 \le K_i\int_E\|Dh(x)\|^2\,d\nu(x).(∫E​Df(x)[ei​]h(x)dν(x))2≤Ki​∫E​∥Dh(x)∥2dν(x).

Then

Var⁡ν(f)≤∑i=1nKi.\operatorname{Var}_\nu(f)\le\sum_{i=1}^n K_i.Varν​(f)≤i=1∑n​Ki​.

The theorem is finite-dimensional and retains the explicit C2C^2C2 convexity, L2L^2L2, and coordinate-derivative hypotheses. It is a variance assembly result from the separate compact-test dual bounds.

Original Lean declaration header

Within namespace FunctionalInequalities.KLS.LogConcave. Shown in its original module context. Proof omitted.

theorem variance_le_sum_of_partial_dual_bounds {n : ℕ}
    (m : Measure (EuclideanSpace ℝ (Fin n))) [m.IsAddHaarMeasure]
    {ν : ProbabilityMeasure (EuclideanSpace ℝ (Fin n))} (hν : FunctionalInequalities.KLS.LogConcave ν)
    {W : EuclideanSpace ℝ (Fin n) → ℝ} (hνW : (ν : Measure _) = m.tilted (-W))
    (hW : ContDiff ℝ 2 W) (hWc : ConvexOn ℝ Set.univ W)
    {f : EuclideanSpace ℝ (Fin n) → ℝ} (hf : ContDiff ℝ 1 f) (hf2 : MemLp f 2 (ν : Measure _))
    (hdf2 : ∀ i, MemLp (fun x => fderiv ℝ f x (EuclideanSpace.single i 1)) 2 (ν : Measure _))
    (K : Fin n → ℝ)
    (hK : ∀ i (h : EuclideanSpace ℝ (Fin n) → ℝ), ContDiff ℝ ∞ h → HasCompactSupport h →
      (∫ x, fderiv ℝ f x (EuclideanSpace.single i 1) * h x ∂(ν : Measure _)) ^ 2 ≤
        K i * ∫ x, ‖fderiv ℝ h x‖ ^ 2 ∂(ν : Measure _)) :
    variance f (ν : Measure _) ≤ ∑ i, K i

Module navigation

Module: KLS/LogConcave/HminusOne.

Definition modules: Probability/LogConcave.

Selected supporting theorems: sum_integral_norm_fderiv_partial_sq_le_integral_weightedLaplacian_sq, centered_mem_closure_compactSmoothDiffusionImage, compact_pairing_identity, inner_center_left_of_mean_zero, nonneg_of_forall_sq_integral_le_mul_integral_norm_fderiv_sq.

Previous: sum_integral_norm_fderiv_partial_sq_le_integral_weightedLaplacian_sq.

Source excerpt, lines 456–467 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_KLS_LogConcave_HminusOne

open MeasureTheory
open scoped ContDiff
open ProbabilityTheory InnerProductSpace
Formal statement

theorem FunctionalInequalities.KLS.LogConcave.variance_le_sum_of_partial_dual_bounds_readable {n : ℕ}
    (m : Measure (EuclideanSpace ℝ (Fin n))) [m.IsAddHaarMeasure]
    {ν : ProbabilityMeasure (EuclideanSpace ℝ (Fin n))} (hν : FunctionalInequalities.KLS.LogConcave ν)
    {W : EuclideanSpace ℝ (Fin n) → ℝ} (hνW : (ν : Measure _) = m.tilted (-W))
    (hW : ContDiff ℝ 2 W) (hWc : ConvexOn ℝ Set.univ W)
    {f : EuclideanSpace ℝ (Fin n) → ℝ} (hf : ContDiff ℝ 1 f) (hf2 : MemLp f 2 (ν : Measure _))
    (hdf2 : ∀ i, MemLp (fun x => fderiv ℝ f x (EuclideanSpace.single i 1)) 2 (ν : Measure _))
    (K : Fin n → ℝ)
    (hK : ∀ i (h : EuclideanSpace ℝ (Fin n) → ℝ), ContDiff ℝ ∞ h → HasCompactSupport h →
      (∫ x, fderiv ℝ f x (EuclideanSpace.single i 1) * h x ∂(ν : Measure _)) ^ 2 ≤
        K i * ∫ x, ‖fderiv ℝ h x‖ ^ 2 ∂(ν : Measure _)) :
    variance f (ν : Measure _) ≤ ∑ i, K i := by sorry
Source
Source: Letwin, The KLS constant is O(log^(1/4) n) (arXiv:2607.24164v1), Proposition 2.8 (Barthe and Klartag [7, Proposition 10]). Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/KLS/LogConcave/HminusOne.lean#L450-L631 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.KLS.LogConcave.HminusOne`, declaration `FunctionalInequalities.KLS.LogConcave.variance_le_sum_of_partial_dual_bounds`; the repository is private at upload time).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me