Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 13

Proved
QAlgorithms.Papers.Independent.Support50.P21.relativeEntanglement_le_max

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 ρAB\rho_{AB}ρAB​ be a bipartite density operator, and let D\mathcal DD contain all separable density operators on the same space. With minima over that entire set,

E(ρ):=min⁡σ∈DS(ρ∥σ)≤min⁡σ∈DDmax⁡(ρ∥σ)=Emax⁡(ρ).E(\rho):=\min_{\sigma\in\mathcal D}S(\rho\Vert\sigma)\le\min_{\sigma\in\mathcal D}D_{\max}(\rho\Vert\sigma)=E_{\max}(\rho).E(ρ):=σ∈Dmin​S(ρ∥σ)≤σ∈Dmin​Dmax​(ρ∥σ)=Emax​(ρ).

The relative-entropy minimum is attained. This is the upper-bound clause advertised in the abstract; neither optimization is restricted to product states.

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 13, PDF p.7, (38)–(39): all separable comparison states.
The unsubscripted D in the first line of (38) is the surrounding Dmax. -/
theorem relativeEntanglement_le_max (rho : Mat (I × J)) (hrho : IsDensityMatrix rho) :
    eRelative rho ≤ eMax rho ∧
    ∃ sigma : Mat (I × J), IsSeparableDensity sigma ∧ unnormalizedRelativeBits rho sigma = eRelative rho := 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. 7, Lemma 13
Read-back

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

Let I,JI,JI,J be finite nonempty index types with decidable equality, and let ρ\rhoρ be a positive semidefinite complex matrix on I×JI\times JI×J with trace 111. Call a matrix σ\sigmaσ separable if it has a finite decomposition σ=∑j=0q−1wjAj⊗Bj\sigma=\sum_{j=0}^{q-1}w_j A_j\otimes B_jσ=∑j=0q−1​wj​Aj​⊗Bj​, where wj≥0w_j\ge0wj​≥0, ∑jwj=1\sum_jw_j=1∑j​wj​=1, and every Aj,BjA_j,B_jAj​,Bj​ is positive semidefinite with trace 111. Define the extended-real quantities

R(ρ,σ)={Re⁡Tr⁡ ⁣(ρ(log⁡2ρ−log⁡2σ)),ker⁡σ⊆ker⁡ρ,+∞,otherwise,Dmax⁡(ρ∥σ)=inf⁡{ℓ∈R:2ℓσ−ρ is positive semidefinite},R(\rho,\sigma)= \begin{cases} \operatorname{Re}\operatorname{Tr}\!\bigl(\rho(\log_2\rho-\log_2\sigma)\bigr), &\ker\sigma\subseteq\ker\rho,\\ +\infty,&\text{otherwise}, \end{cases} \qquad D_{\max}(\rho\Vert\sigma) =\inf\{\ell\in\mathbb R:2^\ell\sigma-\rho\text{ is positive semidefinite}\},R(ρ,σ)={ReTr(ρ(log2​ρ−log2​σ)),+∞,​kerσ⊆kerρ,otherwise,​Dmax​(ρ∥σ)=inf{ℓ∈R:2ℓσ−ρ is positive semidefinite},

where matrix logarithms use functional calculus, with scalar logarithm assigned value 000 at 000, and the latter infimum is taken in the extended reals. Then

inf⁡σ separableR(ρ,σ)≤inf⁡σ separableDmax⁡(ρ∥σ),\inf_{\sigma\ \mathrm{separable}}R(\rho,\sigma) \le \inf_{\sigma\ \mathrm{separable}}D_{\max}(\rho\Vert\sigma),σ separableinf​R(ρ,σ)≤σ separableinf​Dmax​(ρ∥σ),

and there exists a separable density matrix σ\sigmaσ attaining the infimum on the left. No uniqueness of this σ\sigmaσ is asserted.

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