Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Single-letter private rate for classical outputs

Open
QAlgorithms.Papers.Independent.Intakenext100.P30.classical_private_rate

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Suppose the receiver output family and the eavesdropper output family are each simultaneously diagonalizable, separately, in fixed orthonormal bases. The private operational iterated limit exists and satisfies

Rprv(Θ)=sup⁡PT,T→X[H(T∣Z)−H(T∣Y)].R_{\rm prv}(\Theta)=\sup_{P_T,T\to X}\bigl[H(T|Z)-H(T|Y)\bigr].Rprv​(Θ)=PT​,T→Xsup​[H(T∣Z)−H(T∣Y)].

Here TTT is any finite nonempty auxiliary, PTP_TPT​ any law, and T→XT\to XT→X any stochastic map, followed by the fixed channel. The operational rate uses the source's messagewise decoding and trace-distance secrecy conditions. This removes regularization for classical outputs while retaining essential stochastic preprocessing.

All alphabets are finite and nonempty, and output Hilbert spaces are finite dimensional and nonzero. A classical–quantum channel assigns a positive semidefinite, trace-one matrix to each input. Encoders may use private randomness; decoders are normalized POVMs. Codes are fixed independently of the message, with no supplied shared key or entanglement. Logarithms and entropies are in bits.

The maximum is attained by some finite nonempty auxiliary alphabet, a normalized law on it, and a stochastic preprocessor into XXX. Their private information equals the operational rate; no cardinality cutoff is assumed.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P30
Formal statement
noncomputable section

open scoped BigOperators ComplexConjugate Matrix ComplexOrder

open Filter

namespace QAlgorithms.Papers.Independent.Intakenext100.P30

variable {X Y Z M U V A B C : Type*}

variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]

variable [Fintype Z] [DecidableEq Z] [Fintype M] [DecidableEq M]

variable [Fintype U] [DecidableEq U] [Fintype V] [DecidableEq V]

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C]

attribute [local instance] Classical.propDecidable

/-- Section IV, PDF p.5, (19): classical-output single-letter private rate.
Each marginal is simultaneously diagonalizable separately. Stochastic
preprocessing is optimized, and both operational limits exist. An attaining
finite auxiliary and stochastic preprocessor are conclusions, with no size cutoff. -/
theorem classical_private_rate [Nonempty X] [Nonempty Y] [Nonempty Z]
    (thetaY : X → Matrix Y Y ℂ) (thetaZ : X → Matrix Z Z ℂ)
    (hY : RRIsCq thetaY) (hZ : RRIsCq thetaZ)
    (hclassicalY : RRClassicalOutputs thetaY) (hclassicalZ : RRClassicalOutputs thetaZ) :
    ∃ rate : ℝ, RRPrivateRate thetaY thetaZ rate ∧
      (rate : EReal) = rrPrivateInformation thetaY thetaZ ∧
      ∃ k : ℕ, ∃ p : RRDistribution (Fin (k + 1)),
        ∃ enc : Fin (k + 1) → RRDistribution X,
          rate = rrConditionalEntropy (rrCqState p.prob (rrPreprocess thetaZ enc)) -
            rrConditionalEntropy (rrCqState p.prob (rrPreprocess thetaY enc)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P30

end
Source
Noisy channel coding via privacy amplification and information reconciliation, arXiv:1012.4814v2, PDF p. 5, §IV (19): classical single-letter private rate
Read-back

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

Let X,Y,ZX,Y,ZX,Y,Z be nonempty finite types with decidable equality, and let θxY\theta^Y_xθxY​ and θxZ\theta^Z_xθxZ​, for x∈Xx\in Xx∈X, be positive semidefinite matrices of trace 111. Suppose there are matrices VY,VZV_Y,V_ZVY​,VZ​ satisfying VY†VY=VYVY†=IYV_Y^\dagger V_Y=V_YV_Y^\dagger=I_YVY†​VY​=VY​VY†​=IY​ and VZ†VZ=VZVZ†=IZV_Z^\dagger V_Z=V_ZV_Z^\dagger=I_ZVZ†​VZ​=VZ​VZ†​=IZ​, such that all VY†θxYVYV_Y^\dagger\theta^Y_xV_YVY†​θxY​VY​ and all VZ†θxZVZV_Z^\dagger\theta^Z_xV_ZVZ†​θxZ​VZ​ have zero off-diagonal entries. Write S(A)=−Re⁡tr⁡f(A)S(A)=-\operatorname{Re}\operatorname{tr}f(A)S(A)=−Retrf(A), with f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t applied by continuous functional calculus and the total real logarithm satisfying log⁡20=0\log_2 0=0log2​0=0. For an integer L≥1L\ge1L≥1, a probability distribution ppp on {1,…,L}\{1,\ldots,L\}{1,…,L}, and probability distributions eje_jej​ on XXX, put AjY=∑xej(x)θxYA^Y_j=\sum_xe_j(x)\theta^Y_xAjY​=∑x​ej​(x)θxY​, AjZ=∑xej(x)θxZA^Z_j=\sum_xe_j(x)\theta^Z_xAjZ​=∑x​ej​(x)θxZ​, and C(p,A)(j,b),(j′,b′)=1j=j′p(j)(Aj)b,b′C(p,A)_{(j,b),(j',b')}=\mathbf1_{j=j'}p(j)(A_j)_{b,b'}C(p,A)(j,b),(j′,b′)​=1j=j′​p(j)(Aj​)b,b′​, and define

J(p,e)=S(C(p,AZ))−S ⁣(∑jp(j)AjZ)−S(C(p,AY))+S ⁣(∑jp(j)AjY),I=sup⁡L,p,e(J(p,e):R‾).J(p,e)= S(C(p,A^Z))-S\!\left(\sum_jp(j)A^Z_j\right) -S(C(p,A^Y))+S\!\left(\sum_jp(j)A^Y_j\right), \qquad I=\sup_{L,p,e}(J(p,e):\overline{\mathbb R}).J(p,e)=S(C(p,AZ))−S(j∑​p(j)AjZ​)−S(C(p,AY))+S(j∑​p(j)AjY​),I=L,p,esup​(J(p,e):R).

For each positive integer nnn, define Cnpriv(ε)C_n^{\mathrm{priv}}(\varepsilon)Cnpriv​(ε) as the extended-real supremum of log⁡2K\log_2Klog2​K over integers K≥1K\ge1K≥1, probability distributions qmq_mqm​ on XnX^nXn, and positive semidefinite decoding matrices DmD_mDm​ on YnY^nYn summing to IYnI_{Y^n}IYn​, such that every message satisfies 1−Re⁡tr⁡(DmBmY)≤ε1-\operatorname{Re}\operatorname{tr}(D_mB^Y_m)\le\varepsilon1−Retr(Dm​BmY​)≤ε, and there exists one positive semidefinite reference matrix σ\sigmaσ on ZnZ^nZn with trace 111 such that Re⁡tr⁡(BmZ−σ)†(BmZ−σ)/2≤ε\operatorname{Re}\operatorname{tr}\sqrt{(B^Z_m-\sigma)^\dagger(B^Z_m-\sigma)}/2\le\varepsilonRetr(BmZ​−σ)†(BmZ​−σ)​/2≤ε for every message, where

BmY=∑x∈Xnqm(x)θxY,(n),BmZ=∑x∈Xnqm(x)θxZ,(n),(θxY,(n))a,b=∏i=1n(θxiY)ai,bi,B^Y_m=\sum_{x\in X^n}q_m(x)\theta^{Y,(n)}_x,\quad B^Z_m=\sum_{x\in X^n}q_m(x)\theta^{Z,(n)}_x,\quad (\theta^{Y,(n)}_x)_{a,b}=\prod_{i=1}^n(\theta^Y_{x_i})_{a_i,b_i},BmY​=x∈Xn∑​qm​(x)θxY,(n)​,BmZ​=x∈Xn∑​qm​(x)θxZ,(n)​,(θxY,(n)​)a,b​=i=1∏n​(θxi​Y​)ai​,bi​​,

and the ZZZ-output product is defined by the same entrywise formula; the matrix square root uses continuous functional calculus. Then there exist a real number rrr and a function ℓ:R→R‾\ell:\mathbb R\to\overline{\mathbb R}ℓ:R→R such that, for every 0<ε<1/20<\varepsilon<1/20<ε<1/2, Cnpriv(ε)/n→ℓ(ε)C_n^{\mathrm{priv}}(\varepsilon)/n\to\ell(\varepsilon)Cnpriv​(ε)/n→ℓ(ε) as n→∞n\to\inftyn→∞ through positive integers, and ℓ(ε)→(r:R‾)\ell(\varepsilon)\to(r:\overline{\mathbb R})ℓ(ε)→(r:R) as ε→0\varepsilon\to0ε→0 from above. They also satisfy

(r:R‾)=I,r=J(p∗,e∗)(r:\overline{\mathbb R})=I, \qquad r=J(p_*,e_*)(r:R)=I,r=J(p∗​,e∗​)

for some finite L=k+1L=k+1L=k+1 with k∈Nk\in\mathbb Nk∈N, some probability distribution p∗p_*p∗​ on those LLL symbols, and some probability distributions e∗,je_{*,j}e∗,j​ on XXX. The case k=0k=0k=0, zero probabilities, and singleton underlying types are included.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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