Section IV, unnumbered: highest-irrep Choi degrading maps in the explicitly checked dimensions
OpenQAlgorithms.Papers.Independent.Intakenext100.P49.highestIrrep_degradingConstructionLet and put . In the fixed occupation bases let be the projector onto the highest irreducible summand of the ordinary SU(2) tensor representation . The first factor is the degrading output. The projector has rank . Define the unnormalized, output-first Choi matrix and its reconstructed map by
Then is CPTP, has exactly this Choi matrix, and
The source reports exact solutions for and successful checks for . 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 : its entry is when , and zero otherwise. These coefficients fix the highest-irrep phases without an arbitrary projector witness.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P49
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number satisfying , define
where and , and put and . Also define by
and set and . Then , , and . The matrix whose -entry is equals . Moreover, is a channel, meaning that it has a finite representation with , and
for every complex matrix , without requiring to be a density matrix.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.