Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1: every cloning channel is degradable

Open
QAlgorithms.Papers.Independent.Intakenext100.P49.cloning_degradable

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

prove2quantum

For every integer ℓ≥2\ell\ge2ℓ≥2, the cloning channel Cl1,ℓ−1\mathrm{Cl}_{1,\ell-1}Cl1,ℓ−1​ is degradable. There exists one CPTP map DℓD_\ellDℓ​ from the ℓ\ellℓ-dimensional cloning output to the (ℓ−1)(\ell-1)(ℓ−1)-dimensional environment such that

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

The complement is defined by the same fixed occupation-basis isometry. The equality holds on all input operators, so the degrading map works uniformly for all mixed and entangled inputs. This is ordinary degradability of the concrete cloning channel.

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 p.4, Corollary 1: a single CPTP degrading map works for every input. -/
theorem cloning_degradable (k : ℕ) : IsDegradable (unruhSectorDilation k) := 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. 4, Corollary 1
Read-back

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

For every natural number kkk, including k=0k=0k=0, let 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 have entries

(Uk)(b,j),x={2 cx,j(k+1)(k+2),b=x+j,0,b≠x+j,c0,j=k+1−j,c1,j=j+1,(U_k)_{(b,j),x}= \begin{cases} \displaystyle\sqrt{\frac{2\,c_{x,j}}{(k+1)(k+2)}},&b=x+j,\\ 0,&b\ne x+j, \end{cases} \qquad c_{0,j}=k+1-j,\quad c_{1,j}=j+1,(Uk​)(b,j),x​=⎩⎨⎧​(k+1)(k+2)2cx,j​​​,0,​b=x+j,b=x+j,​c0,j​=k+1−j,c1,j​=j+1,

where 0≤b<k+20\le b<k+20≤b<k+2, 0≤j<k+10\le j<k+10≤j<k+1, and x∈{0,1}x\in\{0,1\}x∈{0,1}. Then Uk†Uk=I2U_k^\dagger U_k=I_2Uk†​Uk​=I2​, and there exists a channel D:Mat⁡k+2(C)→Mat⁡k+1(C)D:\operatorname{Mat}_{k+2}(\mathbb C)\to\operatorname{Mat}_{k+1}(\mathbb C)D:Matk+2​(C)→Matk+1​(C) such that, for every complex 2×22\times22×2 matrix XXX,

Tr⁡Ck+2(UkXUk†)=D ⁣(Tr⁡Ck+1(UkXUk†)).\operatorname{Tr}_{\mathbb C^{k+2}}(U_kXU_k^\dagger) = D\!\left(\operatorname{Tr}_{\mathbb C^{k+1}}(U_kXU_k^\dagger)\right).TrCk+2​(Uk​XUk†​)=D(TrCk+1​(Uk​XUk†​)).

Here a channel means a map D(Y)=∑sEsYEs†D(Y)=\sum_s E_sYE_s^\daggerD(Y)=∑s​Es​YEs†​ for some finite family satisfying ∑sEs†Es=Ik+2\sum_sE_s^\dagger E_s=I_{k+2}∑s​Es†​Es​=Ik+2​; the asserted identity applies to all matrices XXX, without a positivity or normalization restriction.

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