Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.4 — running time of the finite sampler

Proved
CritWinSpin.Implementation.SamplerRuntime.criticalWindowMachine_time

by Maxliu · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

critical-windowsamplerspin-systemstheorem-4-4

Let SSS be a GHS spin law of type ppp, and choose the numerical scale CCC to satisfy the stated scale and integration bounds. The concrete sampler MS,CM_{S,C}MS,C​ has constants Ctime>0C_{\mathrm{time}}>0Ctime​>0 and k∈Nk\in\mathbb Nk∈N such that, for every rational instance with

0⪯J⪯τS(1+δ)IN,δ≥0,m≥5,0\preceq J\preceq\tau_S(1+\delta)I_N,\qquad \delta\ge0,\quad m\ge5,0⪯J⪯τS​(1+δ)IN​,δ≥0,m≥5,

its running time is at most

Ctime(N+B+m)kexp⁡ ⁣(CtimeNδp/(p−1)).C_{\mathrm{time}}(N+B+m)^k\exp\!\left(C_{\mathrm{time}}N\delta^{p/(p-1)}\right).Ctime​(N+B+m)kexp(Ctime​Nδp/(p−1)).

Here BBB is the encoded instance length. The machine and the constants are fixed before N,J,h,m,δN,J,h,m,\deltaN,J,h,m,δ. This is the running-time part of the sampler construction in Theorem 4.4.

Preamble
import Definitions.Def_CritWinSpin_SamplerMachine
import Definitions.Def_CritWinSpin_encInst
open QAlgorithms.Complexity QAlgorithms.LocalHamiltonian QuantumPRC
open CritWinSpin CritWinSpin.LocalTM2.Compiled
open CritWinSpin.Implementation.PreprocessIntegral
set_option autoImplicit false
Formal statement
namespace CritWinSpin.Implementation.SamplerRuntime

theorem criticalWindowMachine_time (S : SpinLaw) (p : ℕ) (hS : IsGHS S) (hp : IsTypeP S p)
    (C : ℕ) (hC8 : 8 ≤ C) (hC : 1000 * (fixedScale S : ℝ) ≤ (C : ℝ))
    (hPrecision : 1000 * integrationConstant S ≤ (C : ℝ)) :
    ∃ (Ctime : ℝ) (k : ℕ), 0 < Ctime ∧ ∀ (N : ℕ) (I : Inst N) (m : ℕ) (δ : ℝ),
      I.1.IsSymm → (castM I.1).PosSemidef → 0 ≤ δ →
      ((tau S*(1+δ)) • (1 : Matrix (Fin N) (Fin N) ℝ)-castM I.1).PosSemidef → 5 ≤ m →
      ((criticalWindowMachine S C).time (tupleCode [encInst I, encBin m]) : ℝ) ≤
        Ctime * ((N : ℝ) + bitLen I + m) ^ k *
          Real.exp (Ctime * N * δ ^ ((p : ℝ) / ((p : ℝ)-1))) := by sorry

end CritWinSpin.Implementation.SamplerRuntime
Source
Liu–Zhang–Ren, The Critical Window for Sampling and Learning-to-Sample in Spin Systems, STOC 2027 submission (manuscript sha256 f77584da…), Theorem 4.4, p.17, equation (24). Running-time component of the concrete sampler.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me