Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Scaled Weak Inverse-Hessian Height Cutoffs

Proved
FunctionalInequalities.Analysis.exists_scaled_weak_inverse_hessian_cutoffs_modular

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

functional-inequalitieskls-conjecturekls-modularletwin2026log-concave

This is the weak C1C^1C1 cutoff construction associated with Lemma A.4 of Letwin (arXiv:2607.24164v1), and is used in the proof architecture surrounding Theorem 2.5.

Let u,V:Rn→Ru,V:\mathbb R^n\to\mathbb Ru,V:Rn→R satisfy the stated C1C^1C1 regularity, Lipschitzness of uuu and ∇u\nabla u∇u, Lipschitzness of −u+V∘∇u-u+V\circ\nabla u−u+V∘∇u, the a.e. Monge–Ampère identity, and a.e. positive definiteness of ∇2u\nabla^2u∇2u. Assume uuu is convex and normalized by ∫e−u=1\int e^{-u}=1∫e−u=1.

Then there exist c,C∈Rc,C\in\mathbb Rc,C∈R with C≥0C\ge0C≥0 and u(x)−c≥1u(x)-c\ge1u(x)−c≥1 for every xxx such that, writing

χR(x)=smoothTransition⁡(2−u(x)−cR),\chi_R(x)=\operatorname{smoothTransition}\left(2-\frac{u(x)-c}{R}\right),χR​(x)=smoothTransition(2−Ru(x)−c​),

and

LχR=tr⁡((∇2u)−1∇2χR)−∇V(∇u)⋅∇χR,L\chi_R=\operatorname{tr}\bigl((\nabla^2u)^{-1}\nabla^2\chi_R\bigr)-\nabla V(\nabla u)\cdot\nabla\chi_R,LχR​=tr((∇2u)−1∇2χR​)−∇V(∇u)⋅∇χR​,

for every R≥1R\ge1R≥1, χR\chi_RχR​ is C1C^1C1, compactly supported, has a Lipschitz gradient, and satisfies 0≤χR≤10\le\chi_R\le10≤χR​≤1. For each xxx, R↦χR(x)R\mapsto\chi_R(x)R↦χR​(x) is monotone on [1,∞)[1,\infty)[1,∞) and tends to 111. Moreover, LχRL\chi_RLχR​ is integrable with respect to the tilted measure e−udxe^{-u}dxe−udx, and

∫∣LχR∣ d(e−udx)≤CR.\int |L\chi_R|\,d(e^{-u}dx)\le\frac{C}{R}.∫∣LχR​∣d(e−udx)≤RC​.

The same integral tends to 000 as R→∞R\to\inftyR→∞. This is an existence statement for a cutoff family, not an estimate for arbitrary cutoffs.

Superseded upload. This snapshot was replaced by FunctionalInequalities.Analysis.exists_scaled_weak_inverse_hessian_cutoffs_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_Analysis_BakryEmery_IntegrationByParts_InverseHessian_WeakCutoff

noncomputable section
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
Formal statement

theorem FunctionalInequalities.Analysis.exists_scaled_weak_inverse_hessian_cutoffs_modular {n : ℕ}
    {u V : EuclideanSpace ℝ (Fin n) → ℝ} {L G LF : NNReal}
    (hu : ContDiff ℝ 1 u) (hL : LipschitzWith L u) (hG : LipschitzWith G (gradient u))
    (hV : ContDiff ℝ 1 V)
    (hF : LipschitzWith LF (fun x => -u x + V (gradient u x)))
    (hdet : ∀ᵐ x ∂(volume : Measure (EuclideanSpace ℝ (Fin n))),
      (hessianMatrix u x).det = Real.exp (-u x + V (gradient u x)))
    (hPD : ∀ᵐ x ∂(volume : Measure (EuclideanSpace ℝ (Fin n))), (hessianMatrix u x).PosDef)
    (hconv : ConvexOn ℝ univ u)
    (hnorm : ∫ x, Real.exp (-u x) ∂(volume : Measure (EuclideanSpace ℝ (Fin n))) = 1) :
    ∃ 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 ℝ V (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) := by sorry
Source
Source: Letwin, The KLS constant is O(log^(1/4) n) (arXiv:2607.24164v1), Theorem 2.5. Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/BakryEmery/IntegrationByParts/InverseHessian/WeakCutoff.lean#L772-L838 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.BakryEmery.IntegrationByParts.InverseHessian.WeakCutoff`, declaration `FunctionalInequalities.Analysis.exists_scaled_weak_inverse_hessian_cutoffs`; 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me