Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§III, equations (7)–(8): equivalent max-relative entropy formulas

Proved
QAlgorithms.Papers.Independent.Support50.P21.maxRelative_equivalent_forms

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 ρ≥0\rho\ge0ρ≥0 satisfy 0<Tr⁡ρ≤10<\operatorname{Tr}\rho\le10<Trρ≤1, and let σ≥0\sigma\ge0σ≥0 with supp⁡ρ⊆supp⁡σ\operatorname{supp}\rho\subseteq\operatorname{supp}\sigmasuppρ⊆suppσ. With the inverse square root set to zero on the kernel,

Dmax⁡(ρ∥σ)=log⁡2λmax⁡(σ−1/2ρσ−1/2).D_{\max}(\rho\Vert\sigma)=\log_2\lambda_{\max}(\sigma^{-1/2}\rho\sigma^{-1/2}).Dmax​(ρ∥σ)=log2​λmax​(σ−1/2ρσ−1/2).

There is also a least positive ttt for which

Tr⁡[{ρ≥tσ}(ρ−tσ)]=0,\operatorname{Tr}[\{\rho\ge t\sigma\}(\rho-t\sigma)]=0,Tr[{ρ≥tσ}(ρ−tσ)]=0,

and Dmax⁡(ρ∥σ)=log⁡2tD_{\max}(\rho\Vert\sigma)=\log_2tDmax​(ρ∥σ)=log2​t. The projector includes the zero eigenspace. These are the two equivalent finite formulas for the same divergence.

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]

/-- PDF p.3, (7)–(8): nonzero finite domain, generalized inverse square roots,
and an attained LEAST positive threshold for the weak projector. -/
theorem maxRelative_equivalent_forms (rho sigma : Mat I)
    (hrho : IsSubnormalized rho) (hne : 0 < tr rho) (hsigma : sigma.PosSemidef)
    (hsupp : SupportIncluded rho sigma) :
    maxRelative rho sigma = elog (largestEigenvalue
      (supportPower sigma (-(1/2 : ℝ)) * rho * supportPower sigma (-(1/2 : ℝ)))) ∧
    ∃ t : ℝ, IsLeast (thresholdSet rho sigma) t ∧ maxRelative rho sigma = elog t := 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. 3, §III, equations (7)–(8): equivalent max-relative entropy formulas
Read-back

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

For any finite index type III with decidable equality, let ρ,σ\rho,\sigmaρ,σ be complex matrices indexed by III, with ρ\rhoρ positive semidefinite, 0<tr⁡Rρ≤10<\operatorname{tr}_{\mathbb R}\rho\le10<trR​ρ≤1, σ\sigmaσ positive semidefinite, and ker⁡σ⊆ker⁡ρ\ker\sigma\subseteq\ker\rhokerσ⊆kerρ, where tr⁡RX=Re⁡Tr⁡X\operatorname{tr}_{\mathbb R}X=\operatorname{Re}\operatorname{Tr}XtrR​X=ReTrX. Define

Dmax⁡(ρ∥σ)=inf⁡{ℓ∈R:2ℓσ−ρ is positive semidefinite},L(x)={log⁡2x,x>0,−∞,x≤0,D_{\max}(\rho\|\sigma) =\inf\{\ell\in\mathbb R:2^\ell\sigma-\rho\text{ is positive semidefinite}\}, \qquad L(x)= \begin{cases}\log_2x,&x>0,\\-\infty,&x\le0,\end{cases}Dmax​(ρ∥σ)=inf{ℓ∈R:2ℓσ−ρ is positive semidefinite},L(x)={log2​x,−∞,​x>0,x≤0,​

with the infimum taken in the extended real numbers, so an empty feasible set has infimum +∞+\infty+∞. Let σsupp−1/2\sigma_{\mathrm{supp}}^{-1/2}σsupp−1/2​ act by λ−1/2\lambda^{-1/2}λ−1/2 on every positive eigenvalue λ\lambdaλ of σ\sigmaσ and by zero on its kernel. For Hermitian HHH, let Q≥0(H)Q_{\ge0}(H)Q≥0​(H) be its spectral projection onto all nonnegative eigenvalues, including zero, and set

Tρ,σ={t>0:tr⁡R[Q≥0(ρ−tσ)(ρ−tσ)]=0}.\mathcal T_{\rho,\sigma} =\{t>0:\operatorname{tr}_{\mathbb R}[Q_{\ge0}(\rho-t\sigma)(\rho-t\sigma)]=0\}.Tρ,σ​={t>0:trR​[Q≥0​(ρ−tσ)(ρ−tσ)]=0}.

Then

Dmax⁡(ρ∥σ)=L ⁣(λmax⁡(σsupp−1/2ρ σsupp−1/2)),D_{\max}(\rho\|\sigma) =L\!\left(\lambda_{\max}(\sigma_{\mathrm{supp}}^{-1/2}\rho\,\sigma_{\mathrm{supp}}^{-1/2})\right),Dmax​(ρ∥σ)=L(λmax​(σsupp−1/2​ρσsupp−1/2​)),

and there exists a real t∈Tρ,σt\in\mathcal T_{\rho,\sigma}t∈Tρ,σ​ such that t≤st\le st≤s for every s∈Tρ,σs\in\mathcal T_{\rho,\sigma}s∈Tρ,σ​ and Dmax⁡(ρ∥σ)=L(t)D_{\max}(\rho\|\sigma)=L(t)Dmax​(ρ∥σ)=L(t). The positive-trace hypothesis excludes ρ=0\rho=0ρ=0 and an empty III; no normalization or upper trace bound is imposed on σ\sigmaσ.

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