Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 29: transposed-vectorized Choi eigenbasis

Proved
QAlgorithms.Papers.Independent.Extend50.P31.lemma29_choiBasis

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.

From one selected pivot per fine sector form viβ=vec⁡((Viβ)T)v_i^\beta=\operatorname{vec}((V_i^\beta)^T)viβ​=vec((Viβ​)T), with no coefficient conjugation. These vectors form a complete orthonormal basis of Cn2\mathbb C^{n^2}Cn2:

⟨viα,vjβ⟩=δαβδij,span⁡{viβ}=Cn2.\langle v_i^\alpha,v_j^\beta\rangle=\delta_{\alpha\beta}\delta_{ij},\qquad\operatorname{span}\{v_i^\beta\}=\mathbb C^{n^2}.⟨viα​,vjβ​⟩=δαβ​δij​,span{viβ​}=Cn2.

This describes the transposed-vectorized Choi eigenbasis 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 p.15, Lemma 29 Eq.(75), transpose without complex conjugation. -/
theorem lemma29_choiBasis (D : Data G A n) (P : Pivots D) :
    (∀ r s, (∑ p, conj (choiVector D P r p) * choiVector D P s p) =
      if r = s then 1 else 0) ∧
    Submodule.span ℂ (Set.range (choiVector D P)) = ⊤ := by sorry

end QAlgorithms.Papers.Independent.Extend50.P31

end
Source
Structure of irreducibly covariant quantum channels for finite groups, arXiv:1610.05657v2, PDF p. 15, Lemma 29: transposed-vectorized Choi eigenbasis
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 UUU of positive dimension nnn, a complete pairwise inequivalent family of positive dimensional irreducible unitary representations ρa\rho_aρa​ of dimensions dad_ada​, a distinguished one-dimensional trivial representation, and a finite subset Θ⊆A\Theta\subseteq AΘ⊆A giving a complex linear intertwining isomorphism U⊗U‾≅⨁α∈ΘραU\otimes\overline U\cong\bigoplus_{\alpha\in\Theta}\rho_\alphaU⊗U≅⨁α∈Θ​ρα​, with each listed representation appearing once. Put h=∣G∣h=|G|h=∣G∣ and R={(α,i):α∈Θ, 0≤i<dα}\mathcal R=\{(\alpha,i):\alpha\in\Theta,\ 0\le i<d_\alpha\}R={(α,i):α∈Θ, 0≤i<dα​}. For r=(α,i)r=(\alpha,i)r=(α,i) define

Fr(X)=dαh∑g∈Gρα(g−1)iiUgXUg†,wr,p=Re⁡[dαh∑gρα(g−1)ii(Ug⊗Ug‾)p,p].\mathcal F_r(X)=\frac{d_\alpha}{h}\sum_{g\in G}\rho_\alpha(g^{-1})_{ii}U_gXU_g^\dagger,\qquad w_{r,p}=\operatorname{Re}\left[\frac{d_\alpha}{h}\sum_g \rho_\alpha(g^{-1})_{ii}(U_g\otimes\overline{U_g})_{p,p}\right].Fr​(X)=hdα​​g∈G∑​ρα​(g−1)ii​Ug​XUg†​,wr,p​=Re[hdα​​g∑​ρα​(g−1)ii​(Ug​⊗Ug​​)p,p​].

Let PPP select a pair pr=(xr,yr)p_r=(x_r,y_r)pr​=(xr​,yr​) of indices in {0,…,n−1}\{0,\ldots,n-1\}{0,…,n−1} with wr,pr>0w_{r,p_r}>0wr,pr​​>0 for every rrr, and define Mr=Fr(Exryr)/wr,prM_r=\mathcal F_r(E_{x_ry_r})/\sqrt{w_{r,p_r}}Mr​=Fr​(Exr​yr​​)/wr,pr​​​, where ExyE_{xy}Exy​ is the matrix unit, and vr(x,y)=Mr(y,x)v_r(x,y)=M_r(y,x)vr​(x,y)=Mr​(y,x). Then these vectors are orthonormal and span the entire complex vector space of functions on {0,…,n−1}2\{0,\ldots,n-1\}^2{0,…,n−1}2:

∑p∈{0,…,n−1}2vr(p)‾ vs(p)={1r=s,0r≠s,span⁡C{vr:r∈R}=C{0,…,n−1}2.\sum_{p\in\{0,\ldots,n-1\}^2}\overline{v_r(p)}\,v_s(p) =\begin{cases}1&r=s,\\0&r\ne s,\end{cases} \qquad \operatorname{span}_{\mathbb C}\{v_r:r\in\mathcal R\} =\mathbb C^{\{0,\ldots,n-1\}^2}.p∈{0,…,n−1}2∑​vr​(p)​vs​(p)={10​r=s,r=s,​spanC​{vr​:r∈R}=C{0,…,n−1}2.
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