Lemma 3.1(i) — unique type
ProvedCritWinSpin.p3a_unique_typecritical-windowcumulantsp2o-v1spin-systems
For a single-site law ρ satisfying the GHS condition of Definition 2.1 there is a unique integer p ≥ 2 for which the even cumulants κ₄,…,κ₂ₚ₋₂ vanish and κ₂ₚ < 0. This is the type p of the critical window.
Preamble
import Mathlib import Definitions.Def_CritWinSpin_SpinLaw set_option autoImplicit false
Formal statement
namespace CritWinSpin
/-- Lemma 3.1(i), uniqueness of the type. -/
theorem p3a_unique_type (S : SpinLaw) (hS : IsGHS S) :
∃! p : ℕ, IsTypeP S p := 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)