Bounded strong convergence and nuclear imply and
ProvedMasulloRepair.nuclear_comp_right_adjoint_sot_tendsto_traceNormThis is the right-multiplication form of the strong-to-trace-norm convergence principle of Masullo's manuscript (Lemma C.3.4.4(5), p. 698; Corollary C.3.5.5(2),(3), p. 702). It identifies the correct limit in Theorem 11.2.1.2(2) (p. 488), where a nuclear operator is multiplied on the right by orthogonal projections that converge strongly to a projection different from the identity.
Let be a complex Hilbert space and let be a nuclear (trace-class) operator on . Let be a family of bounded operators on indexed along a filter on , and let be a bounded operator. Assume that
- there is a constant with for -eventually all ;
- the adjoints converge strongly: in for every .
Then every and is nuclear, and
In particular, if the are self-adjoint (for instance orthogonal projections) and strongly, the trace-norm limit of is ; it equals only when . Strong convergence of the themselves is not sufficient for the trace-norm convergence of (take on and ), which is why hypothesis 2 is placed on the adjoints.
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 adjoint is Mathlib's ContinuousLinearMap.adjoint. The limit is taken along an arbitrary filter l.
import Definitions.Def_MasulloGRH_HilbertNuclear set_option autoImplicit false open Filter Topology MasulloGRH
theorem MasulloRepair.nuclear_comp_right_adjoint_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 => ContinuousLinearMap.adjoint (Q i) u) l
(𝓝 (ContinuousLinearMap.adjoint Q₀ u))) :
(∀ i, IsNuclearOperator (T ∘L Q i)) ∧ IsNuclearOperator (T ∘L Q₀) ∧
Tendsto (fun i => traceNorm (T ∘L Q i - T ∘L Q₀)) l (𝓝 0) ∧
Tendsto (fun i => operatorTrace (T ∘L Q i)) l (𝓝 (operatorTrace (T ∘L Q₀))) := by sorry