Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.1.1: weak duality and Slater strong duality

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.semidefinite_duality

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Here FFF is squared algebraic fidelity, F∗F_*F∗​ is squared generalized fidelity, P=1−F∗P=\sqrt{1-F_*}P=1−F∗​​ is purified distance, and Δ(ρ,τ)=max⁡0≤M≤I∣Tr⁡((ρ−τ)M)∣\Delta(\rho,\tau)=\max_{0\le M\le I}|\operatorname{Tr}((\rho-\tau)M)|Δ(ρ,τ)=max0≤M≤I​∣Tr((ρ−τ)M)∣. The symbols Hmin⁡H_{\min}Hmin​ and Hmax⁡H_{\max}Hmax​ denote conditional min- and max-entropy, with values +∞+\infty+∞ and −∞-\infty−∞ at zero. Smoothing optimizes over all subnormalized states in the purified-distance ball; every entropy radius satisfies 0≤ε<Tr⁡ρ0\le\varepsilon<\sqrt{\operatorname{Tr}\rho}0≤ε<Trρ​.

For the source SDP, primal extended infimum a≥dual extended supremum b; if a is finite and there exists a strictly positive dual variable Y with E†Y<K, then a=b and the primal infimum is attained.

b≤a;a∈R, ∃Y>0:E†(Y)<K⟹a=b=Tr⁡(KX∗) for a feasible X∗.b\le a;\qquad a\in\mathbb R,\ \exists Y>0:\mathcal E^\dagger(Y)<K\Longrightarrow a=b=\operatorname{Tr}(KX_*)\text{ for a feasible }X_*.b≤a;a∈R, ∃Y>0:E†(Y)<K⟹a=b=Tr(KX∗​) for a feasible X∗​.

This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
Formal statement
noncomputable section

open Filter

open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P07

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I J A B C D X Y Z : Type*}

variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]

variable [Fintype Z] [DecidableEq Z]

/-- NODE paper:1504.00233#6.sdpduality
§6.1.1: weak duality and Slater strong duality, arXiv:1504.00233v5, PDF p.92. -/
theorem semidefinite_duality [Nonempty I] [Nonempty J] (E : paperMat I →ₗ[ℂ] paperMat J) (K : paperMat I) (L : paperMat J)
    (hK : K.IsHermitian) (hL : L.IsHermitian) (hE : ∀ M : paperMat I, M.IsHermitian → (E M).IsHermitian) :
    sdpDual E K L ≤ sdpPrimal E K L ∧
    ((∃ a : ℝ, sdpPrimal E K L = (a:EReal)) →
      (∃ Y : paperMat J, Y.PosDef ∧ (K-paperAdjointAction E Y).PosDef) →
      sdpPrimal E K L = sdpDual E K L ∧ ∃ X : paperMat I, X.PosSemidef ∧ paperBelow L (E X) ∧
        ((K*X).trace.re:EReal) = sdpPrimal E K L) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 92, §6.1.1: weak duality and Slater strong duality
Read-back

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

Let I,JI,JI,J be nonempty finite types with decidable equality, let EEE be a complex-linear map from matrices on III to matrices on JJJ, and let K,LK,LK,L be Hermitian matrices on I,JI,JI,J, respectively. Assume that E(M)E(M)E(M) is Hermitian whenever MMM is Hermitian. Define the matrix E∗(Y)E^*(Y)E∗(Y) entrywise by

E∗(Y)ij=∑a,b∈JE(eij)ab‾ Yab,E^*(Y)_{ij}=\sum_{a,b\in J}\overline{E(e_{ij})_{ab}}\,Y_{ab},E∗(Y)ij​=a,b∈J∑​E(eij​)ab​​Yab​,

where eije_{ij}eij​ has a single entry 111 at (i,j)(i,j)(i,j), and define extended-real optimization values

p=inf⁡X⪰0E(X)−L⪰0Re⁡tr⁡(KX),d=sup⁡Y⪰0K−E∗(Y)⪰0Re⁡tr⁡(LY).p=\inf_{\substack{X\succeq0\\E(X)-L\succeq0}} \operatorname{Re}\operatorname{tr}(KX), \qquad d=\sup_{\substack{Y\succeq0\\K-E^*(Y)\succeq0}} \operatorname{Re}\operatorname{tr}(LY).p=X⪰0E(X)−L⪰0​inf​Retr(KX),d=Y⪰0K−E∗(Y)⪰0​sup​Retr(LY).

Then d≤pd\le pd≤p. If ppp equals some finite real number and there exists a matrix YYY such that both YYY and K−E∗(Y)K-E^*(Y)K−E∗(Y) are positive definite, then p=dp=dp=d and there exists X⪰0X\succeq0X⪰0 with E(X)−L⪰0E(X)-L\succeq0E(X)−L⪰0 and Re⁡tr⁡(KX)=p\operatorname{Re}\operatorname{tr}(KX)=pRetr(KX)=p, with the latter real value embedded into the extended reals. An empty primal feasible set has infimum +∞+\infty+∞, and an empty dual feasible set has supremum −∞-\infty−∞; neither feasibility nor finiteness is assumed for the unconditional inequality.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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