Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Holevo difference is independent of the pure decomposition

Open
QAlgorithms.Papers.Independent.Gap48.P43.pureDecomposition_holevoDifference_independent

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

prove2quantum

Fix a unitary interaction of a quantum register QQQ with one complete environment EEE in a normalized pure initial state. Let A={pk,ρk}\mathcal A=\{p_k,\rho_k\}A={pk​,ρk​} and B={ql,σl}\mathcal B=\{q_l,\sigma_l\}B={ql​,σl​} be finite or countable probability ensembles of normalized input states, pure whenever their probability is nonzero. Their computed average inputs are equal:

∑kpkρk=∑lqlσl.\sum_kp_k\rho_k=\sum_lq_l\sigma_l.k∑​pk​ρk​=l∑​ql​σl​.

For each ensemble C\mathcal CC and each output H∈{B,E}H\in\{B,E\}H∈{B,E}, compute the conditional and average output states from that fixed interaction and put χH(C)=S(ρˉH′)−∑jrjS(ρH,j′)\chi_H(\mathcal C)=S(\bar\rho'_H)-\sum_j r_jS(\rho'_{H,j})χH​(C)=S(ρˉ​H′​)−∑j​rj​S(ρH,j′​), with entropies in bits. Assume the average output entropies and the weighted conditional entropy sums appearing in these differences are finite. Then

χB(A)−χE(A)=χB(B)−χE(B).\chi_B(\mathcal A)-\chi_E(\mathcal A) =\chi_B(\mathcal B)-\chi_E(\mathcal B).χB​(A)−χE​(A)=χB​(B)−χE​(B).

Thus the difference depends only on the average density operator. The assertion permits different alphabets and probabilities, repeated and nonorthogonal signals, and channels for which one or both individual Holevo quantities are constant.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P43
Formal statement
noncomputable section

open MeasureTheory

open scoped ENNReal BigOperators

namespace QAlgorithms.Papers.Independent.Gap48.P43

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State PureState productCoeff)

open QAlgorithms.Papers.Independent.Frontier18.P01
  (CountableStateEnsemble boundedConjugation traceSecond traceFirst)

open QAlgorithms.Papers.Independent.Frontier18.P18
  (boundedOperator operatorCoeff)

open QAlgorithms.Papers.Independent.Claimed50.P35 (spectralEntropyBits)

open QAlgorithms.Papers.Independent.Frontier30.P10 (HilbertPOVM)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Schumacher--Westmoreland, quant-ph/9709058v2, PDF p.5, paragraph after (12).
Two pure discrete decompositions with the same computed average have the same
Holevo difference. No nonconstant dependence of either individual chi is asserted. -/
theorem pureDecomposition_holevoDifference_independent {Q E : Type}
    (d : PureDilation Q E) (a b : CountableStateEnsemble Q)
    (ha : ActivePure a) (hb : ActivePure b)
    (haverage : averageInput a = averageInput b)
    (haBob : FiniteOutputEntropies a (bobOutput d))
    (haEve : FiniteOutputEntropies a (eveOutput d))
    (hbBob : FiniteOutputEntropies b (bobOutput d))
    (hbEve : FiniteOutputEntropies b (eveOutput d)) :
    holevoBits a (bobOutput d) - holevoBits a (eveOutput d) =
      holevoBits b (bobOutput d) - holevoBits b (eveOutput d) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P43

end
Source
Quantum privacy and quantum coherence, arXiv:quant-ph/9709058v2, PDF p. 5, Unnumbered result after (12): pure-decomposition independence
Read-back

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

Let Q,EQ,EQ,E be arbitrary types and HI=ℓ2(I;C)H_I=\ell^2(I;\mathbb C)HI​=ℓ2(I;C). A state on III means a matrix RRR admitting Rij=∑nun(i)vn(j)‾R_{ij}=\sum_n u_n(i)\overline{v_n(j)}Rij​=∑n​un​(i)vn​(j)​ with un,vn∈HIu_n,v_n\in H_Iun​,vn​∈HI​ and summable ∥un∥∥vn∥\|u_n\|\|v_n\|∥un​∥∥vn​∥, having real nonnegative quadratic forms ∑i,j∈szi‾Rijzj\sum_{i,j\in s}\overline{z_i}R_{ij}z_j∑i,j∈s​zi​​Rij​zj​ for every finite s⊆Is\subseteq Is⊆I and every z:I→Cz:I\to\mathbb Cz:I→C, and having a summable real diagonal with sum 111. Fix ddd consisting of a state τ\tauτ on EEE, expressible as τef=wewf‾\tau_{ef}=w_e\overline{w_f}τef​=we​wf​​ for a unit vector w∈HEw\in H_Ew∈HE​, and a surjective complex linear isometry U:HQ×E→HQ×EU:H_{Q\times E}\to H_{Q\times E}U:HQ×E​→HQ×E​. With Upi=(Uei)pU_{pi}=(Ue_i)_pUpi​=(Uei​)p​, define

Cd(R)pq=∑i:Q×E∑j:Q×EUpiRi1j1τi2j2Uqj‾,Bd(R)qq′=∑eCd(R)(q,e),(q′,e),Ed(R)ee′=∑qCd(R)(q,e),(q,e′).C_d(R)_{pq}=\sum_{i:Q\times E}\sum_{j:Q\times E} U_{pi}R_{i_1j_1}\tau_{i_2j_2}\overline{U_{qj}}, \qquad B_d(R)_{qq'}=\sum_e C_d(R)_{(q,e),(q',e)}, \qquad E_d(R)_{ee'}=\sum_q C_d(R)_{(q,e),(q,e')}.Cd​(R)pq​=i:Q×E∑​j:Q×E∑​Upi​Ri1​j1​​τi2​j2​​Uqj​​,Bd​(R)qq′​=e∑​Cd​(R)(q,e),(q′,e)​,Ed​(R)ee′​=q∑​Cd​(R)(q,e),(q,e′)​.

Let a=(pn,Rn)n∈Na=(p_n,R_n)_{n\in\mathbb N}a=(pn​,Rn​)n∈N​ and b=(qn,Tn)n∈Nb=(q_n,T_n)_{n\in\mathbb N}b=(qn​,Tn​)n∈N​ be ensembles of states on QQQ, with extended nonnegative weights satisfying ∑npn=∑nqn=1\sum_n p_n=\sum_n q_n=1∑n​pn​=∑n​qn​=1. Assume every RnR_nRn​ with pn≠0p_n\ne0pn​=0, and every TnT_nTn​ with qn≠0q_n\ne0qn​=0, has coefficients vivj‾v_i\overline{v_j}vi​vj​​ for some unit vector v∈HQv\in H_Qv∈HQ​; zero-weight states have no additional purity requirement. Define (Rˉa)ij=∑npnr(Rn)ij(\bar R_a)_{ij}=\sum_n p_n^{\mathrm r}(R_n)_{ij}(Rˉa​)ij​=∑n​pnr​(Rn​)ij​ and (Rˉb)ij=∑nqnr(Tn)ij(\bar R_b)_{ij}=\sum_n q_n^{\mathrm r}(T_n)_{ij}(Rˉb​)ij​=∑n​qnr​(Tn​)ij​, where xrx^{\mathrm r}xr converts extended nonnegative reals to reals, sending +∞+\infty+∞ to 000, and assume the matrices Rˉa\bar R_aRˉa​ and Rˉb\bar R_bRˉb​ are equal. For any matrix YYY on III, choose a bounded complex linear operator Y^\widehat YY with coefficients YYY when one exists, and otherwise use zero, and define

S(Y)=∑i:I[Re⁡(f(Y^)ei)i]+[log⁡2]+,f(z)=−Re⁡(z)log⁡(Re⁡(z)),S(Y)= \frac{\displaystyle\sum_{i:I} \left[\operatorname{Re}\bigl(f(\widehat Y)e_i\bigr)_i\right]_+} {[\log 2]_+}, \qquad f(z)=-\operatorname{Re}(z)\log(\operatorname{Re}(z)),S(Y)=[log2]+​i:I∑​[Re(f(Y)ei​)i​]+​​,f(z)=−Re(z)log(Re(z)),

using the complex continuous functional calculus and extended nonnegative clipping [r]+=max⁡(r,0)[r]_+=\max(r,0)[r]+​=max(r,0). Set

χa(F)=S(F(Rˉa))r−(∑npnS(F(Rn)))r,χb(F)=S(F(Rˉb))r−(∑nqnS(F(Tn)))r.\chi_a(F)=S(F(\bar R_a))^{\mathrm r} -\left(\sum_n p_nS(F(R_n))\right)^{\mathrm r}, \qquad \chi_b(F)=S(F(\bar R_b))^{\mathrm r} -\left(\sum_n q_nS(F(T_n))\right)^{\mathrm r}.χa​(F)=S(F(Rˉa​))r−(n∑​pn​S(F(Rn​)))r,χb​(F)=S(F(Rˉb​))r−(n∑​qn​S(F(Tn​)))r.

Assume all four finiteness conditions: for each ensemble c∈{a,b}c\in\{a,b\}c∈{a,b} and each output map F∈{Bd,Ed}F\in\{B_d,E_d\}F∈{Bd​,Ed​}, its average-output entropy S(F(Rˉc))S(F(\bar R_c))S(F(Rˉc​)) and its weighted sum of individual output entropies are both strictly below +∞+\infty+∞. Then

χa(Bd)−χa(Ed)=χb(Bd)−χb(Ed).\chi_a(B_d)-\chi_a(E_d) =\chi_b(B_d)-\chi_b(E_d).χa​(Bd​)−χa​(Ed​)=χb​(Bd​)−χb​(Ed​).

No matching of the individual states or weights of the two ensembles is required, and no countability or finite-dimensionality assumptions are imposed on Q,EQ,EQ,E. Real and complex infinite sums are totalized to zero when nonsummable.

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