Lemma 4.2 (p.14, eqs. (21)–(22)) — bridge from lemma_3_1_i
ProvedCritWinSpin.p4b_lemma_4_2_from_lemma_3_1_icritical-windowp2o-v1reductionspin-systems
Assuming the statement of lemma_3_1_i, the full conclusion of Lemma 4.2 (p.14, eqs. (21)–(22)) holds. This isolates the constructions of that section from the prerequisite estimate.
Preamble
import Mathlib import Definitions.Def_CritWinSpin_Wpot import Definitions.Def_CritWinSpin_SpinLaw set_option autoImplicit false
Formal statement
namespace CritWinSpin
/-- Bridge lemma for Lemma 4.2 (p.14, eqs. (21)–(22)): the target conclusion given lemma_3_1_i. -/
theorem p4b_lemma_4_2_from_lemma_3_1_i (S : SpinLaw) (p : ℕ) (hS : IsGHS S) (hp : IsTypeP S p) (hP : ∀ (S : SpinLaw) (hS : IsGHS S), (∃! p : ℕ, IsTypeP S p) ∧
∀ p : ℕ, IsTypeP S p →
0 < kappa S p ∧
(∃ C m₀ : ℝ, 0 < C ∧ 0 < m₀ ∧ ∀ m : ℝ, |m| ≤ m₀ →
|rateI S m - (tau S / 2) * m ^ 2 - kappa S p * m ^ (2 * p)| ≤ C * |m| ^ (2 * p + 2)) ∧
(∃ c : ℝ, 0 < c ∧ ∀ m : ℝ, |m| ≤ 1 →
(tau S / 2) * m ^ 2 + c * m ^ (2 * p) ≤ rateI S m)) :
∃ C : ℝ, 0 < C ∧ ∀ s : ℝ, tau S < s →
(∃! a : ℝ, 0 < a ∧ a = s * deriv (phi S) a) ∧
(0 < asOf S s ∧ asOf S s = s * deriv (phi S) (asOf S s)) ∧
ConvexOn ℝ Set.univ (gs S s) ∧ ContDiff ℝ 1 (gs S s) ∧
(∀ t : ℝ, |t| ≠ asOf S s →
|deriv (phis S s) t| ≤ 1 ∧ |deriv (ds S s) t| ≤ 1 ∧
0 ≤ iteratedDeriv 2 (phis S s) t ∧ iteratedDeriv 2 (phis S s) t ≤ 1 / s) ∧
(∀ t : ℝ, 0 ≤ ds S s t ∧ ds S s t ≤ deltaS S s) ∧
deltaS S s ≤ C * (s - tau S) ^ ((p : ℝ) / ((p : ℝ) - 1)) := 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 4.2 (p.14, eqs. (21)–(22))