Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Γ\GammaΓ is multiplicative on Fock matrix elements: ⟨u∣Γ(AB)∣v⟩=∑∣w∣=∣u∣⟨u∣Γ(A)∣w⟩⟨w∣Γ(B)∣v⟩\langle u|\Gamma(AB)|v\rangle=\sum_{|w|=|u|}\langle u|\Gamma(A)|w\rangle\langle w|\Gamma(B)|v\rangle⟨u∣Γ(AB)∣v⟩=∑∣w∣=∣u∣​⟨u∣Γ(A)∣w⟩⟨w∣Γ(B)∣v⟩

Proved
BosonicLearn.gammaFock_mul

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

bosonic-gaussian-statesquantum-informationquantum-learning

Functoriality of the second-quantization map Γ\GammaΓ.

For n×nn\times nn×n complex matrices A,BA,BA,B and occupation vectors u,v∈Nnu,v\in\mathbb N^nu,v∈Nn,

⟨u∣Γ(AB)∣v⟩=∑w∈Nn, ∣w∣=∣u∣⟨u∣Γ(A)∣w⟩ ⟨w∣Γ(B)∣v⟩,\langle u|\Gamma(AB)|v\rangle=\sum_{w\in\mathbb N^n,\ |w|=|u|}\langle u|\Gamma(A)|w\rangle\,\langle w|\Gamma(B)|v\rangle ,⟨u∣Γ(AB)∣v⟩=w∈Nn, ∣w∣=∣u∣∑​⟨u∣Γ(A)∣w⟩⟨w∣Γ(B)∣v⟩,

a finite sum over the sector of total photon number ∣u∣|u|∣u∣.

Role. With BosonicLearn.gammaFock_basic this gives Γ(S†S)=Γ(S)†Γ(S)⪰0\Gamma(S^\dagger S)=\Gamma(S)^\dagger\Gamma(S)\succeq0Γ(S†S)=Γ(S)†Γ(S)⪰0 and Γ(U diag(d) U†)=Γ(U)Γ(diag d)Γ(U)†\Gamma(U\,\mathrm{diag}(d)\,U^\dagger)=\Gamma(U)\Gamma(\mathrm{diag}\,d)\Gamma(U)^\daggerΓ(Udiag(d)U†)=Γ(U)Γ(diagd)Γ(U)†, the two facts behind Lemma 2 of the paper (det⁡(I−R)Γ(R)\det(I-R)\Gamma(R)det(I−R)Γ(R) is a state for Hermitian 0⪯R≺I0\preceq R\prec I0⪯R≺I).

Formalization Note Γ\GammaΓ is BosonicLearn.gammaFock. The sum is written over the finite box wi≤∣u∣w_i\le|u|wi​≤∣u∣ filtered by ∣w∣=∣u∣|w|=|u|∣w∣=∣u∣.

Preamble
import Mathlib
import Definitions.Def_BosonicLearn_gammaFock

open QAlgorithms.Papers.Independent.Claimed50.P47 (Occupation)
Formal statement
namespace BosonicLearn

/-- **Second quantization is multiplicative: `Γ(AB) = Γ(A) Γ(B)`.**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, Lemma 2, p. 20: "Γ(X) := ⊕_{m=0}^∞ Γ_m(X) and Γ_m(X) := X^{⊗m}|_{Sym^m(ℂⁿ)}, with Γ_0(X) := 1."

For `n × n` complex matrices `A, B` and occupation vectors `u, v ∈ ℕⁿ`,
`⟨u|Γ(AB)|v⟩ = ∑_w ⟨u|Γ(A)|w⟩ ⟨w|Γ(B)|v⟩`, the sum over the finitely many `w` with `|w| = |u|`.

**Formalization Note.** `Γ` is `gammaFock`; it vanishes between different photon-number sectors, so the sum over
all `w ∈ ℕⁿ` reduces to the sector of `u`, written as a filtered finite box. -/
theorem gammaFock_mul {n : ℕ} (A B : Matrix (Fin n) (Fin n) ℂ) (u v : Occupation (Fin n)) :
    gammaFock (A * B) u v =
      ∑ w ∈ (Fintype.piFinset fun _ : Fin n => Finset.range (∑ i, u i + 1)).filter
          (fun w => ∑ i, w i = ∑ i, u i),
        gammaFock A u w * gammaFock B w v := by sorry

end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, Lemma 2 and Eq. (21), p. 20 (passive Gaussian states as det(I − R)Γ(R))

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