Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.4 — weak error of the finite rounded Euler trajectory

Proved
CritWinSpin.rounded_euler_weak_budget

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

critical-windowsamplerspin-systemstheorem-4-4

Consider the actual finite rounded Euler trajectory for the regularized Ising envelope potential UαU_\alphaUα​, with the certified geometry and Gibbs moments. Let R≥2R\ge2R≥2 dominate the moments and satisfy αR≥1\alpha R\ge1αR≥1. Suppose the step scale and explicit drift, Gaussian-grid, and rounding errors satisfy

σ≤12048R4,e≤σ216R3,T≥16R4σ2.\sigma\le\frac1{2048R^4},\qquad e\le\frac{\sigma^2}{16R^3},\qquad T\ge\frac{16R^4}{\sigma^2}.σ≤2048R41​,e≤16R3σ2​,T≥σ216R4​.

For every bounded measurable test function fff with Lipschitz constant 0≤L≤R0\le L\le R0≤L≤R, the trajectory law νT\nu_TνT​ started at zero satisfies

∣∫f dνT−∫f dμUα∣≤12R.\left|\int f\,d\nu_T-\int f\,d\mu_{U_\alpha}\right|\le\frac1{2R}.​∫fdνT​−∫fdμUα​​​≤2R1​.

The error eee is the explicit expression in the statement for the finite rational drift, Gaussian draw, and rounding schedules. The trajectory law is defined by those numerical updates. This supplies the discretization estimate used by the sampler in Theorem 4.4.

Preamble
import Definitions.Def_CritWinSpin_SamplerNumericalData
set_option autoImplicit false
set_option linter.all false
noncomputable section
open MeasureTheory ProbabilityTheory CritWinSpin
open CritWinSpin.LocalTM2.Compiled CritWinSpin.Implementation
open EnvelopeGeometry LangevinBudget

Formal statement
namespace CritWinSpin

theorem rounded_euler_weak_budget {N : ℕ} (S : SpinLaw) (hS : IsGHS S) (D : EulerData N)
    (hs : tau S < (D.sCap:ℝ)) (ha : 0 < D.a) (ha1 : D.a ≤ 1)
    (hPSD : ((D.sCap:ℝ) • (1 : Matrix (Fin N) (Fin N) ℝ) - castM D.L*(castM D.L).transpose).PosSemidef)
    (hd : 0 < D.dPhi) (hd1 : D.dPhi ≤ 1) (hsnap : 0 < D.snap)
    (hr : 0 < D.dRound) (hsigma : 0 < D.sigma) (B : ℝ) (hB : 0 ≤ B)
    (hL : ∀ i j, |(D.L i j:ℝ)| ≤ B)
    (cert : Certificate N (D.a:ℝ))
    (hUeq : cert.U = potential S D.sCap D.a (castM D.L) (castV D.h))
    (hGeq : cert.g = gradient S D.sCap D.a (castM D.L) (castV D.h))
    {R : ℝ} (hR : 2 ≤ R) (haR : 1 ≤ (D.a:ℝ)*R)
    (hsR : (D.sigma:ℝ) ≤ 1/(2048*R^4))
    (hError :
      (D.sigma:ℝ)^2 * (((N:ℝ)+1)*((N:ℝ)*B*
        (2*(Fintype.card {x:ℚ // x∈S.A}:ℝ)*(D.dPhi:ℝ)/(S.ρ 1:ℝ))+2*(D.snap:ℝ))) +
        (D.sigma:ℝ)*((N:ℝ)/((D.k:ℝ)+1))+((N:ℝ)+1)*(D.dRound:ℝ) ≤
      (D.sigma:ℝ)^2/(16*R^3))
    (hM : (∫ x, ‖x‖ ∂DensityAnalysis.gibbs cert.U) ≤ R)
    (hH : 2+(∫ x, ‖cert.g x‖^6 ∂DensityAnalysis.gibbs cert.U)+
      GaussianMoments.sixthConstant*(N:ℝ)^3 ≤ R)
    (T : ℕ) (hT : 16*R^4/(D.sigma:ℝ)^2 ≤ (T:ℝ))
    (f : DensityAnalysis.Point N → ℝ) (Bf L : ℝ) (hLip : 0 ≤ L) (hLR : L ≤ R) (hf : Measurable f) (hfB : ∀ x, |f x| ≤ Bf)
    (hfL : ∀ x y, |f x-f y| ≤ L*dist x y) :
    |(∫ x, f x ∂D.trajectoryLaw S T (0 : Fin N → ℚ))-
      ∫ x, f x ∂DensityAnalysis.gibbs (potential S D.sCap D.a (castM D.L) (castV D.h))| ≤ 1/(2*R) := 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…), Section 4, pp.15–17, equations (23)–(24). Finite rounded-Euler implementation estimate for Theorem 4.4.

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