Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 15 and Remark 16: spectral form of an ICLM

Proved
QAlgorithms.Papers.Independent.Extend50.P31.corollary15_spectral

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.

Every complex-linear UUU-covariant map Φ\PhiΦ has a spectral expansion in the computed character averages 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). They are Hilbert–Schmidt self-adjoint and mutually orthogonal, sum to the identity map, and have matrix representatives P~α\widetilde P_\alphaPα​. Each range is nonzero, and the corresponding coefficient acts on the whole range as an eigenvalue:

Φ=∑α∈ΘlαPα,lα∈C,Φ(PαX)=lαPαX.PαPβ=δαβPα.\Phi=\sum_{\alpha\in\Theta}l_\alpha P_\alpha,\quad l_\alpha\in\mathbb C,\qquad\Phi(P_\alpha X)=l_\alpha P_\alpha X.\quad P_\alpha P_\beta=\delta_{\alpha\beta}P_\alpha.Φ=α∈Θ∑​lα​Pα​,lα​∈C,Φ(Pα​X)=lα​Pα​X.Pα​Pβ​=δαβ​Pα​.

Equal coefficient values in different sectors are allowed. This gives the spectral parametrization of the full covariant endomorphism algebra.

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.11--12, Corollary 15 and Remark 16. Equal eigenvalues across sectors are allowed. -/
theorem corollary15_spectral (D : Data G A n) (Phi : EndMat n) (hPhi : IsIrrepCovariant D.U Phi) :
    (∃ l : OccurringIrrep D → ℂ, Phi = spectralMap D l ∧
      ∀ a : OccurringIrrep D,
        (∃ X : Mat n, X ≠ 0 ∧ centralMap D.U D.F a.val X = X) ∧
        ∀ X : Mat n, Phi (centralMap D.U D.F a.val X) = l a • centralMap D.U D.F a.val X) ∧
    (∀ a : OccurringIrrep D, rowMatrixRepresentative (centralMap D.U D.F a.val) = centralMatrix D.U D.F a.val) ∧
    (∀ a b : OccurringIrrep D, (centralMap D.U D.F a.val).comp (centralMap D.U D.F b.val) =
      if a = b then centralMap D.U D.F a.val else 0) ∧
    (∀ a : OccurringIrrep D, hsAdjoint (centralMap D.U D.F a.val) = centralMap D.U D.F a.val) ∧
    (∑ a : OccurringIrrep D, centralMap D.U D.F a.val) = LinearMap.id := by sorry

end QAlgorithms.Papers.Independent.Extend50.P31

end
Source
Structure of irreducibly covariant quantum channels for finite groups, arXiv:1610.05657v2, PDF p. 11, Corollary 15 and Remark 16: spectral form of an ICLM
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 set with decidable equality, and DDD consist of an irreducible unitary representation U:G→U(n)U:G\to U(n)U:G→U(n), n>0n>0n>0, a complete family (Va)a∈A(V^a)_{a\in A}(Va)a∈A​ of pairwise inequivalent irreducible unitary representations of positive dimensions dad_ada​, including a designated one-dimensional trivial member, and a subset Θ⊆A\Theta\subseteq AΘ⊆A with a complex-linear intertwining isomorphism U⊗U‾≅⨁a∈ΘVaU\otimes\overline U\cong\bigoplus_{a\in\Theta}V^aU⊗U≅⨁a∈Θ​Va. Define χa(g)=tr⁡Va(g)\chi_a(g)=\operatorname{tr}V^a(g)χa​(g)=trVa(g) and

Ca(X)=da∣G∣∑g∈Gχa(g−1)U(g)XU(g)∗,Ca=da∣G∣∑g∈Gχa(g−1)(U(g)⊗U(g)‾).\mathcal C_a(X)=\frac{d_a}{|G|}\sum_{g\in G}\chi_a(g^{-1})U(g)XU(g)^*, \qquad C_a=\frac{d_a}{|G|}\sum_{g\in G}\chi_a(g^{-1})\bigl(U(g)\otimes\overline{U(g)}\bigr).Ca​(X)=∣G∣da​​g∈G∑​χa​(g−1)U(g)XU(g)∗,Ca​=∣G∣da​​g∈G∑​χa​(g−1)(U(g)⊗U(g)​).

For any complex-linear map Φ:Mn(C)→Mn(C)\Phi:M_n(\mathbb C)\to M_n(\mathbb C)Φ:Mn​(C)→Mn​(C) satisfying Φ(U(g)XU(g)∗)=U(g)Φ(X)U(g)∗\Phi(U(g)XU(g)^*)=U(g)\Phi(X)U(g)^*Φ(U(g)XU(g)∗)=U(g)Φ(X)U(g)∗ for every g,Xg,Xg,X, there exist complex numbers (la)a∈Θ(l_a)_{a\in\Theta}(la​)a∈Θ​ such that Φ=∑a∈ΘlaCa\Phi=\sum_{a\in\Theta}l_a\mathcal C_aΦ=∑a∈Θ​la​Ca​, each Ca\mathcal C_aCa​ fixes some nonzero matrix, and Φ(Ca(X))=laCa(X)\Phi(\mathcal C_a(X))=l_a\mathcal C_a(X)Φ(Ca​(X))=la​Ca​(X) for every a,Xa,Xa,X. Furthermore, writing EijE_{ij}Eij​ for the matrix with its sole nonzero entry 111 at (i,j)(i,j)(i,j), the matrix of Ca\mathcal C_aCa​ in row coordinates has entries Ca(Ekl)ij=(Ca)(i,j),(k,l)\mathcal C_a(E_{kl})_{ij}=(C_a)_{(i,j),(k,l)}Ca​(Ekl​)ij​=(Ca​)(i,j),(k,l)​; the maps obey

Ca∘Cb={Ca,a=b,0,a≠b,Ca†=Ca,∑a∈ΘCa=id⁡.\mathcal C_a\circ\mathcal C_b= \begin{cases}\mathcal C_a,&a=b,\\0,&a\ne b,\end{cases} \qquad \mathcal C_a^\dagger=\mathcal C_a,\qquad \sum_{a\in\Theta}\mathcal C_a=\operatorname{id}.Ca​∘Cb​={Ca​,0,​a=b,a=b,​Ca†​=Ca​,a∈Θ∑​Ca​=id.

Here the adjoint is explicitly (L†Y)ij=∑k,lL(Eij)kl‾Ykl(\mathcal L^\dagger Y)_{ij}=\sum_{k,l}\overline{\mathcal L(E_{ij})_{kl}}Y_{kl}(L†Y)ij​=∑k,l​L(Eij​)kl​​Ykl​.

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