Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8: convexity of operational ss-private capacity

Open
QAlgorithms.Papers.Independent.Support50.P07.ssPrivateCapacity_convex

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

prove2quantum

Let N0,N1:A→B\mathcal N_0,\mathcal N_1:A\to BN0​,N1​:A→B have compatible input and receiver spaces, and let 0≤p≤10\le p\le10≤p≤1. Let M\mathcal MM be any Stinespring realization of the receiver map (1−p)N0+pN1(1-p)\mathcal N_0+p\mathcal N_1(1−p)N0​+pN1​. Then

Cp,ss(M)≤(1−p)Cp,ss(N0)+pCp,ss(N1).C_{p,ss}(\mathcal M)\le(1-p)C_{p,ss}(\mathcal N_0)+pC_{p,ss}(\mathcal N_1).Cp,ss​(M)≤(1−p)Cp,ss​(N0​)+pCp,ss​(N1​).

Each operational capacity uses its channel's full complementary output.

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 8, PDF p.5: convexity compares RECEIVER maps. Each channel's full
complementaryChannel comes from its own isometry; no mixture of isometries is taken. -/
theorem ssPrivateCapacity_convex [Nonempty A] [Nonempty B] [Nonempty E]
    {G H : Type} [Fintype G] [DecidableEq G]
    [Nonempty G] [Fintype H] [DecidableEq H] [Nonempty H]
    (U : Matrix (B × E) A ℂ) (V : Matrix (B × G) A ℂ)
    (W : Matrix (B × H) A ℂ) (hU : IsIsometry U) (hV : IsIsometry V)
    (hW : IsIsometry W) (p : ℝ) (hp : p ∈ Set.Icc 0 1)
    (hmix : ∀ rho, receiverChannel W rho = ((1 - p : ℝ) : ℂ) • receiverChannel U rho +
      (p : ℂ) • receiverChannel V rho) :
    ssPrivateCapacity W ≤ (1 - p) * ssPrivateCapacity U + p * ssPrivateCapacity 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. 5, Lemma 8: convexity of operational ss-private capacity
Read-back

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

Let A,B,E,G,HA,B,E,G,HA,B,E,G,H be finite nonempty types with decidable equality. Let U:A→B⊗EU:A\to B\otimes EU:A→B⊗E, V:A→B⊗GV:A\to B\otimes GV:A→B⊗G, and W:A→B⊗HW:A\to B\otimes HW:A→B⊗H satisfy U†U=V†V=W†W=IU^\dagger U=V^\dagger V=W^\dagger W=IU†U=V†V=W†W=I, and let p∈[0,1]p\in[0,1]p∈[0,1]. Assume that, for every complex matrix ρ\rhoρ on AAA, including matrices that are not density matrices,

Tr⁡H(WρW†)=(1−p)Tr⁡E(UρU†)+pTr⁡G(VρV†).\operatorname{Tr}_H(W\rho W^\dagger) =(1-p)\operatorname{Tr}_E(U\rho U^\dagger) +p\operatorname{Tr}_G(V\rho V^\dagger).TrH​(WρW†)=(1−p)TrE​(UρU†)+pTrG​(VρV†).

For any dilation X:H0→K⊗LX:H_0\to K\otimes LX:H0​→K⊗L, define Css(X)C_{\mathrm{ss}}(X)Css​(X) as the real supremum of nonnegative rates RRR with the following property: for every ε,δ>0\varepsilon,\delta>0ε,δ>0, all sufficiently large positive integers nnn admit integers d,M≥1d,M\ge1d,M≥1, density matrices ρm\rho_mρm​ on H0⊗n⊗Cd⊗CdH_0^{\otimes n}\otimes\mathbb C^d\otimes\mathbb C^dH0⊗n​⊗Cd⊗Cd, and a receiver POVM (Dj)j<M(D_j)_{j<M}(Dj​)j<M​, such that R−δ≤log⁡2M/nR-\delta\le\log_2M/nR−δ≤log2​M/n and Sdρm=ρm=ρmSdS_d\rho_m=\rho_m=\rho_mS_dSd​ρm​=ρm​=ρm​Sd​, where SdS_dSd​ swaps the auxiliary factors. Density matrices are positive semidefinite with trace one, and POVM elements are positive semidefinite and sum to III. Let Xn,dX_{n,d}Xn,d​ apply XXX independently nnn times and route one auxiliary factor to each output, put Ω=M−1∑m,j∣m,j⟩⟨m,j∣⊗Tr⁡receiver[(Dj⊗I)Xn,dρmXn,d†]\Omega=M^{-1}\sum_{m,j}|m,j\rangle\langle m,j|\otimes\operatorname{Tr}_{\mathrm{receiver}}[(D_j\otimes I)X_{n,d}\rho_mX_{n,d}^\dagger]Ω=M−1∑m,j​∣m,j⟩⟨m,j∣⊗Trreceiver​[(Dj​⊗I)Xn,d​ρm​Xn,d†​], and put η=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​<ε, where ∥Z∥1=Re⁡tr⁡Z†Z\|Z\|_1=\operatorname{Re}\operatorname{tr}\sqrt{Z^\dagger Z}∥Z∥1​=RetrZ†Z​. The auxiliary dimension may depend on n,ε,δn,\varepsilon,\deltan,ε,δ, with no stated bound. Then

Css(W)≤(1−p)Css(U)+pCss(V).C_{\mathrm{ss}}(W)\le(1-p)C_{\mathrm{ss}}(U)+pC_{\mathrm{ss}}(V).Css​(W)≤(1−p)Css​(U)+pCss​(V).

Both endpoints p=0p=0p=0 and p=1p=1p=1 are included.

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