Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3.1: additivity with a noiseless factor

Open
QAlgorithms.Papers.Independent.Gap20.P07.capacity_noiselessFactor

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

prove2quantum

Let TTT be a CPTP channel between arbitrary nonzero complex physical Hilbert spaces. Let d≥1d\ge1d≥1 and s≥2s\ge2s≥2 be integers giving a finite noiseless factor and a finite noiseless reference. Then

Q(T⊗idd,ids)=Q(T,ids)+log⁡2dlog⁡2s.Q(T\otimes\mathrm{id}_d,\mathrm{id}_s)=Q(T,\mathrm{id}_s)+\frac{\log_2d}{\log_2s}.Q(T⊗idd​,ids​)=Q(T,ids​)+log2​slog2​d​.

The equality uses extended nonnegative capacities, allowing the physical channel TTT to have infinite-dimensional systems or infinite capacity. It includes additivity for a pair of ideal channels.

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 p.8: exact additivity for a standard finite ideal reference and one
finite noiseless factor; the other channel's physical dimensions are unrestricted. -/
theorem capacity_noiselessFactor {I J : Type} [Nonempty I] [Nonempty J]
    (T : Operation I J) (hT : IsTraceClassChannel T)
    (d s : ℕ) (hd : 0 < d) (hs : 2 ≤ s) :
    relativeCapacity (traceClassTensorMap T (id : Operation (Fin d) (Fin d)))
      (id : Operation (Fin s) (Fin s)) =
      relativeCapacity T (id : Operation (Fin s) (Fin s)) +
        ENNReal.ofReal (Real.logb 2 d / Real.logb 2 s) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P07

end
Source
Tema Con Variazioni: Quantum Channel Capacity, arXiv:quant-ph/0311037v1, PDF p. 8, Section 3.1: additivity with a noiseless factor
Read-back

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

Let I,JI,JI,J be nonempty types and T:CI×I→CJ×JT:\mathbb C^{I\times I}\to\mathbb C^{J\times J}T:CI×I→CJ×J be a channel, and let integers d,sd,sd,s satisfy d>0d>0d>0 and s≥2s\ge2s≥2. Here trace class means admitting Xij=∑r≥0ur(i)vr(j)‾X_{ij}=\sum_{r\ge0}u_r(i)\overline{v_r(j)}Xij​=∑r≥0​ur​(i)vr​(j)​, with square-summable vectors and ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞; τ(X)\tau(X)τ(X) is the infimum of these sums in [0,∞][0,\infty][0,∞], or +∞+\infty+∞ if none exists. A density is trace class with positive semidefinite finite principal restrictions and summable real diagonal of sum 111. A channel preserves trace-class matrices, is additive and complex-homogeneous on them, and preserves densities under every finite ancillary extension, which acts separately on blocks with fixed ancillary row and column indices. Write ∥F∥st=sup⁡r≥0, X trace class, τ(X)≤1τ((F⊗idr)X)\|F\|_{\mathrm{st}}=\sup_{r\ge0,\ X\text{ trace class},\ \tau(X)\le1}\tau((F\otimes\mathrm{id}_r)X)∥F∥st​=supr≥0, X trace class, τ(X)≤1​τ((F⊗idr​)X). For maps P,QP,QP,Q, let ΔP,Q(n,m)\Delta_{P,Q}(n,m)ΔP,Q​(n,m) be the infimum of ∥D∘P[n]∘E−Q[m]∥st\|D\circ P^{[n]}\circ E-Q^{[m]}\|_{\mathrm{st}}∥D∘P[n]∘E−Q[m]∥st​ over channel encoders and decoders between the corresponding registers. Powers apply the map to each coordinate, recursively beginning with the first-coordinate block; their zeroth power evaluates at the unique empty tuples. Define C(P,Q)C(P,Q)C(P,Q) as the supremum of real R>0R>0R>0 such that every positive-integer sequence pair 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, has ΔP,Q(na,ma)→0\Delta_{P,Q}(n_a,m_a)\to0ΔP,Q​(na​,ma​)→0. The supremum lies in [0,∞][0,\infty][0,∞] and is 000 for an empty collection of rates. Let idd\mathrm{id}_didd​ denote the identity on d×dd\times dd×d complex matrices. The map T⊗iddT\otimes\mathrm{id}_dT⊗idd​ sends XXX, indexed by I×{0,…,d−1}I\times\{0,\ldots,d-1\}I×{0,…,d−1}, to the matrix with entry T((X(i,a),(i′,b))i,i′)j,j′T((X_{(i,a),(i',b)})_{i,i'})_{j,j'}T((X(i,a),(i′,b)​)i,i′​)j,j′​ at ((j,a),(j′,b))((j,a),(j',b))((j,a),(j′,b)). Then

C(T⊗idd,ids)=C(T,ids)+max⁡ ⁣(0,log⁡2dlog⁡2s).C(T\otimes\mathrm{id}_d,\mathrm{id}_s) = C(T,\mathrm{id}_s)+\max\!\left(0,\frac{\log_2 d}{\log_2 s}\right).C(T⊗idd​,ids​)=C(T,ids​)+max(0,log2​slog2​d​).

The maximum expresses conversion into the extended nonnegative reals; under the stated bounds the ratio is nonnegative and its denominator is positive. The case d=1d=1d=1 is included and contributes 000.

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