Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Attained independent primal and dual descriptions of eta

Open
QAlgorithms.Papers.Independent.Intakethird100.P90.eta_sdp_duality

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

prove2quantum

All systems are finite-dimensional complex Hilbert spaces with fixed orthonormal product bases and positive local dimensions. A state is a positive semidefinite operator of trace one. All logarithms are base two and all operational rates are measured in standard Bell pairs (ebits) per input copy, with deterministic operations and error tending to zero. Write ED,ECE_D,E_CED​,EC​ for distillable entanglement and entanglement cost under completely PPT-preserving CPTP operations; an explicit LOCC subscript denotes unrestricted two-way local operations and classical communication.

Let ρ\rhoρ be a bipartite state and PPP its support projection. Define the primal and dual independently by

ηp=inf⁡{t:∃Y=Y†, −Y≤PTB≤Y, −tI≤YTB≤tI},\eta_p=\inf\{t:\exists Y=Y^\dagger,\ -Y\le P^{T_B}\le Y,\ -tI\le Y^{T_B}\le tI\},ηp​=inf{t:∃Y=Y†, −Y≤PTB​≤Y, −tI≤YTB​≤tI}, ηd=sup⁡{Tr⁡P(V−F)TB:V,F,W,X≥0, V+F≤(W−X)TB, Tr⁡(W+X)≤1}.\eta_d=\sup\{\operatorname{Tr}P(V-F)^{T_B}:V,F,W,X\ge0,\ V+F\le(W-X)^{T_B},\ \operatorname{Tr}(W+X)\le1\}.ηd​=sup{TrP(V−F)TB​:V,F,W,X≥0, V+F≤(W−X)TB​, Tr(W+X)≤1}.

Both extrema are attained, and

0<η(ρ)=ηp=ηd,Eη(ρ)=−log⁡2ηp,0<\eta(\rho)=\eta_p=\eta_d,\qquad E_\eta(\rho)=-\log_2\eta_p,0<η(ρ)=ηp​=ηd​,Eη​(ρ)=−log2​ηp​,

where η(ρ)\eta(\rho)η(ρ) is the minimum of ∥YTB∥∞\|Y^{T_B}\|_\infty∥YTB​∥∞​ over the support sandwich in Eq. (4). These finite SDPs specify the paper's computable lower bound; no exact real-input bit-complexity claim is added.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P90
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakethird100.P90

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms

open QAlgorithms.Papers.Independent.Dependency50.P36
  (relativeEntropy rains target canonicalMatrix allowed pptDistillable)

open QAlgorithms.Papers.Independent.Information100.P04 (gamma copies IsPPT)

open QAlgorithms.Papers.Independent.Next46.P42 (regroupProduct)

open QAlgorithms.Papers.Independent.Information100.P06 (supportProjection)

open QAlgorithms.Papers.Independent.Information100.P21 (FiniteLOCC)

open QAlgorithms.Papers.Independent.Gap48.P32 (antisymmetricQutrit)

/-- arXiv:1606.09421v3, PDF p.6, Eqs.(12)--(13): independently defined
primal and dual optima coincide and are attained, and E_eta=-log2 supportEta.
Strict positivity prevents a default logarithm value at zero. -/
theorem eta_sdp_duality {A B : Type} [Fintype A] [Fintype B]
    [DecidableEq A] [DecidableEq B] [Nonempty A] [Nonempty B]
    (rho : Matrix (A × B) (A × B) ℂ) (hstate : IsDensityMatrix rho) :
    0 < supportEta rho ∧ etaPrimal rho = supportEta rho ∧ etaDual rho = etaPrimal rho ∧
    (∃ Y, etaPrimalFeasible rho (etaPrimal rho) Y) ∧
    (∃ V F W X : Matrix (A × B) (A × B) ℂ,
      etaDualFeasible V F W X ∧ etaDualObjective rho V F = etaDual rho) ∧
    etaEntanglement rho = -Real.logb 2 (etaPrimal rho) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P90

end
Source
Irreversibility of Asymptotic Entanglement Manipulation Under Quantum Operations Completely Preserving Positivity of Partial Transpose, arXiv:1606.09421v3, PDF p. 6, Supplemental unnumbered result, Eqs.(12)–(13): attained primal/dual description of eta
Read-back

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

For any nonempty finite types A,BA,BA,B, each equipped with decidable equality, and every complex matrix ρ\rhoρ indexed by A×BA\times BA×B satisfying ρ⪰0\rho\succeq0ρ⪰0 and Tr⁡ρ=1\operatorname{Tr}\rho=1Trρ=1, define (ΓX)(a,b),(c,d)=X(a,d),(c,b)(\Gamma X)_{(a,b),(c,d)}=X_{(a,d),(c,b)}(ΓX)(a,b),(c,d)​=X(a,d),(c,b)​ and let PρP_\rhoPρ​ be the functional-calculus value at ρ\rhoρ of the function that is zero at zero and one elsewhere. Let η(ρ)\eta(\rho)η(ρ) be the infimum of ∥ΓY∥op\|\Gamma Y\|_{\mathrm{op}}∥ΓY∥op​ over Hermitian YYY satisfying Y−ΓPρ⪰0Y-\Gamma P_\rho\succeq0Y−ΓPρ​⪰0 and Y+ΓPρ⪰0Y+\Gamma P_\rho\succeq0Y+ΓPρ​⪰0. Define the primal value pη(ρ)p_\eta(\rho)pη​(ρ) as the infimum of all real ttt for which such a YYY additionally satisfies tI−ΓY⪰0tI-\Gamma Y\succeq0tI−ΓY⪰0 and ΓY+tI⪰0\Gamma Y+tI\succeq0ΓY+tI⪰0. Define the dual value dη(ρ)d_\eta(\rho)dη​(ρ) as the supremum of Re⁡Tr⁡[PρΓ(V−F)]\operatorname{Re}\operatorname{Tr}[P_\rho\Gamma(V-F)]ReTr[Pρ​Γ(V−F)] over matrices V,F,W,XV,F,W,XV,F,W,X indexed by A×BA\times BA×B satisfying

V,F,W,X⪰0,Γ(W−X)−(V+F)⪰0,Re⁡Tr⁡(W+X)≤1.V,F,W,X\succeq0,\qquad \Gamma(W-X)-(V+F)\succeq0,\qquad \operatorname{Re}\operatorname{Tr}(W+X)\le1.V,F,W,X⪰0,Γ(W−X)−(V+F)⪰0,ReTr(W+X)≤1.

Then η(ρ)>0\eta(\rho)>0η(ρ)>0, pη(ρ)=η(ρ)p_\eta(\rho)=\eta(\rho)pη​(ρ)=η(ρ), and dη(ρ)=pη(ρ)d_\eta(\rho)=p_\eta(\rho)dη​(ρ)=pη​(ρ); there exists a Hermitian YYY satisfying all four primal inequalities with t=pη(ρ)t=p_\eta(\rho)t=pη​(ρ), and there exist V,F,W,XV,F,W,XV,F,W,X satisfying the displayed dual constraints whose objective equals dη(ρ)d_\eta(\rho)dη​(ρ). Finally, the quantity defined as Eη(ρ)=−log⁡2η(ρ)E_\eta(\rho)=-\log_2\eta(\rho)Eη​(ρ)=−log2​η(ρ) satisfies Eη(ρ)=−log⁡2pη(ρ)E_\eta(\rho)=-\log_2p_\eta(\rho)Eη​(ρ)=−log2​pη​(ρ). No restriction on the real variable ttt is imposed separately from its matrix inequalities.

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