(45), p. 27 — Σ_{Q:P∼Q∼S} ‖h_Q‖ ≤ ζ₀ Σ_{p∈P} δ_{dist(p,S)≤1}
ProvedLatticeHamSim.StrictLR.eq_45Let be operators indexed by the subsets of a finite metric space of sites (local dimension ), strictly local in the sense that whenever , and let be a real number with
Then for arbitrary sets of sites,
where the left sum is over all meeting both and , and is if and otherwise.
This counting bound converts the linked sums of (44) into powers of .
Formalization Note The paper defines ; here is any upper bound of these sums. The two readings are equivalent for this inequality, which is monotone in and is satisfied by the maximum itself; the bound form avoids a maximum over a possibly empty . is Metric.infDist (which is for , where the left side is an empty sum). is the operator norm.
import Mathlib import Definitions.Def_LatticeHamSim_StrictLR_Setting open scoped Matrix.Norms.L2Operator
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.