Strict feasibility, duality, and both optima attained
OpenQAlgorithms.Papers.Independent.Intakenext100.P98.blockSdp_strictFeasibility_attainmentLet , with , and let be complex-linear with a Stinespring pair of minimal environment dimension . Use the concrete block triple defined on PDF page 7, with , and . There are operators and such that
The primal supremum and dual infimum are equal, finite, and both attained: there exist primal and dual feasible with
This includes the zero map with its zero-dimensional minimal environment. The result supplies both optimality certificates for this particular SDP.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P98
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakenext100.P98
/-- PDF pp.8,10--11: strict feasibility on both sides, strong duality, and
attainment of both finite optima for the concrete p.7 triple. An empty minimal
environment is allowed; no minimum eigenvalue of an empty matrix is used. -/
theorem blockSdp_strictFeasibility_attainment {n m r : ℕ} (hn : 0 < n) (hm : 0 < m)
(Phi : (Matrix (Fin n) (Fin n) ℂ →ₗ[ℂ] Matrix (Fin m) (Fin m) ℂ)) (A B : (Matrix (Fin m × Fin r) (Fin n) ℂ))
(hpair : stinespringPairRepresents Phi A B) (hminimal : r = (watrousChoiMatrix Phi).rank) :
(∃ P : (Matrix (PrimalIndex n m r) (PrimalIndex n m r) ℂ),
P.PosDef ∧ (stinespringSdpBound r - stinespringSdpMap A P).PosDef) ∧
(∃ S : (Matrix (DualIndex r) (DualIndex r) ℂ),
S.PosDef ∧ (blockAdjoint A S - stinespringSdpObjective B).PosDef) ∧
blockPrimalValue A B = blockDualValue A B ∧
∃ (P : (Matrix (PrimalIndex n m r) (PrimalIndex n m r) ℂ)) (S : (Matrix (DualIndex r) (DualIndex r) ℂ)),
BlockPrimalFeasible A P ∧ BlockDualFeasible A B S ∧
(realTracePairing (stinespringSdpObjective B) P : EReal) = blockPrimalValue A B ∧
(realTracePairing (stinespringSdpBound r) S : EReal) = blockDualValue A B := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P98
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be natural numbers with and , let be any complex-linear map, and let satisfy for every , and , where , is the matrix unit, and . For a matrix on , with diagonal blocks , and a matrix on , with upper-left scalar and lower-right block , set
where . Define to be the extended-real supremum of over with , and to be the extended-real infimum of over with , embedding each real objective into the extended reals. The theorem asserts all of the following: there exists with and ; there exists with and ; ; and there exist matrices , with corresponding diagonal blocks and , such that
with the final equalities understood in the extended reals. Here and mean Hermitian positive semidefinite and Hermitian positive definite, respectively. No positivity or channel assumption is imposed on , and is allowed, using empty blocks and sums.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.