Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Trace-norm error of finite frequency-band truncations

Proved
MasulloGRH.traceNorm_tail_of_summable_rank_mul_opNorm

by marozols · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

functional-analysismasullooperator-theorytrace-class

Let AnA_nAn​ be bounded operators on a complex Hilbert space, with range in finite-dimensional subspaces SnS_nSn​. Suppose ∑nAnu=Tu\sum_n A_nu=Tu∑n​An​u=Tu for every uuu and cn=dim⁡(Sn)∥An∥c_n=\dim(S_n)\|A_n\|cn​=dim(Sn​)∥An​∥ is summable. For every finite index set FFF the trace norm satisfies

∥T−∑n∈FAn∥Tr≤∑ncn−∑n∈Fcn.\left\|T-\sum_{n\in F}A_n\right\|_{\rm Tr}\le\sum_n c_n-\sum_{n\in F}c_n.​T−n∈F∑​An​​Tr​≤n∑​cn​−n∈F∑​cn​.

In particular the finite sums converge to TTT in trace norm as FFF increases over the finite subsets. If the operators group nearby spectral values into bands, this gives the quantitative approximation error for truncating the bands.

Preamble
import Definitions.Def_MasulloGRH_HilbertNuclear
open MasulloGRH Filter
open scoped Topology BigOperators
Formal statement
theorem MasulloGRH.traceNorm_tail_of_summable_rank_mul_opNorm {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
    (A : ℕ → H →L[ℂ] H) (S : ℕ → Submodule ℂ H) [∀ n, FiniteDimensional ℂ (S n)]
    (hAS : ∀ n u, A n u ∈ S n)
    (hc : Summable (fun n => (Module.finrank ℂ (S n) : ℝ) * ‖A n‖))
    (T : H →L[ℂ] H) (hT : ∀ u, HasSum (fun n => A n u) (T u)) :
    (∀ s : Finset ℕ, traceNorm (T - ∑ n ∈ s, A n) ≤
      (∑' n, (Module.finrank ℂ (S n) : ℝ) * ‖A n‖) -
      ∑ n ∈ s, (Module.finrank ℂ (S n) : ℝ) * ‖A n‖) ∧
    Tendsto (fun s : Finset ℕ => traceNorm (T - ∑ n ∈ s, A n)) atTop (𝓝 0) := by sorry
Source
A. Connes, Trace formula in noncommutative geometry and the zeros of the Riemann zeta function, Appendix I, preprint pp. 67–68, equations (35)–(36), https://arxiv.org/abs/math/9811068. Quantitative trace-norm step for the fixed-line frequency-band proposal for Masullo §10.3.1 by Calvin Yost-Wolff, Prove2Me mission discussion, 20 November 2026, 22:19 UTC.

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