Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3.1 / (16): tensor superadditivity

Open
QAlgorithms.Papers.Independent.Gap20.P07.capacity_superadditive

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

prove2quantum

Let T1,T2T_1,T_2T1​,T2​ be CPTP channels on nonzero complex Hilbert spaces and let SSS be any CPTP reference channel. Then their extended nonnegative relative capacities satisfy

Q(T1⊗T2,S)≥Q(T1,S)+Q(T2,S).Q(T_1\otimes T_2,S)\ge Q(T_1,S)+Q(T_2,S).Q(T1​⊗T2​,S)≥Q(T1​,S)+Q(T2​,S).

This gives superadditivity for parallel use; it does not assert additivity for arbitrary noisy factors.

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, (16): tensor superadditivity, with no general additivity assumption. -/
theorem capacity_superadditive {I J K L A B : Type}
    [Nonempty I] [Nonempty J] [Nonempty K] [Nonempty L] [Nonempty A] [Nonempty B]
    (T1 : Operation I J) (T2 : Operation K L) (S : Operation A B)
    (h1 : IsTraceClassChannel T1) (h2 : IsTraceClassChannel T2) (hS : IsTraceClassChannel S) :
    relativeCapacity T1 S + relativeCapacity T2 S ≤
      relativeCapacity (traceClassTensorMap T1 T2) 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 / (16): tensor superadditivity
Read-back

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

Let I,J,K,L,A,BI,J,K,L,A,BI,J,K,L,A,B be nonempty types, and let T1:CI×I→CJ×JT_1:\mathbb C^{I\times I}\to\mathbb C^{J\times J}T1​:CI×I→CJ×J, T2:CK×K→CL×LT_2:\mathbb C^{K\times K}\to\mathbb C^{L\times L}T2​:CK×K→CL×L, and S:CA×A→CB×BS:\mathbb C^{A\times A}\to\mathbb C^{B\times B}S:CA×A→CB×B satisfy these channel requirements: they preserve trace-class matrices, are additive and complex-homogeneous on them, and preserve densities after adjoining every finite ancillary register. Explicitly, trace class means having an expansion 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 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​∥<∞; τ(X)∈[0,∞]\tau(X)\in[0,\infty]τ(X)∈[0,∞] is the infimum of these sums, with empty infimum +∞+\infty+∞. A density is trace class with positive semidefinite finite principal restrictions and summable real diagonal of sum 111. Ancillary extension applies the map to each matrix block with fixed ancillary row and column indices. For any FFF, put ∥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, set ΔP,Q(n,m)=inf⁡E,D∥D∘P[n]∘E−Q[m]∥st\Delta_{P,Q}(n,m)=\inf_{E,D}\|D\circ P^{[n]}\circ E-Q^{[m]}\|_{\mathrm{st}}ΔP,Q​(n,m)=infE,D​∥D∘P[n]∘E−Q[m]∥st​, with channel encoders and decoders between the relevant registers. Coordinate powers apply the map to the first-coordinate block and recursively to the remaining coordinates; the zeroth power evaluates at the unique empty tuples. Let C(P,Q)C(P,Q)C(P,Q) be the supremum in [0,∞][0,\infty][0,∞] 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 is 000 when there are no such rates. Define the joint map explicitly by

((T1⊗T2)X)(j,l),(j′,l′)=T1 ⁣((T2((X(i,k),(i′,k′))k,k′)l,l′)i,i′)j,j′.((T_1\otimes T_2)X)_{(j,l),(j',l')} = T_1\!\left( \left(T_2((X_{(i,k),(i',k')})_{k,k'})_{l,l'}\right)_{i,i'} \right)_{j,j'}.((T1​⊗T2​)X)(j,l),(j′,l′)​=T1​((T2​((X(i,k),(i′,k′)​)k,k′​)l,l′​)i,i′​)j,j′​.

Then, with addition in the extended nonnegative reals,

C(T1,S)+C(T2,S)≤C(T1⊗T2,S).C(T_1,S)+C(T_2,S)\le C(T_1\otimes T_2,S).C(T1​,S)+C(T2​,S)≤C(T1​⊗T2​,S).
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