Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fock matrix of Γ(A)\Gamma(A)Γ(A): particle-number conservation, Γ(A†)=Γ(A)†\Gamma(A^\dagger)=\Gamma(A)^\daggerΓ(A†)=Γ(A)†, Γ(1)=1\Gamma(\mathbf 1)=\mathbf 1Γ(1)=1

Proved
BosonicLearn.gammaFock_basic

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

bosonic-gaussian-statesquantum-informationquantum-learning

Three elementary properties of the Fock matrix elements of the second-quantization map Γ\GammaΓ.

For an n×nn\times nn×n complex matrix AAA and occupation vectors u,v∈Nnu,v\in\mathbb N^nu,v∈Nn:

  1. ⟨u∣Γ(A)∣v⟩=0\langle u|\Gamma(A)|v\rangle=0⟨u∣Γ(A)∣v⟩=0 unless ∣u∣=∣v∣|u|=|v|∣u∣=∣v∣ (total photon number is conserved);
  2. ⟨u∣Γ(A†)∣v⟩=⟨v∣Γ(A)∣u⟩‾\langle u|\Gamma(A^\dagger)|v\rangle=\overline{\langle v|\Gamma(A)|u\rangle}⟨u∣Γ(A†)∣v⟩=⟨v∣Γ(A)∣u⟩​;
  3. ⟨u∣Γ(1)∣v⟩=δuv\langle u|\Gamma(\mathbf 1)|v\rangle=\delta_{uv}⟨u∣Γ(1)∣v⟩=δuv​.

Role. Together with multiplicativity (BosonicLearn.gammaFock_mul) these make Γ\GammaΓ a ∗*∗-homomorphism on each photon-number sector, which is what Lemma 2 of the paper uses to identify det⁡(I−R)Γ(R)\det(I-R)\Gamma(R)det(I−R)Γ(R) as a state.

Formalization Note Γ(A)\Gamma(A)Γ(A) is the mission definition BosonicLearn.gammaFock, u! v!∑M∏ijAijMij/Mij!\sqrt{u!\,v!}\sum_M\prod_{ij}A_{ij}^{M_{ij}}/M_{ij}!u!v!​∑M​∏ij​AijMij​​/Mij​! over M∈Nn×nM\in\mathbb N^{n\times n}M∈Nn×n with row sums uuu and column sums vvv.

Preamble
import Mathlib
import Definitions.Def_BosonicLearn_gammaFock

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

/-- **Basic properties of `Γ`: sector structure, adjoint, identity.**
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 an `n × n` complex matrix `A` and occupation vectors `u, v`: `⟨u|Γ(A)|v⟩ = 0` unless `|u| = |v|`;
`⟨u|Γ(A†)|v⟩ = conj ⟨v|Γ(A)|u⟩`; and `Γ(1) = 1`.

**Formalization Note.** `Γ` is `gammaFock`. -/
theorem gammaFock_basic {n : ℕ} (A : Matrix (Fin n) (Fin n) ℂ) (u v : Occupation (Fin n)) :
    (∑ i, u i ≠ ∑ i, v i → gammaFock A u v = 0) ∧
    gammaFock Aᴴ u v = star (gammaFock A v u) ∧
    gammaFock (1 : Matrix (Fin n) (Fin n) ℂ) u v = (if u = v then 1 else 0) := 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