Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Equations (47)–(50): Holevo measurement bound

Open
QAlgorithms.Papers.Independent.Intakethird100.P51.holevoMeasurementBound

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

prove2quantum

Let E={πj,ρj}\mathcal E=\{\pi_j,\rho_j\}E={πj​,ρj​} be any finite ensemble of normalized PSD states, with nonnegative weights summing to one and average ρˉ=∑jπjρj\bar\rho=\sum_j\pi_j\rho_jρˉ​=∑j​πj​ρj​. For every finite POVM M={Eb}\mathcal M=\{E_b\}M={Eb​}, set pj(b)=Tr⁡(Ebρj)p_j(b)=\operatorname{Tr}(E_b\rho_j)pj​(b)=Tr(Eb​ρj​) and p(b)=Tr⁡(Ebρˉ)p(b)=\operatorname{Tr}(E_b\bar\rho)p(b)=Tr(Eb​ρˉ​). With Shannon entropy HShH_{\rm Sh}HSh​ in nats,

I(E,M):=HSh(p)−∑jπjHSh(pj)≤χ(E):=S(ρˉ)−∑jπjS(ρj)=∑j:πj>0πjH(ρj,ρˉ).I(\mathcal E,\mathcal M):=H_{\rm Sh}(p)-\sum_j\pi_jH_{\rm Sh}(p_j)\le\chi(\mathcal E):=S(\bar\rho)-\sum_j\pi_jS(\rho_j)=\sum_{j:\pi_j>0}\pi_jH(\rho_j,\bar\rho).I(E,M):=HSh​(p)−j∑​πj​HSh​(pj​)≤χ(E):=S(ρˉ​)−j∑​πj​S(ρj​)=j:πj​>0∑​πj​H(ρj​,ρˉ​).

Zero probabilities use the entropy convention 0log⁡0=00\log0=00log0=0. This is the pointwise Holevo measurement bound, including singular ensembles.

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]

/-- Equations (47)–(50), PDF pp.17–18: the Holevo bound for every POVM, together
with its relative-entropy expression; only active labels enter that expression. -/
theorem holevoMeasurementBound [Nonempty A] [Nonempty J] [Nonempty O] (w : J → ℝ) (hw : IsLaw w)
    (rho : J → Mat A) (hr : ∀ j, IsDensityMatrix (rho j)) (E : O → Mat A) (hE : IsPOVM E) :
    (Real.log 2 * measurementInformation w rho E) ≤ holevo w rho ∧
      holevo w rho = ∑ j, if 0 < w j then w j * (relativeEntropy (rho j) (average w rho)).toReal else 0 := 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, Equations (47)–(50): Holevo measurement bound
Read-back

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

For finite nonempty index types A,J,OA,J,OA,J,O, with decidable equality as required for the matrix definitions, let w:J→Rw:J\to\mathbb Rw:J→R satisfy wj≥0w_j\ge0wj​≥0 and ∑jwj=1\sum_jw_j=1∑j​wj​=1, let every ρj\rho_jρj​ be a positive semidefinite trace-one matrix on AAA, and let EoE_oEo​ be positive semidefinite matrices with ∑oEo=IA\sum_oE_o=I_A∑o​Eo​=IA​. Put ρˉ=∑jwjρj\bar\rho=\sum_jw_j\rho_jρˉ​=∑j​wj​ρj​, po∣j=Re⁡tr⁡(Eoρj)p_{o|j}=\operatorname{Re}\operatorname{tr}(E_o\rho_j)po∣j​=Retr(Eo​ρj​), po=∑jwjpo∣jp_o=\sum_jw_jp_{o|j}po​=∑j​wj​po∣j​, H2(p)=−∑opolog⁡2poH_2(p)=-\sum_op_o\log_2p_oH2​(p)=−∑o​po​log2​po​, and S(X)=−Re⁡tr⁡[f(X)]S(X)=-\operatorname{Re}\operatorname{tr}[f(X)]S(X)=−Retr[f(X)], where f(x)=xln⁡xf(x)=x\ln xf(x)=xlnx is applied by continuous functional calculus. Then

(ln⁡2)[H2((po)o)−∑jwjH2((po∣j)o)]≤S(ρˉ)−∑jwjS(ρj)=∑j∈Jwj>0wjDR(ρj∥ρˉ).(\ln2)\left[H_2((p_o)_o)-\sum_jw_jH_2((p_{o|j})_o)\right] \le S(\bar\rho)-\sum_jw_jS(\rho_j) =\sum_{\substack{j\in J\\w_j>0}}w_jD_{\mathbb R}(\rho_j\Vert\bar\rho).(ln2)[H2​((po​)o​)−j∑​wj​H2​((po∣j​)o​)]≤S(ρˉ​)−j∑​wj​S(ρj​)=j∈Jwj​>0​∑​wj​DR​(ρj​∥ρˉ​).

Here D(X∥Y)D(X\Vert Y)D(X∥Y) is Re⁡tr⁡[f(X)−Xlog⁡Y]\operatorname{Re}\operatorname{tr}[f(X)-X\log Y]Retr[f(X)−XlogY] if ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and +∞+\infty+∞ otherwise, and DRD_{\mathbb R}DR​ is its real conversion, sending +∞+\infty+∞ to zero. All logarithms use their total real definitions, including value zero at zero. Zero weights and zero measurement effects are allowed, and the displayed relative-entropy sum assigns zero to every term with wj=0w_j=0wj​=0.

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