Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Gram identity for all raw quantum-channel eigenmatrices

Proved
QAlgorithms.Papers.Independent.Extend50.P31.raw_eigenmatrix_gram

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

finite-groupsquantum-informationrepresentation-theory

Under the finite-group irreducible and multiplicity-free decomposition assumptions, let QrQ_rQr​ be a fine projector and let Vr(p)=Pr(Ep)V_r(p)=P_r(E_p)Vr​(p)=Pr​(Ep​) be its raw eigenmatrix at matrix-unit position ppp. For any fine sectors r,sr,sr,s and positions p,qp,qp,q,

⟨Vr(p),Vs(q)⟩HS={(Qr)pqr=s,0r≠s.\langle V_r(p),V_s(q)\rangle_{\mathrm{HS}}=\begin{cases}(Q_r)_{pq}&r=s,\\0&r\ne s.\end{cases}⟨Vr​(p),Vs​(q)⟩HS​={(Qr​)pq​0​r=s,r=s.​

The inner product is conjugate-linear in its first argument and uses the unnormalized Hilbert–Schmidt convention. In particular, a raw eigenmatrix has squared norm equal to its diagonal pivot weight. The mixed Gram formula also records orthogonality across all distinct sectors.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Extend50_P31
noncomputable section
open QAlgorithms.Papers.Independent.Extend50.P31
open QAlgorithms.Papers.Independent.Information100.P44 (Mat matrixUnit)
open QAlgorithms.Papers.Independent.Frontier18.P17 (hs res)
open scoped Matrix ComplexConjugate
Formal statement
theorem QAlgorithms.Papers.Independent.Extend50.P31.raw_eigenmatrix_gram {G A : Type*} [Group G] [Fintype G] [Fintype A] [DecidableEq A] {n : ℕ} (D : Data G A n) (r s : Row D) (p q : Fin n × Fin n) :
    hs (rawMatrix D.U D.F r.1.val r.2 p) (rawMatrix D.U D.F s.1.val s.2 q) =
      if r = s then fineMatrix D.U D.F r.1.val r.2 p q else 0 := by sorry
Source
Mozrzymas, Studzinski and Datta, Structure of irreducibly covariant quantum channels for finite groups, https://arxiv.org/abs/1610.05657v2, PDF p.12 Proposition 17 Eq.(56), p.13 Proposition 20 Eqs.(62)–(63), and pp.31–32 Theorem 58 Eq.(157); mixed-position Gram extension of the displayed norm identity.

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