Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix Lemma 4: majorization of cloning coefficient vectors

Proved
QAlgorithms.Papers.Independent.Support50.P01.cloningCoefficients_majorization

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

prove2quantum

Let 1≤N≤M1\le N\le M1≤N≤M be integers and L=M−NL=M-NL=M−N. For 0≤j≤L0\le j\le L0≤j≤L define

αj=N+1M+1(M−N)!(M−j)!(M−N−j)!M!,βj=αjM−jM+αj+1j+1M,\alpha_j=\frac{N+1}{M+1}\frac{(M-N)!(M-j)!}{(M-N-j)!M!},\qquad \beta_j=\alpha_j\frac{M-j}{M}+\alpha_{j+1}\frac{j+1}{M},αj​=M+1N+1​(M−N−j)!M!(M−N)!(M−j)!​,βj​=αj​MM−j​+αj+1​Mj+1​,

where αL+1=0\alpha_{L+1}=0αL+1​=0. Here αj\alpha_jαj​ is the square of the amplitude in Eq.(47). These are scalar vectors; no identification with the inconsistent environment kets printed in Eq.(46) is required. The decreasing probability vectors obey ordinary majorization:

∑j=0k−1βj≥∑j=0k−1αj(0≤k≤L+1),∑j=0Lαj=∑j=0Lβj=1.\sum_{j=0}^{k-1}\beta_j\ge\sum_{j=0}^{k-1}\alpha_j\quad(0\le k\le L+1),\qquad \sum_{j=0}^{L}\alpha_j=\sum_{j=0}^{L}\beta_j=1.j=0∑k−1​βj​≥j=0∑k−1​αj​(0≤k≤L+1),j=0∑L​αj​=j=0∑L​βj​=1.

Both vectors are nonnegative and nonincreasing. Thus β≻α\boldsymbol\beta\succ\boldsymbol\alphaβ≻α denotes majorization with equal totals, not a strict total-sum inequality. No common input-independent degrading channel is inferred.

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.16–17, Lemma 4: ordinary probability-vector majorization with equal total sums.
No input-independent quantum degrading map is inferred from a scalar majorization. -/
theorem cloningCoefficients_majorization (N M : ℕ) (hN : 1≤N) (hNM : N≤M) :
    CloningMajorizes N 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. 17, Appendix Lemma 4: majorization of cloning coefficient vectors
Read-back

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

For all natural numbers N,MN,MN,M satisfying 1≤N≤M1\le N\le M1≤N≤M, put d=M−Nd=M-Nd=M−N and define, for every natural number jjj, αj=N+1M+1d! (M−j)!(d−j)! M!\alpha_j=\frac{N+1}{M+1}\frac{d!\,(M-j)!}{(d-j)!\,M!}αj​=M+1N+1​(d−j)!M!d!(M−j)!​ if j≤dj\le dj≤d, and αj=0\alpha_j=0αj​=0 otherwise, and βj=αjM−jM+αj+1j+1M\beta_j=\alpha_j\frac{M-j}{M}+\alpha_{j+1}\frac{j+1}{M}βj​=αj​MM−j​+αj+1​Mj+1​, using natural-number subtraction truncated at zero and real division. Then αj,βj≥0\alpha_j,\beta_j\ge0αj​,βj​≥0 for every j≤dj\le dj≤d; αj+1≤αj\alpha_{j+1}\le\alpha_jαj+1​≤αj​ and βj+1≤βj\beta_{j+1}\le\beta_jβj+1​≤βj​ for every j<dj<dj<d; for every natural number k≤d+1k\le d+1k≤d+1, ∑j=0k−1αj≤∑j=0k−1βj\sum_{j=0}^{k-1}\alpha_j\le\sum_{j=0}^{k-1}\beta_j∑j=0k−1​αj​≤∑j=0k−1​βj​; and ∑j=0dαj=∑j=0dβj=1\sum_{j=0}^{d}\alpha_j=\sum_{j=0}^{d}\beta_j=1∑j=0d​αj​=∑j=0d​βj​=1. The prefix sums for k=0k=0k=0 are empty and equal zero. The case M=NM=NM=N is included: the monotonicity conditions have no indices, and both sequences have their sole nonzero entry equal to 111 at j=0j=0j=0.

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