Proposition 3: PPT asymptotic pure-state cost and distillation
OpenQAlgorithms.Papers.Independent.Intakethird100.P95.proposition3Let 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 finite order , is the Rényi entropy, with the log support size, (using ), and otherwise. The separate infinity order is . Define PPT formation cost as the infimum, and PPT distillation as the supremum, of limiting rates along PPT protocols with positive block lengths , positive integer resource ranks , and trace norm error tending to zero. Rank-one resources are permitted for zero entanglement. Then
This identifies the reversible asymptotic pure-state entanglement rate under PPT operations.
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.3, Proposition 3: vanishing-error PPT cost and distillation both equal Shannon entropy. -/
theorem proposition3 {d : ℕ} (lam : Fin d → ℝ) (hprob : IsProbability lam) :
pptEntanglementCost lam false = (schmidtRenyi 1 lam : EReal) ∧
pptDistillableEntanglement lam false = (schmidtRenyi 1 lam : EReal) := 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 be any natural number and let satisfy for every and ; these assumptions exclude . Write , let with , and let for positive . A permitted transformation is a complex-linear map that preserves trace, is completely positive, and remains completely positive after partial transposition on the second subsystem both before and after the map; complete positivity means that every amplification by an identity map of finite dimension, including dimension zero, preserves positive semidefiniteness. Consider all real rates for which there are sequences of positive integers with and , together with such transformations taking to matrices converging in trace norm to the grouped tensor power . The infimum of these rates in the extended real numbers equals . Also, the supremum in the extended real numbers of the rates obtained in the reverse direction, using permitted transformations whose outputs on converge in trace norm to , equals the same number:
Here the finite real expression is embedded into the extended reals, zero-probability terms contribute zero under the total real logarithm, and the trace norm of is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.