Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary II.21: For 0≤R≤C(W), with possible exception of the leftmost finite Esp value: E(R)≤Esp(R)=max_P Esp(R,P).

Open
QAlgorithms.Papers.Independent.Renew46.P43.spherePackingReliability

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

prove2quantum

Let WWW be a finite stationary channel and 0≤R≤C(W)0\le R\le C(W)0≤R≤C(W). Define Esp(R)=sup⁡PEsp(R,P)E_{\rm sp}(R)=\sup_P E_{\rm sp}(R,P)Esp​(R)=supP​Esp​(R,P). Exclude exactly the case where this value is finite and every smaller nonnegative rate has infinite sphere-packing bound. The maximizing input law is attained.

E(R)≤Esp(R)=max⁡PEsp(R,P).E(R)\le E_{\rm sp}(R)=\max_P E_{\rm sp}(R,P).E(R)≤Esp​(R)=Pmax​Esp​(R,P).

This is the source result with its stated operational or information-theoretic domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Renew46.P43

open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator

open Filter MeasureTheory

open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)

open QAlgorithms.Papers.Independent.Information100.P06 (Below)

open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)

open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)

open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)

attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace

/-- Corollary II.21, PDF p.36: exclude exactly a finite leftmost sphere-packing
value with every smaller nonnegative rate infinite, not all zero or positive rates. -/
theorem spherePackingReliability {a d : ℕ} (ha : 0 < a) (hd : 0 < d)
    (W : FiniteChannel a (fullAlgebra d hd)) (R : ℝ) (hR : 0 ≤ R) (hcap : R ≤ W.capacity)
    (hnotleftmost : ¬ (sphereBound W R ≠ ⊤ ∧
      ∀ r : ℝ, 0 ≤ r → r < R → sphereBound W r = ⊤)) :
    reliability W R ≤ sphereBound W R ∧
    ∃ P : PMF (Fin a), sphereBound W R = sphereExponent W R P := by sorry

end QAlgorithms.Papers.Independent.Renew46.P43

end
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 36, Corollary II.21
Read-back

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

For all positive natural numbers a,da,da,d, every channel WWW with aaa letters and ddd-dimensional density matrix outputs, and every real RRR with

0≤R≤C(W),C(W)=sup⁡PI(P,W),0\le R\le C(W),\qquad C(W)=\sup_P I(P,W),0≤R≤C(W),C(W)=Psup​I(P,W),

suppose that it is not the case that S∗(W,R)S_*(W,R)S∗​(W,R) is finite while S∗(W,r)=+∞S_*(W,r)=+\inftyS∗​(W,r)=+∞ for every real rrr satisfying 0≤r<R0\le r<R0≤r<R; then

reliability⁡(W,R)≤S∗(W,R),∃P,S∗(W,R)=S(W,R,P).\operatorname{reliability}(W,R)\le S_*(W,R), \qquad \exists P,\quad S_*(W,R)=S(W,R,P).reliability(W,R)≤S∗​(W,R),∃P,S∗​(W,R)=S(W,R,P).

Here PPP ranges over input probability distributions,

S∗(W,r)=sup⁡PS(W,r,P),S(W,r,P)=inf⁡VI(P,V)≤r∑xP(x)D2(Vx∥Wx),S_*(W,r)=\sup_P S(W,r,P),\qquad S(W,r,P)= \inf_{\substack{V\\I(P,V)\le r}}\sum_xP(x)D_2(V_x\Vert W_x),S∗​(W,r)=Psup​S(W,r,P),S(W,r,P)=VI(P,V)≤r​inf​x∑​P(x)D2​(Vx​∥Wx​),

and I(P,V)=H(∑xP(x)Vx)−∑xP(x)H(Vx)I(P,V)=H(\sum_xP(x)V_x)-\sum_xP(x)H(V_x)I(P,V)=H(∑x​P(x)Vx​)−∑x​P(x)H(Vx​), with VxV_xVx​ ranging over ddd-dimensional density matrices. Entropy is H(X)=−Re⁡tr⁡[f(X)]H(X)=-\operatorname{Re}\operatorname{tr}[f(X)]H(X)=−Retr[f(X)], f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t; D2(ν∥ρ)D_2(\nu\Vert\rho)D2​(ν∥ρ) is +∞+\infty+∞ when ker⁡ρ⊈ker⁡ν\ker\rho\not\subseteq\ker\nukerρ⊆kerν, and otherwise is max⁡{0,Re⁡tr⁡[νln⁡ν−νln⁡ρ]}/ln⁡2\max\{0,\operatorname{Re}\operatorname{tr}[\nu\ln\nu-\nu\ln\rho]\}/\ln2max{0,Retr[νlnν−νlnρ]}/ln2, using continuous functional calculus and total real logarithms. Empty extended nonnegative infima are +∞+\infty+∞. Reliability means

lim inf⁡j→∞η→0+E(j+1,ej+1(W,R−η))\liminf_{\substack{j\to\infty\\\eta\to0^+}} E(j+1,e_{j+1}(W,R-\eta))j→∞η→0+​liminf​E(j+1,ej+1​(W,R−η))

along the product filter, where em(W,r)e_m(W,r)em​(W,r) is the infimum of the nonnegative part of maximum decoding error over length m>0m>0m>0 codes with a positive message count M≥2mrM\ge2^{mr}M≥2mr, arbitrary input words, and a measurement consisting of positive semidefinite matrices D⊥,D0,…,DM−1D_\bot,D_0,\ldots,D_{M-1}D⊥​,D0​,…,DM−1​ summing to the identity. The maximum error is max⁡ℓ<M(1−Re⁡tr⁡[(⨂tWwℓ(t))Dℓ])\max_{\ell<M}(1-\operatorname{Re}\operatorname{tr}[(\bigotimes_tW_{w_\ell(t)})D_\ell])maxℓ<M​(1−Retr[(⨂t​Wwℓ​(t)​)Dℓ​]); an empty code infimum is +∞+\infty+∞. The exponent satisfies E(m,0)=+∞E(m,0)=+\inftyE(m,0)=+∞, E(m,+∞)=0E(m,+\infty)=0E(m,+∞)=0, and E(m,e)=max⁡{0,−log⁡2(e)/m}E(m,e)=\max\{0,-\log_2(e)/m\}E(m,e)=max{0,−log2​(e)/m} otherwise. The extra hypothesis permits S∗(W,R)=+∞S_*(W,R)=+\inftyS∗​(W,R)=+∞; when R=0R=0R=0, the quantifier over 0≤r<R0\le r<R0≤r<R is vacuous, so the hypothesis requires S∗(W,0)=+∞S_*(W,0)=+\inftyS∗​(W,0)=+∞.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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