Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6: regularized ss-private capacity

Open
QAlgorithms.Papers.Independent.Support50.P07.ssPrivateCapacity_regularization

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

prove2quantum

For any channel N\mathcal NN, let Cp,ss(1)C_{p,ss}^{(1)}Cp,ss(1)​ denote the symmetric-pure-ensemble variational quantity of Eq.(3), optimizing all finite auxiliary dimensions and classical processings. The sequence of normalized block quantities converges, and

lim⁡n→∞1nCp,ss(1)(N⊗n)=Cp,ss(N).\lim_{n\to\infty}\frac{1}{n}C_{p,ss}^{(1)}(\mathcal N^{\otimes n})=C_{p,ss}(\mathcal N).n→∞lim​n1​Cp,ss(1)​(N⊗n)=Cp,ss​(N).

Here nnn counts only memoryless uses of the main channel.

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 6, PDF pp.3–4: convergence itself, to the operational capacity, is asserted.
The harmless n=0 value from real division does not enter the tail atTop. -/
theorem ssPrivateCapacity_regularization [Nonempty A] [Nonempty B] [Nonempty E]
    (U : Matrix (B × E) A ℂ) (hU : IsIsometry U) :
    Tendsto (fun n : ℕ => ssPrivateInformation (dilationPower U n) / (n : ℝ))
      atTop (nhds (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. 3, Lemma 6: regularized 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:CA→CB⊗CEU:\mathbb C^A\to\mathbb C^B\otimes\mathbb C^EU:CA→CB⊗CE satisfy U†U=IU^\dagger U=IU†U=I. For any such dilation X:H→K⊗LX:H\to K\otimes LX:H→K⊗L, write NX(ρ)=Tr⁡L(XρX†)\mathcal N_X(\rho)=\operatorname{Tr}_L(X\rho X^\dagger)NX​(ρ)=TrL​(XρX†) and EX(ρ)=Tr⁡K(XρX†)\mathcal E_X(\rho)=\operatorname{Tr}_K(X\rho X^\dagger)EX​(ρ)=TrK​(XρX†). Define Jss(X)J_{\mathrm{ss}}(X)Jss​(X) as the real supremum, over every integer d≥1d\ge1d≥1, every pair of positive finite label counts, probabilities wx≥0w_x\ge0wx​≥0 summing to one, 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 conditional probabilities p(t∣x)≥0p(t\mid x)\ge0p(t∣x)≥0 summing to one for each xxx, of I(T:KCd)−I(T:LCd)I(T:K\mathbb C^d)-I(T:L\mathbb C^d)I(T:KCd)−I(T:LCd). These mutual informations are evaluated on the two states obtained by applying the receiver and environment maps of XXX together with the identity routing of the two auxiliary factors to ∑x,twxp(t∣x)∣t⟩⟨t∣⊗∣ψx⟩⟨ψx∣\sum_{x,t}w_xp(t\mid x)|t\rangle\langle t|\otimes|\psi_x\rangle\langle\psi_x|∑x,t​wx​p(t∣x)∣t⟩⟨t∣⊗∣ψx​⟩⟨ψ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​), where S(ρ)=−Re⁡tr⁡[(t↦tlog⁡2t)(ρ)]S(\rho)=-\operatorname{Re}\operatorname{tr}[(t\mapsto t\log_2t)(\rho)]S(ρ)=−Retr[(t↦tlog2​t)(ρ)], using continuous functional calculus. Define Css(X)C_{\mathrm{ss}}(X)Css​(X) as the real supremum of nonnegative rates RRR such that, for every ε,δ>0\varepsilon,\delta>0ε,δ>0, there is n0>0n_0>0n0​>0 for which every n≥n0n\ge n_0n≥n0​ admits d≥1d\ge1d≥1, M≥1M\ge1M≥1, density matrices ρm\rho_mρm​ on H⊗n⊗Cd⊗CdH^{\otimes n}\otimes\mathbb C^d\otimes\mathbb C^dH⊗n⊗Cd⊗Cd, and a receiver POVM (Dj)j<M(D_j)_{j<M}(Dj​)j<M​, with R−δ≤log⁡2M/nR-\delta\le\log_2M/nR−δ≤log2​M/n. A density matrix is positive semidefinite with trace one, a POVM consists of positive semidefinite matrices summing to III, and each ρm\rho_mρm​ must satisfy Sdρm=ρm=ρmSdS_d\rho_m=\rho_m=\rho_mS_dSd​ρm​=ρm​=ρm​Sd​, where SdS_dSd​ swaps the auxiliary factors. Let Xn,dX_{n,d}Xn,d​ apply XXX independently nnn times and route the first auxiliary factor to the receiver and the second to the environment, and set Ω=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 η=Tr⁡m,jΩ\eta=\operatorname{Tr}_{m,j}\Omegaη=Trm,j​Ω; the required error is ∥Ω−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​<ε, with the full trace norm ∥Z∥1=Re⁡tr⁡Z†Z\|Z\|_1=\operatorname{Re}\operatorname{tr}\sqrt{Z^\dagger Z}∥Z∥1​=RetrZ†Z​. Then, 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​),

lim⁡n→∞Jss(Un)n=Css(U).\lim_{n\to\infty}\frac{J_{\mathrm{ss}}(U_n)}{n}=C_{\mathrm{ss}}(U).n→∞lim​nJss​(Un​)​=Css​(U).

The sequence is defined also at n=0n=0n=0: the matrix entries are empty products equal to one, and division by zero has value zero; this term does not affect the limit.

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