Lemma 3.1(i) — global lower
ProvedCritWinSpin.p3a_global_lowercritical-windowcumulantsp2o-v1spin-systems
There is c > 0 such that I(m) ≥ (τ/2)m² + c m²ᵖ for every m ∈ [−1,1]; this is eq. (11) of the manuscript.
Preamble
import Mathlib import Definitions.Def_CritWinSpin_SpinLaw set_option autoImplicit false
Formal statement
namespace CritWinSpin
/-- Lemma 3.1(i), the global lower bound (11). -/
theorem p3a_global_lower (S : SpinLaw) (hS : IsGHS S) (p : ℕ) (hp : IsTypeP S p) :
∃ c : ℝ, 0 < c ∧ ∀ m : ℝ, |m| ≤ 1 →
(tau S / 2) * m ^ 2 + c * m ^ (2 * p) ≤ rateI S m := by sorry
end CritWinSpin
Source
Liu, Zhang, Ren, The Critical Window for Sampling and Learning-to-Sample in Spin Systems, STOC 2027 submission (manuscript sha256 f77584da…), Lemma 3.1(i), p.11, eqs. (1) and (11)