Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4, equation (9): additivity implies a product optimal output

Open
QAlgorithms.Papers.Independent.Intakenext100.P60.optimal_output_product

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let TTT and T′T'T′ be trace-preserving completely positive channels with arbitrary Hilbert input spaces and finite positive-dimensional output spaces. Suppose

C(T⊗T′)=C(T)+C(T′).C(T\otimes T')=C(T)+C(T').C(T⊗T′)=C(T)+C(T′).

For any normalized finite pure ensembles attaining these three Holevo suprema, denote their average output density matrices by ω\omegaω, ω′\omega'ω′ and Ω\OmegaΩ, respectively. The joint channel is the actual tensor channel on the completed Hilbert tensor product, allowing entangled inputs of arbitrary Schmidt rank. Then

Ω=ω⊗ω′.\Omega=\omega\otimes\omega'.Ω=ω⊗ω′.

This is a consequence of the stated additivity premise, with attainment assumed only for the three ensembles being compared.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P60
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P60

open scoped Matrix ComplexConjugate ComplexOrder TensorProduct

noncomputable section

attribute [local instance] Classical.propDecidable Classical.decEq

-- Exact accepted matrix, normalized ensemble, convex roof, grouped copies and LOCC.

open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)

open QAlgorithms.Papers.Independent.Information100.P08 (PureEnsemble pureAverage formation)

open QAlgorithms.Papers.Independent.Information100.P80 (groupedPower)

open QAlgorithms.Papers.Independent.Gap48.P32 (twoWayDistillable)

/-- PDF p.6, (9): conditional on capacity additivity, any three attaining ensembles
have the stated product output. The joint channel and all its entangled inputs are
constructed using the completed Hilbert tensor product. -/
theorem optimal_output_product {H K : Type*} [NormedAddCommGroup H]
    [InnerProductSpace ℂ H] [CompleteSpace H] [NormedAddCommGroup K]
    [InnerProductSpace ℂ K] [CompleteSpace K] {d e : ℕ} (hd : 0 < d) (he : 0 < e)
    (T : FiniteOutputDualChannel H d) (S : FiniteOutputDualChannel K e)
    (hadd : signalCapacity (tensorDualOutput T S) =
      signalCapacity (pureOutput T) + signalCapacity (pureOutput S))
    (a : SignalEnsemble H) (b : SignalEnsemble K)
    (c : SignalEnsemble (UniformSpace.Completion (H ⊗[ℂ] K)))
    (ha : signalHolevo (pureOutput T) a = signalCapacity (pureOutput T))
    (hb : signalHolevo (pureOutput S) b = signalCapacity (pureOutput S))
    (hc : signalHolevo (tensorDualOutput T S) c = signalCapacity (tensorDualOutput T S)) :
    signalBarycenter (tensorDualOutput T S) c =
      Matrix.kronecker (signalBarycenter (pureOutput T) a) (signalBarycenter (pureOutput S) b) := by sorry

end

end QAlgorithms.Papers.Independent.Intakenext100.P60
Source
Remarks on additivity of the Holevo channel capacity and of the entanglement of formation, arXiv:quant-ph/0206148v4, PDF p. 6, §4, equation (9): additivity implies a product optimal output
Read-back

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

Let H,KH,KH,K be complete complex inner product spaces with their normed additive group structures, and let d,e>0d,e>0d,e>0 be natural numbers. Let T∗:Md(C)→L(H)T^*:M_d(\mathbb C)\to\mathcal L(H)T∗:Md​(C)→L(H) and S∗:Me(C)→L(K)S^*:M_e(\mathbb C)\to\mathcal L(K)S∗:Me​(C)→L(K) be complex linear and unital, each satisfying ∑a,b⟨ua,T∗(Xab)ub⟩≥0\sum_{a,b}\langle u_a,T^*(X_{ab})u_b\rangle\ge0∑a,b​⟨ua​,T∗(Xab​)ub​⟩≥0, or its S∗S^*S∗ counterpart, for every finite positive semidefinite block matrix XXX and every corresponding family of vectors. Define

QT(v)ij=⟨v,T∗(Ej,i)v⟩,QS(w)kl=⟨w,S∗(El,k)w⟩,Q_T(v)_{ij}=\langle v,T^*(E_{j,i})v\rangle,\qquad Q_S(w)_{kl}=\langle w,S^*(E_{l,k})w\rangle,QT​(v)ij​=⟨v,T∗(Ej,i​)v⟩,QS​(w)kl​=⟨w,S∗(El,k​)w⟩,

and, on the completion of H⊗CKH\otimes_{\mathbb C}KH⊗C​K, define

QT,S(z)(i,k),(j,l)=⟨z,T∗(Ej,i)⊗S∗(El,k)^ z⟩,Q_{T,S}(z)_{(i,k),(j,l)} =\left\langle z,\widehat{T^*(E_{j,i})\otimes S^*(E_{l,k})}\,z\right\rangle,QT,S​(z)(i,k),(j,l)​=⟨z,T∗(Ej,i​)⊗S∗(El,k​)​z⟩,

where the hat denotes continuous extension to the completion. For any of these output functions QQQ, a signal ensemble consists of finitely many unit vectors vjv_jvj​ with nonnegative real weights pjp_jpj​ summing to 111; its average output is Q‾g=∑jpjQ(vj)\overline Q_g=\sum_jp_jQ(v_j)Q​g​=∑j​pj​Q(vj​), its value is χQ(g)=S(Q‾g)−∑jpjS(Q(vj))\chi_Q(g)=S(\overline Q_g)-\sum_jp_jS(Q(v_j))χQ​(g)=S(Q​g​)−∑j​pj​S(Q(vj​)), and its capacity CQC_QCQ​ is the real supremum of these values, with S(X)=−Re⁡tr⁡(x↦xlog⁡2x)(X)S(X)=-\operatorname{Re}\operatorname{tr}(x\mapsto x\log_2x)(X)S(X)=−Retr(x↦xlog2​x)(X) defined by continuous functional calculus. Assume CQT,S=CQT+CQSC_{Q_{T,S}}=C_{Q_T}+C_{Q_S}CQT,S​​=CQT​​+CQS​​. For every ensemble aaa on HHH, ensemble bbb on KKK, and ensemble ccc on the completed tensor product satisfying χQT(a)=CQT\chi_{Q_T}(a)=C_{Q_T}χQT​​(a)=CQT​​, χQS(b)=CQS\chi_{Q_S}(b)=C_{Q_S}χQS​​(b)=CQS​​, and χQT,S(c)=CQT,S\chi_{Q_{T,S}}(c)=C_{Q_{T,S}}χQT,S​​(c)=CQT,S​​, the theorem asserts

Q‾c=Q‾a⊗Q‾b.\overline Q_c=\overline Q_a\otimes\overline Q_b.Q​c​=Q​a​⊗Q​b​.

Zero ensemble weights are permitted; the existence of these ensembles requires unit vectors in their respective spaces.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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