Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Trace norm by duality: if ∣Tr(AV)∣≤c|\mathrm{Tr}(AV)|\le c∣Tr(AV)∣≤c for all contractions VVV then ∥A∥1≤c\|A\|_1\le c∥A∥1​≤c (self-adjoint AAA on ℓ2(I)\ell^2(I)ℓ2(I))

Proved
BosonicLearn.traceSize_le_of_pairing

by Senrui Chen · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

bosonic-gaussian-statesquantum-informationquantum-learning

The variational characterization of the trace norm, in the direction needed to bound it, for the nuclear-expansion definition traceSize.

Let AAA be a bounded self-adjoint operator on ℓ2(I)\ell^2(I)ℓ2(I) (III countable) and c≥0c\ge0c≥0. If for every operator VVV with ∥V∥≤1\|V\|\le1∥V∥≤1 and every finite set FFF of basis indices

∣∑u∈F⟨eu,AVeu⟩∣≤c,\Big|\sum_{u\in F}\langle e_u,AVe_u\rangle\Big|\le c,​u∈F∑​⟨eu​,AVeu​⟩​≤c,

then the matrix (⟨eu,Aev⟩)u,v(\langle e_u,Ae_v\rangle)_{u,v}(⟨eu​,Aev​⟩)u,v​ is trace class with trace norm at most ccc.

Proof idea: with the continuous functional calculus, A=A+−A−A=A_+-A_-A=A+​−A−​ and ∣A∣=A++A−|A|=A_++A_-∣A∣=A+​+A−​; the contractions Vε=A(∣A∣+ε)−1V_\varepsilon=A(|A|+\varepsilon)^{-1}Vε​=A(∣A∣+ε)−1 give ∑u∈F⟨eu,∣A∣eu⟩≤c+ε∣F∣\sum_{u\in F}\langle e_u,|A|e_u\rangle\le c+\varepsilon|F|∑u∈F​⟨eu​,∣A∣eu​⟩≤c+ε∣F∣, so Tr⁡A++Tr⁡A−≤c\operatorname{Tr}A_++\operatorname{Tr}A_-\le cTrA+​+TrA−​≤c, and a positive operator with finite trace ttt has a nuclear expansion of total weight ttt.

Formalization Note traceSize is the infimum over nuclear expansions (∞\infty∞ if there is none), so the conclusion includes that AAA is trace class. eue_ueu​ is lp.single 2 u 1 in Hilbert I.

Preamble
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P33

open QAlgorithms.Papers.Independent.Dependency50.P33 (State IsDensity traceSize)
open QAlgorithms.RealRegisters (Hilbert)
open scoped ENNReal
Formal statement
namespace BosonicLearn

/-- **Trace norm by duality: `‖A‖₁ ≤ sup_{‖V‖ ≤ 1} |Tr(AV)|` for self-adjoint `A`.**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, footnote 1, p. 3 (trace distance `½‖ρ − σ‖₁`), and §7.1, p. 55 (trace-distance bounds between Gaussian states); this is the
standard variational characterization of the trace norm used to bound it.

Let `A` be a bounded self-adjoint operator on `ℓ²(I)` and `c ≥ 0`. If for every contraction `V` and every finite set
`F` of basis indices the partial trace `∑_{u ∈ F} ⟨e_u, A V e_u⟩` has modulus at most `c`, then the matrix of `A` in
the standard basis is trace class with trace norm at most `c`.

**Formalization Note.** `traceSize` is the infimum over nuclear expansions (`∞` if there is none), so the conclusion
includes that `A` is trace class. The matrix of `A` is `⟨e_u, A e_v⟩`, `e_u = lp.single 2 u 1`. -/
theorem traceSize_le_of_pairing {I : Type} [DecidableEq I] [Countable I] (A : Hilbert I →L[ℂ] Hilbert I)
    (hA : IsSelfAdjoint A) (c : ℝ) (hc : 0 ≤ c)
    (h : ∀ V : Hilbert I →L[ℂ] Hilbert I, ‖V‖ ≤ 1 → ∀ F : Finset I,
      ‖∑ u ∈ F, inner ℂ (lp.single 2 u (1 : ℂ) : Hilbert I) (A (V (lp.single 2 u (1 : ℂ))))‖ ≤ c) :
    traceSize (fun u v : I => inner ℂ (lp.single 2 u (1 : ℂ) : Hilbert I) (A (lp.single 2 v (1 : ℂ)))) ≤
      ENNReal.ofReal c := by sorry

end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, footnote 1, p. 3 (trace distance 12∥ρ−σ∥1\frac12\|\rho-\sigma\|_121​∥ρ−σ∥1​); §7.1, p. 55 (trace-distance bounds between Gaussian states)

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