Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

∥ρ(μ,Σ1)−ρ(μ,Σ2)∥1=∥ρ(μ′,Σ1)−ρ(μ′,Σ2)∥1\|\rho(\mu,\Sigma_1)-\rho(\mu,\Sigma_2)\|_1=\|\rho(\mu',\Sigma_1)-\rho(\mu',\Sigma_2)\|_1∥ρ(μ,Σ1​)−ρ(μ,Σ2​)∥1​=∥ρ(μ′,Σ1​)−ρ(μ′,Σ2​)∥1​: a common displacement does not change the trace distance

Proved
BosonicLearn.traceDist_gaussian_common_mean

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

bosonic-gaussian-statesquantum-informationquantum-learning

The trace distance between two Gaussian states with the same mean depends only on the two covariance matrices.

Let ρ1=ρ(μ,Σ1)\rho_1=\rho(\mu,\Sigma_1)ρ1​=ρ(μ,Σ1​), ρ2=ρ(μ,Σ2)\rho_2=\rho(\mu,\Sigma_2)ρ2​=ρ(μ,Σ2​), σ1=ρ(μ′,Σ1)\sigma_1=\rho(\mu',\Sigma_1)σ1​=ρ(μ′,Σ1​), σ2=ρ(μ′,Σ2)\sigma_2=\rho(\mu',\Sigma_2)σ2​=ρ(μ′,Σ2​) be nnn-mode Gaussian states. Then

12∥ρ1−ρ2∥1=12∥σ1−σ2∥1.\tfrac12\|\rho_1-\rho_2\|_1=\tfrac12\|\sigma_1-\sigma_2\|_1 .21​∥ρ1​−ρ2​∥1​=21​∥σ1​−σ2​∥1​.

Why it holds. A state is determined by its characteristic function, so ρk=D σkD†\rho_k=D\,\sigma_kD^\daggerρk​=Dσk​D† for the displacement operator DDD by μ−μ′\mu-\mu'μ−μ′, a unitary, and the trace norm is invariant under conjugation by a unitary.

Role. Theorem 7 bounds 12∥ρ(0,Σ′)−ρ(0,Σˉ)∥1\tfrac12\|\rho(0,\Sigma')-\rho(0,\bar\Sigma)\|_121​∥ρ(0,Σ′)−ρ(0,Σˉ)∥1​ for centred states. In the proof of Theorem 8 it is applied to ρ(μ^,Σ~)\rho(\hat\mu,\tilde\Sigma)ρ(μ^​,Σ~) and ρ(μ^,Σ)\rho(\hat\mu,\Sigma)ρ(μ^​,Σ) through this identity.

Formalization Note IsGaussianState ρ μ S is the mission's predicate for ρ=ρ(μ,Σ)\rho=\rho(\mu,\Sigma)ρ=ρ(μ,Σ): the characteristic function of ρ\rhoρ is exp⁡(iξ⋅μ−12ξ⊤Σξ)\exp(\mathrm i\xi\cdot\mu-\tfrac12\xi^\top\Sigma\xi)exp(iξ⋅μ−21​ξ⊤Σξ), together with finite energy, symmetry of Σ\SigmaΣ and the first and second moment identities; quadratures are in grouped order (q1,…,qn,p1,…,pn)(q_1,\dots,q_n,p_1,\dots,p_n)(q1​,…,qn​,p1​,…,pn​) and the vacuum has Σ=121\Sigma=\tfrac12\mathbf 1Σ=21​1. States are State (Occupation (Fin n)), density operators on ℓ2(Nn)\ell^2(\mathbb N^n)ℓ2(Nn). The four states are given through the predicate, so the statement also contains uniqueness of the Gaussian state with given moments (take μ′=μ\mu'=\muμ′=μ and Σ1=Σ2\Sigma_1=\Sigma_2Σ1​=Σ2​). traceDist is 12∥⋅∥1\tfrac12\|\cdot\|_121​∥⋅∥1​ with values in ℝ≥0∞.

Preamble
import Mathlib
import Definitions.Def_BosonicLearn_traceDist
import Definitions.Def_BosonicLearn_IsGaussianState

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

/-- **The trace distance of two Gaussian states with a common mean does not depend on the mean.**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, §7.2, proof of Theorem 8, p. 62: "Since a common displacement is implemented by the same unitary on both
states, trace distance is invariant under it. Therefore ‖ρ(µ̂, Σ̃) − ρ(µ̂, Σ)‖₁ = ‖ρ(0, Σ̃) − ρ(0, Σ)‖₁."

For Gaussian states `ρ(µ, Σ₁)`, `ρ(µ, Σ₂)` and `ρ(µ′, Σ₁)`, `ρ(µ′, Σ₂)`,
`½‖ρ(µ, Σ₁) − ρ(µ, Σ₂)‖₁ = ½‖ρ(µ′, Σ₁) − ρ(µ′, Σ₂)‖₁`.

**Formalization Note.** The four states are given by their defining predicate; the statement includes that a
Gaussian state is determined by its mean and covariance (take `µ′ = µ`, `Σ₁ = Σ₂`). -/
theorem traceDist_gaussian_common_mean {n : ℕ} (ρ₁ ρ₂ σ₁ σ₂ : State (Occupation (Fin n)))
    (μ μ' : Fin n ⊕ Fin n → ℝ) (S₁ S₂ : Matrix (Fin n ⊕ Fin n) (Fin n ⊕ Fin n) ℝ)
    (h₁ : IsGaussianState ρ₁ μ S₁) (h₂ : IsGaussianState ρ₂ μ S₂)
    (k₁ : IsGaussianState σ₁ μ' S₁) (k₂ : IsGaussianState σ₂ μ' S₂) :
    traceDist ρ₁.coefficients ρ₂.coefficients = traceDist σ₁.coefficients σ₂.coefficients := by sorry

end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, p. 62 ("Since a common displacement is implemented by the same unitary on both states, trace distance is invariant under it", proof of Theorem 8)

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