Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section V: equivalence of ss equality and private-capacity additivity

Open
QAlgorithms.Papers.Independent.Support50.P07.ssEquality_iff_privateAdditivity

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

prove2quantum

The following two universal propositions, each ranging over all finite nonzero quantum channels, are equivalent:

[∀N, Cp,ss(N)=Cp(N)]⟺[∀N1,N2, Cp(N1⊗N2)=Cp(N1)+Cp(N2)].[\forall\mathcal N,\ C_{p,ss}(\mathcal N)=C_p(\mathcal N)]\quad\Longleftrightarrow\quad[\forall\mathcal N_1,\mathcal N_2,\ C_p(\mathcal N_1\otimes\mathcal N_2)=C_p(\mathcal N_1)+C_p(\mathcal N_2)].[∀N, Cp,ss​(N)=Cp​(N)]⟺[∀N1​,N2​, Cp​(N1​⊗N2​)=Cp​(N1​)+Cp​(N2​)].

The statement asserts the equivalence, not the truth of either conjecture.

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]

/-- Section V, PDF p.8: equivalence of two universally quantified conjectures.
Neither proposition is asserted true; all finite nonzero input/output/environment
sizes are quantified separately, and the product inputs can be entangled. -/
theorem ssEquality_iff_privateAdditivity :
    (∀ a b e : ℕ, 0 < a → 0 < b → 0 < e →
      ∀ U : Matrix (Fin b × Fin e) (Fin a) ℂ, IsIsometry U →
        ssPrivateCapacity U = fullTracePrivateCapacity U) ↔
    (∀ a b e c d f : ℕ, 0 < a → 0 < b → 0 < e → 0 < c → 0 < d → 0 < f →
      ∀ (U : Matrix (Fin b × Fin e) (Fin a) ℂ)
        (V : Matrix (Fin d × Fin f) (Fin c) ℂ), IsIsometry U → IsIsometry V →
        fullTracePrivateCapacity (productDilation U V) = fullTracePrivateCapacity U + fullTracePrivateCapacity 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. 8, Section V: equivalence of ss equality and private-capacity additivity
Read-back

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

The following two universally quantified statements are equivalent: first, for every three positive integers a,b,ea,b,ea,b,e and every complex matrix U:Ca→Cb⊗CeU:\mathbb C^a\to\mathbb C^b\otimes\mathbb C^eU:Ca→Cb⊗Ce satisfying U†U=IU^\dagger U=IU†U=I, one has Css(U)=C(U)C_{\mathrm{ss}}(U)=C(U)Css​(U)=C(U); second, for every six positive integers a,b,e,c,d,fa,b,e,c,d,fa,b,e,c,d,f and all matrices U:Ca→Cb⊗CeU:\mathbb C^a\to\mathbb C^b\otimes\mathbb C^eU:Ca→Cb⊗Ce and V:Cc→Cd⊗CfV:\mathbb C^c\to\mathbb C^d\otimes\mathbb C^fV:Cc→Cd⊗Cf satisfying U†U=IU^\dagger U=IU†U=I and V†V=IV^\dagger V=IV†V=I, one has

C(U⊠V)=C(U)+C(V),(U⊠V)((b0,d0),(e0,f0)),(a0,c0)=U(b0,e0),a0V(d0,f0),c0.C(U\boxtimes V)=C(U)+C(V),\qquad (U\boxtimes V)_{((b_0,d_0),(e_0,f_0)),(a_0,c_0)} =U_{(b_0,e_0),a_0}V_{(d_0,f_0),c_0}.C(U⊠V)=C(U)+C(V),(U⊠V)((b0​,d0​),(e0​,f0​)),(a0​,c0​)​=U(b0​,e0​),a0​​V(d0​,f0​),c0​​.

For any such dilation W:A→B⊗EW:A\to B\otimes EW:A→B⊗E, C(W)C(W)C(W) means the supremum of nonnegative rates rrr such that, for every ε>0\varepsilon>0ε>0 and η>0\eta>0η>0, there exists an integer n0>0n_0>0n0​>0 for which every integer n≥n0n\ge n_0n≥n0​ admits M>0M>0M>0 messages, density matrices ρm\rho_mρm​ on AnA^nAn, and positive semidefinite measurement matrices DjD_jDj​ on BnB^nBn summing to III, with log⁡2M/n≥r−η\log_2M/n\ge r-\etalog2​M/n≥r−η and

∥Ω−1M∑m∣m,m⟩⟨m,m∣⊗ΩE∥1<ε,Ω=1M∑m,j∣m,j⟩⟨m,j∣⊗Tr⁡Bn ⁣[(Dj⊗I)W(n)ρmW(n)†],ΩE=Tr⁡m,jΩ,\left\|\Omega-\frac1M\sum_m|m,m\rangle\langle m,m|\otimes\Omega_E\right\|_1<\varepsilon, \quad \Omega=\frac1M\sum_{m,j}|m,j\rangle\langle m,j|\otimes \operatorname{Tr}_{B^n}\!\left[(D_j\otimes I)W^{(n)}\rho_mW^{(n)\dagger}\right], \quad \Omega_E=\operatorname{Tr}_{m,j}\Omega,​Ω−M1​m∑​∣m,m⟩⟨m,m∣⊗ΩE​​1​<ε,Ω=M1​m,j∑​∣m,j⟩⟨m,j∣⊗TrBn​[(Dj​⊗I)W(n)ρm​W(n)†],ΩE​=Trm,j​Ω,

where W(b,e),a(n)=∏i=0n−1W(bi,ei),aiW^{(n)}_{(b,e),a}=\prod_{i=0}^{n-1}W_{(b_i,e_i),a_i}W(b,e),a(n)​=∏i=0n−1​W(bi​,ei​),ai​​. The quantity Css(W)C_{\mathrm{ss}}(W)Css​(W) is defined by the same supremum and accuracy and rate quantifiers, except that each block length may additionally choose a positive integer hhh, use input matrices on An⊗Ch⊗ChA^n\otimes\mathbb C^h\otimes\mathbb C^hAn⊗Ch⊗Ch invariant under swapping the two hhh-indices separately in rows and columns, and measure Bn⊗ChB^n\otimes\mathbb C^hBn⊗Ch. Its dilation sends the two added indices unchanged to the receiver and environment respectively: its entry is W(b,e),a(n)1u=u′1v=v′W^{(n)}_{(b,e),a}\mathbf1_{u=u'}\mathbf1_{v=v'}W(b,e),a(n)​1u=u′​1v=v′​ between input (a,u′,v′)(a,u',v')(a,u′,v′) and output ((b,u),(e,v))((b,u),(e,v))((b,u),(e,v)). In the same error formula the environmental marginal therefore includes En⊗ChE^n\otimes\mathbb C^hEn⊗Ch. In both definitions message indices range over 0,…,M−10,\ldots,M-10,…,M−1, density matrices are positive semidefinite with trace 111, and ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​, without a factor 1/21/21/2. All six dimensions in the second statement, and all three in the first, must be strictly positive; either statement imposes no condition on dimensions equal to zero.

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