Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Trace-norm separation of passive Gaussian states from their occupation matrices, uniform in temperature: ∥ρ1−ρ2∥1≥c Tr(N1−N2)2/(θm2n)\|\rho_1-\rho_2\|_1\ge c\,\mathrm{Tr}(N_1-N_2)^2/(\theta m^2\sqrt n)∥ρ1​−ρ2​∥1​≥cTr(N1​−N2​)2/(θm2n​)

Proved
BosonicLearn.occupation_count_separation

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

bosonic-gaussian-statesquantum-informationquantum-learning

The pairwise-distance bound for the hard ensemble of Theorem 9, by the photon-counting argument of Lemma 12, with a constant independent of the temperature scale mmm.

There is an absolute constant c>0c>0c>0 such that: for m≥1m\ge1m≥1, θ>0\theta>0θ>0 with θn≤78\theta\sqrt n\le\frac78θn​≤87​, and Hermitian n×nn\times nn×n occupation matrices N1,N2N_1,N_2N1​,N2​ with 78m 1⪯Ni⪯98m 1\frac78m\,\mathbf 1\preceq N_i\preceq\frac98m\,\mathbf 187​m1⪯Ni​⪯89​m1, Tr⁡(N1−N2)=0\operatorname{Tr}(N_1-N_2)=0Tr(N1​−N2​)=0 and −θm 1⪯N1−N2⪯θm 1-\theta m\,\mathbf 1\preceq N_1-N_2\preceq\theta m\,\mathbf 1−θm1⪯N1​−N2​⪯θm1, the passive Gaussian states ρi=det⁡(1−Ri)Γ(Ri)\rho_i=\det(\mathbf 1-R_i)\Gamma(R_i)ρi​=det(1−Ri​)Γ(Ri​) with fugacity matrices Ri=Ni(1+Ni)−1R_i=N_i(\mathbf 1+N_i)^{-1}Ri​=Ni​(1+Ni​)−1 satisfy

∥ρ1−ρ2∥1 ≥ c Tr⁡(N1−N2)2θ m2n.\|\rho_1-\rho_2\|_1\ \ge\ c\,\frac{\operatorname{Tr}(N_1-N_2)^2}{\theta\,m^2\sqrt n}.∥ρ1​−ρ2​∥1​ ≥ cθm2n​Tr(N1​−N2​)2​.

With Ni=m(1+ξXi)N_i=m(\mathbf 1+\xi X_i)Ni​=m(1+ξXi​), ∥Xi∥op≤4\|X_i\|_{\rm op}\le4∥Xi​∥op​≤4 and θ=8ξ\theta=8\xiθ=8ξ the right-hand side is c8 ξ ∥X1−X2∥F2/n\frac c8\,\xi\,\|X_1-X_2\|_F^2/\sqrt n8c​ξ∥X1​−X2​∥F2​/n​.

Proof idea: count photons in the positive eigen-directions of N1−N2N_1-N_2N1​−N2​; the two counts are sums of geometric variables with paired means (BosonicLearn.loewner_eigenvalue_pairing, BosonicLearn.fugacity_count_pgf), a threshold separates them (BosonicLearn.geometric_threshold_scaled), and data processing (BosonicLearn.fugacity_count_test) transfers this to the trace norm.

Formalization Note ∥⋅∥1\|\cdot\|_1∥⋅∥1​ is the full trace norm traceSize; the lower bound is ENNReal.ofReal (…).

Preamble
import Mathlib
import Definitions.Def_BosonicLearn_fugacityCoeff
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P33

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

/-- **Trace-norm separation of passive Gaussian states from their occupation matrices, uniformly in temperature.**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, §8, proof of Theorem 9, Eqs. (226)–(228), p. 66 (pairwise trace distance of the hard ensemble for `ν ≥ 1`), by the
photon-counting argument of §5.7 (proof of Lemma 12, Eqs. (135)–(148)).

There is an absolute constant `c > 0` with the following property. Let `m ≥ 1` and let `N₁, N₂` be Hermitian `n × n`
occupation matrices with `(7/8)m·1 ⪯ N_i ⪯ (9/8)m·1`, `Tr(N₁ − N₂) = 0` and `−θm·1 ⪯ N₁ − N₂ ⪯ θm·1`, where
`θ√n ≤ 7/8`. Then the passive Gaussian states `ρ_i = det(1 − R_i)Γ(R_i)` with fugacity matrices
`R_i = N_i(1 + N_i)⁻¹` satisfy

`‖ρ₁ − ρ₂‖₁ ≥ c · Tr (N₁ − N₂)² / (θ m² √n)`.

**Formalization Note.** `‖·‖₁` is the full trace norm `traceSize`. With `N_i = m(1 + ξX_i)`, `‖X_i‖_op ≤ 4` and
`θ = 8ξ` the right-hand side is `(c/8) ξ ‖X₁ − X₂‖_F² / √n`; the bound does not depend on `m`. -/
theorem occupation_count_separation :
    ∃ c : ℝ, 0 < c ∧ ∀ (n : ℕ) (m θ : ℝ), 1 ≤ m → 0 < θ → θ * Real.sqrt n ≤ 7 / 8 →
      ∀ N₁ N₂ : Matrix (Fin n) (Fin n) ℂ,
        (N₁ - ((7 / 8 * m : ℝ) : ℂ) • (1 : Matrix (Fin n) (Fin n) ℂ)).PosSemidef →
        (((9 / 8 * m : ℝ) : ℂ) • (1 : Matrix (Fin n) (Fin n) ℂ) - N₁).PosSemidef →
        (N₂ - ((7 / 8 * m : ℝ) : ℂ) • (1 : Matrix (Fin n) (Fin n) ℂ)).PosSemidef →
        (((9 / 8 * m : ℝ) : ℂ) • (1 : Matrix (Fin n) (Fin n) ℂ) - N₂).PosSemidef →
        (N₁ - N₂).trace = 0 →
        (((θ * m : ℝ) : ℂ) • (1 : Matrix (Fin n) (Fin n) ℂ) - (N₁ - N₂)).PosSemidef →
        (((θ * m : ℝ) : ℂ) • (1 : Matrix (Fin n) (Fin n) ℂ) + (N₁ - N₂)).PosSemidef →
        ENNReal.ofReal (c * ((N₁ - N₂) * (N₁ - N₂)).trace.re / (θ * m ^ 2 * Real.sqrt n)) ≤
          traceSize (fugacityCoeff (N₁ * (1 + N₁)⁻¹) - fugacityCoeff (N₂ * (1 + N₂)⁻¹)) := by sorry

end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, §8, proof of Theorem 9, pp. 65–67 (Eqs. (226)–(228): pairwise trace distance of the ensemble); §5.7, proof of Lemma 12, Eqs. (135)–(148)

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