Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Σ⪰c I\Sigma\succeq c\,IΣ⪰cI implies every eigenvalue zzz of ΩΣ\Omega\SigmaΩΣ has ∣z∣≥c|z|\ge c∣z∣≥c (symplectic eigenvalues ≥c\ge c≥c)

Proved
BosonicLearn.symplectic_spectrum_lower

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

bosonic-gaussian-statesquantum-informationquantum-learning

Ordinary-to-symplectic eigenvalue comparison.

Let SSS be a real symmetric 2n×2n2n\times2n2n×2n matrix with S⪰c 1S\succeq c\,\mathbf 1S⪰c1 for some c≥0c\ge0c≥0, and Ω=(01n−1n0)\Omega=\begin{pmatrix}0&\mathbf 1_n\\-\mathbf 1_n&0\end{pmatrix}Ω=(0−1n​​1n​0​). Then every complex eigenvalue zzz of ΩS\Omega SΩS satisfies ∣z∣≥c|z|\ge c∣z∣≥c.

For a covariance matrix Σ\SigmaΣ the spectrum of ΩΣ\Omega\SigmaΩΣ is {±iνj}\{\pm\mathrm i\nu_j\}{±iνj​} with νj\nu_jνj​ the symplectic eigenvalues, so Σ⪰(12+ν)1\Sigma\succeq(\tfrac12+\nu)\mathbf 1Σ⪰(21​+ν)1 implies that all symplectic eigenvalues are at least 12+ν\tfrac12+\nu21​+ν.

Role. This verifies the hypothesis of Theorem 7 (symplectic eigenvalues of Σˉ\bar\SigmaΣˉ at least ν−>12\nu_->\tfrac12ν−​>21​) for states of the promise class in the proof of Theorem 8.

Formalization Note The conclusion has the form of the hypothesis hsympl of BosonicLearn.theorem_7: for every z ∈ spectrum ℂ ((Ω * S).map (↑)), c ≤ ‖z‖, with Ω = Matrix.fromBlocks 0 1 (-1) 0 in the grouped quadrature order. The hypothesis is Matrix.PosSemidef (S − c • 1). Pure linear algebra.

Preamble
import Mathlib

open scoped Matrix
Formal statement
namespace BosonicLearn

/-- **Ordinary-to-symplectic eigenvalue comparison.**
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: "The same promise also implies that every symplectic eigenvalue of Σ is at
least 1/2 + ν, by the ordinary-to-symplectic eigenvalue comparison proved above."

Let `S` be a real symmetric `2n × 2n` matrix with `S ⪰ c I`, `c ≥ 0`, and `Ω = [[0, I], [−I, 0]]`. Then every
complex eigenvalue `z` of `ΩS` satisfies `|z| ≥ c`. For a covariance matrix the spectrum of `ΩΣ` is
`{± i ν_j}` with `ν_j` the symplectic eigenvalues, so all symplectic eigenvalues are at least `c`.

**Formalization Note.** This is the hypothesis `hsympl` of `theorem_7` (with `νm = c`), in the same form:
`z ∈ spectrum ℂ ((Ω * S).map (↑))`. -/
theorem symplectic_spectrum_lower {n : ℕ} (S : Matrix (Fin n ⊕ Fin n) (Fin n ⊕ Fin n) ℝ) (c : ℝ)
    (hc : 0 ≤ c) (hS : (S - c • (1 : Matrix (Fin n ⊕ Fin n) (Fin n ⊕ Fin n) ℝ)).PosSemidef) :
    ∀ z ∈ spectrum ℂ ((Matrix.fromBlocks 0 1 (-1) 0 * S).map (fun x : ℝ => (x : ℂ))),
      c ≤ ‖z‖ := by sorry

end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, p. 62 ("the ordinary-to-symplectic eigenvalue comparison", proof of Theorem 8); Theorem 7, p. 55

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