Smooth Two-Scale Cutoff Profile
ProvedFunctionalInequalities.Analysis.smoothTransition_two_sub_cutoff_readablefunctional-inequalitieskls-conjecturekls-modularkls-readableletwin2026log-concave
This formalizes the scalar part of Lemma A.4 of Letwin (arXiv:2607.24164v1), with a stronger standalone profile statement.
Define . Then is smooth and antitone, satisfies , equals for , and equals for . If or , then . Both and have compact support, and there exists such that
This is reusable scalar cutoff infrastructure; it does not construct the paper’s full generator estimates.
Original Lean declaration header
Within namespace FunctionalInequalities.Analysis. Shown in its original module context. Proof omitted.
theorem smoothTransition_two_sub_cutoff :
ContDiff ℝ ∞ (fun s : ℝ => Real.smoothTransition (2 - s)) ∧ Antitone (fun s : ℝ => Real.smoothTransition (2 - s)) ∧
(∀ t : ℝ, 0 ≤ Real.smoothTransition (2 - t) ∧ Real.smoothTransition (2 - t) ≤ 1) ∧
(∀ t : ℝ, t ≤ 1 → Real.smoothTransition (2 - t) = 1) ∧
(∀ t : ℝ, 2 ≤ t → Real.smoothTransition (2 - t) = 0) ∧
(∀ t : ℝ, t < 1 ∨ 2 < t →
deriv (fun s : ℝ => Real.smoothTransition (2 - s)) t = 0 ∧ deriv (deriv (fun s : ℝ => Real.smoothTransition (2 - s))) t = 0) ∧
HasCompactSupport (deriv (fun s : ℝ => Real.smoothTransition (2 - s))) ∧
HasCompactSupport (deriv (deriv (fun s : ℝ => Real.smoothTransition (2 - s)))) ∧
∃ B : ℝ, 0 ≤ B ∧ ∀ t : ℝ,
|deriv (fun s : ℝ => Real.smoothTransition (2 - s)) t| ≤ B ∧ |deriv (deriv (fun s : ℝ => Real.smoothTransition (2 - s))) t| ≤ B
Module navigation
Module: Analysis/Cutoff/Profile.
Next: exists_majorant_abs_deriv_deriv_smoothTransition_two_sub.
Source excerpt, lines 35–45 · Frozen source 408915f.
Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_Cutoff_Profile open scoped ContDiff
Formal statement
theorem FunctionalInequalities.Analysis.smoothTransition_two_sub_cutoff_readable :
ContDiff ℝ ∞ (fun s : ℝ => Real.smoothTransition (2 - s)) ∧ Antitone (fun s : ℝ => Real.smoothTransition (2 - s)) ∧
(∀ t : ℝ, 0 ≤ Real.smoothTransition (2 - t) ∧ Real.smoothTransition (2 - t) ≤ 1) ∧
(∀ t : ℝ, t ≤ 1 → Real.smoothTransition (2 - t) = 1) ∧
(∀ t : ℝ, 2 ≤ t → Real.smoothTransition (2 - t) = 0) ∧
(∀ t : ℝ, t < 1 ∨ 2 < t →
deriv (fun s : ℝ => Real.smoothTransition (2 - s)) t = 0 ∧ deriv (deriv (fun s : ℝ => Real.smoothTransition (2 - s))) t = 0) ∧
HasCompactSupport (deriv (fun s : ℝ => Real.smoothTransition (2 - s))) ∧
HasCompactSupport (deriv (deriv (fun s : ℝ => Real.smoothTransition (2 - s)))) ∧
∃ B : ℝ, 0 ≤ B ∧ ∀ t : ℝ,
|deriv (fun s : ℝ => Real.smoothTransition (2 - s)) t| ≤ B ∧ |deriv (deriv (fun s : ℝ => Real.smoothTransition (2 - s))) t| ≤ B := by sorry
Source
Source: Letwin, The KLS constant is O(log^(1/4) n) (arXiv:2607.24164v1), Lemma A.4. Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Analysis/Cutoff/Profile.lean#L32-L122 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Analysis.Cutoff.Profile`, declaration `FunctionalInequalities.Analysis.smoothTransition_two_sub_cutoff`; the repository is private at upload time).