Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sections 2.2 and 7.3: sporadic capacity equals Q

Open
QAlgorithms.Papers.Independent.Gap20.P07.sporadicCapacity_eq

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

prove2quantum

Let TTT be a memoryless CPTP channel between nonzero complex Hilbert spaces. A positive rate RRR is sporadic if there are positive block sequences nν→∞,mνn_\nu\to\infty,m_\nunν​→∞,mν​ whose ratio has limsup RRR and whose optimal full-cb coding errors tend to zero. Let Qspor(T)Q_{\rm spor}(T)Qspor​(T) be the extended nonnegative supremum of such rates. Then

Qspor(T)=Q(T).Q_{\rm spor}(T)=Q(T).Qspor​(T)=Q(T).

This is equality of suprema. The extension argument achieves every strict subrate, and does not assert that the sporadic endpoint satisfies every sequence allowed by Definition 2.1.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P07
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped Topology ENNReal NNReal Matrix ComplexOrder ComplexConjugate

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus

namespace QAlgorithms.Papers.Independent.Gap20.P07

open QAlgorithms

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsTraceClass IsTraceClassChannel traceSize rankOne tensorApply)

open QAlgorithms.Papers.Independent.Frontier30.P14
  (Operation isometryCoeff conjugateKernel)

open QAlgorithms.Papers.Independent.Claimed50.P35
  (stabilizedTraceClassNorm traceClassTensorMap traceClassChannelPower
   transpose transposeBound TraceLinear tracePair MeasurePrepare)

open QAlgorithms.Papers.Independent.Gap48.P29 (fe FiniteCPMap)

/-- PDF pp.4,25--29: equality of suprema; no false endpoint assertion. -/
theorem sporadicCapacity_eq {I J : Type} [Nonempty I] [Nonempty J]
    (T : Operation I J) (hT : IsTraceClassChannel T) :
    sporadicCapacity T = qubitReferenceCapacity T := by sorry

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 4, Sections 2.2 and 7.3: sporadic capacity equals Q
Read-back

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

For arbitrary nonempty types I,JI,JI,J, let TTT map complex coefficient matrices on III to those on JJJ. A matrix is trace class when Xij=∑rur(i)vr(j)‾X_{ij}=\sum_r u_r(i)\overline{v_r(j)}Xij​=∑r​ur​(i)vr​(j)​ for sequences in ℓ2\ell^2ℓ2 satisfying ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞; let ν(X)\nu(X)ν(X) be the infimum of those sums in [0,∞][0,\infty][0,∞]. A density coefficient matrix is trace class, has real nonnegative quadratic forms on every finite coordinate set, and has summable real diagonal entries with sum 111. Assume TTT preserves trace class, is additive and complex homogeneous on such inputs, and preserves density coefficient matrices after extension by the identity on every finite ancillary register; such extensions apply TTT separately to ancillary coefficient blocks. Maps with these properties are the allowed channels. Put ∥Φ∥∗=sup⁡q≥0sup⁡X trace class, ν(X)≤1ν((Φ⊗idq)X)\|\Phi\|_*=\sup_{q\ge0}\sup_{X\text{ trace class},\,\nu(X)\le1}\nu((\Phi\otimes\mathrm{id}_q)X)∥Φ∥∗​=supq≥0​supX trace class,ν(X)≤1​ν((Φ⊗idq​)X), and for positive n,mn,mn,m let e(n,m)e(n,m)e(n,m) be the infimum of ∥DT⊗nE−id2⊗m∥∗\|DT^{\otimes n}E-\mathrm{id}_2^{\otimes m}\|_*∥DT⊗nE−id2⊗m​∥∗​ over allowed channel encoders and decoders, where tensor powers apply maps independently to coordinates. The theorem equates two suprema in [0,∞][0,\infty][0,∞]: the supremum of positive real RRR for which there exist positive-integer sequences na,man_a,m_ana​,ma​ with na→∞n_a\to\inftyna​→∞, lim sup⁡ama/na=R\limsup_a m_a/n_a=Rlimsupa​ma​/na​=R, and e(na,ma)→0e(n_a,m_a)\to0e(na​,ma​)→0; and the supremum of positive real RRR for which every such pair of sequences with na→∞n_a\to\inftyna​→∞ and lim sup⁡ama/na≤R\limsup_a m_a/n_a\le Rlimsupa​ma​/na​≤R has e(na,ma)→0e(n_a,m_a)\to0e(na​,ma​)→0. Empty suprema are 000, and either capacity may be infinite.

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