Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§III.C: coherent information tends to zero with diverging M/N

Open
QAlgorithms.Papers.Independent.Support50.P01.cloner_singleUse_asymptotics

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. For each fixed N≥1N\ge1N≥1, M↦Q(1)(ClN,M)M\mapsto Q^{(1)}(\mathrm{Cl}_{N,M})M↦Q(1)(ClN,M​) is nonincreasing on integers M≥NM\ge NM≥N. If integer sequences obey 1≤Nt≤Mt1\le N_t\le M_t1≤Nt​≤Mt​ and Mt/Nt→+∞M_t/N_t\to+\inftyMt​/Nt​→+∞, then

lim⁡t→∞Q(1)(ClNt,Mt)=0.\lim_{t\to\infty}Q^{(1)}(\mathrm{Cl}_{N_t,M_t})=0.t→∞lim​Q(1)(ClNt​,Mt​​)=0.

This is a limit of maximized single-use information, not an unproved limit for general regularized capacities.

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 p.11: fixed-N monotonicity and the divergent-ratio limit concern optimized
single-use information, not the unknown general regularized capacity. -/
theorem cloner_singleUse_asymptotics :
    (∀ N : ℕ, 1≤N → AntitoneOn (fun M => maximumCoherentInformation (clonerDilation N M))
      {M : ℕ | N≤M}) ∧
    (∀ N M : ℕ → ℕ, (∀ t, 1≤N t ∧ N t≤M t) →
      Tendsto (fun t => (M t : ℝ)/(N t : ℝ)) atTop atTop →
      Tendsto (fun t => maximumCoherentInformation (clonerDilation (N t) (M t))) atTop (nhds 0)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P01

end
Source
Conjugate Degradability and the Quantum Capacity of Cloning Channels, arXiv:0909.3297v1, PDF p. 11, §III.C: coherent information tends to zero with diverging M/N
Read-back

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

For natural numbers 1≤N≤M1\le N\le M1≤N≤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 have entries

(UN,M)(r,j),k=1{r=k+j}(M−N)!(N+1)!(k+j)!(M−k−j)!k!(N−k)!(M+1)!j!(M−N−j)!,(U_{N,M})_{(r,j),k} =\mathbf1_{\{r=k+j\}} \sqrt{\frac{(M-N)!(N+1)!(k+j)!(M-k-j)!} {k!(N-k)!(M+1)!j!(M-N-j)!}},(UN,M​)(r,j),k​=1{r=k+j}​k!(N−k)!(M+1)!j!(M−N−j)!(M−N)!(N+1)!(k+j)!(M−k−j)!​​,

with 0≤r≤M0\le r\le M0≤r≤M, 0≤j≤M−N0\le j\le M-N0≤j≤M−N, 0≤k≤N0\le k\le N0≤k≤N, and natural-number subtraction truncated at zero. Define

J(N,M)=sup⁡ρ⪰0, tr⁡ρ=1[S ⁣(Tr⁡E(UN,MρUN,M†))−S ⁣(Tr⁡B(UN,MρUN,M†))],J(N,M)=\sup_{\rho\succeq0,\ \operatorname{tr}\rho=1} \left[S\!\left(\operatorname{Tr}_{E}(U_{N,M}\rho U_{N,M}^\dagger)\right) -S\!\left(\operatorname{Tr}_{B}(U_{N,M}\rho U_{N,M}^\dagger)\right)\right],J(N,M)=ρ⪰0, trρ=1sup​[S(TrE​(UN,M​ρUN,M†​))−S(TrB​(UN,M​ρUN,M†​))],

where ρ\rhoρ acts on CN+1\mathbb C^{N+1}CN+1, the two partial traces remove the second and first output factors, and S(X)=−Re⁡tr⁡(f(X))S(X)=-\operatorname{Re}\operatorname{tr}(f(X))S(X)=−Retr(f(X)) for f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x applied by continuous functional calculus. The assertion has two parts: for every fixed N≥1N\ge1N≥1, if N≤M1≤M2N\le M_1\le M_2N≤M1​≤M2​, then J(N,M2)≤J(N,M1)J(N,M_2)\le J(N,M_1)J(N,M2​)≤J(N,M1​); and for every pair of sequences Nt,Mt∈NN_t,M_t\in\mathbb NNt​,Mt​∈N satisfying 1≤Nt≤Mt1\le N_t\le M_t1≤Nt​≤Mt​ for every ttt, if Mt/Nt→+∞M_t/N_t\to+\inftyMt​/Nt​→+∞, with the quotient taken in R\mathbb RR, then J(Nt,Mt)→0J(N_t,M_t)\to0J(Nt​,Mt​)→0 as t→∞t\to\inftyt→∞. The monotonicity is non-strict, and the sequence conclusion is conditional on divergence of the ratio.

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