Taylor-Field Recursion With Explicit Constants
ProvedFunctionalInequalities.KLS.LogConcave.PoissonIterate.norm_taylorField_grad0_iter_sq_le_modularThis formalizes Lemma 3.8 of Bizeul–Klartag–Lehec (arXiv:2610.05474v1), Lemma 3.8, p. 15, in its route form.
Let be a finite-dimensional real inner-product space with the stated complete, measurable, Borel, and second-countable structures. Let be a log-concave probability measure on , let be an additive Haar measure, and assume that the interior of the support of is nonempty. Let have temperate growth, assume
and assume that every exponential moment is integrable. Let be a nonnegative-real parameter satisfying and .
Assume the Taylor bound that, for every and every integer ,
where taylorField and the coordinate tensor are taken in the standard orthonormal basis. Let lie in the domain of the adjoint composition of the closed weighted gradient. For integers , assume , , and, for every ,
where is the corresponding scale of the Poisson iterate.
Then, with defect denoting the iterate defect,
This is a technical recursive estimate used to control Taylor fields of Poisson iterates and to feed the later Taylor-coefficient criterion. The explicit constant is part of the statement, rather than an unspecified universal constant.
Formalization Note. The Poincaré constant is compared with the coercion of a NNReal into ; the displayed inequalities are real-valued. The sum is over Finset.Ico, and the indices and iterates are those represented by taylorField, grad0, iter, scale, and defect.
Superseded upload. This snapshot was replaced by FunctionalInequalities.KLS.LogConcave.PoissonIterate.norm_taylorField_grad0_iter_sq_le_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.
import Definitions.Def_KLSModular_FunctionalInequalities_KLS_BKL_PoissonIterate_TaylorRecursion
noncomputable section
open MeasureTheory Finset
open FunctionalInequalities.Analysis.Semigroup FunctionalInequalities.Analysis.BakryEmery
open FunctionalInequalities.Analysis.Tensor
open scoped 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 HeatModel
variable {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [CompleteSpace V]
[MeasurableSpace V] [BorelSpace V] [SecondCountableTopology V] [FiniteDimensional ℝ V]
{ν : ProbabilityMeasure V} (m : Measure V) [m.IsAddHaarMeasure] (hν : LogConcave ν)
(hi : (interior (ν : Measure V).support).Nonempty) {U : V → ℝ}
(hνU : (ν : Measure V) = m.tilted (-U)) (hUt : U.HasTemperateGrowth)
(hexp : ∀ r : ℝ, Integrable (fun x => Real.exp (r * ‖x‖)) (ν : Measure V))
{C : NNReal} (hC : Poincare.LocalSlope.Intrinsic.constant ν ≤ (C : ENNReal))
local notation "T̄" => hν.closedWeightedOperator m (ContinuousLinearMap.id ℝ V) hi
include hνU hUt hexp hC
theorem FunctionalInequalities.KLS.LogConcave.PoissonIterate.norm_taylorField_grad0_iter_sq_le_modular (hCpos : 0 < C) {R : ℝ}
(h29 : ∀ (u : Lp ℝ 2 (ν : Measure V)) (d : ℕ), 1 ≤ d →
‖coordTensor (stdOrthonormalBasis ℝ V) (taylorTensor (ν : Measure V) (⇑u) d)‖ ≤
R ^ d * ‖u‖)
{f : Lp ℝ 2 (ν : Measure V)} (hf : f ∈ (adjointComp T̄).domain) {β : ℝ} (k d : ℕ)
(hd : 1 ≤ d) (hdk : 2 * d ≤ k + 1)
(hα : ∀ j < k, 0 < scale T̄ (iter T̄ f j) ∧ scale T̄ (iter T̄ f j) ^ 2 ≤ β / C) :
‖taylorField d (grad0 T̄ (iter T̄ f k))‖ ^ 2 ≤
(2 ^ 20 * max 1 β ^ 2 / C) ^ d *
‖taylorField (2 * d) (grad0 T̄ (iter T̄ f (k - d)))‖ ^ 2 +
(2 ^ 20 * max 1 β ^ 2) ^ d * R ^ (2 * d) * C *
∑ j ∈ Finset.Ico (k + 1 - 2 * d) k, defect T̄ (iter T̄ f j) := by sorry