Attained independent primal and dual descriptions of eta
OpenQAlgorithms.Papers.Independent.Intakethird100.P90.eta_sdp_dualityAll 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 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 be a bipartite state and its support projection. Define the primal and dual independently by
Both extrema are attained, and
where is the minimum of 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.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P90
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any nonempty finite types , each equipped with decidable equality, and every complex matrix indexed by satisfying and , define and let be the functional-calculus value at of the function that is zero at zero and one elsewhere. Let be the infimum of over Hermitian satisfying and . Define the primal value as the infimum of all real for which such a additionally satisfies and . Define the dual value as the supremum of over matrices indexed by satisfying
Then , , and ; there exists a Hermitian satisfying all four primal inequalities with , and there exist satisfying the displayed dual constraints whose objective equals . Finally, the quantity defined as satisfies . No restriction on the real variable is imposed separately from its matrix inequalities.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.