Iterate Bounds Imply the Final Criterion
ProvedFunctionalInequalities.KLS.LogConcave.PoissonIterate.le_of_iterate_bounds_modularfunctional-inequalitieskls-conjecturekls-modularlog-concave
This formalizes the final real-sequence argument of Bizeul–Klartag–Lehec (arXiv:2610.05474v1), p. 17, in the operator route.
Let , sequences , and be given. Assume:
- , , and ; , , and .
- For every , .
- , , and .
- and .
- , implies , and implies .
- , for , and the recursion bound from (63) holds whenever and all earlier scales are positive with square at most .
- For every , if whenever , then
Then
This is the scalar terminal estimate that converts the iterate identities, Taylor bounds, and defect recursion into a Poincaré-constant bound.
Superseded upload. This snapshot was replaced by FunctionalInequalities.KLS.LogConcave.PoissonIterate.le_of_iterate_bounds_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_PoissonIterate_Criterion noncomputable section open MeasureTheory Filter Topology Finset open FunctionalInequalities.Analysis.Semigroup FunctionalInequalities.Analysis.BakryEmery open FunctionalInequalities.Analysis.Tensor open scoped ENNReal NNReal RealInnerProductSpace InnerProductSpace ContDiff section namespace FunctionalInequalities end FunctionalInequalities open FunctionalInequalities section namespace FunctionalInequalities.KLS end FunctionalInequalities.KLS open FunctionalInequalities FunctionalInequalities.KLS section namespace FunctionalInequalities.KLS.LogConcave end FunctionalInequalities.KLS.LogConcave open FunctionalInequalities FunctionalInequalities.KLS FunctionalInequalities.KLS.LogConcave section namespace FunctionalInequalities.KLS.LogConcave.PoissonIterate end FunctionalInequalities.KLS.LogConcave.PoissonIterate open FunctionalInequalities FunctionalInequalities.KLS FunctionalInequalities.KLS.LogConcave FunctionalInequalities.KLS.LogConcave.PoissonIterate section Scalar
Formal statement
theorem FunctionalInequalities.KLS.LogConcave.PoissonIterate.le_of_iterate_bounds_modular {C c R : ℝ} {v p χ L α : ℕ → ℝ} {t : ℕ → ℕ → ℝ}
(hC : 0 < C) (hc : 1 ≤ c) (hR : 1 ≤ R)
(hv : ∀ k, 0 ≤ v k) (hv0 : C⁻¹ ≤ v 0) (hvlim : Tendsto v atTop (𝓝 0))
(h36 : ∀ N, v 0 = v N + ∑ k ∈ range N, p k)
(hχ : ∀ k, 0 ≤ χ k) (hχsum : ∀ N, ∑ k ∈ range N, χ k ≤ L 0)
(hL0 : L 0 ≤ (11 / 10 * C⁻¹) ^ 2) (hL : ∀ k, L (k + 1) ≤ L k)
(h46 : ∀ k, L (k + 1) = α k ^ 2 * v (k + 1))
(hα : ∀ k, 0 ≤ α k) (hα0 : ∀ k, α k = 0 → v (k + 1) = 0)
(h32 : ∀ k, 0 < α k → C⁻¹ ≤ α k ^ 2)
(ht : ∀ d k, 0 ≤ t d k)
(htaylor : ∀ d k, 1 ≤ d → t d k ≤ R ^ (2 * d) * v (k + 1))
(hJ1 : ∀ k d, 1 ≤ d → 2 * d ≤ k + 1 → (∀ j < k, 0 < α j ∧ α j ^ 2 ≤ 3 / C) →
t d k ≤ (c / C) ^ d * t (2 * d) (k - d) +
c ^ d * R ^ (2 * d) * C * ∑ j ∈ Ico (k + 1 - 2 * d) k, χ j)
(hJ2 : ∀ N, (∀ j, j + 1 < N → α j ^ 2 ≤ 3 / C) →
∑ k ∈ range N, p k ≤ L 0 + 3 / C * ∑ k ∈ range (N - 1), t 1 k) :
C ≤ 100 * c ^ 2 * R ^ 2 := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/KLS/BKL/PoissonIterate/Criterion.lean#L268-L332 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.KLS.BKL.PoissonIterate.Criterion`, declaration `FunctionalInequalities.KLS.LogConcave.PoissonIterate.le_of_iterate_bounds`; the repository is private at upload time).