Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Sections 7.1–7.3: Holevo bound is attainable iff active states commute

Open
QAlgorithms.Papers.Independent.Intakethird100.P51.holevoAttainment

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Fix a finite ensemble E={πj,ρj}\mathcal E=\{\pi_j,\rho_j\}E={πj​,ρj​} of normalized PSD states with nonnegative weights summing to one. Its Holevo quantity is χ(E)\chi(\mathcal E)χ(E) and I(E,M)I(\mathcal E,\mathcal M)I(E,M) is the classical information extracted by a POVM. Then

∃ M: I(E,M)=χ(E)  ⟺  [ρj,ρk]=0 for all πj,πk>0.\exists\,\mathcal M:\ I(\mathcal E,\mathcal M)=\chi(\mathcal E)\iff[\rho_j,\rho_k]=0\ \text{for all }\pi_j,\pi_k>0.∃M: I(E,M)=χ(E)⟺[ρj​,ρk​]=0 for all πj​,πk​>0.

When the active states commute, a unitary simultaneous diagonalization gives a rank-one spectral projective measurement attaining equality. This is an existence and witness assertion, allowing singular states; it does not require every attaining POVM to be projective.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P51
Formal statement
noncomputable section

open scoped Matrix ComplexOrder ComplexConjugate Matrix.Norms.L2Operator

open MeasureTheory

namespace QAlgorithms.Papers.Independent.Intakethird100.P51

attribute [local instance] Classical.propDecidable Classical.decEq

-- Exact interfaces from the frozen accepted library; no local redeclarations.

open QAlgorithms.Papers.Independent.Information100.P63 (Mat)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy holevo IsLaw)

open QAlgorithms.Papers.Independent.Information100.P27 (average)

open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy marginalAB channelAdjoint)

open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)

open QAlgorithms.Papers.Independent.Gap48.P19 (shannonNats)

open QAlgorithms.Papers.Independent.Gap48.P33 (measurementInformation)

section Statements

variable {A B C D J K O : Type}

variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype J] [Fintype K] [Fintype O]

variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D]

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

/-- Sections 7.1–7.3, PDF pp.17–20: existence of an attaining POVM iff active
states commute, and a simultaneous spectral projective witness in that case. -/
theorem holevoAttainment [Nonempty A] [Nonempty J] (w : J → ℝ) (hw : IsLaw w)
    (rho : J → Mat A) (hr : ∀ j, IsDensityMatrix (rho j)) :
    let commuting := ∀ j k, 0 < w j → 0 < w k → rho j * rho k = rho k * rho j
    ((∃ m : ℕ, 0 < m ∧ ∃ E : Fin m → Mat A, IsPOVM E ∧
      (Real.log 2 * measurementInformation w rho E) = holevo w rho) ↔ commuting) ∧
    (commuting → ∃ U : Mat A, Uᴴ * U = 1 ∧ U * Uᴴ = 1 ∧
      (∀ j, 0 < w j → ∀ a b, a ≠ b → (Uᴴ * rho j * U) a b = 0) ∧
      IsPOVM (basisPVM U) ∧
      (∀ a b, basisPVM U a * basisPVM U b = if a = b then basisPVM U a else 0) ∧
      (Real.log 2 * measurementInformation w rho (basisPVM U)) = holevo w rho) := by sorry

end Statements

end QAlgorithms.Papers.Independent.Intakethird100.P51

end
Source
Inequalities for Quantum Entropy: A Review with Conditions for Equality, arXiv:quant-ph/0205064v2, PDF p. 17, Sections 7.1–7.3: Holevo bound is attainable iff active states commute
Read-back

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

For finite nonempty index types A,JA,JA,J, with decidable equality as required for matrix operations, let wj≥0w_j\ge0wj​≥0, ∑jwj=1\sum_jw_j=1∑j​wj​=1, and let every ρj\rho_jρj​ be positive semidefinite with trace one. Define ρˉ=∑jwjρj\bar\rho=\sum_jw_j\rho_jρˉ​=∑j​wj​ρj​, S(X)=−Re⁡tr⁡[f(X)]S(X)=-\operatorname{Re}\operatorname{tr}[f(X)]S(X)=−Retr[f(X)] with f(x)=xln⁡xf(x)=x\ln xf(x)=xlnx applied by continuous functional calculus, and χ=S(ρˉ)−∑jwjS(ρj)\chi=S(\bar\rho)-\sum_jw_jS(\rho_j)χ=S(ρˉ​)−∑j​wj​S(ρj​). For a finite measurement EEE, define pb∣j=Re⁡tr⁡(Ebρj)p_{b|j}=\operatorname{Re}\operatorname{tr}(E_b\rho_j)pb∣j​=Retr(Eb​ρj​) and

I(w,ρ,E)=H2 ⁣((∑jwjpb∣j)b)−∑jwjH2((pb∣j)b),H2(p)=−∑bpblog⁡2pb.I(w,\rho,E)=H_2\!\left(\left(\sum_jw_jp_{b|j}\right)_b\right) -\sum_jw_jH_2((p_{b|j})_b),\qquad H_2(p)=-\sum_bp_b\log_2p_b.I(w,ρ,E)=H2​​(j∑​wj​pb∣j​)b​​−j∑​wj​H2​((pb∣j​)b​),H2​(p)=−b∑​pb​log2​pb​.

Then there exist a natural number m>0m>0m>0 and positive semidefinite effects E0,…,Em−1E_0,\ldots,E_{m-1}E0​,…,Em−1​ summing to IAI_AIA​, with (ln⁡2)I(w,ρ,E)=χ(\ln2)I(w,\rho,E)=\chi(ln2)I(w,ρ,E)=χ, if and only if ρjρk=ρkρj\rho_j\rho_k=\rho_k\rho_jρj​ρk​=ρk​ρj​ whenever wj>0w_j>0wj​>0 and wk>0w_k>0wk​>0. Moreover, if this commutation condition holds, there exists a matrix UUU on AAA with U†U=UU†=IAU^\dagger U=UU^\dagger=I_AU†U=UU†=IA​ such that every U†ρjUU^\dagger\rho_jUU†ρj​U with wj>0w_j>0wj​>0 has zero off-diagonal entries; the matrices PaP_aPa​, defined by (Pa)ij=UiaUja‾(P_a)_{ij}=U_{ia}\overline{U_{ja}}(Pa​)ij​=Uia​Uja​​, are positive semidefinite, sum to IAI_AIA​, satisfy PaPb=PaP_aP_b=P_aPa​Pb​=Pa​ when a=ba=ba=b and PaPb=0P_aP_b=0Pa​Pb​=0 otherwise, and obey (ln⁡2)I(w,ρ,P)=χ(\ln2)I(w,\rho,P)=\chi(ln2)I(w,ρ,P)=χ. Zero weights are permitted, and no commutation or diagonalization condition is imposed on their corresponding states; logarithmic expressions use value zero at zero.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me