Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7

Proved
QAlgorithms.Papers.Independent.Support50.P21.cptp_monotonicity

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All systems are nonzero finite-dimensional complex Hilbert spaces, and logarithms have base two.

Let ρ\rhoρ be a density operator, σ≥0\sigma\ge0σ≥0, and TTT any completely positive trace-preserving map between finite-dimensional systems. Then

Dmin⁡(T(ρ)∥T(σ))≤Dmin⁡(ρ∥σ),Dmax⁡(T(ρ)∥T(σ))≤Dmax⁡(ρ∥σ).D_{\min}(T(\rho)\Vert T(\sigma))\le D_{\min}(\rho\Vert\sigma),\qquad D_{\max}(T(\rho)\Vert T(\sigma))\le D_{\max}(\rho\Vert\sigma).Dmin​(T(ρ)∥T(σ))≤Dmin​(ρ∥σ),Dmax​(T(ρ)∥T(σ))≤Dmax​(ρ∥σ).

The output dimension is arbitrary and σ\sigmaσ is not required to be normalized. This is data processing for both divergences.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P21
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P21

open QAlgorithms QAlgorithms.Entanglement Filter

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

-- Use the accepted declarations directly; no paper-local aliases hide dimension binders.

open QAlgorithms.Papers.Independent.Claimed50.P33
  (FiniteState IsAverageLocalMonotone IsAdaptiveLOCCMonotone)

open QAlgorithms.Papers.Independent.Information100.P63 (Mat)

open QAlgorithms.Papers.Independent.Dependency50.P35 (tr elog maxRelative)

open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)

open QAlgorithms.Papers.Independent.Information100.P07 (support)

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)

variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

section Statements

variable [Nonempty I] [Nonempty J]

/-- Lemma 7, PDF p.4, (18)–(19): arbitrary finite output dimension and Kraus CPTP.
The reversed Petz inequality inside the printed proof is not copied. -/
theorem cptp_monotonicity (rho sigma : Mat I) (hrho : IsDensityMatrix rho)
    (hsigma : sigma.PosSemidef) (T : Superop I J) (hT : IsChannel T) :
    dMin (T rho) (T sigma) ≤ dMin rho sigma ∧
    maxRelative (T rho) (T sigma) ≤ maxRelative rho sigma := by sorry

end Statements

end QAlgorithms.Papers.Independent.Support50.P21

end
Source
Min- and Max- Relative Entropies and a New Entanglement Monotone, arXiv:0803.2770v3, PDF p. 4, Lemma 7
Read-back

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

For any finite index types I,JI,JI,J with decidable equality, let ρ\rhoρ be a positive semidefinite complex matrix on III with complex trace one, let σ\sigmaσ be any positive semidefinite complex matrix on III, and let TTT be a function from complex matrices on III to complex matrices on JJJ admitting a finite Kraus representation: there exist m∈Nm\in\mathbb Nm∈N and matrices E0,…,Em−1E_0,\ldots,E_{m-1}E0​,…,Em−1​ from III to JJJ such that ∑jEj†Ej=1I\sum_jE_j^\dagger E_j=\mathbf1_I∑j​Ej†​Ej​=1I​ and T(X)=∑jEjXEj†T(X)=\sum_jE_jXE_j^\daggerT(X)=∑j​Ej​XEj†​ for every XXX. For SXS_XSX​ the orthogonal projection onto the range of XXX, tr⁡RX=Re⁡Tr⁡X\operatorname{tr}_{\mathbb R}X=\operatorname{Re}\operatorname{Tr}XtrR​X=ReTrX, and L(x)=log⁡2xL(x)=\log_2xL(x)=log2​x when x>0x>0x>0, with L(x)=−∞L(x)=-\inftyL(x)=−∞ otherwise, define

Dmin⁡(X∥Y)=−L(tr⁡R(SXY)),Dmax⁡(X∥Y)=inf⁡{ℓ∈R:2ℓY−X is positive semidefinite},D_{\min}(X\|Y)=-L(\operatorname{tr}_{\mathbb R}(S_XY)), \qquad D_{\max}(X\|Y)=\inf\{\ell\in\mathbb R:2^\ell Y-X\text{ is positive semidefinite}\},Dmin​(X∥Y)=−L(trR​(SX​Y)),Dmax​(X∥Y)=inf{ℓ∈R:2ℓY−X is positive semidefinite},

using extended-real infima, including +∞+\infty+∞ for an empty feasible set. Then

Dmin⁡(T(ρ)∥T(σ))≤Dmin⁡(ρ∥σ),Dmax⁡(T(ρ)∥T(σ))≤Dmax⁡(ρ∥σ).D_{\min}(T(\rho)\|T(\sigma))\le D_{\min}(\rho\|\sigma), \qquad D_{\max}(T(\rho)\|T(\sigma))\le D_{\max}(\rho\|\sigma).Dmin​(T(ρ)∥T(σ))≤Dmin​(ρ∥σ),Dmax​(T(ρ)∥T(σ))≤Dmax​(ρ∥σ).

No support inclusion or trace normalization of σ\sigmaσ is required, and σ=0\sigma=0σ=0 is allowed.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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