Proposition 9: Schmidt-coordinate primal SDP
OpenQAlgorithms.Papers.Independent.Intakethird100.P95.proposition9Let be a finite probability vector: every entry is nonnegative and the entries sum to one. Write . All logarithms have base two. A PPT operation is a completely positive, trace-preserving map such that is completely positive for arbitrary finite ancillary systems; transposes Bob in the fixed product basis. Assume in addition that all entries of are strictly positive, so is its Schmidt rank. For a positive integer , denotes the maximally entangled state of Schmidt rank . For , let be the minimum of the Schmidt-coordinate primal SDP (20), defined independently of operational reachability. Its real variables for and for obey and , and the matrix is positive semidefinite. The objective is . Here , while the off-diagonal symmetric and antisymmetric projectors are . The minimum is attained, and
This translates pure-state preparation into Schmidt-coordinate semidefinite optimization.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P95
noncomputable section
open scoped BigOperators Matrix ComplexOrder
open Filter
namespace QAlgorithms.Papers.Independent.Intakethird100.P95
attribute [local instance] Classical.propDecidable Classical.decEq
-- Exact primitives from the pinned accepted library; no local aliases.
open QAlgorithms.Papers.Independent.Claimed50.P28 (maximallyEntangledDensity)
open QAlgorithms.Papers.Independent.Information100.P27 (IsProbability)
open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)
open QAlgorithms.Papers.Independent.Information100.P19 (outer)
open QAlgorithms.Papers.Independent.Dependency50.P18 (bipartiteTensor)
open QAlgorithms.Papers.Independent.Support50.P11 (Loewner)
/-- PDF pp.5–6, Proposition 9: the primal minimum is attained and characterizes preparation. -/
theorem proposition9 {d : ℕ} (K : ℕ) (hK : 2 ≤ K) (lam : Fin d → ℝ)
(hprob : IsProbability lam) (hpos : ∀ i, 0 < lam i) :
IsLeast (primalValues K lam) (primalValue K lam) ∧
(Reach (maximallyEntangledDensity K) (schmidtDensity lam) ↔ primalValue K lam ≤ 1) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P95
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , with , and let satisfy for every and ; thus is excluded. For , let and, when , let ; for , let . Write for partial transposition on the second subsystem and define
Let consist of the real values for real coefficient families satisfying , , and , and put in . Then belongs to this set and is no greater than every member. Furthermore, with understood as the outer product of that vector with itself and , there exists a complex-linear, trace-preserving, completely positive map taking exactly to and remaining completely positive after partial transposition on the second subsystem before and after the map if and only if . Complete positivity includes every finite-dimensional identity amplification, and for the antisymmetric index set is empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.