Abstract and Conjecture 19: conditional full preparation criterion
OpenQAlgorithms.Papers.Independent.Intakethird100.P95.conditionalCharacterizationLet 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 , 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 . Write for the supremum of the dual objective (28) over feasible coordinates whose associated matrix has rank exactly one; attainment is not assumed. Suppose, as a premise rather than a proved claim, that for every and every strictly positive finite probability vector. Then for every such instance,
This states the abstract’s full preparation criterion conditionally on the optimal-value equality implied by Conjecture 19.
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.1,5,8: the abstract's conditional criterion. The premise is explicitly
the conjectured equality of values (Conjecture 19's consequence), not a proved fact. -/
theorem conditionalCharacterization
(hconjecture : ∀ (d K : ℕ), 2 ≤ K → ∀ lam : Fin d → ℝ,
IsProbability lam → (∀ i, 0 < lam i) → primalValue K lam = rankOneValue K lam)
{d : ℕ} (K : ℕ) (hK : 2 ≤ K) (lam : Fin d → ℝ)
(hprob : IsProbability lam) (hpos : ∀ i, 0 < lam i) :
Reach (maximallyEntangledDensity K) (schmidtDensity lam) ↔ rankOneValue 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
For a vector , define and . Define , and for , on , and set , where . Let be the real infimum of subject to , , and . Let be the real supremum of
subject to the real coefficient bounds , , positive semidefiniteness of , and . Assume that for every pair of natural numbers with and every strictly positive probability vector . Under this assumption, for every natural , every , and every with , there exists a complex-linear, trace-preserving map such that and are completely positive and if and only if . Here , and has entries at and zero elsewhere; complete positivity requires positivity preservation under every finite identity amplification, including size zero. The probability hypotheses exclude , and neither ordering of nor a relation between and is assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.