Corollary 16: equality of S_oneHalf forbids nontrivial preparation
OpenQAlgorithms.Papers.Independent.Intakethird100.P95.corollary16Let 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 a finite order , is the Rényi entropy, with the log support size, (using ), and otherwise. The separate infinity order is . Let and . If , then
Thus the entropy equality case permits only the same maximally entangled nonzero spectrum, up to local unitaries.
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.7, Corollary 16: only-if, including the entropy equality boundary.
Full support makes equality of nonzero spectra exactly d=K and uniform entries. -/
theorem corollary16 {d : ℕ} (K : ℕ) (hK : 2 ≤ K) (lam : Fin d → ℝ)
(hprob : IsProbability lam) (hpos : ∀ i, 0 < lam i) (hd : K ≤ d)
(hentropy : schmidtRenyi (1 / 2) lam = logTwo (K : ℝ)) :
Reach (maximallyEntangledDensity K) (schmidtDensity lam) → d = K ∧ ∀ i, lam i = (K : ℝ)⁻¹ := 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 natural number , integer , and strictly positive probability vector , assume and
Define and define on by if and , and otherwise. If there exists a complex-linear map sending to , preserving the trace of every matrix, and such that both and are completely positive, then and for every . Here transposes the second tensor factor, , and complete positivity requires positivity preservation under every finite identity amplification, including size zero. Strict positivity and probability mean and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.