Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 11: cost of degradable mixing bounds private capacity

Open
QAlgorithms.Papers.Independent.Support50.P07.privateCapacity_le_degradableMixingCost

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

prove2quantum

For a channel N:A→B\mathcal N:A\to BN:A→B, consider every finite decomposition N=∑ipiDi∘Ni\mathcal N=\sum_i p_i\mathcal D_i\circ\mathcal N_iN=∑i​pi​Di​∘Ni​, where pi≥0p_i\ge0pi​≥0, ∑ipi=1\sum_i p_i=1∑i​pi​=1, each Ni\mathcal N_iNi​ is degradable or antidegradable, and each Di\mathcal D_iDi​ is CPTP. Branches may have different finite intermediate output and environment dimensions. Define CDM(N)=inf⁡∑ipiQ(1)(Ni)C_{DM}(\mathcal N)=\inf\sum_i p_iQ^{(1)}(\mathcal N_i)CDM​(N)=inf∑i​pi​Q(1)(Ni​) over these decompositions. Then

Cp(N)≤CDM(N).C_p(\mathcal N)\le C_{DM}(\mathcal N).Cp​(N)≤CDM​(N).

All quantum registers are finite and nonzero, states have trace one, pure vectors have norm one, and entropy and logarithms are in bits. Operational private capacities use memoryless powers, positive blocklengths and message counts, uniform messages, arbitrary mixed block inputs, and normalized decoding POVMs. A code is good when its joint decoded message/environment state has full trace norm less than the error from a perfectly correlated uniform pair tensor its actual common environment marginal. Rates use every positive error and rate slack at all sufficiently large blocklengths. Symmetric assistance allows one arbitrary finite symmetric channel per block without charging its dimension.

The result turns degradable decompositions into general private-capacity upper bounds.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P07
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

open Filter

namespace QAlgorithms.Papers.Independent.Support50.P07

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

open QAlgorithms.Papers.Independent.Claimed50.P24 (productDilation)

open QAlgorithms.Papers.Independent.Dependency50.P19 (mutualInformation)

variable {A B E C D F : Type}

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype E] [DecidableEq E] [Fintype C] [DecidableEq C]

variable [Fintype D] [DecidableEq D] [Fintype F] [DecidableEq F]

/-- Theorem 11, PDF p.5: private capacity is bounded by the full cost of degradable
mixing, with the postprocessors of Definition 10 retained. -/
theorem privateCapacity_le_degradableMixingCost [Nonempty A] [Nonempty B] [Nonempty E]
    (U : Matrix (B × E) A ℂ)
    (hU : IsIsometry U) :
    fullTracePrivateCapacity U ≤ degradableMixingCost U := by sorry

end QAlgorithms.Papers.Independent.Support50.P07

end
Source
The private classical capacity with a symmetric side channel and its application to quantum cryptography, arXiv:0705.3838v1, PDF p. 5, Theorem 11: cost of degradable mixing bounds private capacity
Read-back

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

Let A,B,EA,B,EA,B,E be finite nonempty types with decidable equality, and let U:A→B⊗EU:A\to B\otimes EU:A→B⊗E satisfy U†U=IU^\dagger U=IU†U=I. Define Ctr(U)C_{\mathrm{tr}}(U)Ctr​(U) as the real supremum of nonnegative rates RRR for which, for every ε,δ>0\varepsilon,\delta>0ε,δ>0, all sufficiently large positive nnn admit M≥1M\ge1M≥1, density matrices ρm\rho_mρm​ on A⊗nA^{\otimes n}A⊗n, and a POVM (Dj)j<M(D_j)_{j<M}(Dj​)j<M​ on B⊗nB^{\otimes n}B⊗n, such that R−δ≤log⁡2M/nR-\delta\le\log_2M/nR−δ≤log2​M/n. Writing Un((bi),(ei);(ai))=∏i<nU(bi,ei;ai)U_n((b_i),(e_i);(a_i))=\prod_{i<n}U(b_i,e_i;a_i)Un​((bi​),(ei​);(ai​))=∏i<n​U(bi​,ei​;ai​), set Ω=M−1∑m,j∣m,j⟩⟨m,j∣⊗Tr⁡B⊗n[(Dj⊗I)UnρmUn†]\Omega=M^{-1}\sum_{m,j}|m,j\rangle\langle m,j|\otimes\operatorname{Tr}_{B^{\otimes n}}[(D_j\otimes I)U_n\rho_mU_n^\dagger]Ω=M−1∑m,j​∣m,j⟩⟨m,j∣⊗TrB⊗n​[(Dj​⊗I)Un​ρm​Un†​] and η=Tr⁡m,jΩ\eta=\operatorname{Tr}_{m,j}\Omegaη=Trm,j​Ω; require ∥Ω−M−1∑m∣m,m⟩⟨m,m∣⊗η∥1<ε\|\Omega-M^{-1}\sum_m|m,m\rangle\langle m,m|\otimes\eta\|_1<\varepsilon∥Ω−M−1∑m​∣m,m⟩⟨m,m∣⊗η∥1​<ε. Density matrices are positive semidefinite with trace one, POVM elements are positive semidefinite and sum to III, and ∥Z∥1=Re⁡tr⁡Z†Z\|Z\|_1=\operatorname{Re}\operatorname{tr}\sqrt{Z^\dagger Z}∥Z∥1​=RetrZ†Z​. Define Dmix(U)D_{\mathrm{mix}}(U)Dmix​(U) as the real infimum of ∑i<kpiQ(vi)\sum_{i<k}p_iQ(v_i)∑i<k​pi​Q(vi​) over k≥1k\ge1k≥1, pi≥0p_i\ge0pi​≥0 summing to one, positive integers bi,eib_i,e_ibi​,ei​, isometries vi:A→Cbi⊗Ceiv_i:A\to\mathbb C^{b_i}\otimes\mathbb C^{e_i}vi​:A→Cbi​⊗Cei​, and channels Pi:Cbi→B\mathcal P_i:\mathbb C^{b_i}\to BPi​:Cbi​→B, such that Tr⁡E(UρU†)=∑ipiPi(Tr⁡ei(viρvi†))\operatorname{Tr}_E(U\rho U^\dagger)=\sum_ip_i\mathcal P_i(\operatorname{Tr}_{e_i}(v_i\rho v_i^\dagger))TrE​(UρU†)=∑i​pi​Pi​(Trei​​(vi​ρvi†​)) for every matrix ρ\rhoρ. Each viv_ivi​ must admit either a channel from its receiver output to its environment output reproducing the latter for every ρ\rhoρ, or a channel in the reverse direction reproducing its receiver output. A channel here has a finite Kraus representation P(Z)=∑jKjZKj†\mathcal P(Z)=\sum_jK_jZK_j^\daggerP(Z)=∑j​Kj​ZKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I, and Q(v)=sup⁡ρ≥0,tr⁡ρ=1[S(Tr⁡envvρv†)−S(Tr⁡recvρv†)]Q(v)=\sup_{\rho\ge0,\operatorname{tr}\rho=1}[S(\operatorname{Tr}_{\mathrm{env}}v\rho v^\dagger)-S(\operatorname{Tr}_{\mathrm{rec}}v\rho v^\dagger)]Q(v)=supρ≥0,trρ=1​[S(Trenv​vρv†)−S(Trrec​vρv†)], where S(X)=−Re⁡tr⁡[(t↦tlog⁡2t)(X)]S(X)=-\operatorname{Re}\operatorname{tr}[(t\mapsto t\log_2t)(X)]S(X)=−Retr[(t↦tlog2​t)(X)] by continuous functional calculus. Zero mixing weights are permitted; the infimum is real, so an empty admissible set has infimum zero under the underlying total convention. Then Ctr(U)≤Dmix(U)C_{\mathrm{tr}}(U)\le D_{\mathrm{mix}}(U)Ctr​(U)≤Dmix​(U).

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

    Confirmed by the moderator at approval.

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