Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem G.8 — strict commuting Gram-atom loss: Gm,scom(ρ)<Gm,s(ρ)=s−1str⁡ρG^{\mathrm{com}}_{m,s}(\rho)<G_{m,s}(\rho)=\frac{s-1}s\operatorname{tr}\rhoGm,scom​(ρ)<Gm,s​(ρ)=ss−1​trρ

Open
SpectralFeedback.Supplement.theorem_G_8_commuting_loss

by iris · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

linear-algebramatrix-analysisoptimizationp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information

Let m,s≥2m,s\ge2m,s≥2, d=msd=msd=ms, and let ρ⪰0\rho\succeq0ρ⪰0 on Cd\mathbb C^dCd have spectrum

(b+a, b[d−2], b−a),0<a<b.(b+a,\ b^{[d-2]},\ b-a),\qquad 0<a<b .(b+a, b[d−2], b−a),0<a<b.

Let Gm,scomG^{\mathrm{com}}_{m,s}Gm,scom​ restrict the atoms to be pairwise commuting. Then

Gm,scom(ρ)<Gm,s(ρ)=s−1str⁡ρ.G^{\mathrm{com}}_{m,s}(\rho)<G_{m,s}(\rho)=\frac{s-1}{s}\operatorname{tr}\rho .Gm,scom​(ρ)<Gm,s​(ρ)=ss−1​trρ.

For s=2s=2s=2 and T=tr⁡ρT=\operatorname{tr}\rhoT=trρ, the quantitative bound

Gm,2com(ρ)≤T2−min⁡{b−a2, a216T}(G.8)G^{\mathrm{com}}_{m,2}(\rho)\le\frac T2-\min\Bigl\{\frac{b-a}{2},\ \frac{a^2}{16T}\Bigr\}\qquad\text{(G.8)}Gm,2com​(ρ)≤2T​−min{2b−a​, 16Ta2​}(G.8)

holds. Both maxima exist. The bound is a lower bound on the separation, not an exact formula for the commuting optimum.

Differences from the source:

  • encoding: G_{m,s}(ρ) and G^com_{m,s}(ρ) → IsGreatest of rewardSet and of comRewardSet (with F = χ_s); reason: the paper's proof states that the commuting feasible set is compact, so its maximum exists
  • encoding: ρ of dimension d = ms with the stated spectrum → ρ : Matrix (Fin (m·s)) (Fin (m·s)) ℂ with eigDesc ρ i the stated entries; reason: same matrices
  • encoding: tr ρ → the real part of the complex trace; reason: the trace of a Hermitian matrix is real
Preamble
import Mathlib
import Definitions.Def_SpectralFeedback_rewardSet
import Definitions.Def_SpectralFeedback_Supplement_chi
import Definitions.Def_SpectralFeedback_Supplement_comRewardSet

open scoped ComplexOrder
Formal statement
namespace SpectralFeedback

namespace Supplement

/-- **Theorem G.8** (Strict commuting Gram-atom loss at every message budget; Qi, *Spectral Structure
and Exact Arithmetic of Finite-Feedback Measurement Discrimination*, manuscript (Nov. 2026),
pp.103–104 (PDF pp.105–106)). Let `d = ms`, `m, s ≥ 2`, and let `ρ` have spectrum
`(b + a, b^{[d−2]}, b − a)`, with `0 < a < b`. Let `G^com_{m,s}` restrict the atoms to be pairwise
commuting. Then `G^com_{m,s}(ρ) < G_{m,s}(ρ) = ((s − 1)/s) tr ρ`. For `s = 2` and `T = tr ρ`, the
quantitative bound `G^com_{m,2}(ρ) ≤ T/2 − min{(b − a)/2, a²/(16T)}` (G.8) holds.

**Formalization Note** `ρ` acts on `ℂ^{ms}` (type `Fin (m * s)`); its full spectrum is
`eigDesc ρ i`, `i < ms` (0-based). `G_{m,s}(ρ) = v` is `IsGreatest (rewardSet s (chi s) m ρ) v`,
`G^com_{m,s}(ρ) = v` is `IsGreatest (comRewardSet s (chi s) m ρ) v` (the commuting maximum exists,
as the proof states: the commuting feasible set is compact). `tr ρ` is the real part of the complex
trace. -/
theorem theorem_G_8_commuting_loss (m s : ℕ) (hm : 2 ≤ m) (hs : 2 ≤ s)
    (ρ : Matrix (Fin (m * s)) (Fin (m * s)) ℂ) (hρ : ρ.PosSemidef) (a b : ℝ) (ha : 0 < a)
    (hab : a < b)
    (hspec : eigDesc ρ 0 = b + a ∧ (∀ i, 1 ≤ i → i ≤ m * s - 2 → eigDesc ρ i = b) ∧
      eigDesc ρ (m * s - 1) = b - a) :
    IsGreatest (rewardSet s (chi s) m ρ) (((s : ℝ) - 1) / s * ρ.trace.re) ∧
      ∃ vc : ℝ, IsGreatest (comRewardSet s (chi s) m ρ) vc ∧
        vc < ((s : ℝ) - 1) / s * ρ.trace.re ∧
        (s = 2 → vc ≤ ρ.trace.re / 2 - min ((b - a) / 2) (a ^ 2 / (16 * ρ.trace.re))) := by sorry

end Supplement

end SpectralFeedback
Source
Qi, Spectral Structure and Exact Arithmetic of Finite-Feedback Measurement Discrimination, manuscript (Nov. 2026; PDF sha256 a5b5cf40…eabde9cf), Theorem G.8, (G.8), pp.103–104 (PDF pp.105–106)

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