Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 58: norm, reconstruction and trace identities for raw eigenmatrices

Proved
QAlgorithms.Papers.Independent.Extend50.P31.theorem58_rawIdentities

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let GGG be a finite group and U:G→U(n)U:G\to U(n)U:G→U(n) an ordinary unitary irreducible representation with n>0n>0n>0. Fix a complete family of inequivalent unitary irreducibles φα\varphi^\alphaφα, in fixed coordinate bases, with dimensions dα>0d_\alpha>0dα​>0 and characters χα\chi_\alphaχα​. Assume U⊗U‾≃⨁α∈ΘφαU\otimes\overline U\simeq\bigoplus_{\alpha\in\Theta}\varphi^\alphaU⊗U≃⨁α∈Θ​φα, each occurring once. Throughout, Pα=(dα/∣G∣)∑gχα(g−1)Ad⁡U(g)P_\alpha=(d_\alpha/|G|)\sum_g\chi_\alpha(g^{-1})\operatorname{Ad}_U(g)Pα​=(dα​/∣G∣)∑g​χα​(g−1)AdU​(g), P~α=mat⁡(Pα)\widetilde P_\alpha=\operatorname{mat}(P_\alpha)Pα​=mat(Pα​), and J(Φ)=∑ijEij⊗Φ(Eij)J(\Phi)=\sum_{ij}E_{ij}\otimes\Phi(E_{ij})J(Φ)=∑ij​Eij​⊗Φ(Eij​) is unnormalized. Fine projectors use the diagonal matrix coefficient φα(g−1)ii\varphi^\alpha(g^{-1})_{ii}φα(g−1)ii​ in place of the character. Whenever vectors ViβV_i^\betaViβ​ occur, choose one pivot (s,t)(s,t)(s,t) per fine sector with p=(P~βi)st,st>0p=(\widetilde P_{\beta i})_{st,st}>0p=(Pβi​)st,st​>0 and set Viβ=Pβi(Est)/pV_i^\beta=P_{\beta i}(E_{st})/\sqrt pViβ​=Pβi​(Est​)/p​ and viβ=vec⁡((Viβ)T)v_i^\beta=\operatorname{vec}((V_i^\beta)^T)viβ​=vec((Viβ​)T). Write μi(α,β)=(dα/∣G∣)∑gχα(g−1)∣Tr⁡(ViβU(g)†)∣2\mu_i(\alpha,\beta)=(d_\alpha/|G|)\sum_g\chi_\alpha(g^{-1})|\operatorname{Tr}(V_i^\beta U(g)^\dagger)|^2μi​(α,β)=(dα​/∣G∣)∑g​χα​(g−1)∣Tr(Viβ​U(g)†)∣2 and M(β,i),α=μi(α,β)M_{(\beta,i),\alpha}=\mu_i(\alpha,\beta)M(β,i),α​=μi​(α,β) when these spectral coordinates occur.

For occurring fine sectors r=(α,i)r=(\alpha,i)r=(α,i), use the raw matrices Wr(s,t)=Pr(Est)W_r(s,t)=P_r(E_{st})Wr​(s,t)=Pr​(Est​), without normalizing and including zero pivots. Their norm, reconstruction and trace identities are

∥Wr(s,t)∥HS2=(P~r)st,st,∑s,t∥Wr(s,t)∥HS2=1,∑rWr(s,t)=Est,∑sWαi(s,s)=δα,idIn,Tr⁡Wαi(s,t)=δα,idδst.\begin{gathered}\|W_r(s,t)\|_{\mathrm{HS}}^2=(\widetilde P_r)_{st,st},\qquad\sum_{s,t}\|W_r(s,t)\|_{\mathrm{HS}}^2=1,\\\sum_r W_r(s,t)=E_{st},\qquad\sum_sW_{\alpha i}(s,s)=\delta_{\alpha,\mathrm{id}}I_n,\qquad\operatorname{Tr}W_{\alpha i}(s,t)=\delta_{\alpha,\mathrm{id}}\delta_{st}.\end{gathered}∥Wr​(s,t)∥HS2​=(Pr​)st,st​,s,t∑​∥Wr​(s,t)∥HS2​=1,r∑​Wr​(s,t)=Est​,s∑​Wαi​(s,s)=δα,id​In​,TrWαi​(s,t)=δα,id​δst​.​

This describes the norm, reconstruction and trace identities for raw eigenmatrices in the fixed source conventions.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Extend50_P31
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

namespace QAlgorithms.Papers.Independent.Extend50.P31

open QAlgorithms.Papers.Independent.Information100.P44 (Mat matrixUnit)

open QAlgorithms.Papers.Independent.Frontier18.P17 (hs)

open QAlgorithms.Papers.Independent.Bridge50.P37 (hsAdjoint)

open QAlgorithms.Papers.Independent.Information100.P34 (choi)

open QAlgorithms.Papers.Independent.Dependency50.P26 (TracePreserving)

open QAlgorithms.Papers.Independent.Dependency50.P16 (sandwich)

open QAlgorithms.Papers.Independent.Information100.P75 (phase)

variable {G A : Type*} [Group G] [Fintype G] [Fintype A] [DecidableEq A] {n : ℕ}

/-- PDF pp.31--32, Theorem 58 Eqs.(157)--(160), proof p.40 Eq.(192).
SOURCE CORRECTION: these are raw W, not normalized Eq.(62) V. At id and a diagonal
pivot, W=I/n has squared HS norm 1/n. Proof Eq.(194) also needs the omitted sum over s. -/
theorem theorem58_rawIdentities (D : Data G A n) :
    (∀ r : Row D, ∀ p : Fin n × Fin n,
      hs (rawMatrix D.U D.F r.1.val r.2 p) (rawMatrix D.U D.F r.1.val r.2 p) =
        fineMatrix D.U D.F r.1.val r.2 p p) ∧
    (∀ r : Row D, (∑ p : Fin n × Fin n,
      hs (rawMatrix D.U D.F r.1.val r.2 p) (rawMatrix D.U D.F r.1.val r.2 p)) = 1) ∧
    (∀ p : Fin n × Fin n, (∑ r : Row D, rawMatrix D.U D.F r.1.val r.2 p) = matrixUnit p.1 p.2) ∧
    (∀ r : Row D, (∑ s : Fin n, rawMatrix D.U D.F r.1.val r.2 (s,s)) =
      if r.1.val = D.F.trivial then 1 else 0) ∧
    (∀ r : Row D, ∀ p : Fin n × Fin n, Matrix.trace (rawMatrix D.U D.F r.1.val r.2 p) =
      if r.1.val = D.F.trivial ∧ p.1 = p.2 then 1 else 0) := by sorry

end QAlgorithms.Papers.Independent.Extend50.P31

end
Source
Structure of irreducibly covariant quantum channels for finite groups, arXiv:1610.05657v2, PDF p. 31, Theorem 58: norm, reconstruction and trace identities for raw eigenmatrices
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let GGG be a finite group, AAA a finite index type with decidable equality, and DDD specify an irreducible unitary representation U:G→Mn(C)U:G\to M_n(\mathbb C)U:G→Mn​(C), n>0n>0n>0, a complete family (ρa)a∈A(\rho_a)_{a\in A}(ρa​)a∈A​ of pairwise inequivalent positive-dimensional irreducible unitary representations with designated one-dimensional trivial member a0a_0a0​, and an invertible complex-linear intertwining equivalence U⊗U‾≃⨁a∈ΘρaU\otimes\overline U\simeq\bigoplus_{a\in\Theta}\rho_aU⊗U≃⨁a∈Θ​ρa​, each summand appearing once. Write R={(a,i):a∈Θ, 0≤i<da}R=\{(a,i):a\in\Theta,\ 0\le i<d_a\}R={(a,i):a∈Θ, 0≤i<da​}. For r=(a,i)∈Rr=(a,i)\in Rr=(a,i)∈R and p=(u,v)p=(u,v)p=(u,v), define

Br,p=da∣G∣∑gρa(g−1)iiUgEuvUg†,Qr=da∣G∣∑gρa(g−1)ii(Ug⊗Ug‾),B_{r,p}=\frac{d_a}{|G|}\sum_g\rho_a(g^{-1})_{ii}U_gE_{uv}U_g^\dagger, \qquad Q_r=\frac{d_a}{|G|}\sum_g\rho_a(g^{-1})_{ii}(U_g\otimes\overline{U_g}),Br,p​=∣G∣da​​g∑​ρa​(g−1)ii​Ug​Euv​Ug†​,Qr​=∣G∣da​​g∑​ρa​(g−1)ii​(Ug​⊗Ug​​),

and define ⟨X,Y⟩HS=∑u,vXuv‾Yuv\langle X,Y\rangle_{\mathrm{HS}}=\sum_{u,v}\overline{X_{uv}}Y_{uv}⟨X,Y⟩HS​=∑u,v​Xuv​​Yuv​. Then, for every r,pr,pr,p, ⟨Br,p,Br,p⟩HS=(Qr)p,p\langle B_{r,p},B_{r,p}\rangle_{\mathrm{HS}}=(Q_r)_{p,p}⟨Br,p​,Br,p​⟩HS​=(Qr​)p,p​; for every rrr, ∑p⟨Br,p,Br,p⟩HS=1\sum_p\langle B_{r,p},B_{r,p}\rangle_{\mathrm{HS}}=1∑p​⟨Br,p​,Br,p​⟩HS​=1; for every p=(u,v)p=(u,v)p=(u,v), ∑rBr,p=Euv\sum_rB_{r,p}=E_{uv}∑r​Br,p​=Euv​; for every r=(a,i)r=(a,i)r=(a,i), ∑s=0n−1Br,(s,s)=In\sum_{s=0}^{n-1}B_{r,(s,s)}=I_n∑s=0n−1​Br,(s,s)​=In​ if a=a0a=a_0a=a0​ and equals the zero matrix otherwise; and, for every r=(a,i)r=(a,i)r=(a,i) and p=(u,v)p=(u,v)p=(u,v), tr⁡Br,p=1\operatorname{tr}B_{r,p}=1trBr,p​=1 if both a=a0a=a_0a=a0​ and u=vu=vu=v, and equals 000 otherwise.

Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 30, 2026

    Confirmed by the mission captain (proposal self-audit).

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