Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7: additivity of one-letter ss-private information

Open
QAlgorithms.Papers.Independent.Support50.P07.ssPrivateInformation_additive

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

prove2quantum

Let N1,N2\mathcal N_1,\mathcal N_2N1​,N2​ be arbitrary quantum channels. Define Cp,ss(1)C_{p,ss}^{(1)}Cp,ss(1)​ by optimizing I(T;BF)−I(T;EG)I(T;BF)-I(T;EG)I(T;BF)−I(T;EG) over all finite symmetric pure input ensembles and finite classical processings. Then

Cp,ss(1)(N1⊗N2)=Cp,ss(1)(N1)+Cp,ss(1)(N2).C_{p,ss}^{(1)}(\mathcal N_1\otimes\mathcal N_2)=C_{p,ss}^{(1)}(\mathcal N_1)+C_{p,ss}^{(1)}(\mathcal N_2).Cp,ss(1)​(N1​⊗N2​)=Cp,ss(1)​(N1​)+Cp,ss(1)​(N2​).

No degradability or equality of receiver and environment dimensions is assumed.

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 7, PDF p.4: one-letter ss information is additive for arbitrary channels. -/
theorem ssPrivateInformation_additive [Nonempty A] [Nonempty B] [Nonempty E]
    [Nonempty C] [Nonempty D] [Nonempty F]
    (U : Matrix (B × E) A ℂ)
    (V : Matrix (D × F) C ℂ) (hU : IsIsometry U) (hV : IsIsometry V) :
    ssPrivateInformation (productDilation U V) =
      ssPrivateInformation U + ssPrivateInformation V := 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. 4, Lemma 7: additivity of one-letter ss-private information
Read-back

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

Let A,B,E,C,D,FA,B,E,C,D,FA,B,E,C,D,F be finite nonempty types with decidable equality, and let U:A→B⊗EU:A\to B\otimes EU:A→B⊗E and V:C→D⊗FV:C\to D\otimes FV:C→D⊗F be complex matrices satisfying U†U=IU^\dagger U=IU†U=I and V†V=IV^\dagger V=IV†V=I. For a dilation X:H→K⊗LX:H\to K\otimes LX:H→K⊗L, define Jss(X)J_{\mathrm{ss}}(X)Jss​(X) as follows. Choose any integer d≥1d\ge1d≥1, positive finite label counts r,sr,sr,s, weights wx≥0w_x\ge0wx​≥0 with ∑x<rwx=1\sum_{x<r}w_x=1∑x<r​wx​=1, unit vectors ψx∈H⊗Cd⊗Cd\psi_x\in H\otimes\mathbb C^d\otimes\mathbb C^dψx​∈H⊗Cd⊗Cd satisfying ψx(a,f,g)=ψx(a,g,f)\psi_x(a,f,g)=\psi_x(a,g,f)ψx​(a,f,g)=ψx​(a,g,f), and numbers p(t∣x)≥0p(t\mid x)\ge0p(t∣x)≥0 with ∑t<sp(t∣x)=1\sum_{t<s}p(t\mid x)=1∑t<s​p(t∣x)=1. Apply XXX to HHH, route the first auxiliary factor to KKK and the second to LLL, and form the receiver and environment states with classical label ttt, weighted by wxp(t∣x)w_xp(t\mid x)wx​p(t∣x). Take I(T:KCd)−I(T:LCd)I(T:K\mathbb C^d)-I(T:L\mathbb C^d)I(T:KCd)−I(T:LCd), and let Jss(X)J_{\mathrm{ss}}(X)Jss​(X) be the real supremum of all these values. Here the receiver and environment maps are the respective partial traces of XρX†X\rho X^\daggerXρX†, I(P:Q)=S(ρP)+S(ρQ)−S(ρPQ)I(P:Q)=S(\rho_P)+S(\rho_Q)-S(\rho_{PQ})I(P:Q)=S(ρP​)+S(ρQ​)−S(ρPQ​), and S(ρ)=−Re⁡tr⁡[(t↦tlog⁡2t)(ρ)]S(\rho)=-\operatorname{Re}\operatorname{tr}[(t\mapsto t\log_2t)(\rho)]S(ρ)=−Retr[(t↦tlog2​t)(ρ)] by continuous functional calculus. Zero ensemble weights and zero conditional probabilities are allowed. Define the product dilation by (U⊠V)((b,d),(e,f);(a,c))=U(b,e;a)V(d,f;c)(U\boxtimes V)((b,d),(e,f);(a,c))=U(b,e;a)V(d,f;c)(U⊠V)((b,d),(e,f);(a,c))=U(b,e;a)V(d,f;c). Then

Jss(U⊠V)=Jss(U)+Jss(V).J_{\mathrm{ss}}(U\boxtimes V)=J_{\mathrm{ss}}(U)+J_{\mathrm{ss}}(V).Jss​(U⊠V)=Jss​(U)+Jss​(V).
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