Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(45), p. 27 — Σ_{Q:P∼Q∼S} ‖h_Q‖ ≤ ζ₀ Σ_{p∈P} δ_{dist(p,S)≤1}

Proved
LatticeHamSim.StrictLR.eq_45

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

lieb-robinson-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-lattice-systemstrictly-local

Let (hQ)Q⊆Λ(h_Q)_{Q \subseteq \Lambda}(hQ​)Q⊆Λ​ be operators indexed by the subsets of a finite metric space of sites Λ\LambdaΛ (local dimension qqq), strictly local in the sense that hQ=0h_Q = 0hQ​=0 whenever diam(Q)>1\mathrm{diam}(Q) > 1diam(Q)>1, and let ζ0\zeta_0ζ0​ be a real number with

∑Q∋x∣Q∣ ∥hQ∥≤ζ0for every site x.\sum_{Q \ni x} |Q|\, \|h_Q\| \le \zeta_0 \quad \text{for every site } x .Q∋x∑​∣Q∣∥hQ​∥≤ζ0​for every site x.

Then for arbitrary sets P,SP, SP,S of sites,

∑Q : P∼Q∼S∥hQ∥≤ζ0∑p∈Pδdist(p,S)≤1,\sum_{Q \,:\, P \sim Q \sim S} \|h_Q\| \le \zeta_0 \sum_{p \in P} \delta_{\mathrm{dist}(p, S) \le 1},Q:P∼Q∼S∑​∥hQ​∥≤ζ0​p∈P∑​δdist(p,S)≤1​,

where the left sum is over all QQQ meeting both PPP and SSS, and δdist(p,S)≤1\delta_{\mathrm{dist}(p, S) \le 1}δdist(p,S)≤1​ is 111 if dist(p,S)≤1\mathrm{dist}(p, S) \le 1dist(p,S)≤1 and 000 otherwise.

This counting bound converts the linked sums of (44) into powers of ζ0\zeta_0ζ0​.

Formalization Note The paper defines ζ0=max⁡x∑Q∋x∣Q∣ ∥hQ∥\zeta_0 = \max_{x} \sum_{Q \ni x} |Q|\,\|h_Q\|ζ0​=maxx​∑Q∋x​∣Q∣∥hQ​∥; here ζ0\zeta_0ζ0​ is any upper bound of these sums. The two readings are equivalent for this inequality, which is monotone in ζ0\zeta_0ζ0​ and is satisfied by the maximum itself; the bound form avoids a maximum over a possibly empty Λ\LambdaΛ. dist(p,S)\mathrm{dist}(p, S)dist(p,S) is Metric.infDist (which is 000 for S=∅S = \emptysetS=∅, where the left side is an empty sum). ∥⋅∥\|\cdot\|∥⋅∥ is the L2L^2L2 operator norm.

Preamble
import Mathlib
import Definitions.Def_LatticeHamSim_StrictLR_Setting
open scoped Matrix.Norms.L2Operator
Formal statement
namespace LatticeHamSim.StrictLR

theorem eq_45 {Λ : Type*} [Fintype Λ] [DecidableEq Λ] [MetricSpace Λ] {q : ℕ}
    (h : Finset Λ → Matrix (Λ → Fin q) (Λ → Fin q) ℂ)
    (hloc : ∀ X : Finset Λ, 1 < Metric.diam (X : Set Λ) → h X = 0)
    (ζ₀ : ℝ) (hζ₀ : ∀ x : Λ, ∑ Q ∈ Finset.univ.filter (fun Q => x ∈ Q), (Q.card : ℝ) * ‖h Q‖ ≤ ζ₀)
    (P S : Finset Λ) :
    ∑ Q ∈ Finset.univ.filter (fun Q => LatticeHamSim.CommLR.meets P Q ∧ LatticeHamSim.CommLR.meets Q S), ‖h Q‖ ≤
      ζ₀ * ∑ p ∈ P, (if Metric.infDist p (S : Set Λ) ≤ 1 then (1 : ℝ) else 0) := by sorry

end LatticeHamSim.StrictLR
Source
Haah, Hastings, Kothari and Low, Quantum algorithm for simulating real time evolution of lattice Hamiltonians, arXiv:1801.03922v4, p. 27, Appendix C.4, display (45)
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 2026

    Confirmed by the mission captain (proposal self-audit).

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