Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7: strong purity and Holevo additivity for general Hadamard channels

Open
QAlgorithms.Papers.Independent.Gap48.P36.hadamard_strong_additivity

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

prove2quantum

All Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. Write νp(Φ)=sup⁡ρ∥Φ(ρ)∥p\nu_p(\Phi)=\sup_\rho\|\Phi(\rho)\|_pνp​(Φ)=supρ​∥Φ(ρ)∥p​ and Smin⁡(Φ)=inf⁡ρS(Φ(ρ))S_{\min}(\Phi)=\inf_\rho S(\Phi(\rho))Smin​(Φ)=infρ​S(Φ(ρ)), with density inputs, Schatten norm, and von Neumann entropy. Let Φ1\Phi_1Φ1​ have normalized Kraus operators Rm=∑jcjm∣ej⟩⟨wj∣R_m=\sum_j c_{jm}|e_j\rangle\langle w_j|Rm​=∑j​cjm​∣ej​⟩⟨wj​∣, where the eje_jej​ are an orthonormal output basis and the wjw_jwj​ are independent of mmm. For every channel Φ2\Phi_2Φ2​,

νp(Φ1⊗Φ2)=νp(Φ1)νp(Φ2)(p≥1),Smin⁡(Φ1⊗Φ2)=Smin⁡(Φ1)+Smin⁡(Φ2),CHolv(Φ1⊗Φ2)=CHolv(Φ1)+CHolv(Φ2).\begin{gathered}\nu_p(\Phi_1\otimes\Phi_2)=\nu_p(\Phi_1)\nu_p(\Phi_2)\quad(p\ge1),\\ S_{\min}(\Phi_1\otimes\Phi_2)=S_{\min}(\Phi_1)+S_{\min}(\Phi_2),\\C_{\mathrm{Holv}}(\Phi_1\otimes\Phi_2)=C_{\mathrm{Holv}}(\Phi_1)+C_{\mathrm{Holv}}(\Phi_2).\end{gathered}νp​(Φ1​⊗Φ2​)=νp​(Φ1​)νp​(Φ2​)(p≥1),Smin​(Φ1​⊗Φ2​)=Smin​(Φ1​)+Smin​(Φ2​),CHolv​(Φ1​⊗Φ2​)=CHolv​(Φ1​)+CHolv​(Φ2​).​

Here CHolvC_{\mathrm{Holv}}CHolv​ is the supremum of the single-use Holevo quantity over finite input ensembles. The wjw_jwj​ need not be orthogonal, and the output dimension may exceed the input dimension.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P36
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P36

open scoped BigOperators Matrix Kronecker ComplexConjugate ComplexOrder ENNReal

open QAlgorithms.Papers.Independent.Claimed50.P48

open QAlgorithms.Papers.Independent.Information100.P67 (receiverChannel complementaryChannel)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy normalizedChoi)

open QAlgorithms.Papers.Independent.Information100.P50 (schattenNorm)

open QAlgorithms.Papers.Independent.Information100.P03 (convexRoof)

open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C D E K L A2 B2 C2 : Type*}

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

variable [Fintype E] [DecidableEq E] [Fintype K] [DecidableEq K]

variable [Fintype L] [DecidableEq L] [Fintype A2] [DecidableEq A2]

variable [Fintype B2] [DecidableEq B2] [Fintype C2] [DecidableEq C2]

/-- Theorem 7, PDF pp.11–13: arbitrary common-vector Kraus maps, with all three conclusions.
The partner and finite exponent are unrestricted in the source's domains. -/
theorem hadamard_strong_additivity [Nonempty A] [Nonempty B] [Nonempty K] [Nonempty A2] [Nonempty B2]
    (v : Matrix K B ℂ) (w : K → EuclideanSpace ℂ A)
    (hF : IsKrausFamily (gramKraus v w)) (Psi : Superop A2 B2) (hPsi : IsChannel Psi) :
    (∀ p : ℝ, 1 ≤ p → Multiplicative (ENNReal.ofReal p) (krausApply (gramKraus v w)) Psi) ∧
    Additive (krausApply (gramKraus v w)) Psi ∧
    holevoCapacity (superopTensor (krausApply (gramKraus v w)) Psi) =
      holevoCapacity (krausApply (gramKraus v w)) + holevoCapacity Psi := by sorry

end QAlgorithms.Papers.Independent.Gap48.P36

end
Source
Properties of Conjugate Channels with Applications to Additivity and Multiplicativity, arXiv:quant-ph/0509126v3, PDF p. 12, Theorem 7: strong purity and Holevo additivity for general Hadamard channels
Read-back

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

Let A,B,K,A2,B2A,B,K,A_2,B_2A,B,K,A2​,B2​ be finite nonempty types with decidable equality, let vvv be a complex matrix with rows indexed by KKK and columns indexed by BBB, and let wk∈CAw_k\in\mathbb C^Awk​∈CA be arbitrary vectors. Define matrices EjE_jEj​ from CA\mathbb C^ACA to CK\mathbb C^KCK, indexed by j∈Bj\in Bj∈B, by (Ej)ki=vkjwk(i)‾(E_j)_{ki}=v_{kj}\overline{w_k(i)}(Ej​)ki​=vkj​wk​(i)​, and assume ∑j∈BEj†Ej=IA\sum_{j\in B}E_j^\dagger E_j=I_A∑j∈B​Ej†​Ej​=IA​. Set F(X)=∑j∈BEjXEj†F(X)=\sum_{j\in B}E_jXE_j^\daggerF(X)=∑j∈B​Ej​XEj†​, and let Ψ\PsiΨ be any channel from matrices on A2A_2A2​ to matrices on B2B_2B2​, meaning it has a finite Kraus representation with the same normalization condition. Then

∀p∈[1,∞),νp(F⊗Ψ)=νp(F)νp(Ψ),hmin⁡(F⊗Ψ)=hmin⁡(F)+hmin⁡(Ψ),\forall p\in[1,\infty),\quad \nu_p(F\otimes\Psi)=\nu_p(F)\nu_p(\Psi), \qquad h_{\min}(F\otimes\Psi)=h_{\min}(F)+h_{\min}(\Psi),∀p∈[1,∞),νp​(F⊗Ψ)=νp​(F)νp​(Ψ),hmin​(F⊗Ψ)=hmin​(F)+hmin​(Ψ),

and

χ(F⊗Ψ)=χ(F)+χ(Ψ).\chi(F\otimes\Psi)=\chi(F)+\chi(\Psi).χ(F⊗Ψ)=χ(F)+χ(Ψ).

Here νp(G)=sup⁡ρ≥0,tr⁡ρ=1∥G(ρ)∥p\nu_p(G)=\sup_{\rho\ge0,\operatorname{tr}\rho=1}\|G(\rho)\|_pνp​(G)=supρ≥0,trρ=1​∥G(ρ)∥p​, with ∥Y∥p=(Re⁡tr⁡((Y†Y)p/2))1/p\|Y\|_p=(\operatorname{Re}\operatorname{tr}((Y^\dagger Y)^{p/2}))^{1/p}∥Y∥p​=(Retr((Y†Y)p/2))1/p; hmin⁡(G)h_{\min}(G)hmin​(G) is the infimum of −Re⁡tr⁡(G(ρ)log⁡G(ρ))-\operatorname{Re}\operatorname{tr}(G(\rho)\log G(\rho))−Retr(G(ρ)logG(ρ)) over density matrices, using natural logarithms; and χ(G)\chi(G)χ(G) is the supremum, over all finite ensembles of density matrices ρj\rho_jρj​ with nonnegative real weights qjq_jqj​ summing to 111, of S(G(∑jqjρj))−∑jqjS(G(ρj))S(G(\sum_jq_j\rho_j))-\sum_jq_jS(G(\rho_j))S(G(∑j​qj​ρj​))−∑j​qj​S(G(ρj​)), where S(Y)=−Re⁡tr⁡(Ylog⁡2Y)S(Y)=-\operatorname{Re}\operatorname{tr}(Y\log_2Y)S(Y)=−Retr(Ylog2​Y). All matrix functions use continuous functional calculus, and (G⊗H)(X)=∑a,b,c,dX(a,b),(c,d)G(Eac)⊗H(Ebd)(G\otimes H)(X)=\sum_{a,b,c,d}X_{(a,b),(c,d)}G(E_{ac})\otimes H(E_{bd})(G⊗H)(X)=∑a,b,c,d​X(a,b),(c,d)​G(Eac​)⊗H(Ebd​).

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