Equation (51) and Figure 1: rank-three catalytic region, strict boundary corrected
OpenQAlgorithms.Papers.Independent.Intakethird100.P95.rankThreeCatalysisLet 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. For a positive integer , denotes the maximally entangled state of Schmidt rank . Assume the target has three strictly positive probabilities in nondecreasing order. Then
This gives the finite-catalyst preparation region of Figure 1.
Source correction. Equation (51) prints a non-strict inequality, but Theorem 21 requires the strict inequality displayed here.
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 p.9, (51), CORRECTED BOUNDARY: printed ≤1 is replaced by <1, as required
by Theorem 21. The positive spectrum (1/18,1/18,8/9) has S_{1/2}=1 and
cannot be prepared with any finite catalyst, so the printed equality case is false. -/
theorem rankThreeCatalysis (lam : Fin 3 → ℝ) (hprob : IsProbability lam)
(hpos : ∀ i, 0 < lam i) (hsorted : Monotone lam) :
CatalyticPreparation 2 lam ↔
2 * (Real.sqrt (lam 2 * lam 1) + Real.sqrt (lam 2 * lam 0) +
Real.sqrt (lam 0 * lam 1)) < 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 every vector satisfying and , there exist an integer and a complex-linear, trace-preserving map sending to , with both and completely positive, if and only if
Here , and has entries at and zero elsewhere. Each tensor product groups the first factors together and the second factors together; transposes the latter factor, . Complete positivity requires positivity preservation under every finite identity amplification, including size zero, and trace preservation holds for every matrix. This equivalence imposes no additional requirement about whether conversion without the factor exists.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.