Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered result used in Theorem 11: unassisted capacity is bounded by ss-private capacity

Open
QAlgorithms.Papers.Independent.Support50.P07.privateCapacity_le_ssPrivateCapacity

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

prove2quantum

For every channel N\mathcal NN, unassisted private communication is bounded by free symmetric-side-channel-assisted private communication:

Cp(N)≤Cp,ss(N).C_p(\mathcal N)\le C_{p,ss}(\mathcal N).Cp​(N)≤Cp,ss​(N).

Both capacities use uniform messages and joint full-trace-norm correctness and security against the full environment.

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]

/-- PDF pp.1,5: ignoring the d=1 side channel recovers every unassisted code. -/
theorem privateCapacity_le_ssPrivateCapacity [Nonempty A] [Nonempty B] [Nonempty E]
    (U : Matrix (B × E) A ℂ)
    (hU : IsIsometry U) :
    fullTracePrivateCapacity U ≤ ssPrivateCapacity 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, Unnumbered result used in Theorem 11: unassisted capacity is bounded by ss-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. For an isometric dilation X:H→K⊗LX:H\to K\otimes LX:H→K⊗L, a code consists of M≥1M\ge1M≥1 density matrices ρm\rho_mρm​ on HHH and a POVM (Dj)j<M(D_j)_{j<M}(Dj​)j<M​ on KKK, where density matrices are positive semidefinite with trace one and POVM elements are positive semidefinite and sum to III. Its decoded state is Ω=M−1∑m,j∣m,j⟩⟨m,j∣⊗Tr⁡K[(Dj⊗I)XρmX†]\Omega=M^{-1}\sum_{m,j}|m,j\rangle\langle m,j|\otimes\operatorname{Tr}_K[(D_j\otimes I)X\rho_mX^\dagger]Ω=M−1∑m,j​∣m,j⟩⟨m,j∣⊗TrK​[(Dj​⊗I)Xρm​X†]; with η=Tr⁡m,jΩ\eta=\operatorname{Tr}_{m,j}\Omegaη=Trm,j​Ω, its error is the full trace norm ∥Ω−M−1∑m∣m,m⟩⟨m,m∣⊗η∥1\|\Omega-M^{-1}\sum_m|m,m\rangle\langle m,m|\otimes\eta\|_1∥Ω−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​. Define Ctr(U)C_{\mathrm{tr}}(U)Ctr​(U) as the real supremum of nonnegative RRR such that, for every ε,δ>0\varepsilon,\delta>0ε,δ>0, all sufficiently large positive nnn admit such a code for 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​), with error strictly below ε\varepsilonε and log⁡2M/n≥R−δ\log_2M/n\ge R-\deltalog2​M/n≥R−δ. Define Css(U)C_{\mathrm{ss}}(U)Css​(U) by the same rate and error requirements, allowing at each block length any d≥1d\ge1d≥1, input space A⊗n⊗Cd⊗CdA^{\otimes n}\otimes\mathbb C^d\otimes\mathbb C^dA⊗n⊗Cd⊗Cd, and the dilation applying UnU_nUn​ and routing one auxiliary factor to each output, while requiring every input matrix to satisfy Sdρm=ρm=ρmSdS_d\rho_m=\rho_m=\rho_mS_dSd​ρm​=ρm​=ρm​Sd​, where SdS_dSd​ swaps the auxiliary factors. The auxiliary dimension is unrestricted and may depend on the block length and tolerances. Then Ctr(U)≤Css(U)C_{\mathrm{tr}}(U)\le C_{\mathrm{ss}}(U)Ctr​(U)≤Css​(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