Scalar Absorption by the Cumulant Envelope
ProvedFunctionalInequalities.KLS.BKL.absorption_le_envelope_modularbkl2026functional-inequalitieskls-conjecturekls-modularlog-concave
This formalizes the scalar absorption estimate after BKL (106), p. 27.
Let satisfy , , and . For an integer , let
Then
This is an arithmetic estimate only; it does not assert a cumulant bound or complete the induction by itself.
Superseded upload. This snapshot was replaced by FunctionalInequalities.KLS.BKL.absorption_le_envelope_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_KLS_BKL_CumulantEnvelope noncomputable section section namespace FunctionalInequalities end FunctionalInequalities open FunctionalInequalities section namespace FunctionalInequalities.KLS end FunctionalInequalities.KLS open FunctionalInequalities FunctionalInequalities.KLS section namespace FunctionalInequalities.KLS.BKL end FunctionalInequalities.KLS.BKL open FunctionalInequalities FunctionalInequalities.KLS FunctionalInequalities.KLS.BKL
Formal statement
theorem FunctionalInequalities.KLS.BKL.absorption_le_envelope_modular {K C : ℝ} (hC : 0 ≤ C) (hK9 : 9 * C ≤ K) (hK64 : 64 ≤ K)
{m : ℕ} (hm : 3 ≤ m) :
2 * C * (m : ℝ) ^ 2 * envelope K (m - 1) +
4 * ((m - 3 : ℕ) : ℝ) * Real.sqrt (envelope K (m - 1) * envelope K m) ≤
envelope K m := by sorry
Source
Source: Bizeul–Klartag–Lehec, Presenting a proof of the Kannan–Lovász–Simonovits conjecture (arXiv:2610.05474v1), Theorem 4.1, p. 18. Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/KLS/BKL/CumulantEnvelope.lean#L129-L242 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.KLS.BKL.CumulantEnvelope`, declaration `FunctionalInequalities.KLS.BKL.absorption_le_envelope`; the repository is private at upload time).