Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every passive Gaussian state is det⁡(I−R)Γ(R)\det(I-R)\Gamma(R)det(I−R)Γ(R) for a Hermitian 0⪯R≺I0\preceq R\prec I0⪯R≺I

Open
BosonicLearn.passive_gaussian_fugacity

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

bosonic-gaussian-statesquantum-informationquantum-learning

The surjectivity half of the bijection of Lemma 2 of the paper.

Let ρ\rhoρ be a passive Gaussian state on nnn modes: a Gaussian state whose density operator is block diagonal in the total photon number sectors. Then there is a positive semidefinite n×nn\times nn×n matrix RRR with 1−R1-R1−R positive definite such that

ρ=det⁡(1−R) Γ(R).\rho=\det(1-R)\,\Gamma(R).ρ=det(1−R)Γ(R).

Status of the other clauses of Lemma 2. That det⁡(1−R)Γ(R)\det(1-R)\Gamma(R)det(1−R)Γ(R) is a passive Gaussian state (with covariance 12(1+R)(1−R)−1\tfrac12(1+R)(1-R)^{-1}21​(1+R)(1−R)−1 in real form) is BosonicLearn.fugacity_isGaussianState; the formula R=P1ρP1/Tr⁡(P0ρ)R=P_1\rho P_1/\operatorname{Tr}(P_0\rho)R=P1​ρP1​/Tr(P0​ρ), hence uniqueness of RRR, is BosonicLearn.gammaFock_one_photon; the mean photon number is BosonicLearn.fugacity_photon_number. This statement is the only part of BosonicLearn.lemma_2 that is not yet proved.

Possible route. Block diagonality makes the characteristic function invariant under ζ↦eiθζ\zeta\mapsto e^{i\theta}\zetaζ↦eiθζ, which forces mean 000 and a covariance 12(Re⁡C−Im⁡CIm⁡CRe⁡C)\tfrac12\big(\begin{smallmatrix}\operatorname{Re}C&-\operatorname{Im}C\\ \operatorname{Im}C&\operatorname{Re}C\end{smallmatrix}\big)21​(ReCImC​−ImCReC​) with CCC Hermitian; put R=(C−1)(C+1)−1R=(C-1)(C+1)^{-1}R=(C−1)(C+1)−1; positivity and normalization of ρ\rhoρ give 0⪯R≺10\preceq R\prec10⪯R≺1; conclude with the fact that a state is determined by its characteristic function (or by its Husimi function, BosonicLearn.husimi_fourier).

Formalization Note IsPassive ρ is the mission predicate (Gaussian for some mean and covariance, and vanishing Fock matrix elements between different total photon numbers); the conclusion is equality of coefficient arrays with fugacityCoeff R.

Preamble
import Mathlib
import Definitions.Def_BosonicLearn_fugacityCoeff
import Definitions.Def_BosonicLearn_IsPassive

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

/-- **Every passive Gaussian state has a fugacity matrix.**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, Lemma 2, p. 20: "There is a bijection between n-mode passive Gaussian states ρ and n-by-n Hermitian matrices 0 ≤ R < I.
Given R, which we call the fugacity matrix, the corresponding passive Gaussian state is ρ = det(I − R)Γ(R)."

If `ρ` is a passive Gaussian state (Gaussian, and block diagonal in the total photon number), then there is a
positive semidefinite `R` with `1 − R` positive definite such that `ρ = det(1 − R)Γ(R)`.

**Formalization Note.** This is the surjectivity half of the bijection of `lemma_2`; the other clauses of Lemma 2
(`det(1 − R)Γ(R)` is a passive Gaussian state, the formula `R = P_1ρP_1/Tr(P_0ρ)` and hence uniqueness of `R`, and
the mean photon number) are proved in `fugacity_isGaussianState`, `gammaFock_one_photon` and
`fugacity_photon_number`. -/
theorem passive_gaussian_fugacity {n : ℕ} (ρ : State (Occupation (Fin n))) (hρ : IsPassive ρ) :
    ∃ R : Matrix (Fin n) (Fin n) ℂ, R.PosSemidef ∧ (1 - R).PosDef ∧
      ρ.coefficients = fugacityCoeff R := by sorry

end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, Lemma 2, Eqs. (21)–(22), p. 20

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