Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Section 5.3: relationships among MONO, MPT, SSA and JC

Open
QAlgorithms.Papers.Independent.Intakethird100.P51.inequalityEquivalences

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

prove2quantum

Let MONO, MPT, SSA and JC denote the universal finite-dimensional principles of relative-entropy monotonicity under all CPTP maps, monotonicity under partial trace, strong subadditivity, and joint convexity, respectively. The relative-entropy principles include PSD support-included pairs and unnormalized references; SSA ranges over normalized PSD states. Then

MONO⇒MPT,MPT⟺SSA⟺JC,MPT⇒MONO.\mathrm{MONO}\Rightarrow\mathrm{MPT},\qquad\mathrm{MPT}\Longleftrightarrow\mathrm{SSA}\Longleftrightarrow\mathrm{JC},\qquad\mathrm{MPT}\Rightarrow\mathrm{MONO}.MONO⇒MPT,MPT⟺SSA⟺JC,MPT⇒MONO.

These are relationships among global principles, including the singular block and dilation cases used in their reductions. Equality characterizations are not part of these principles.

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]

/-- Section 5.3, equation (37) and Lindblad's completion, PDF pp.14–15:
relationships between the four GLOBAL principles, including PSD/support cases. -/
theorem inequalityEquivalences :
    (MONO → MPT) ∧ (MPT ↔ SSA) ∧ (SSA ↔ JC) ∧ (MPT → MONO) := 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. 15, Section 5.3: relationships among MONO, MPT, SSA and JC
Read-back

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

The following four logical statements hold: (M⇒P)(\mathcal M\Rightarrow\mathcal P)(M⇒P), (P⇔S)(\mathcal P\Leftrightarrow\mathcal S)(P⇔S), (S⇔J)(\mathcal S\Leftrightarrow\mathcal J)(S⇔J), and (P⇒M)(\mathcal P\Rightarrow\mathcal M)(P⇒M), where the properties are defined as follows. Write S(X)=−Re⁡tr⁡[f(X)]S(X)=-\operatorname{Re}\operatorname{tr}[f(X)]S(X)=−Retr[f(X)], with f(x)=xln⁡xf(x)=x\ln xf(x)=xlnx applied by continuous functional calculus, and write DR(X∥Y)D_{\mathbb R}(X\Vert Y)DR​(X∥Y) for the real conversion of the extended-real quantity

D(X∥Y)={Re⁡tr⁡ ⁣[f(X)−Xlog⁡Y],ker⁡Y⊆ker⁡X,+∞,otherwise.D(X\Vert Y)= \begin{cases} \operatorname{Re}\operatorname{tr}\!\left[f(X)-X\log Y\right],& \ker Y\subseteq\ker X,\\ +\infty,&\text{otherwise}. \end{cases}D(X∥Y)={Retr[f(X)−XlogY],+∞,​kerY⊆kerX,otherwise.​

Here log⁡Y\log YlogY is defined by continuous functional calculus using the total real logarithm, whose value at zero is zero; conversion to a real number sends +∞+\infty+∞ to zero. Property M\mathcal MM says that for every n,m∈Nn,m\in\mathbb Nn,m∈N, every channel Φ\PhiΦ from (n+1)×(n+1)(n+1)\times(n+1)(n+1)×(n+1) complex matrices to (m+1)×(m+1)(m+1)\times(m+1)(m+1)×(m+1) complex matrices, and all positive semidefinite X,YX,YX,Y with ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, one has both ker⁡(ΦY)⊆ker⁡(ΦX)\ker(\Phi Y)\subseteq\ker(\Phi X)ker(ΦY)⊆ker(ΦX) and DR(ΦX∥ΦY)≤DR(X∥Y)D_{\mathbb R}(\Phi X\Vert\Phi Y)\le D_{\mathbb R}(X\Vert Y)DR​(ΦX∥ΦY)≤DR​(X∥Y). A channel here means a map admitting a finite representation Φ(Z)=∑iEiZEi†\Phi(Z)=\sum_i E_iZE_i^\daggerΦ(Z)=∑i​Ei​ZEi†​ with ∑iEi†Ei=I\sum_iE_i^\dagger E_i=I∑i​Ei†​Ei​=I. Property P\mathcal PP says that for every n,m∈Nn,m\in\mathbb Nn,m∈N and all positive semidefinite matrices X,YX,YX,Y on Cn+1⊗Cm+1\mathbb C^{n+1}\otimes\mathbb C^{m+1}Cn+1⊗Cm+1 with ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, tracing out the first factor preserves this kernel inclusion and does not increase DRD_{\mathbb R}DR​. Property S\mathcal SS says that for every n,m,k∈Nn,m,k\in\mathbb Nn,m,k∈N and every positive semidefinite trace-one matrix XABCX_{ABC}XABC​ on dimensions n+1,m+1,k+1n+1,m+1,k+1n+1,m+1,k+1,

0≤S(XAB)+S(XBC)−S(XABC)−S(XB),0\le S(X_{AB})+S(X_{BC})-S(X_{ABC})-S(X_B),0≤S(XAB​)+S(XBC​)−S(XABC​)−S(XB​),

where each subscript denotes the indicated partial trace. Property J\mathcal JJ says that for every n,k∈Nn,k\in\mathbb Nn,k∈N, nonnegative weights w0,…,wkw_0,\ldots,w_kw0​,…,wk​ summing to one, and positive semidefinite (n+1)×(n+1)(n+1)\times(n+1)(n+1)×(n+1) matrices Xj,YjX_j,Y_jXj​,Yj​ satisfying ker⁡Yj⊆ker⁡Xj\ker Y_j\subseteq\ker X_jkerYj​⊆kerXj​, their weighted sums satisfy the same kernel inclusion and

DR ⁣(∑jwjXj∥∑jwjYj)≤∑jwjDR(Xj∥Yj).D_{\mathbb R}\!\left(\sum_jw_jX_j\Big\Vert\sum_jw_jY_j\right) \le\sum_jw_jD_{\mathbb R}(X_j\Vert Y_j).DR​(j∑​wj​Xj​​j∑​wj​Yj​)≤j∑​wj​DR​(Xj​∥Yj​).

All natural-number parameters include zero, so the register dimensions here include one but are never zero; X,Y,Xj,YjX,Y,X_j,Y_jX,Y,Xj​,Yj​ need not have trace one and may be zero, and the weights may vanish.

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