Existence Of A Suitable Number Of Copies
ProvedFunctionalInequalities.KLS.LogConcave.Suspension.exists_copies_readableThis 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 .
Original Lean declaration header
Within namespace FunctionalInequalities.KLS.LogConcave.Suspension. Shown in its original module context. Proof omitted.
theorem exists_copies {a beta M : ℝ} (ha : 0 < a) (hbeta : 0 ≤ beta) (hM : 0 ≤ M) :
∃ N : ℕ, 0 < N ∧ beta / Real.sqrt N * M ≤ a
Module navigation
Module: KLS/BKL/Suspension/Basic.
Previous: convexOn_potential.
Source excerpt, lines 108–109 · Frozen source 408915f.
import Definitions.Def_KLSModular_FunctionalInequalities_KLS_BKL_Suspension_Basic
theorem FunctionalInequalities.KLS.LogConcave.Suspension.exists_copies_readable {a beta M : ℝ} (ha : 0 < a) (hbeta : 0 ≤ beta) (hM : 0 ≤ M) :
∃ N : ℕ, 0 < N ∧ beta / Real.sqrt N * M ≤ a := by sorry