Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 ([23,14]): Uhlmann monotonicity, cited background

Open
QAlgorithms.Papers.Independent.Intakethird100.P84.uhlmannMonotonicity

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

prove2quantum

Let T:MI(C)→MJ(C)T:M_I(\mathbb C)\to M_J(\mathbb C)T:MI​(C)→MJ​(C) be complex linear, 2-positive and trace preserving on nonzero finite spaces. For every pair of density matrices D1,D2D_1,D_2D1​,D2​, including singular ones,

S(T(D1),T(D2))≤S(D1,D2).S(T(D_1),T(D_2))\le S(D_1,D_2).S(T(D1​),T(D2​))≤S(D1​,D2​).

Here S(A,B)=Tr⁡(Alog⁡A−Alog⁡B)S(A,B)=\operatorname{Tr}(A\log A-A\log B)S(A,B)=Tr(AlogA−AlogB) when supp⁡A⊆supp⁡B\operatorname{supp}A\subseteq\operatorname{supp}BsuppA⊆suppB, and +∞+\infty+∞ otherwise. No input or output invertibility is assumed.

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.2, Theorem 1 [23,14].
Full-domain extended Umegaki entropy; singular densities and support failure are allowed.
Two-positivity and trace preservation are the only map assumptions. -/
theorem uhlmannMonotonicity {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) :
    QAlgorithms.Papers.Independent.Dependency50.P21.relativeEntropy (T D1) (T 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. 2, Theorem 1 ([23,14]): Uhlmann monotonicity, cited background
Read-back

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

For any finite nonempty sets I,JI,JI,J, 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: for every positive semidefinite matrix XXX indexed by {0,1}×I\{0,1\}\times I{0,1}×I, the matrix with entries T(Xab)yzT(X_{ab})_{yz}T(Xab​)yz​, where (Xab)ij=X(a,i),(b,j)(X_{ab})_{ij}=X_{(a,i),(b,j)}(Xab​)ij​=X(a,i),(b,j)​, is positive semidefinite. For any positive semidefinite matrices D1,D2∈MI(C)D_1,D_2\in M_I(\mathbb C)D1​,D2​∈MI​(C) with trace 111, the assertion is

D(T(D1)∥T(D2))≤D(D1∥D2).\mathcal D(T(D_1)\Vert T(D_2))\le \mathcal D(D_1\Vert D_2).D(T(D1​)∥T(D2​))≤D(D1​∥D2​).

Here D(R∥S)\mathcal D(R\Vert S)D(R∥S) is the extended-real quantity

D(R∥S)={Re⁡tr⁡ ⁣(f(R)−Rlog⁡S),ker⁡S⊆ker⁡R,+∞,otherwise,f(x)=xln⁡x,\mathcal D(R\Vert S)= \begin{cases} \operatorname{Re}\operatorname{tr}\!\bigl(f(R)-R\log S\bigr), &\ker S\subseteq\ker R,\\ +\infty,&\text{otherwise}, \end{cases} \qquad f(x)=x\ln x,D(R∥S)={Retr(f(R)−RlogS),+∞,​kerS⊆kerR,otherwise,​f(x)=xlnx,

with matrix functions interpreted through functional calculus and the scalar logarithm taking value 000 at 000. No support-inclusion assumption is imposed on D1,D2D_1,D_2D1​,D2​; the inequality includes cases where these quantities are infinite.

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