Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 4, printed 3.2: measurement relative-entropy bound (14)

Open
QAlgorithms.Papers.Independent.Intakethird100.P84.measurementRelativeEntropyMonotonicity

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

prove2quantum

For finite nonzero input and outcome spaces, a POVM (Ej)(E_j)(Ej​), and arbitrary density matrices D1,D2D_1,D_2D1​,D2​, let μi(j)=Tr⁡(DiEj)\mu_i(j)=\operatorname{Tr}(D_iE_j)μi​(j)=Tr(Di​Ej​). Then

S(μ1,μ2)≤S(D1,D2).S(\mu_1,\mu_2)\le S(D_1,D_2).S(μ1​,μ2​)≤S(D1​,D2​).

Classical entropy is the extended Umegaki entropy of the computed diagonal law. Zero effects, zero probabilities, singular reference states and infinite relative entropy are allowed.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P84
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P84

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

-- Pinned accepted definitions, inspected at their recorded source locations.

open QAlgorithms.Papers.Independent.Renew46.P35 (traceAdjoint)

open QAlgorithms.Papers.Independent.Dependency50.P21 (imaginaryPower marginalAB)

/-- Petz, arXiv:quant-ph/0209053v1, PDF p.6, (14).
All finite POVMs are allowed, including zero effects; relative entropy uses its
support-failure value +infinity. No invertibility assumption is imposed. -/
theorem measurementRelativeEntropyMonotonicity {I O : Type*}
    [Fintype I] [Fintype O] [Nonempty I] [Nonempty O]
    (E : O → Matrix I I ℂ) (hE : IsPOVM E)
    (D1 D2 : Matrix I I ℂ)
    (hD1 : IsDensityMatrix D1) (hD2 : IsDensityMatrix D2) :
    QAlgorithms.Papers.Independent.Dependency50.P21.relativeEntropy
      (measurementDensity E D1) (measurementDensity E D2) ≤
      QAlgorithms.Papers.Independent.Dependency50.P21.relativeEntropy D1 D2 := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P84

end
Source
Monotonicity of quantum relative entropy revisited, arXiv:quant-ph/0209053v1, PDF p. 6, Section 4, printed 3.2: measurement relative-entropy bound (14)
Read-back

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

For any finite nonempty sets I,OI,OI,O, let (Eo)o∈O(E_o)_{o\in O}(Eo​)o∈O​ be positive semidefinite complex matrices indexed by III satisfying ∑oEo=1\sum_oE_o=1∑o​Eo​=1, and let D1,D2D_1,D_2D1​,D2​ be positive semidefinite matrices indexed by III with trace 111. Define the diagonal matrix ME(D)M_E(D)ME​(D) indexed by OOO by

ME(D)oo=Re⁡tr⁡(EoD),ME(D)oo′=0(o≠o′).M_E(D)_{oo}=\operatorname{Re}\operatorname{tr}(E_oD), \qquad M_E(D)_{oo'}=0\quad(o\ne o').ME​(D)oo​=Retr(Eo​D),ME​(D)oo′​=0(o=o′).

Then

D(ME(D1)∥ME(D2))≤D(D1∥D2),\mathcal D(M_E(D_1)\Vert M_E(D_2)) \le \mathcal D(D_1\Vert D_2),D(ME​(D1​)∥ME​(D2​))≤D(D1​∥D2​),

where D(R∥S)=Re⁡tr⁡(f(R)−Rlog⁡S)\mathcal D(R\Vert S)=\operatorname{Re}\operatorname{tr}(f(R)-R\log S)D(R∥S)=Retr(f(R)−RlogS), with f(x)=xln⁡xf(x)=x\ln xf(x)=xlnx, when ker⁡S⊆ker⁡R\ker S\subseteq\ker RkerS⊆kerR, and D(R∥S)=+∞\mathcal D(R\Vert S)=+\inftyD(R∥S)=+∞ otherwise. Matrix functions use functional calculus, with the scalar logarithm equal to 000 at 000. Zero measurement probabilities and failure of the support inclusion are included; no strict positivity is assumed.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me