Lemma 6.2 (p.22, eqs. (32)–(33)) — bridge from lemma_3_1_ii
ProvedCritWinSpin.p6c_lemma_6_2_from_lemma_3_1_iicritical-windowp2o-v1reductionspin-systems
Assuming the statement of lemma_3_1_ii, the full conclusion of Lemma 6.2 (p.22, eqs. (32)–(33)) holds. This isolates the constructions of that section from the prerequisite estimate.
Preamble
import Mathlib import Definitions.Def_CritWinSpin_nuPm import Definitions.Def_CritWinSpin_SpinLaw set_option autoImplicit false
Formal statement
namespace CritWinSpin
/-- Bridge lemma for Lemma 6.2 (p.22, eqs. (32)–(33)): the target conclusion given lemma_3_1_ii. -/
theorem p6c_lemma_6_2_from_lemma_3_1_ii (S : SpinLaw) (p : ℕ) (hS : IsGHS S) (hp : IsTypeP S p) (hP : ∀ (S : SpinLaw) (p : ℕ) (hS : IsGHS S) (hp : IsTypeP S p), ∃ θ₀ c C : ℝ, 0 < θ₀ ∧ 0 < c ∧ 0 < C ∧ ∀ θ : ℝ, 0 < θ → θ ≤ θ₀ →
∃ u : ℝ, (0 < u ∧ u < 1 ∧ u = deriv (phi S) ((tau S + θ) * u)) ∧
(∀ u' : ℝ, 0 < u' → u' < 1 → u' = deriv (phi S) ((tau S + θ) * u') → u' = u) ∧
c * θ ^ (1 / (2 * (p : ℝ) - 2)) ≤ u ∧ u ≤ C * θ ^ (1 / (2 * (p : ℝ) - 2)) ∧
c * θ ^ ((p : ℝ) / ((p : ℝ) - 1)) ≤ θ * u ^ 2 ∧
θ * u ^ 2 ≤ C * θ ^ ((p : ℝ) / ((p : ℝ) - 1)) ∧
Ftheta S θ (-u) = Ftheta S θ u ∧
(∀ m : ℝ, |m| ≤ 1 → Ftheta S θ m ≤ Ftheta S θ u) ∧
(∀ m : ℝ, |m| ≤ 1 → c * θ * (|m| - u) ^ 2 ≤ Ftheta S θ u - Ftheta S θ m)) :
∃ θ₀ Cₛ : ℝ, 0 < θ₀ ∧ 0 < Cₛ ∧
∀ (n r : ℕ) (J₀ : Matrix (Fin n) (Fin n) ℝ) (h₀ : Fin n → ℝ) (θ : ℝ) (û : ℚ) (L : ℝ),
1 ≤ n → 1 ≤ r → J₀.IsSymm → (∀ i, J₀ i i = 0) → 0 < θ → θ ≤ θ₀ → IsUhat S θ r û →
(n : ℝ) ≤ L →
(r : ℝ) * θ * (û : ℝ) ^ 2 ≥
Cₛ * (n : ℝ) * (max 1 (width J₀ h₀)) ^ 2 *
((n : ℝ) * Real.log ((r : ℝ) + 1) + L + 1) →
∀ y : BinCfg n,
(∑ σ : Config S (Fin n × Fin r), nuProd S (tau S + θ) y σ *
(open Classical in if ∃ i, cloudSum σ i = 0 then (1 : ℝ) else 0)) ≤ Real.exp (-L) ∧
(∑ σ : Config S (Fin n × Fin r), nuProd S (tau S + θ) y σ *
(Real.exp |Dy J₀ h₀ (û : ℝ) y σ| *
(if 1 < |Dy J₀ h₀ (û : ℝ) y σ| then (1 : ℝ) else 0))) ≤ Real.exp (-L) ∧
Real.exp (-1) * (1 - Real.exp (-L)) ≤
(∑ σ : Config S (Fin n × Fin r), nuProd S (tau S + θ) y σ *
Real.exp (Dy J₀ h₀ (û : ℝ) y σ)) ∧
(∑ σ : Config S (Fin n × Fin r), nuProd S (tau S + θ) y σ *
Real.exp (Dy J₀ h₀ (û : ℝ) y σ)) ≤ Real.exp 1 + Real.exp (-L) := 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 6.2 (p.22, eqs. (32)–(33))