Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Regularized public rate for independent uses of a fixed cq channel

Open
QAlgorithms.Papers.Independent.Intakenext100.P30.asymptotic_public_rate

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

prove2quantum

Fix the cq input alphabet and receiver channel Θ\ThetaΘ. The operational iterated limit exists, as does the regularized information limit, and they agree:

Rpub(Θ)=lim⁡ε↓0lim⁡n→∞Cpubε(Θ⊗n)n=lim⁡ℓ→∞1ℓsup⁡PXℓ[H(Xℓ)−H(Xℓ∣Y⊗ℓ)].R_{\rm pub}(\Theta) =\lim_{\varepsilon\downarrow0}\lim_{n\to\infty}\frac{C_{\rm pub}^{\varepsilon}(\Theta^{\otimes n})}{n} =\lim_{\ell\to\infty}\frac1\ell\sup_{P_{X^\ell}}\bigl[H(X^\ell)-H(X^\ell|Y^{\otimes\ell})\bigr].Rpub​(Θ)=ε↓0lim​n→∞lim​nCpubε​(Θ⊗n)​=ℓ→∞lim​ℓ1​PXℓ​sup​[H(Xℓ)−H(Xℓ∣Y⊗ℓ)].

Each input law may correlate the entire classical string; each code may use an arbitrary stochastic encoder and normalized decoder. The independent channel uses, not the codes or input laws, factor. This is the public classical communication formula for the fixed cq channel.

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.

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, (15)–(16): existence of the operational iterated limit
and its regularized public information formula on the fixed cq alphabet. -/
theorem asymptotic_public_rate [Nonempty X] [Nonempty Y]
    (theta : X → Matrix Y Y ℂ) (hTheta : RRIsCq theta) :
    ∃ rate : ℝ, RRPublicRate theta rate ∧
      Tendsto (fun n : ℕ => rrPerUse (n + 1)
        (rrPublicInformation (rrChannelPower theta (n + 1)))) atTop (nhds (rate : EReal)) := 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 (16): regularized public rate
Read-back

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

Let X,YX,YX,Y be finite nonempty types, with the required decidable equalities, and let θx\theta_xθx​ be a positive semidefinite complex matrix on YYY of trace 111 for every x∈Xx\in Xx∈X. For m≥1m\ge1m≥1, define the product family by θ(x1,…,xm)[m]=⨂i=1mθxi\theta^{[m]}_{(x_1,\ldots,x_m)}=\bigotimes_{i=1}^{m}\theta_{x_i}θ(x1​,…,xm​)[m]​=⨂i=1m​θxi​​. For any such family Θ:A→MatB(C)\Theta:A\to\mathrm{Mat}_B(\mathbb C)Θ:A→MatB​(C), define Cpub(Θ,ϵ)C_{\mathrm{pub}}(\Theta,\epsilon)Cpub​(Θ,ϵ) as the extended-real supremum of log⁡2s\log_2slog2​s over integers s≥1s\ge1s≥1 for which there exist distributions qjq_jqj​ on AAA and matrices Dj⪰0D_j\succeq0Dj​⪰0 on BBB, indexed by the sss messages, such that ∑jDj=IB\sum_jD_j=I_B∑j​Dj​=IB​ and 1−Re⁡tr⁡(Dj∑aqj(a)Θa)≤ϵ1-\operatorname{Re}\operatorname{tr}(D_j\sum_aq_j(a)\Theta_a)\le\epsilon1−Retr(Dj​∑a​qj​(a)Θa​)≤ϵ for every jjj. For a distribution ppp on AAA, set ωp,Θ=∑ap(a)∣a⟩⟨a∣⊗Θa\omega_{p,\Theta}=\sum_ap(a)|a\rangle\langle a|\otimes\Theta_aωp,Θ​=∑a​p(a)∣a⟩⟨a∣⊗Θa​, define S(ρ)=−Re⁡tr⁡[g(ρ)]S(\rho)=-\operatorname{Re}\operatorname{tr}[g(\rho)]S(ρ)=−Retr[g(ρ)], where g(t)=tlog⁡2tg(t)=t\log_2tg(t)=tlog2​t is applied by continuous functional calculus, and set S(A∣B)ω=S(ω)−S(tr⁡Aω)S(A\mid B)_\omega=S(\omega)-S(\operatorname{tr}_A\omega)S(A∣B)ω​=S(ω)−S(trA​ω), with (tr⁡Aω)bb′=∑aω(a,b),(a,b′)(\operatorname{tr}_A\omega)_{bb'}=\sum_a\omega_{(a,b),(a,b')}(trA​ω)bb′​=∑a​ω(a,b),(a,b′)​. Define

Ipub(Θ)=sup⁡p[S(diag⁡p)−S(A∣B)ωp,Θ],I_{\mathrm{pub}}(\Theta) =\sup_p\left[S(\operatorname{diag}p)-S(A\mid B)_{\omega_{p,\Theta}}\right],Ipub​(Θ)=psup​[S(diagp)−S(A∣B)ωp,Θ​​],

where ppp ranges over all nonnegative real functions summing to 111, and the supremum is in the extended reals. There exist a real number rrr and a function L:R→R‾L:\mathbb R\to\overline{\mathbb R}L:R→R such that, for every 0<ϵ<1/20<\epsilon<1/20<ϵ<1/2,

lim⁡n→∞Cpub(θ[n+1],ϵ)n+1=L(ϵ),lim⁡ϵ→0+L(ϵ)=r,\lim_{n\to\infty}\frac{C_{\mathrm{pub}}(\theta^{[n+1]},\epsilon)}{n+1}=L(\epsilon), \qquad \lim_{\epsilon\to0^+}L(\epsilon)=r,n→∞lim​n+1Cpub​(θ[n+1],ϵ)​=L(ϵ),ϵ→0+lim​L(ϵ)=r,

and also

lim⁡n→∞Ipub(θ[n+1])n+1=r.\lim_{n\to\infty}\frac{I_{\mathrm{pub}}(\theta^{[n+1]})}{n+1}=r.n→∞lim​n+1Ipub​(θ[n+1])​=r.

All limits are in the extended reals, with rrr embedded there; the divisions mean multiplication by the embedded real reciprocal of n+1n+1n+1, so only positive block lengths occur.

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