Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Globally Lipschitz Patch From Finitely Many Compact Cores

Proved
FunctionalInequalities.Energy.LocalSlope.exists_patch_of_isCompact_readable

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

functional-inequalitieskls-conjecturekls-modularkls-readablelog-concave

This theorem constructs a global Lipschitz patch from finitely many disjoint compact cores.

Let VVV be a normed additive group, let f:V→Rf:V\to\mathbb Rf:V→R be globally LLL-Lipschitz, let α≥0\alpha\ge0α≥0, and let N∈NN\in\mathbb NN∈N. Let Kn⊆VK_n\subseteq VKn​⊆V and cn≥0c_n\ge0cn​≥0 satisfy

  1. every KnK_nKn​ is compact;
  2. distinct Ki,KjK_i,K_jKi​,Kj​ are disjoint;
  3. fff is cnc_ncn​-Lipschitz on KnK_nKn​;
  4. cn≤L+αc_n\le L+\alphacn​≤L+α for every nnn.

Then there exists F:V→RF:V\to\mathbb RF:V→R such that

LipschitzWith⁡(9L+8α,F),\operatorname{LipschitzWith}(9L+8\alpha,F),LipschitzWith(9L+8α,F),

and

∣F(x)−f(x)∣≤2L+2αfor every x,|F(x)-f(x)|\le 2L+2\alpha\quad\text{for every }x,∣F(x)−f(x)∣≤2L+2αfor every x,

while, for every n<Nn<Nn<N and x∈Knx\in K_nx∈Kn​,

F(x)=f(x),AsymptoticLipschitz.apply⁡(F,x)≤cn.F(x)=f(x), \qquad \operatorname{AsymptoticLipschitz.apply}(F,x)\le c_n.F(x)=f(x),AsymptoticLipschitz.apply(F,x)≤cn​.

The declaration is exists_patch_of_isCompact_readable. The constants LLL, α\alphaα, and cnc_ncn​ are nonnegative-real parameters represented by NNReal; the pointwise asymptotic-Lipschitz bound is an ENNReal inequality.

Original Lean declaration header

Within namespace FunctionalInequalities.Energy.LocalSlope. Shown in its original module context. Proof omitted.

theorem exists_patch_of_isCompact {f : V → ℝ} {L : ℝ≥0} (hf : LipschitzWith L f) {α : ℝ≥0}
    (N : ℕ) (Kc : ℕ → Set V) (c : ℕ → ℝ≥0) (hcomp : ∀ n, IsCompact (Kc n))
    (hdisj : ∀ i j, i ≠ j → Disjoint (Kc i) (Kc j))
    (hlipK : ∀ n, LipschitzOnWith (c n) f (Kc n)) (hcle : ∀ n, c n ≤ L + α) :
    ∃ F : V → ℝ, LipschitzWith (9 * L + 8 * α) F ∧
      (∀ x, |F x - f x| ≤ 2 * (L : ℝ) + 2 * (α : ℝ)) ∧
      (∀ n < N, ∀ x ∈ Kc n, F x = f x) ∧
      (∀ n < N, ∀ x ∈ Kc n, AsymptoticLipschitz.apply F x ≤ (c n : ℝ≥0∞))

Module navigation

Module: Energy/Euclidean/Slope/Density.

Definition modules: Energy/LocalSlope/Relaxation.

Supporting theorems: exists_thickening_pairwise_disjoint.

Previous: exists_thickening_pairwise_disjoint · Next: exists_partition.

Source excerpt, lines 171–178 · Frozen source 408915f.

Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Energy_Euclidean_Slope_Density

open scoped ENNReal NNReal ContDiff
universe u
variable {V : Type u} [NormedAddCommGroup V] [InnerProductSpace ℝ V]
omit [InnerProductSpace ℝ V]
Formal statement

theorem FunctionalInequalities.Energy.LocalSlope.exists_patch_of_isCompact_readable {f : V → ℝ} {L : ℝ≥0} (hf : LipschitzWith L f) {α : ℝ≥0}
    (N : ℕ) (Kc : ℕ → Set V) (c : ℕ → ℝ≥0) (hcomp : ∀ n, IsCompact (Kc n))
    (hdisj : ∀ i j, i ≠ j → Disjoint (Kc i) (Kc j))
    (hlipK : ∀ n, LipschitzOnWith (c n) f (Kc n)) (hcle : ∀ n, c n ≤ L + α) :
    ∃ F : V → ℝ, LipschitzWith (9 * L + 8 * α) F ∧
      (∀ x, |F x - f x| ≤ 2 * (L : ℝ) + 2 * (α : ℝ)) ∧
      (∀ n < N, ∀ x ∈ Kc n, F x = f x) ∧
      (∀ n < N, ∀ x ∈ Kc n, AsymptoticLipschitz.apply F x ≤ (c n : ℝ≥0∞)) := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Energy/Euclidean/Slope/Density.lean#L166-L548 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Energy.Euclidean.Slope.Density`, declaration `FunctionalInequalities.Energy.LocalSlope.exists_patch_of_isCompact`; 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