Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Trace pairing: ∑i∑jEijXji=∑a⟨Ra,FLa⟩\sum_i\sum_jE_{ij}X_{ji}=\sum_a\langle R_a,FL_a\rangle∑i​∑j​Eij​Xji​=∑a​⟨Ra​,FLa​⟩ for a bounded operator and a nuclear expansion

Proved
BosonicLearn.effect_trace_pairing

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

bosonic-gaussian-statesquantum-informationquantum-learning

The trace of a bounded operator against a trace-class matrix can be computed along any nuclear expansion, and all the series involved converge.

Let III be any index set, E=(Eij)i,j∈IE=(E_{ij})_{i,j\in I}E=(Eij​)i,j∈I​ a complex matrix and FFF a bounded operator on ℓ2(I)\ell^2(I)ℓ2(I) whose coordinates are given by the rows of EEE: for every z∈ℓ2(I)z\in\ell^2(I)z∈ℓ2(I) and every iii, the series ∑jEijzj\sum_jE_{ij}z_j∑j​Eij​zj​ converges to (Fz)i(Fz)_i(Fz)i​. Let X=(Xij)X=(X_{ij})X=(Xij​) be a matrix with a nuclear expansion

Xij=∑a∈NLa(i) Ra(j)‾,La,Ra∈ℓ2(I),∑a∥La∥ ∥Ra∥<∞.X_{ij}=\sum_{a\in\mathbb N}L_a(i)\,\overline{R_a(j)},\qquad L_a,R_a\in\ell^2(I),\qquad\sum_a\|L_a\|\,\|R_a\|<\infty .Xij​=a∈N∑​La​(i)Ra​(j)​,La​,Ra​∈ℓ2(I),a∑​∥La​∥∥Ra​∥<∞.

Then

  1. for every i∈Ii\in Ii∈I the series ∑jEijXji\sum_jE_{ij}X_{ji}∑j​Eij​Xji​ converges;
  2. the series ∑i(∑jEijXji)\sum_i\big(\sum_jE_{ij}X_{ji}\big)∑i​(∑j​Eij​Xji​) converges;
  3. the series ∑a⟨Ra,FLa⟩\sum_a\langle R_a,FL_a\rangle∑a​⟨Ra​,FLa​⟩ converges;
  4. the two sums are equal:
∑i∈I∑j∈IEijXji=∑a∈N⟨Ra,FLa⟩.\sum_{i\in I}\sum_{j\in I}E_{ij}X_{ji}=\sum_{a\in\mathbb N}\langle R_a,FL_a\rangle .i∈I∑​j∈I∑​Eij​Xji​=a∈N∑​⟨Ra​,FLa​⟩.

Role. The left-hand side of clause 4 is the quantity Tr⁡(Eρ)\operatorname{Tr}(E\rho)Tr(Eρ) that appears in the Born rule of a POVM in this mission, written as an iterated series. The statement shows that it is a genuine convergent sum and rewrites it as an absolutely convergent series of inner products, which is the form in which one can pass to limits, integrate over a parameter, or compare two effects. It is a foundation for BosonicLearn.fockPOVM_postprocess and BosonicLearn.adaptive_scheme_product_povm.

Formalization Note Convergence is Summable, and the two sides of clause 4 are tsums; by clauses 1–3 they are genuine sums and not the default value 000 that Lean assigns to a divergent series. The hypothesis on FFF is clause 3 of BosonicLearn.effect_matrix_operator. The nuclear expansion is a NuclearExpansion X of Dependency50.P33. The index set is arbitrary and XXX need not be positive.

Related platform material The space ℓ2(A)\ell^2(A)ℓ2(A) used here (Hilbert A) is the same Lean type as OAI.TensorLp.H A, and ℓ2(Nn)\ell^2(\mathbb N^n)ℓ2(Nn) is the same type as OAI.EntropyPhotonNumber.Fock n. The published definitions OAI_Analysis_TensorLp (tensor products, slices and operator lifts on ℓ2(A×B)\ell^2(A\times B)ℓ2(A×B)) and OAI_MathematicalPhysics_Fock_Operators (OAI.CrossEnsemble.operator, the bounded operator ∑i∣ui⟩⟨vi∣\sum_i|u_i\rangle\langle v_i|∑i​∣ui​⟩⟨vi​∣ of a family, with hasSum_operator and entry_hasSum) are sorry-free and can be imported. Proved lemmas of this mission that can be imported: BosonicLearn.traceDist_le_one (nuclear expansions, truncation to finite index sets) and BosonicLearn.effect_matrix_operator (effect matrices as bounded positive operators).

Preamble
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P33

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

/-- **Trace pairing of a bounded operator with a trace-class matrix.**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, §5.4, Eq. (63), p. 35 (outcome likelihoods are Born probabilities `⟨ϕ|ρ|ϕ⟩ = Tr(|ϕ⟩⟨ϕ| ρ)`). This makes
precise the remark in the definition `BosonicLearn_FockPOVM` that "`Tr(E ρ)` is the iterated series
`∑ᵢ ∑ⱼ E_ij ρ_ji`, which converges absolutely for bounded `E` and trace-class `ρ`".

Let `F` be a bounded operator on `ℓ²(I)` whose coordinates are given by the rows of a matrix `E`,
`(F z)_i = ∑_j E_{ij} z_j`, and let `X` have a nuclear expansion `X_{ij} = ∑_a L_a(i) conj(R_a(j))` with
`∑_a ‖L_a‖‖R_a‖ < ∞`. Then
1. for every `i` the series `∑_j E_{ij} X_{ji}` converges;
2. the series `∑_i (∑_j E_{ij} X_{ji})` converges;
3. the series `∑_a ⟨R_a, F L_a⟩` converges;
4. `∑_i ∑_j E_{ij} X_{ji} = ∑_a ⟨R_a, F L_a⟩`.

**Formalization Note.** Convergence is `Summable` (unconditional); the two sides of clause 4 are `tsum`s, which
by clauses 1–3 are genuine sums and not the default value `0`. The hypothesis on `F` is clause 3 of
`BosonicLearn.effect_matrix_operator`. The left-hand side of clause 4 is the expression in the Born rule
`FockPOVM.law_born`. The index set is arbitrary. -/
theorem effect_trace_pairing {I : Type} (E : Matrix I I ℂ) (F : Hilbert I →L[ℂ] Hilbert I)
    (hF : ∀ (z : Hilbert I) (i : I), HasSum (fun j => E i j * z j) (F z i))
    (X : Matrix I I ℂ) (e : NuclearExpansion X) :
    (∀ i, Summable fun j => E i j * X j i) ∧
    Summable (fun i => ∑' j, E i j * X j i) ∧
    Summable (fun a => inner ℂ (e.right a) (F (e.left a))) ∧
    ∑' i, ∑' j, E i j * X j i = ∑' a, inner ℂ (e.right a) (F (e.left a)) := by sorry

end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, §5.4, Eq. (63), p. 35 (outcome likelihoods as Born probabilities); makes precise the remark in definition BosonicLearn_FockPOVM that Tr(E ρ) "is the iterated series ∑ᵢ ∑ⱼ E_ij ρ_ji, which converges absolutely for bounded E and trace-class ρ"

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