Dyadic Recursion Estimate
ProvedFunctionalInequalities.KLS.LogConcave.PoissonIterate.recursion_modularfunctional-inequalitieskls-conjecturekls-modularlog-concave
This private technical lemma establishes the recursion used in the operator-route criterion.
Let and let and . Assume:
- , , , and .
- and for every .
- Every partial sum of is at most , and .
- Whenever , and .
- , , and, whenever and the preceding scale bounds hold,
Then
This is a neutral auxiliary estimate that packages the finite-index decomposition into the indices where the Taylor recursion applies and the at most remaining indices.
Superseded upload. This snapshot was replaced by FunctionalInequalities.KLS.LogConcave.PoissonIterate.recursion_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.recursion_modular {C c R : ℝ} {v χ L α : ℕ → ℝ} {t : ℕ → ℕ → ℝ} {N d : ℕ}
(hC : 0 < C) (hc : 1 ≤ c) (hR : 1 ≤ R) (hd : 1 ≤ d)
(hvk : ∀ k, v (k + 1) ≤ 121 / 100 * C⁻¹)
(hχ : ∀ k, 0 ≤ χ k) (hχsum : ∀ N, ∑ k ∈ range N, χ k ≤ L 0)
(hL0 : L 0 ≤ (11 / 10 * C⁻¹) ^ 2)
(hαN : ∀ j, j + 1 < N → 0 < α j ∧ α j ^ 2 ≤ 3 / C)
(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) :
∑ k ∈ range (N - d), t d k ≤
(c / C) ^ d * ∑ k ∈ range (N - 2 * d), t (2 * d) k +
5 * d * c ^ d * C⁻¹ * R ^ (2 * d) := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/KLS/BKL/PoissonIterate/Criterion.lean#L147-L232 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.KLS.BKL.PoissonIterate.Criterion`, declaration `_private.FunctionalInequalities.KLS.BKL.PoissonIterate.Criterion.0.FunctionalInequalities.KLS.LogConcave.PoissonIterate.recursion`; the repository is private at upload time).