Numerical Uhlmann–Alberti SDP duality
OpenQAlgorithms.Papers.Independent.Intakenext100.P98.fidelity_sdp_dualityLet , , , and let be arbitrary vectors. Set , and . Write . The primal and dual problems of PDF page 13 and the two positive-definite infima satisfy
No normalization or minimal-environment assumption is made, and no positive-definite minimizer is asserted. These numerical equalities express the connection between Uhlmann’s and Alberti’s characterizations via SDP duality.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P98
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakenext100.P98
/-- PDF pp.13--15, equation (5) and the constrained PD infimum:
primal, PSD dual, constrained PD dual, and product infimum all have the
squared-fidelity value. This is numerical Uhlmann--Alberti duality, without
Section 3 minimal-rank assumptions or an assertion of a PD minimizer. -/
theorem fidelity_sdp_duality {m r : ℕ} (hm : 0 < m) (hr : 0 < r)
(u v : EuclideanSpace ℂ (Fin m × Fin r)) :
let f := (rootFidelity (traceLeft (pureDensity u)) (traceLeft (pureDensity v))) ^ 2
sSup ((fun a : ℝ => (a : EReal)) '' fidelityPrimalValues u v) = (f : EReal) ∧
sInf ((fun a : ℝ => (a : EReal)) '' fidelityDualValues u v) = (f : EReal) ∧
IsGLB (fidelityPDValues u v) f ∧ IsGLB (fidelityProductValues u v) f := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P98
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For positive natural numbers and arbitrary vectors , put , , define , and set , . With denoting conjugate transpose and denoting positive semidefiniteness, define
where the square roots are positive semidefinite matrix square roots. The supremum of and the infimum of , after embedding their values into the extended real numbers, both equal the embedded real number . Moreover, is the greatest real lower bound of and also of : it is at most every member of each set, and every real lower bound of either set is at most . Attainment of these bounds is not asserted here. Neither nor is required to be normalized or nonzero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.