Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Squared Gradient Bound for a Scaled Cutoff Product

Proved
FunctionalInequalities.Poincare.SmoothTest.norm_gradient_scaled_mul_sq_le_readable

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

functional-inequalitieskls-conjecturekls-modularkls-readablelog-concave

This is a pointwise estimate for the gradient of a function multiplied by the designated scaled cutoff.

Let EEE be a finite-dimensional complete real inner product space. Denote the fixed bump Energy.Euclidean.LipschitzApproximation.bump by β\betaβ, and its scaled cutoff Energy.Euclidean.LipschitzApproximation.scaled R by χR\chi_RχR​. Assume:

  1. R,M∈RR,M\in\mathbb RR,M∈R and R>0R>0R>0.
  2. ∥Dβ(y)∥≤M\|D\beta(y)\|\le M∥Dβ(y)∥≤M for every y∈Ey\in Ey∈E, where the norm is the operator norm of the Fréchet derivative.
  3. f:E→Rf:E\to\mathbb Rf:E→R is differentiable at x∈Ex\in Ex∈E.

Then

∥∇(χRf)(x)∥2≤2∥∇f(x)∥2+2(M/R)2f(x)2.\|\nabla(\chi_R f)(x)\|^2 \le 2\|\nabla f(x)\|^2+2(M/R)^2 f(x)^2.∥∇(χR​f)(x)∥2≤2∥∇f(x)∥2+2(M/R)2f(x)2.

This technical estimate controls the energy contribution introduced by cutoff multiplication. It requires no measure or global differentiability assumption on fff.

Original Lean declaration header

Within namespace FunctionalInequalities.Poincare.SmoothTest. Shown in its original module context. Proof omitted.

theorem norm_gradient_scaled_mul_sq_le {R M : ℝ} (hR : 0 < R)
    (hM : ∀ x : E, ‖fderiv ℝ (⇑(Energy.Euclidean.LipschitzApproximation.bump (E := E))) x‖ ≤ M)
    {f : E → ℝ} {x : E} (hf : DifferentiableAt ℝ f x) :
    ‖gradient (fun y => Energy.Euclidean.LipschitzApproximation.scaled R y * f y) x‖ ^ 2 ≤
      2 * ‖gradient f x‖ ^ 2 + 2 * (M / R) ^ 2 * f x ^ 2

Module navigation

Module: Poincare/SmoothTest/WeakLimit.

Definition modules: Analysis/Cutoff/SmoothBall.

Previous: tendsto_integral_scaled_mul · Next: tendsto_energy_scaled_mul.

Source excerpt, lines 343–347 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Poincare_SmoothTest_WeakLimit

variable {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E] [CompleteSpace E]
  [MeasurableSpace E] [BorelSpace E]
variable [FiniteDimensional ℝ E]
omit [MeasurableSpace E] [BorelSpace E]
Formal statement

theorem FunctionalInequalities.Poincare.SmoothTest.norm_gradient_scaled_mul_sq_le_readable {R M : ℝ} (hR : 0 < R)
    (hM : ∀ x : E, ‖fderiv ℝ (⇑(Energy.Euclidean.LipschitzApproximation.bump (E := E))) x‖ ≤ M)
    {f : E → ℝ} {x : E} (hf : DifferentiableAt ℝ f x) :
    ‖gradient (fun y => Energy.Euclidean.LipschitzApproximation.scaled R y * f y) x‖ ^ 2 ≤
      2 * ‖gradient f x‖ ^ 2 + 2 * (M / R) ^ 2 * f x ^ 2 := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Poincare/SmoothTest/WeakLimit.lean#L341-L419 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Poincare.SmoothTest.WeakLimit`, declaration `FunctionalInequalities.Poincare.SmoothTest.norm_gradient_scaled_mul_sq_le`; 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