Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section IV, unnumbered: highest-irrep Choi degrading maps in the explicitly checked dimensions

Open
QAlgorithms.Papers.Independent.Intakenext100.P49.highestIrrep_degradingConstruction

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

prove2quantum

Let ℓ∈{3,4,5,6,7}\ell\in\{3,4,5,6,7\}ℓ∈{3,4,5,6,7} and put k=ℓ−2k=\ell-2k=ℓ−2. In the fixed occupation bases let Πmax⁡\Pi_{\max}Πmax​ be the projector onto the highest irreducible summand of the ordinary SU(2) tensor representation Sym⁡ℓ−2(C2)⊗Sym⁡ℓ−1(C2)\operatorname{Sym}^{\ell-2}(\mathbb C^2)\otimes\operatorname{Sym}^{\ell-1}(\mathbb C^2)Symℓ−2(C2)⊗Symℓ−1(C2). The first factor is the degrading output. The projector has rank 2ℓ−22\ell-22ℓ−2. Define the unnormalized, output-first Choi matrix and its reconstructed map by

RDℓ=ℓ2ℓ−2Πmax⁡,Dℓ(X)=Tr⁡in[(I⊗XT)RDℓ].R_{D_\ell}=\frac{\ell}{2\ell-2}\Pi_{\max},\qquad D_\ell(X)=\operatorname{Tr}_{\rm in}[(I\otimes X^T)R_{D_\ell}].RDℓ​​=2ℓ−2ℓ​Πmax​,Dℓ​(X)=Trin​[(I⊗XT)RDℓ​​].

Then DℓD_\ellDℓ​ is CPTP, has exactly this Choi matrix, and

Dℓ∘Cl1,ℓ−1=Sℓ−1c.D_\ell\circ\mathrm{Cl}_{1,\ell-1}=S^c_{\ell-1}.Dℓ​∘Cl1,ℓ−1​=Sℓ−1c​.

The source reports exact solutions for ℓ=3,4\ell=3,4ℓ=3,4 and successful checks for ℓ=5,6,7\ell=5,6,7ℓ=5,6,7. The statement specifies the construction for exactly that set. It gives neither a universal projector-ansatz theorem nor a runtime bound.

Formalization Note The projector is constructed by the normalized occupation coefficients ca,i=(ka)(k+1i)/(2k+1a+i)c_{a,i}=\sqrt{\binom{k}{a}\binom{k+1}{i}/\binom{2k+1}{a+i}}ca,i​=(ak​)(ik+1​)/(a+i2k+1​)​: its entry is ca,icb,jc_{a,i}c_{b,j}ca,i​cb,j​ when a+i=b+ja+i=b+ja+i=b+j, and zero otherwise. These coefficients fix the highest-irrep phases without an arbitrary projector witness.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P49
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P49

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

open Filter

open QAlgorithms.Papers.Independent.Support50.P01
  (unruhSectorDilation unruhWeight unruhBlockDilation unruhBlockWeight
   unruhReceiver unruhReceiverEntropy)

open QAlgorithms.Papers.Independent.Information100.P67
  (receiverChannel complementaryChannel IsDegradable)

open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking)

open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)

open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)

open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)

open QAlgorithms.QuditFidelity (depolarizingMap)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF pp.5--6, Section IV: the highest-irrep unnormalized Choi ansatz
is the degrading map for precisely the reported dimensions ell=3,4,5,6,7.
The claim is not extended to every ell and makes no runtime assertion. -/
theorem highestIrrep_degradingConstruction (k : ℕ) (_hk0 : 1 ≤ k) (_hk1 : k ≤ 5) :
    (highestProjector k)ᴴ = highestProjector k ∧
    highestProjector k * highestProjector k = highestProjector k ∧
    (highestProjector k).rank = 2*k+2 ∧
    outputFirstChoi (highestDegradingMap k) = degradingChoi k ∧
    IsChannel (highestDegradingMap k) ∧
    ∀ X, highestDegradingMap k (cloner k X) = clonerComplement k X := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P49

end
Source
An Infinite Sequence of Additive Channels: the Classical Capacity of Cloning Channels, arXiv:0903.1638v7, PDF p. 6, Section IV, unnumbered (Eqs.(24)–(26), pp.5–6)
Read-back

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

For every natural number kkk satisfying 1≤k≤51\le k\le51≤k≤5, define

ha,i=(ka)(k+1i)(2k+1a+i),P(a,i),(b,j)={ha,ihb,j,a+i=b+j,0,a+i≠b+j,h_{a,i}= \sqrt{\frac{\binom{k}{a}\binom{k+1}{i}}{\binom{2k+1}{a+i}}}, \qquad P_{(a,i),(b,j)} = \begin{cases} h_{a,i}h_{b,j},&a+i=b+j,\\ 0,&a+i\ne b+j, \end{cases}ha,i​=(a+i2k+1​)(ak​)(ik+1​)​​,P(a,i),(b,j)​={ha,i​hb,j​,0,​a+i=b+j,a+i=b+j,​

where 0≤a,b<k+10\le a,b<k+10≤a,b<k+1 and 0≤i,j<k+20\le i,j<k+20≤i,j<k+2, and put J=k+22k+2PJ=\frac{k+2}{2k+2}PJ=2k+2k+2​P and D(X)a,b=∑i,j=0k+1Xi,jJ(a,i),(b,j)D(X)_{a,b}=\sum_{i,j=0}^{k+1}X_{i,j}J_{(a,i),(b,j)}D(X)a,b​=∑i,j=0k+1​Xi,j​J(a,i),(b,j)​. Also define Uk:C2→Ck+2⊗Ck+1U_k:\mathbb C^2\to\mathbb C^{k+2}\otimes\mathbb C^{k+1}Uk​:C2→Ck+2⊗Ck+1 by

(Uk)(i,a),x=1{i=x+a}2 cx,a(k+1)(k+2),c0,a=k+1−a,c1,a=a+1,(U_k)_{(i,a),x} =\mathbf1_{\{i=x+a\}}\sqrt{\frac{2\,c_{x,a}}{(k+1)(k+2)}}, \qquad c_{0,a}=k+1-a,\quad c_{1,a}=a+1,(Uk​)(i,a),x​=1{i=x+a}​(k+1)(k+2)2cx,a​​​,c0,a​=k+1−a,c1,a​=a+1,

and set Ck(X)=Tr⁡Ck+1(UkXUk†)C_k(X)=\operatorname{Tr}_{\mathbb C^{k+1}}(U_kXU_k^\dagger)Ck​(X)=TrCk+1​(Uk​XUk†​) and Ckc(X)=Tr⁡Ck+2(UkXUk†)C_k^{\mathrm c}(X)=\operatorname{Tr}_{\mathbb C^{k+2}}(U_kXU_k^\dagger)Ckc​(X)=TrCk+2​(Uk​XUk†​). Then P†=PP^\dagger=PP†=P, P2=PP^2=PP2=P, and rank⁡P=2k+2\operatorname{rank}P=2k+2rankP=2k+2. The matrix whose ((a,i),(b,j))((a,i),(b,j))((a,i),(b,j))-entry is D(∣i⟩⟨j∣)a,bD(|i\rangle\langle j|)_{a,b}D(∣i⟩⟨j∣)a,b​ equals JJJ. Moreover, DDD is a channel, meaning that it has a finite representation D(X)=∑sEsXEs†D(X)=\sum_sE_sXE_s^\daggerD(X)=∑s​Es​XEs†​ with ∑sEs†Es=Ik+2\sum_sE_s^\dagger E_s=I_{k+2}∑s​Es†​Es​=Ik+2​, and

D(Ck(X))=Ckc(X)D(C_k(X))=C_k^{\mathrm c}(X)D(Ck​(X))=Ckc​(X)

for every complex 2×22\times22×2 matrix XXX, without requiring XXX to be a density matrix.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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