Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 1: nonprojective measurements can preserve relative entropy

Open
QAlgorithms.Papers.Independent.Intakethird100.P84.nonprojectiveMeasurementExample

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

prove2quantum

Fix real numbers 0<μ<1/20<\mu<1/20<μ<1/2 and 0<x<10<x<10<x<1. On C3\mathbb C^3C3 set D1=diag⁡(1−2μ,μ,μ)D_1=\operatorname{diag}(1-2\mu,\mu,\mu)D1​=diag(1−2μ,μ,μ), D2=I/3D_2=I/3D2​=I/3, and

E1=diag⁡(1,0,0),E2=(000\0xz\0zˉ1−x),E3=(000\01−x−z\0−zˉx).E_1=\operatorname{diag}(1,0,0),\qquad E_2=\begin{pmatrix}0&0&0\0&x&z\0&\bar z&1-x\end{pmatrix},\qquad E_3=\begin{pmatrix}0&0&0\0&1-x&-z\0&-\bar z&x\end{pmatrix}.E1​=diag(1,0,0),E2​=(0​0​0\0​x​z\0​zˉ​1−x​),E3​=(0​0​0\0​1−x​−z\0​−zˉ​x​).

There exists r>0r>0r>0 such that for every complex zzz with ∣z∣<r|z|<r∣z∣<r, these effects are positive semidefinite and sum to III. Writing μi(j)=Tr⁡(DiEj)\mu_i(j)=\operatorname{Tr}(D_iE_j)μi​(j)=Tr(Di​Ej​) for the corresponding three-outcome probability laws, one has

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

Here SSS denotes classical or quantum relative entropy with natural logarithms, as appropriate. This explicit family demonstrates that an entropy-preserving measurement need not be projective.

Formalization Note The probability laws are represented by their computed diagonal density matrices. The radius is existential and is quantified before zzz, matching the source's phrase “small enough.”

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.7, Example 1.
The positive radius formalizes exactly the source's "modulus small enough";
it is chosen before z and no unprinted sharp boundary is imposed. -/
theorem nonprojectiveMeasurementExample (mu x : ℝ)
    (hmu0 : 0 < mu) (hmu1 : mu < 1 / 2) (hx0 : 0 < x) (hx1 : x < 1) :
    ∃ r : ℝ, 0 < r ∧ ∀ z : ℂ, ‖z‖ < r →
      IsPOVM (exampleEffects x z) ∧
      qRelEntropy
        (measurementDensity (exampleEffects x z) (petzExampleDensity mu))
        (measurementDensity (exampleEffects x z) exampleReference) =
      qRelEntropy (petzExampleDensity mu) exampleReference := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P84

end
Source
Monotonicity of quantum relative entropy revisited, arXiv:quant-ph/0209053v1, PDF p. 7, Example 1: nonprojective measurements can preserve relative entropy
Read-back

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

For all real μ,x\mu,xμ,x satisfying 0<μ<120<\mu<\tfrac120<μ<21​ and 0<x<10<x<10<x<1, there exists a real r>0r>0r>0 such that every complex zzz with ∣z∣<r|z|<r∣z∣<r, including z=0z=0z=0, has the following properties. Define

Dμ=diag⁡(1−2μ,μ,μ),Dref=13I3,E0=(100000000),E1=(0000xz0z‾1−x),E2=(00001−x−z0−z‾x).D_\mu=\operatorname{diag}(1-2\mu,\mu,\mu),\qquad D_{\mathrm{ref}}=\tfrac13 I_3,\qquad E_0=\begin{pmatrix}1&0&0\\0&0&0\\0&0&0\end{pmatrix}, \quad E_1=\begin{pmatrix}0&0&0\\0&x&z\\0&\overline z&1-x\end{pmatrix}, \quad E_2=\begin{pmatrix}0&0&0\\0&1-x&-z\\0&-\overline z&x\end{pmatrix}.Dμ​=diag(1−2μ,μ,μ),Dref​=31​I3​,E0​=​100​000​000​​,E1​=​000​0xz​0z1−x​​,E2​=​000​01−x−z​0−zx​​.

Each EjE_jEj​ is positive semidefinite and E0+E1+E2=I3E_0+E_1+E_2=I_3E0​+E1​+E2​=I3​. Moreover, writing ME(D)=diag⁡j=02(Re⁡tr⁡(EjD))\mathcal M_E(D)=\operatorname{diag}_{j=0}^2(\operatorname{Re}\operatorname{tr}(E_jD))ME​(D)=diagj=02​(Retr(Ej​D)) and R(A,B)=Re⁡tr⁡(f(A)−Aln⁡B−A+B)\mathcal R(A,B)=\operatorname{Re}\operatorname{tr}(f(A)-A\ln B-A+B)R(A,B)=Retr(f(A)−AlnB−A+B), where f(u)=uln⁡uf(u)=u\ln uf(u)=ulnu and matrix functions use spectral functional calculus, one has

R(ME(Dμ),ME(Dref))=R(Dμ,Dref).\mathcal R\bigl(\mathcal M_E(D_\mu),\mathcal M_E(D_{\mathrm{ref}})\bigr) =\mathcal R(D_\mu,D_{\mathrm{ref}}).R(ME​(Dμ​),ME​(Dref​))=R(Dμ​,Dref​).
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