Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3: Holevo information of direct-sum mixtures

Proved
QAlgorithms.Papers.Independent.Gap48.P46.direct_sum_information

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

prove2quantum

All quantum systems are nonzero finite-dimensional complex Hilbert spaces. States are positive semidefinite trace-one matrices, and channels are CPTP maps on the full matrix algebra. All entropies and logarithms are in bits. An ensemble is a finite probability distribution of states, with zero weights permitted. For a channel Φ\PhiΦ, write χΦ(ρ)\chi_\Phi(\rho)χΦ​(ρ) for the maximum ensemble Holevo information at mean ρ\rhoρ, H^Φ(ρ)\widehat H_\Phi(\rho)HΦ​(ρ) for the minimum average output entropy at that mean, and C‾(Φ;A)\overline C(\Phi;\mathcal A)C(Φ;A) for the maximum of χΦ\chi_\PhiχΦ​ over a nonempty closed mean constraint A\mathcal AA.

Let {Φj}j∈T\{\Phi_j\}_{j\in T}{Φj​}j∈T​ be a nonempty finite family of channels with a common input and possibly different output spaces, and let qj≥0q_j\ge0qj​≥0 with ∑jqj=1\sum_jq_j=1∑j​qj​=1. Put Φ(X)=⨁jqjΦj(X)\Phi(X)=\bigoplus_jq_j\Phi_j(X)Φ(X)=⨁j​qj​Φj​(X). For every fixed input ensemble eee,

χΦ(e)=∑j∈TqjχΦj(e).\chi_\Phi(e)=\sum_{j\in T}q_j\chi_{\Phi_j}(e).χΦ​(e)=j∈T∑​qj​χΦj​​(e).

Here each ensemble chi is its output-mean entropy minus its average output entropy. This is an ensemble identity, allowing qj=0q_j=0qj​=0, rather than an identity between independently optimized ensembles.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P46
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P46

open scoped Matrix ComplexConjugate ENNReal ComplexOrder

open Filter

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)

open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntropyBits)

open QAlgorithms.Papers.Independent.Dependency50.P23 (IsEB)

open QAlgorithms.Papers.Independent.Information100.P08
  (Ensemble ensembleAverage outputHolevo mixedRoof)

variable {I O J K : Type} [Fintype I] [Fintype O] [Fintype J] [Fintype K]

variable [DecidableEq I] [DecidableEq O] [DecidableEq J] [DecidableEq K]

/-- PDF p.8, Lemma 3: identity for a fixed ensemble, without separate branch
optimization. Branch output spaces may differ and weights may vanish. -/
theorem direct_sum_information [Nonempty I] {T : Type} [Fintype T] [DecidableEq T]
    [Nonempty T] {B : T → Type} [∀ t, Fintype (B t)] [∀ t, DecidableEq (B t)]
    [∀ t, Nonempty (B t)] (q : T → ℝ) (hq : ∀ t, 0 ≤ q t) (hsum : ∑ t, q t = 1)
    (Phi : (t : T) → Superop I (B t)) (hPhi : ∀ t, IsChannel (Phi t)) (e : Ensemble I) :
    outputHolevo (flaggedChannelSum q Phi) e = ∑ t, q t * outputHolevo (Phi t) e := by sorry

end QAlgorithms.Papers.Independent.Gap48.P46

end
Source
On Shor's channel extension and constrained channels, arXiv:quant-ph/0306196v2, PDF p. 8, Lemma 3: Holevo information of direct-sum mixtures
Read-back

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

Let I,TI,TI,T be finite nonempty types with decidable equality, and for each t∈Tt\in Tt∈T, let BtB_tBt​ be a finite nonempty type with decidable equality. Let qt≥0q_t\ge0qt​≥0 be real numbers with ∑tqt=1\sum_tq_t=1∑t​qt​=1, and let Φt\Phi_tΦt​ be channels from matrices on III to matrices on BtB_tBt​, each admitting a finite Kraus representation with Kraus adjoint-products summing to the identity. Define a map Λ\LambdaΛ to matrices on the disjoint union ⨆tBt\bigsqcup_tB_t⨆t​Bt​ by

Λ(X)(t,b),(u,c)={qt Φt(X)b,c,t=u,0,t≠u.\Lambda(X)_{(t,b),(u,c)} =\begin{cases}q_t\,\Phi_t(X)_{b,c},&t=u,\\0,&t\ne u.\end{cases}Λ(X)(t,b),(u,c)​={qt​Φt​(X)b,c​,0,​t=u,t=u.​

For every finite ensemble e=(pi,ρi)e=(p_i,\rho_i)e=(pi​,ρi​) of density matrices on III, with pi≥0p_i\ge0pi​≥0, ∑ipi=1\sum_i p_i=1∑i​pi​=1, and ρˉ=∑ipiρi\bar\rho=\sum_i p_i\rho_iρˉ​=∑i​pi​ρi​, one has

H(Λ(ρˉ))−∑ipiH(Λ(ρi))=∑tqt[H(Φt(ρˉ))−∑ipiH(Φt(ρi))].H(\Lambda(\bar\rho))-\sum_i p_iH(\Lambda(\rho_i)) =\sum_tq_t\left[H(\Phi_t(\bar\rho))-\sum_i p_iH(\Phi_t(\rho_i))\right].H(Λ(ρˉ​))−i∑​pi​H(Λ(ρi​))=t∑​qt​[H(Φt​(ρˉ​))−i∑​pi​H(Φt​(ρi​))].

Here a density matrix is positive semidefinite with trace 111, and H(X)=−∑jλjlog⁡2λjH(X)=-\sum_j\lambda_j\log_2\lambda_jH(X)=−∑j​λj​log2​λj​, with zero terms equal to 000. Both the ensemble weights and the branch weights may vanish.

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