Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Weyl monotonicity: for Hermitian 0⪯B−⪯B+⪯Λ0\preceq B_-\preceq B_+\preceq\Lambda0⪯B−​⪯B+​⪯Λ the eigenvalues can be paired, 0≤λi−≤λi+≤Λ0\le\lambda^-_i\le\lambda^+_i\le\Lambda0≤λi−​≤λi+​≤Λ

Proved
BosonicLearn.loewner_eigenvalue_pairing

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

bosonic-gaussian-statesquantum-informationquantum-learning

Weyl's monotonicity theorem for eigenvalues, in a form with explicit enumerations.

Let B−,B+B_-,B_+B−​,B+​ be Hermitian n×nn\times nn×n complex matrices with 0⪯B−⪯B+⪯Λ10\preceq B_-\preceq B_+\preceq\Lambda\mathbf 10⪯B−​⪯B+​⪯Λ1. Then the eigenvalues of B−B_-B−​ and of B+B_+B+​ can be enumerated, with multiplicity, as λ1−,…,λn−\lambda^-_1,\dots,\lambda^-_nλ1−​,…,λn−​ and λ1+,…,λn+\lambda^+_1,\dots,\lambda^+_nλ1+​,…,λn+​ so that

0≤λi−≤λi+≤Λfor every i.0\le\lambda^-_i\le\lambda^+_i\le\Lambda\qquad\text{for every }i .0≤λi−​≤λi+​≤Λfor every i.

Role. In the proof of Lemma 12 this pairs the mean photon numbers of the thermal modes of the two reduced states ("Since B+≥B−B_+\ge B_-B+​≥B−​, Weyl's monotonicity theorem yields λi+≥λi−\lambda^+_i\ge\lambda^-_iλi+​≥λi−​ for every iii"), which is what makes the convolution coupling of the two photon-count distributions possible.

Formalization Note "Enumeration of the eigenvalues with multiplicity" is expressed through the consequences that are used: det⁡(1+tB±)=∏i(1+tλi±)\det(1+tB_\pm)=\prod_i(1+t\lambda^\pm_i)det(1+tB±​)=∏i​(1+tλi±​) for all real ttt (this determines the multiset), Tr⁡B±=∑iλi±\operatorname{Tr}B_\pm=\sum_i\lambda^\pm_iTrB±​=∑i​λi±​ and Tr⁡B−2=∑i(λi−)2\operatorname{Tr}B_-^2=\sum_i(\lambda^-_i)^2TrB−2​=∑i​(λi−​)2. The hypotheses are Matrix.PosSemidef of B−B_-B−​, B+−B−B_+-B_-B+​−B−​ and Λ⋅1−B+\Lambda\cdot1-B_+Λ⋅1−B+​.

Preamble
import Mathlib

open scoped Matrix ComplexOrder
Formal statement
namespace BosonicLearn

/-- **Weyl monotonicity: eigenvalues of Loewner-ordered Hermitian matrices can be paired.**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, §5.7, proof of Lemma 12, after Eq. (136): "Since B₊ ≥ B₋, Weyl's monotonicity theorem yields λ⁺_i ≥ λ⁻_i for every i."

Let `0 ⪯ B₋ ⪯ B₊ ⪯ Λ·1` be Hermitian `n × n` matrices. Then there are enumerations `λ⁻_1, …, λ⁻_n` and
`λ⁺_1, …, λ⁺_n` of their eigenvalues (with multiplicity) such that `0 ≤ λ⁻_i ≤ λ⁺_i ≤ Λ` for every `i`.

**Formalization Note.** "Enumeration of the eigenvalues" is expressed by the consequences that are used:
`det(1 + tB_±) = ∏ᵢ (1 + tλ^±_i)` for all real `t`, `Tr B_± = ∑ᵢ λ^±_i` and `Tr B₋² = ∑ᵢ (λ⁻_i)²`. -/
theorem loewner_eigenvalue_pairing {n : ℕ} (Bm Bp : Matrix (Fin n) (Fin n) ℂ) (hm : Bm.PosSemidef)
    (hd : (Bp - Bm).PosSemidef) (Λ : ℝ)
    (hΛ : (((Λ : ℝ) : ℂ) • (1 : Matrix (Fin n) (Fin n) ℂ) - Bp).PosSemidef) :
    ∃ lp lm : Fin n → ℝ, (∀ i, 0 ≤ lm i) ∧ (∀ i, lm i ≤ lp i) ∧ (∀ i, lp i ≤ Λ) ∧
      (∀ t : ℝ, (1 + ((t : ℝ) : ℂ) • Bp).det = ∏ i, ((1 + t * lp i : ℝ) : ℂ)) ∧
      (∀ t : ℝ, (1 + ((t : ℝ) : ℂ) • Bm).det = ∏ i, ((1 + t * lm i : ℝ) : ℂ)) ∧
      Bp.trace = ((∑ i, lp i : ℝ) : ℂ) ∧ Bm.trace = ((∑ i, lm i : ℝ) : ℂ) ∧
      (Bm * Bm).trace = ((∑ i, lm i ^ 2 : ℝ) : ℂ) := by sorry

end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, §5.7 (Delayed proof for Lemma 12), proof of Lemma 12, after Eq. (136) (Weyl's monotonicity theorem)

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