Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(7), p. 3 — for 1 ≤ p ≤ 2 the minimal p-Rényi output entropy of ⊗ⱼ Γ_{dⱼ} is the sum of the single-channel values

Proved
WHAdditivity.Renyi.meo_additive

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

additivityminimal-output-entropyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1renyi-entropywerner-holevo

Let N∈NN\in\mathbb NN∈N and d1,…,dN≥2d_1,\dots,d_N\ge2d1​,…,dN​≥2. For each jjj let Γdj\Gamma_{d_j}Γdj​​ be the Werner–Holevo channel Γd(X)=1d−1(Tr⁡(X) 1−XT)\Gamma_{d}(X) = \frac{1}{d-1}\bigl(\operatorname{Tr}(X)\,\mathbb 1 - X^{\mathsf T}\bigr)Γd​(X)=d−11​(Tr(X)1−XT) on dj×djd_j\times d_jdj​×dj​ matrices, and let ⨂j=1NΓdj\bigotimes_{j=1}^N\Gamma_{d_j}⨂j=1N​Γdj​​ be their tensor product, a linear map on matrices of ⨂j=1NCdj\bigotimes_{j=1}^N\mathbb C^{d_j}⨂j=1N​Cdj​. For p≥1p\ge1p≥1 let Sp(ρ)=−1p−1log⁡Tr⁡ρpS_p(\rho) = -\frac{1}{p-1}\log\operatorname{Tr}\rho^pSp​(ρ)=−p−11​logTrρp (p>1p>1p>1) and S1=SS_1 = SS1​=S the von Neumann entropy, with the natural logarithm, and let

MEOp[Φ]=inf⁡φ, ∥φ∥=1Sp(Φ(∣φ⟩⟨φ∣))\mathrm{MEO}_p[\Phi] = \inf_{\varphi,\ \|\varphi\|=1}S_p\bigl(\Phi(|\varphi\rangle\langle\varphi|)\bigr)MEOp​[Φ]=φ, ∥φ∥=1inf​Sp​(Φ(∣φ⟩⟨φ∣))

be the minimal ppp-Rényi output entropy (1), the infimum over all unit input vectors — for the product channel, over all unit vectors of ⨂jCdj\bigotimes_j\mathbb C^{d_j}⨂j​Cdj​, entangled ones included.

Then for every 1≤p≤21\le p\le21≤p≤2 the sets of output entropies of ⨂jΓdj\bigotimes_j\Gamma_{d_j}⨂j​Γdj​​ and of each Γdj\Gamma_{d_j}Γdj​​ are bounded below, and

MEOp[⨂j=1NΓdj]=∑j=1NMEOp[Γdj].\mathrm{MEO}_p\Bigl[\bigotimes_{j=1}^N\Gamma_{d_j}\Bigr] = \sum_{j=1}^N\mathrm{MEO}_p\bigl[\Gamma_{d_j}\bigr].MEOp​[j=1⨂N​Γdj​​]=j=1∑N​MEOp​[Γdj​​].

This is the multiple additivity of the minimal output entropy of the Werner–Holevo channels, for arbitrary numbers of factors and arbitrary, possibly different, dimensions: entangled inputs cannot lower the output entropy below what product inputs achieve.

Formalization Note. ⨂jΓdj\bigotimes_j\Gamma_{d_j}⨂j​Γdj​​ is the generic matrix-unit tensor product of the definitions file applied to the family Γdj\Gamma_{d_j}Γdj​​; it is not defined through its value on pure states. MEOp\mathrm{MEO}_pMEOp​ is a real sInf, which is why bounded-belowness is part of the conclusion.

Differences from the source:

  • encoding: Γ_{d_j} with 1/(d_j − 1) → hypotheses 2 ≤ d_j; reason: (6) is undefined at d_j = 1; Lean's 0⁻¹ = 0 would make it the zero map.
  • encoding: Γ_d(ρ) = (1/(d−1))(𝟙 − ρᵀ) on density matrices, and ⊗j Γ{d_j} → the linear extension (Tr X · 𝟙 − Xᵀ)/(d − 1), tensored through matrix units; reason: the product channel acts on entangled inputs, which needs Γ_d as a linear map; it agrees with (6) on density matrices.
  • encoding: MEO_p at p = 1 defined as the limit p ↓ 1 → S_1 := S, the von Neumann entropy; reason: the paper extends the notation to p = 1 by this limit, whose value is the von Neumann MEO.
  • encoding: MEO_p as an infimum → real sInf, with bounded-belowness of each set concluded; reason: Lean's sInf of a set unbounded below is 0; concluding the bound excludes the junk case.
  • encoding: log unspecified → natural logarithm; reason: both sides scale by the same factor under a change of base.
  • encoding: sites 1, …, N → sites Fin N from 0; reason: relabelling only.
  • generalization: N ≥ 1 implicitly → every N ∈ ℕ; reason: at N = 0 both sides are 0 (one-dimensional output, empty sum); specializes to the paper's N ≥ 1.
Preamble
import Mathlib
import Definitions.Def_WHAdditivity_Renyi_Model
Formal statement
namespace WHAdditivity.Renyi

theorem meo_additive (N : ℕ) (d : Fin N → ℕ) (hd : ∀ j, 2 ≤ d j) (p : ℝ) (hp1 : 1 ≤ p)
    (hp2 : p ≤ 2) :
    BddBelow (outputEntropies p (tensorChannel d fun j => wernerHolevo (d j))) ∧
    (∀ j, BddBelow (outputEntropies p (wernerHolevo (d j)))) ∧
    minOutputEntropy p (tensorChannel d fun j => wernerHolevo (d j)) =
      ∑ j, minOutputEntropy p (wernerHolevo (d j)) := by sorry

end WHAdditivity.Renyi
Source
Alicki, Fannes, Note on multiple additivity of minimal Renyi entropy output of the Werner–Holevo channels, arXiv:quant-ph/0407033v2, p. 3, (7)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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