Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1: conjugate degradability of two cloning families

Proved
QAlgorithms.Papers.Independent.Support50.P01.cloningFamilies_conjugateDegradable

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let 1≤N≤M1\le N\le M1≤N≤M be integers. Let ClN,M\mathrm{Cl}_{N,M}ClN,M​ be the specified optimal universal qubit cloner on Sym⁡N(C2)\operatorname{Sym}^N(\mathbb C^2)SymN(C2), with receiver support Sym⁡M(C2)\operatorname{Sym}^M(\mathbb C^2)SymM(C2) and environment dimension M−N+1M-N+1M−N+1. Its common dilation on normalized occupation kets is exactly Eqs.(21),(22). Write πd=Id/d\pi_d=I_d/dπd​=Id​/d, IcI_cIc​ for coherent information in bits, Q(1)Q^{(1)}Q(1) for its supremum over all density inputs, and QQQ for its regularization over all positive block lengths and arbitrary entangled block inputs. The two families satisfy

ClN,N+1 is conjugate degradable(N≥1),Cl1,M is conjugate degradable(M≥1).\mathrm{Cl}_{N,N+1}\text{ is conjugate degradable}\quad(N\ge1),\qquad \mathrm{Cl}_{1,M}\text{ is conjugate degradable}\quad(M\ge1).ClN,N+1​ is conjugate degradable(N≥1),Cl1,M​ is conjugate degradable(M≥1).

Each assertion supplies one CPTP witness for the entire input operator space. The identity case M=1M=1M=1 is included.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P01
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P01

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

open Filter

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

open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation quantumCapacity)

open QAlgorithms.Papers.Independent.Information100.P08 (maximallyMixed)

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

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

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

variable {a b e c : ℕ}

/-- PDF pp.8–10, Theorem 1: both proven cloning families, retaining the M=1 identity case. -/
theorem cloningFamilies_conjugateDegradable :
    (∀ N : ℕ, 1≤N → ConjugateDegradable (clonerDilation N (N+1))) ∧
    (∀ M : ℕ, 1≤M → ConjugateDegradable (clonerDilation 1 M)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P01

end
Source
Conjugate Degradability and the Quantum Capacity of Cloning Channels, arXiv:0909.3297v1, PDF p. 8, Theorem 1: conjugate degradability of two cloning families
Read-back

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

For natural numbers N≤MN\le MN≤M, let UN,M:CN+1→CM+1⊗CM−N+1U_{N,M}:\mathbb C^{N+1}\to\mathbb C^{M+1}\otimes\mathbb C^{M-N+1}UN,M​:CN+1→CM+1⊗CM−N+1 be the matrix

(UN,M)(r,j),k={(M−N)!(N+1)!(k+j)!(M−k−j)!k!(N−k)!(M+1)!j!(M−N−j)!r=k+j,0otherwise,(U_{N,M})_{(r,j),k}= \begin{cases} \displaystyle\sqrt{\frac{(M-N)!(N+1)!(k+j)!(M-k-j)!} {k!(N-k)!(M+1)!j!(M-N-j)!}}&r=k+j,\\ 0&\text{otherwise}, \end{cases}(UN,M​)(r,j),k​=⎩⎨⎧​k!(N−k)!(M+1)!j!(M−N−j)!(M−N)!(N+1)!(k+j)!(M−k−j)!​​0​r=k+j,otherwise,​

where 0≤r≤M0\le r\le M0≤r≤M, 0≤j≤M−N0\le j\le M-N0≤j≤M−N, and 0≤k≤N0\le k\le N0≤k≤N; subtractions in factorial arguments are natural-number subtractions, truncated at zero. Write NU(X)=Tr⁡E(UXU†)\mathcal N_U(X)=\operatorname{Tr}_{E}(UXU^\dagger)NU​(X)=TrE​(UXU†) and EU(X)=Tr⁡B(UXU†)\mathcal E_U(X)=\operatorname{Tr}_{B}(UXU^\dagger)EU​(X)=TrB​(UXU†) for the partial traces over the second and first output factors, respectively. The assertion is that, for every N≥1N\ge1N≥1, UN,N+1U_{N,N+1}UN,N+1​ satisfies UN,N+1†UN,N+1=IU_{N,N+1}^\dagger U_{N,N+1}=IUN,N+1†​UN,N+1​=I and admits a map D:B→E\mathcal D:B\to ED:B→E with D(NU(X))=EU(X)T\mathcal D(\mathcal N_U(X))=\mathcal E_U(X)^{\mathsf T}D(NU​(X))=EU​(X)T for every complex input matrix XXX, and that the same holds for U1,MU_{1,M}U1,M​ for every M≥1M\ge1M≥1. In each case, D\mathcal DD must have a finite Kraus representation D(Y)=∑ℓ=0s−1KℓYKℓ†\mathcal D(Y)=\sum_{\ell=0}^{s-1}K_\ell YK_\ell^\daggerD(Y)=∑ℓ=0s−1​Kℓ​YKℓ†​, for some natural number sss, with ∑ℓKℓ†Kℓ=IB\sum_\ell K_\ell^\dagger K_\ell=I_B∑ℓ​Kℓ†​Kℓ​=IB​; the transpose T{}^{\mathsf T}T is the ordinary transpose. The choices of D\mathcal DD may depend on the family parameter. The second family includes M=1M=1M=1, whose environment has dimension one.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 23, 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