Bounded strong convergence and nuclear imply and
ProvedMasulloRepair.nuclear_comp_left_sot_tendsto_traceNormThis is the general form of the strong-to-trace-norm convergence principle that Masullo's manuscript states only for finite-rank operators (Lemma C.3.4.4(5), p. 698) and for exhaustive filtrations by orthogonal projections (Corollary C.3.5.5, p. 702). It confirms those statements and extends them to the form needed in Chapters 10 and 11.
Let be a complex Hilbert space and let be a nuclear (trace-class) operator on , i.e. with . Let be a family of bounded operators on indexed along a filter on (a sequence, a net, or a real parameter tending to ), and let be a bounded operator. Assume that
- the family is eventually uniformly bounded: there is a constant with for -eventually all ;
- in the strong operator topology: in for every .
Then every and is nuclear, and
For sequences the bound in 1. is automatic by the uniform boundedness principle; for nets it is a genuine hypothesis. No convergence of the adjoints is needed for multiplication on the left; the companion statement for multiplication on the right, which does need it, is MasulloRepair.nuclear_comp_right_adjoint_sot_tendsto_traceNorm.
The statement is reusable wherever a trace is computed as a limit of traces of truncations with not converging to the identity, which is the situation of the spectral and geometric truncations in §10.4 and §11.2 of the manuscript.
Formalization Note Nuclearity, the trace and the trace norm are the platform definitions IsNuclearOperator, operatorTrace and traceNorm of Def_MasulloGRH_HilbertNuclear (Definition C.3.4.2 of the manuscript). The limit is taken along an arbitrary filter l, and the trace-norm convergence is stated as .
import Definitions.Def_MasulloGRH_HilbertNuclear set_option autoImplicit false open Filter Topology MasulloGRH
theorem MasulloRepair.nuclear_comp_left_sot_tendsto_traceNorm
{H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
(T : H →L[ℂ] H) (hT : IsNuclearOperator T)
{ι : Type*} (l : Filter ι) (Q : ι → H →L[ℂ] H) (Q₀ : H →L[ℂ] H) (C : ℝ)
(hbd : ∀ᶠ i in l, ‖Q i‖ ≤ C)
(hQ : ∀ u : H, Tendsto (fun i => Q i u) l (𝓝 (Q₀ u))) :
(∀ i, IsNuclearOperator (Q i ∘L T)) ∧ IsNuclearOperator (Q₀ ∘L T) ∧
Tendsto (fun i => traceNorm (Q i ∘L T - Q₀ ∘L T)) l (𝓝 0) ∧
Tendsto (fun i => operatorTrace (Q i ∘L T)) l (𝓝 (operatorTrace (Q₀ ∘L T))) := by sorry