Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sections 2.6 and 4.4: infinite unconstrained Schumacher capacity

Open
QAlgorithms.Papers.Independent.Gap20.P07.unconstrainedEntropyCapacity_infinite

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

prove2quantum

Let TTT be a memoryless CPTP channel between nonzero complex Hilbert spaces with Q(T)>0Q(T)>0Q(T)>0. If arbitrary finite block source dimensions are permitted, then

Qentropy,unconstrained(T)=+∞.Q_{\rm entropy,unconstrained}(T)=+\infty.Qentropy,unconstrained​(T)=+∞.

More explicitly, there are positive integer dimensions dn,knd_n,k_ndn​,kn​, numbers 0<ϵn<10<\epsilon_n<10<ϵn​<1 tending to zero, and source states

ρn=(1−ϵn)Idndn⊕ϵnIknkn\rho_n=(1-\epsilon_n)\frac{I_{d_n}}{d_n}\oplus\epsilon_n\frac{I_{k_n}}{k_n}ρn​=(1−ϵn​)dn​Idn​​​⊕ϵn​kn​Ikn​​​

with CPTP codes defined on the entire enlarged space, whose entanglement fidelity tends to one while S(ρn)/n→+∞S(\rho_n)/n\to+\inftyS(ρn​)/n→+∞. This construction explains why a dimension or QAEP restriction is necessary for the entropy formulation.

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.6,19, (67)--(68): unconstrained entropy capacity is infinite if Q>0.
The witness is the actual direct-sum mixture and uses TP codes on its whole space. -/
theorem unconstrainedEntropyCapacity_infinite {I J : Type} [Nonempty I] [Nonempty J]
    (T : Operation I J) (hT : IsTraceClassChannel T) (hQ : 0 < qubitReferenceCapacity T) :
    sourceEntropyCapacity T (fun _ => True) = ⊤ ∧
    ∃ (d k : ℕ → ℕ+) (epsilon : ℕ → ℝ) (S : QuantumSource),
      (∀ n, 0 < epsilon n ∧ epsilon n < 1) ∧ Tendsto epsilon atTop (𝓝 0) ∧
      (∀ n, S.dimension n = d n + k n) ∧
      (∀ n, HEq (S.rho n) (enlargedMixture (d n) (k n) (epsilon n))) ∧
      SourceReliable T S ∧
      Tendsto (fun n => ENNReal.ofReal (vnEntropy (S.rho n) / (n + 1 : ℝ))) atTop (𝓝 ⊤) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 6, Sections 2.6 and 4.4: infinite unconstrained Schumacher capacity
Read-back

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

Let I,JI,JI,J be arbitrary nonempty types and TTT a trace-class channel, meaning that it preserves coefficient matrices admitting expansions Xij=∑rur(i)vr(j)‾X_{ij}=\sum_r u_r(i)\overline{v_r(j)}Xij​=∑r​ur​(i)vr​(j)​ with ur,vr∈ℓ2u_r,v_r\in\ell^2ur​,vr​∈ℓ2 and ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞, is additive and complex homogeneous on them, and preserves density coefficient matrices after every finite ancillary identity extension, applied blockwise. A density coefficient matrix has real nonnegative finite-coordinate quadratic forms and a summable real diagonal of sum 111. Let ν(X)\nu(X)ν(X) be the infimum of the expansion sums, let ∥Φ∥∗=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 let Q(T)Q(T)Q(T) be the supremum of positive real RRR for which all positive-integer sequences na,man_a,m_ana​,ma​ with na→∞n_a\to\inftyna​→∞ and lim sup⁡ma/na≤R\limsup m_a/n_a\le Rlimsupma​/na​≤R have inf⁡E,D∥DT⊗naE−id2⊗ma∥∗→0\inf_{E,D}\|DT^{\otimes n_a}E-\mathrm{id}_2^{\otimes m_a}\|_*\to0infE,D​∥DT⊗na​E−id2⊗ma​​∥∗​→0, with channel encoders and decoders. Assume 0<Q(T)0<Q(T)0<Q(T), allowing Q(T)=+∞Q(T)=+\inftyQ(T)=+∞. A source is a sequence of positive dimensions DaD_aDa​ and positive semidefinite trace-one matrices ρa\rho_aρa​; its entropy rate is lim sup⁡aS(ρa)/(a+1)\limsup_a S(\rho_a)/(a+1)limsupa​S(ρa​)/(a+1), where S(ρ)=−Re⁡tr⁡(ρlog⁡2ρ)S(\rho)=-\operatorname{Re}\operatorname{tr}(\rho\log_2\rho)S(ρ)=−Retr(ρlog2​ρ), with 0log⁡20=00\log_2 0=00log2​0=0. A source is reliable if length-(a+1)(a+1)(a+1) channel codes with effective maps AaA_aAa​ satisfy fe(ρa,Aa)→1f_e(\rho_a,A_a)\to1fe​(ρa​,Aa​)→1, where fe(ρ,A)=Re⁡∑i,j,k,lρjiρlk‾[A(Ejl)]ikf_e(\rho,A)=\operatorname{Re}\sum_{i,j,k,l}\rho_{ji}\overline{\rho_{lk}}[A(E_{jl})]_{ik}fe​(ρ,A)=Re∑i,j,k,l​ρji​ρlk​​[A(Ejl​)]ik​. The theorem asserts that the supremum of positive real RRR for which some reliable source has entropy rate at least RRR, with no additional source property, is +∞+\infty+∞. It further asserts the existence of positive-integer sequences da,kad_a,k_ada​,ka​, real numbers 0<ϵa<10<\epsilon_a<10<ϵa​<1 with ϵa→0\epsilon_a\to0ϵa​→0, and a reliable source of dimension Da=da+kaD_a=d_a+k_aDa​=da​+ka​, whose density matrix, after identifying these equal dimensions, is exactly

ρa=diag⁡ ⁣(1−ϵada,…,1−ϵada⏟da entries,ϵaka,…,ϵaka⏟ka entries),\rho_a=\operatorname{diag}\!\left( \underbrace{\frac{1-\epsilon_a}{d_a},\ldots,\frac{1-\epsilon_a}{d_a}}_{d_a\text{ entries}}, \underbrace{\frac{\epsilon_a}{k_a},\ldots,\frac{\epsilon_a}{k_a}}_{k_a\text{ entries}} \right),ρa​=diag​da​ entriesda​1−ϵa​​,…,da​1−ϵa​​​​,ka​ entrieska​ϵa​​,…,ka​ϵa​​​​​,

and for which max⁡(S(ρa)/(a+1),0)→+∞\max(S(\rho_a)/(a+1),0)\to+\inftymax(S(ρa​)/(a+1),0)→+∞ in the extended nonnegative reals. No rate of decay for ϵa\epsilon_aϵa​, growth bound for da,kad_a,k_ada​,ka​, or countability assumption on I,JI,JI,J is stipulated.

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