Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Proved
LatticeHamSim.StrictLR.eq_46

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∥≤ζ0\sum_{Q \ni x} |Q|\, \|h_Q\| \le \zeta_0∑Q∋x​∣Q∣∥hQ​∥≤ζ0​ for every site xxx. Then for arbitrary sets P,SP, SP,S of sites and every real ddd,

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

Together with (45), this inequality bounds each successive factor of a linked sum by ζ0\zeta_0ζ0​ while keeping track of the distance still to be covered.

Formalization Note As in (45), ζ0\zeta_0ζ0​ is any upper bound of the site sums ∑Q∋x∣Q∣ ∥hQ∥\sum_{Q \ni x} |Q|\,\|h_Q\|∑Q∋x​∣Q∣∥hQ​∥, equivalent to the paper's maximum. dist(Q,S)\mathrm{dist}(Q, S)dist(Q,S) is setDist Q S, the minimum distance for nonempty sets and 000 if S=∅S = \emptysetS=∅; dist(p,S)\mathrm{dist}(p, S)dist(p,S) is Metric.infDist, also 000 for S=∅S = \emptysetS=∅. Under these conventions the inequality still holds when S=∅S = \emptysetS=∅. ∥⋅∥\|\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_46 {Λ : 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 Λ) (d : ℝ) :
    ∑ Q ∈ Finset.univ.filter (fun Q => LatticeHamSim.CommLR.meets P Q),
        (Q.card : ℝ) * ‖h Q‖ * (if LatticeHamSim.CommLR.setDist Q S ≤ d then 1 else 0) ≤
      ζ₀ * ∑ p ∈ P, (if Metric.infDist p (S : Set Λ) ≤ d + 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 (46)
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