Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Capacity of an arbitrary channel sequence

Open
QAlgorithms.Papers.Independent.Support50.P20.arbitraryChannel_capacity

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

prove2quantum

Fix a complex output Hilbert space BBB. For each positive integer nnn, let Wn:xn↦ρxn(n)W_n:x_n\mapsto\rho_{x_n}^{(n)}Wn​:xn​↦ρxn​(n)​ be an arbitrary channel from a nonempty set XnX_nXn​ to normalized trace-class states on the completed tensor product B⊗nB^{\otimes n}B⊗n. No relation between different blocklengths is assumed, and XnX_nXn​ may include entangled block preparations. Define CCC independently as the extended supremum of lim inf⁡n→∞log⁡2(mn)/n\liminf_{n\to\infty}\log_2(m_n)/nliminfn→∞​log2​(mn​)/n over sequences of actual mnm_nmn​-message codes whose average errors tend to zero. For each discrete law PPP on XnX_nXn​, form πn,PAnB⊗n=∑xnP(xn)∣xn⟩⟨xn∣⊗ρxn(n)\pi_{n,P}^{A_nB^{\otimes n}}=\sum_{x_n}P(x_n)|x_n\rangle\langle x_n|\otimes\rho_{x_n}^{(n)}πn,PAn​B⊗n​=∑xn​​P(xn​)∣xn​⟩⟨xn​∣⊗ρxn​(n)​ and its marginals. Then the following outer limit exists, possibly with value +∞+\infty+∞, and

C=lim⁡ϵ↓0lim inf⁡n→∞1nsup⁡PDHϵ(πn,PAnB⊗n∥πn,PAn⊗πn,PB⊗n).C=\lim_{\epsilon\downarrow0}\liminf_{n\to\infty}\frac1n\sup_P D_H^\epsilon\bigl(\pi_{n,P}^{A_nB^{\otimes n}}\|\pi_{n,P}^{A_n}\otimes\pi_{n,P}^{B^{\otimes n}}\bigr).C=ϵ↓0lim​n→∞liminf​n1​Psup​DHϵ​(πn,PAn​B⊗n​∥πn,PAn​​⊗πn,PB⊗n​).

This operational formula covers channel sequences without causality, memorylessness, or stationarity. The small-error limit is taken after the lower limit in blocklength.

Formalization Note Completed tensor powers use square-summable coordinates indexed by tensor-product basis tuples. Sequence index zero denotes the one-use channel, so every blocklength denominator is positive. The equality with the outer limit is expressed as convergence to the independently defined operational capacity.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P20
Formal statement
noncomputable section

open Filter

open scoped ENNReal

namespace QAlgorithms.Papers.Independent.Support50.P20

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Dependency50.P13
  (IsTraceClass IsPositive operatorTrace State)

open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)

variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]

/-- PDF pp.4–5, (10) and footnote [23]: arbitrary-channel sequence capacity.
The inner limit is liminf; epsilon decreases to zero AFTER it. Output coordinates
are those of B tensor (n+1), and inputs X_n are unrestricted block preparations.
The Tendsto formulation retains the outer limit and its existence, even at infinity. -/
theorem arbitraryChannel_capacity {I : Type*} [Nonempty I] {X : ℕ → Type*}
    [∀ n, Nonempty (X n)] (W : ∀ n, ClassicalInputChannel (X n) (blockBasis I n)) :
    Tendsto
      (fun epsilon : ℝ => Filter.liminf
        (fun n => optimizedTestingInformation (blockBasis I n) (W n) epsilon /
          (((n + 1 : ℕ) : ℝ) : EReal)) atTop)
      (nhdsWithin 0 (Set.Ioi 0)) (nhds (vanishingErrorCapacity W)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P20

end
Source
One-Shot Classical-Quantum Capacity and Hypothesis Testing, arXiv:1007.5456v3, PDF p. 4, Unnumbered main asymptotic result, (10): arbitrary-channel sequence capacity
Read-back

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

Let III be any nonempty type and let XnX_nXn​ be a nonempty type for every natural number nnn, including n=0n=0n=0. Define Hn=ℓ2({0,…,n}→I;C)H_n=\ell^2(\{0,\ldots,n\}\to I;\mathbb C)Hn​=ℓ2({0,…,n}→I;C), with its canonical Hilbert basis b(n)b^{(n)}b(n) indexed by functions {0,…,n}→I\{0,\ldots,n\}\to I{0,…,n}→I. Let WnW_nWn​ assign a state on HnH_nHn​ to every x∈Xnx\in X_nx∈Xn​. Here a state is a bounded complex-linear operator TTT that is self-adjoint with nonnegative real quadratic form, has tr⁡b(n)T=∑j⟨bj(n),Tbj(n)⟩=1\operatorname{tr}_{b^{(n)}}T=\sum_j\langle b_j^{(n)},Tb_j^{(n)}\rangle=1trb(n)​T=∑j​⟨bj(n)​,Tbj(n)​⟩=1, and admits a representation Ty=∑r=0∞⟨vr,y⟩urTy=\sum_{r=0}^\infty\langle v_r,y\rangle u_rTy=∑r=0∞​⟨vr​,y⟩ur​ with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞. An effect QQQ means that both QQQ and 1−Q1-Q1−Q are bounded self-adjoint operators with nonnegative real quadratic forms; write an(Q,T)=Re⁡tr⁡b(n)(QT)a_n(Q,T)=\operatorname{Re}\operatorname{tr}_{b^{(n)}}(QT)an​(Q,T)=Retrb(n)​(QT). For a probability mass function PPP on XnX_nXn​ and effects QxQ_xQx​ on HnH_nHn​, using real probability masses, set Jn(P,Q)=∑xP(x)an(Qx,Wn(x))J_n(P,Q)=\sum_xP(x)a_n(Q_x,W_n(x))Jn​(P,Q)=∑x​P(x)an​(Qx​,Wn​(x)) and Bn(P,Q)=∑xP(x)∑yP(y)an(Qx,Wn(y))B_n(P,Q)=\sum_xP(x)\sum_yP(y)a_n(Q_x,W_n(y))Bn​(P,Q)=∑x​P(x)∑y​P(y)an​(Qx​,Wn​(y)). Define

Iϵ(Wn)=sup⁡P: PMF(Xn)L ⁣(inf⁡Qx effectsJn(P,Q)≥1−ϵmax⁡(Bn(P,Q),0)),\mathcal I_\epsilon(W_n)= \sup_{P:\,\mathrm{PMF}(X_n)} L\!\left(\inf_{\substack{Q_x\text{ effects}\\J_n(P,Q)\ge1-\epsilon}} \max(B_n(P,Q),0)\right),Iϵ​(Wn​)=P:PMF(Xn​)sup​L​Qx​ effectsJn​(P,Q)≥1−ϵ​inf​max(Bn​(P,Q),0)​,

where the infimum is in [0,∞][0,\infty][0,∞], L(0)=+∞L(0)=+\inftyL(0)=+∞, L(+∞)=−∞L(+\infty)=-\inftyL(+∞)=−∞, and L(z)=−log⁡2zL(z)=-\log_2zL(z)=−log2​z for positive finite zzz. For each nnn, a code consists of a positive integer mnm_nmn​, words xn,i∈Xnx_{n,i}\in X_nxn,i​∈Xn​, and effects Dn,iD_{n,i}Dn,i​ on HnH_nHn​ summing to the identity; its error is en=1−mn−1∑ian(Dn,i,Wn(xn,i))e_n=1-m_n^{-1}\sum_i a_n(D_{n,i},W_n(x_{n,i}))en​=1−mn−1​∑i​an​(Dn,i​,Wn​(xn,i​)), and its words need not be distinct. Define

Cvan(W)=sup⁡{lim inf⁡n→∞log⁡2mnn+1:such a code is chosen for every n,en→0},C_{\mathrm{van}}(W)= \sup\left\{ \liminf_{n\to\infty}\frac{\log_2m_n}{n+1}: \text{such a code is chosen for every }n,\quad e_n\to0 \right\},Cvan​(W)=sup{n→∞liminf​n+1log2​mn​​:such a code is chosen for every n,en​→0},

with the supremum and rate limit inferior taken in the extended reals. The declaration asserts that, as the real number ϵ\epsilonϵ tends to 000 through strictly positive values,

lim inf⁡n→∞Iϵ(Wn)n+1⟶Cvan(W)\liminf_{n\to\infty}\frac{\mathcal I_\epsilon(W_n)}{n+1} \longrightarrow C_{\mathrm{van}}(W)n→∞liminf​n+1Iϵ​(Wn​)​⟶Cvan​(W)

in the extended-real topology. No finiteness or countability of III or the XnX_nXn​, and no relation between the different functions WnW_nWn​, is assumed.

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