Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3: noisy processing does not improve the private information of a degradable channel

Open
QAlgorithms.Papers.Independent.Support50.P07.degradable_privateInformation

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

prove2quantum

For a degradable channel N\mathcal NN, optimize Cp(1)C_p^{(1)}Cp(1)​ over all finite normalized pure signal ensembles and all finite stochastic processings X→TX\to TX→T, with the same dilation defining receiver BBB and environment EEE. Then

Cp(1)(N):=sup⁡{px,φx},X→T[I(T;B)−I(T;E)]=Q(1)(N)=sup⁡ϕRAI(R⟩B).C_p^{(1)}(\mathcal N):=\sup_{\{p_x,\varphi_x\},X\to T}[I(T;B)-I(T;E)]=Q^{(1)}(\mathcal N)=\sup_{\phi_{RA}}I(R\rangle B).Cp(1)​(N):={px​,φx​},X→Tsup​[I(T;B)−I(T;E)]=Q(1)(N)=ϕRA​sup​I(R⟩B).

The last supremum is over normalized purifications with reference isomorphic to the input; Q(1)Q^{(1)}Q(1) optimizes S(B)−S(E)S(B)-S(E)S(B)−S(E) over arbitrary input density operators.

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.

This result supplies a capacity identity or bound for the channel family and resource model stated above.

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]

/-- Lemma 3, PDF p.2: classical noisy processing gives no one-use advantage for degradable N. -/
theorem degradable_privateInformation [Nonempty A] [Nonempty B] [Nonempty E]
    (U : Matrix (B × E) A ℂ)
    (hU : IsIsometry U) (hd : IsDegradable U) :
    processedPrivateInformation U = maximumCoherentInformation U ∧
    maximumCoherentInformation U = purificationCoherentInformation 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. 2, Lemma 3: noisy processing does not improve the private information of a degradable channel
Read-back

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

Let A,B,EA,B,EA,B,E be arbitrary finite nonempty index types with decidable equality, and let U:A→B×EU:A\to B\times EU:A→B×E satisfy U†U=IAU^\dagger U=I_AU†U=IA​. Assume also degradability, meaning that UUU is an isometry and there exists a map D:B→ED:B\to ED:B→E on matrices, represented on every matrix by finitely many Kraus matrices KjK_jKj​ with ∑jKj†Kj=IB\sum_jK_j^\dagger K_j=I_B∑j​Kj†​Kj​=IB​, such that D(N(ρ))=Nc(ρ)D(N(\rho))=N^c(\rho)D(N(ρ))=Nc(ρ) for every matrix ρ\rhoρ, where N(ρ)=tr⁡E(UρU†)N(\rho)=\operatorname{tr}_E(U\rho U^\dagger)N(ρ)=trE​(UρU†) and Nc(ρ)=tr⁡B(UρU†)N^c(\rho)=\operatorname{tr}_B(U\rho U^\dagger)Nc(ρ)=trB​(UρU†). Then

Pproc(U)=sup⁡ρ≥0, tr⁡ρ=1[S(N(ρ))−S(Nc(ρ))]=sup⁡ψ∈CA×A∥ψ∥=1[S(tr⁡AΩψ)−S(Ωψ)],Ωψ=(idA⊗N)(∣ψ⟩⟨ψ∣).P_{\mathrm{proc}}(U) =\sup_{\rho\ge0,\ \operatorname{tr}\rho=1} \bigl[S(N(\rho))-S(N^c(\rho))\bigr] =\sup_{\substack{\psi\in\mathbb C^{A\times A}\\\|\psi\|=1}} \bigl[S(\operatorname{tr}_A\Omega_\psi)-S(\Omega_\psi)\bigr], \qquad \Omega_\psi=(\mathrm{id}_A\otimes N)(|\psi\rangle\langle\psi|).Pproc​(U)=ρ≥0, trρ=1sup​[S(N(ρ))−S(Nc(ρ))]=ψ∈CA×A∥ψ∥=1​sup​[S(trA​Ωψ​)−S(Ωψ​)],Ωψ​=(idA​⊗N)(∣ψ⟩⟨ψ∣).

Here S(X)=−Re⁡tr⁡f(X)S(X)=-\operatorname{Re}\operatorname{tr}f(X)S(X)=−Retrf(X), where f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x, f(0)=0f(0)=0f(0)=0, is applied by continuous functional calculus; the identity extension applies NNN separately to each block indexed by the first AAA. The leftmost quantity is the real supremum over all positive integers x0,t0x_0,t_0x0​,t0​, weights wx≥0w_x\ge0wx​≥0 with ∑xwx=1\sum_xw_x=1∑x​wx​=1, unit vectors ψx∈CA\psi_x\in\mathbb C^Aψx​∈CA, and numbers P(t∣x)≥0P(t\mid x)\ge0P(t∣x)≥0 with ∑tP(t∣x)=1\sum_tP(t\mid x)=1∑t​P(t∣x)=1, of I(ΩN)−I(ΩNc)I(\Omega^N)-I(\Omega^{N^c})I(ΩN)−I(ΩNc), where

Ω(t,b),(t′,b′)N=1t=t′∑xwxP(t∣x) N(∣ψx⟩⟨ψx∣)b,b′,\Omega^N_{(t,b),(t',b')}= \mathbf1_{t=t'}\sum_xw_xP(t\mid x)\, N(|\psi_x\rangle\langle\psi_x|)_{b,b'},Ω(t,b),(t′,b′)N​=1t=t′​x∑​wx​P(t∣x)N(∣ψx​⟩⟨ψx​∣)b,b′​,

with the analogous formula for ΩNc\Omega^{N^c}ΩNc, and I(Ω)=S(tr⁡secondΩ)+S(tr⁡firstΩ)−S(Ω)I(\Omega)=S(\operatorname{tr}_{\mathrm{second}}\Omega)+S(\operatorname{tr}_{\mathrm{first}}\Omega)-S(\Omega)I(Ω)=S(trsecond​Ω)+S(trfirst​Ω)−S(Ω). Both label counts are unrestricted positive integers; zero weights and zero processing probabilities are permitted.

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