Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Characteristic function of det⁡(I−R)Γ(R)\det(I-R)\Gamma(R)det(I−R)Γ(R): Tr(ρReiξ⋅r^)=exp⁡(−12ζ†(1+R)(1−R)−1ζ)\mathrm{Tr}(\rho_Re^{i\xi\cdot\hat r})=\exp(-\tfrac12\zeta^\dagger(1+R)(1-R)^{-1}\zeta)Tr(ρR​eiξ⋅r^)=exp(−21​ζ†(1+R)(1−R)−1ζ)

Proved
BosonicLearn.fugacity_characteristic

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

bosonic-gaussian-statesquantum-informationquantum-learning

The Weyl characteristic function of the passive Gaussian state with fugacity matrix RRR.

Let RRR be a positive semidefinite n×nn\times nn×n complex matrix with 1−R1-R1−R positive definite, and ρR=det⁡(1−R)Γ(R)\rho_R=\det(1-R)\Gamma(R)ρR​=det(1−R)Γ(R). For ξ∈R2n\xi\in\mathbb R^{2n}ξ∈R2n put ζj=(−ξpj+iξqj)/2\zeta_j=(-\xi_{p_j}+i\xi_{q_j})/\sqrt2ζj​=(−ξpj​​+iξqj​​)/2​, so that eiξ⋅r^=D(ζ)e^{i\xi\cdot\hat r}=D(\zeta)eiξ⋅r^=D(ζ). Then the iterated series defining Tr⁡(ρReiξ⋅r^)\operatorname{Tr}(\rho_Re^{i\xi\cdot\hat r})Tr(ρR​eiξ⋅r^) converge and

Tr⁡(ρR eiξ⋅r^)=exp⁡ ⁣(−12 ζ†(1+R)(1−R)−1ζ).\operatorname{Tr}\big(\rho_R\,e^{i\xi\cdot\hat r}\big)=\exp\!\Big(-\tfrac12\,\zeta^\dagger(1+R)(1-R)^{-1}\zeta\Big).Tr(ρR​eiξ⋅r^)=exp(−21​ζ†(1+R)(1−R)−1ζ).

Role. This is the computation behind clause 1 of Lemma 2 of the paper: ρR\rho_RρR​ is Gaussian, with covariance read off from (1+R)(1−R)−1(1+R)(1-R)^{-1}(1+R)(1−R)−1 (BosonicLearn.fugacity_isGaussianState).

Formalization Note The left-hand side is the published Support50.P14.oscillatorCharacteristic (∑u∑vρuvW(ξ)vu\sum_u\sum_v\rho_{uv}W(\xi)_{vu}∑u​∑v​ρuv​W(ξ)vu​ with interleaved quadrature index (j,0)=qj(j,0)=q_j(j,0)=qj​, (j,1)=pj(j,1)=p_j(j,1)=pj​), and the convergence statement is OscillatorCharacteristicSummable. The quadratic form is written as the double sum ∑j,kζˉj ((1+R)(1−R)−1)jk ζk\sum_{j,k}\bar\zeta_j\,((1+R)(1-R)^{-1})_{jk}\,\zeta_k∑j,k​ζˉ​j​((1+R)(1−R)−1)jk​ζk​.

Preamble
import Mathlib
import Definitions.Def_BosonicLearn_fugacityCoeff
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P14

open QAlgorithms.Papers.Independent.Claimed50.P47 (Occupation)
open QAlgorithms.Papers.Independent.Support50.P14 (oscillatorCharacteristic OscillatorCharacteristicSummable)
open scoped Matrix ComplexOrder
Formal statement
namespace BosonicLearn

/-- **Characteristic function of `det(I − R)Γ(R)`.**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, Lemma 2, Eq. (21), p. 20: "the corresponding passive Gaussian state is ρ = det(I − R)Γ(R)"; §1.1, Eq. (2), pp. 4–5
(characteristic function of a Gaussian state).

Let `R` be positive semidefinite with `1 − R` positive definite and `ρ_R = det(1 − R)Γ(R)`. For `ξ ∈ ℝ^{2n}` let
`ζⱼ = (−ξ_{pⱼ} + i ξ_{qⱼ})/√2`, so that the Weyl operator is `e^{iξ·r̂} = D(ζ)`. Then

`Tr(ρ_R e^{iξ·r̂}) = exp(−½ ζ† (1 + R)(1 − R)⁻¹ ζ)`,

and the iterated sums defining the left-hand side converge.

**Formalization Note.** The left-hand side is the published `Support50.P14.oscillatorCharacteristic`
(`∑ᵤ ∑ᵥ ρ_{uv} W(ξ)_{vu}`, interleaved quadrature index `(j, 0) = qⱼ`, `(j, 1) = pⱼ`), and the convergence statement
is `OscillatorCharacteristicSummable`. -/
theorem fugacity_characteristic {n : ℕ} (R : Matrix (Fin n) (Fin n) ℂ) (hR : R.PosSemidef)
    (hR1 : (1 - R).PosDef) :
    OscillatorCharacteristicSummable (fugacityCoeff R) ∧
    ∀ ξ : Fin n × Fin 2 → ℝ,
      oscillatorCharacteristic (fugacityCoeff R) ξ =
        Complex.exp (-(1 / 2 : ℂ) *
          ∑ j, ∑ k, star ((-(ξ (j, 1) : ℂ) + Complex.I * (ξ (j, 0) : ℂ)) / (Real.sqrt 2 : ℂ)) *
            ((1 + R) * (1 - R)⁻¹) j k *
            ((-(ξ (k, 1) : ℂ) + Complex.I * (ξ (k, 0) : ℂ)) / (Real.sqrt 2 : ℂ))) := 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)); §1.1, Eqs. (2) and (4), pp. 4–5 (Gaussian states, characteristic function, passive 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