Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2: equality in monotonicity (seed paper result)

Open
QAlgorithms.Papers.Independent.Intakethird100.P84.equalityInMonotonicity

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

prove2quantum

Let HHH and KKK be nonzero finite-dimensional complex Hilbert spaces, and let T:B(H)→B(K)T:B(H)\to B(K)T:B(H)→B(K) be complex-linear, trace preserving and 2-positive. Let D1,D2D_1,D_2D1​,D2​ be invertible density matrices whose images T(D1),T(D2)T(D_1),T(D_2)T(D1​),T(D2​) are also invertible. Density matrices are positive semidefinite with ordinary trace one. Write S(A,B)=Tr⁡[A(log⁡A−log⁡B)]S(A,B)=\operatorname{Tr}[A(\log A-\log B)]S(A,B)=Tr[A(logA−logB)], using natural logarithms, and let T∗T^*T∗ be the computed trace adjoint. Then each of the following is separately equivalent to S(D1,D2)=S(T(D1),T(D2))S(D_1,D_2)=S(T(D_1),T(D_2))S(D1​,D2​)=S(T(D1​),T(D2​)):

T∗(T(D1)itT(D2)−it)=D1itD2−itfor every t∈R, T∗(log⁡T(D1)−log⁡T(D2))=log⁡D1−log⁡D2.\begin{aligned} &T^*(T(D_1)^{it}T(D_2)^{-it})=D_1^{it}D_2^{-it}\quad\text{for every }t\in\mathbb R,\ &T^*(\log T(D_1)-\log T(D_2))=\log D_1-\log D_2. \end{aligned}​T∗(T(D1​)itT(D2​)−it)=D1it​D2−it​for every t∈R, ​T∗(logT(D1​)−logT(D2​))=logD1​−logD2​.​

This characterizes exactly when coarse graining preserves the relative entropy of a faithful pair. No commutativity, complete positivity or unitality of TTT is assumed.

Formalization Note The frozen relative entropy includes the correction −A+B-A+B−A+B, whose trace vanishes for trace-one densities. The adjoint is calculated from matrix units; powers are exp⁡(itlog⁡A)\exp(it\log A)exp(itlogA).

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.5, Theorem 2.
Both printed characterizations are individually equivalent to entropy equality.
All four densities are invertible; T is only two-positive and trace preserving. -/
theorem equalityInMonotonicity {I J : Type*}
    [Fintype I] [Fintype J] [Nonempty I] [Nonempty J]
    (T : Matrix I I ℂ →ₗ[ℂ] Matrix J J ℂ)
    (hT : IsTwoPositive T) (htrace : ∀ B, (T B).trace = B.trace)
    (D1 D2 : Matrix I I ℂ)
    (hD1 : IsDensityMatrix D1) (hD2 : IsDensityMatrix D2)
    (hTD1 : IsDensityMatrix (T D1)) (hTD2 : IsDensityMatrix (T D2))
    (hInvD1 : IsUnit D1) (hInvD2 : IsUnit D2)
    (hInvTD1 : IsUnit (T D1)) (hInvTD2 : IsUnit (T D2)) :
    ((qRelEntropy D1 D2 = qRelEntropy (T D1) (T D2)) ↔
      ∀ t : ℝ, traceAdjoint T (imaginaryPower (T D1) t * imaginaryPower (T D2) (-t)) =
        imaginaryPower D1 t * imaginaryPower D2 (-t)) ∧
    ((qRelEntropy D1 D2 = qRelEntropy (T D1) (T D2)) ↔
      traceAdjoint T (cfc Real.log (T D1) - cfc Real.log (T D2)) =
        cfc Real.log D1 - cfc Real.log D2) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P84

end
Source
Monotonicity of quantum relative entropy revisited, arXiv:quant-ph/0209053v1, PDF p. 5, Theorem 2: equality in monotonicity (seed paper result)
Read-back

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

Let I,JI,JI,J be nonempty finite types, and let T:MI(C)→MJ(C)T:M_I(\mathbb C)\to M_J(\mathbb C)T:MI​(C)→MJ​(C) be complex linear, trace preserving on every matrix, and two-positive, meaning that applying TTT to each I×II\times II×I block of any positive semidefinite matrix indexed by {0,1}×I\{0,1\}\times I{0,1}×I produces a positive semidefinite matrix. Let D1,D2D_1,D_2D1​,D2​ and both T(D1),T(D2)T(D_1),T(D_2)T(D1​),T(D2​) be invertible positive semidefinite matrices of trace one. Write f(u)=uln⁡uf(u)=u\ln uf(u)=ulnu, interpret scalar functions of these matrices by spectral functional calculus, set AitA^{it}Ait to have eigenvalues eitln⁡λe^{it\ln\lambda}eitlnλ on the eigenspaces of AAA, and define

R(A,B)=Re⁡tr⁡(f(A)−Aln⁡B−A+B),(T♯Y)a,b=tr⁡(Y T(Eb,a)),\mathcal R(A,B)=\operatorname{Re}\operatorname{tr}\bigl(f(A)-A\ln B-A+B\bigr), \qquad (T^\sharp Y)_{a,b}=\operatorname{tr}\bigl(Y\,T(E_{b,a})\bigr),R(A,B)=Retr(f(A)−AlnB−A+B),(T♯Y)a,b​=tr(YT(Eb,a​)),

where Eb,aE_{b,a}Eb,a​ is the matrix unit. The declaration asserts both equivalences

R(D1,D2)=R(T(D1),T(D2))  ⟺  ∀t∈R,T♯ ⁣(T(D1)itT(D2)−it)=D1itD2−it,\mathcal R(D_1,D_2)=\mathcal R(T(D_1),T(D_2)) \iff \forall t\in\mathbb R,\quad T^\sharp\!\left(T(D_1)^{it}T(D_2)^{-it}\right) =D_1^{it}D_2^{-it},R(D1​,D2​)=R(T(D1​),T(D2​))⟺∀t∈R,T♯(T(D1​)itT(D2​)−it)=D1it​D2−it​,

and

R(D1,D2)=R(T(D1),T(D2))  ⟺  T♯ ⁣(ln⁡T(D1)−ln⁡T(D2))=ln⁡D1−ln⁡D2.\mathcal R(D_1,D_2)=\mathcal R(T(D_1),T(D_2)) \iff T^\sharp\!\left(\ln T(D_1)-\ln T(D_2)\right) =\ln D_1-\ln D_2.R(D1​,D2​)=R(T(D1​),T(D2​))⟺T♯(lnT(D1​)−lnT(D2​))=lnD1​−lnD2​.
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