Existence Of A Suitable Number Of Copies
ProvedFunctionalInequalities.KLS.LogConcave.Suspension.exists_copies_modularThis statement formalizes the numerical choice of the number of copies in the suspension construction.
Let satisfy
Then there exists an integer such that
The result guarantees a positive finite copy number for any positive curvature parameter and finite nonnegative Hessian bound. It is the numerical existence component of the suspension convexity condition.
Formalization Note. The square root uses the real coercion of ; the conclusion does not specify a particular choice of .
Superseded upload. This snapshot was replaced by FunctionalInequalities.KLS.LogConcave.Suspension.exists_copies_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_Suspension_Basic
noncomputable section
open scoped ContDiff
open FunctionalInequalities.Analysis.BakryEmery
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.Suspension
end FunctionalInequalities.KLS.LogConcave.Suspension
open FunctionalInequalities FunctionalInequalities.KLS FunctionalInequalities.KLS.LogConcave FunctionalInequalities.KLS.LogConcave.Suspension
variable {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
theorem FunctionalInequalities.KLS.LogConcave.Suspension.exists_copies_modular {a beta M : ℝ} (ha : 0 < a) (hbeta : 0 ≤ beta) (hM : 0 ≤ M) :
∃ N : ℕ, 0 < N ∧ beta / Real.sqrt N * M ≤ a := by sorry