Pure inputs attain all the output-purity extrema
ProvedQAlgorithms.Papers.Independent.Support50.P31.pureInputExtremaLet be a completely positive trace-preserving linear endomorphism of the operators on a nonzero finite-dimensional complex Hilbert space. A density matrix is a positive semidefinite operator of trace one. Write in natural units, with ; write for the Schatten -norm, allowing for the operator norm, and for the least eigenvalue including zero. There exist unit vectors attaining each of the following extrema:
The extrema range over all density inputs. Different objectives may have different optimizing vectors. The assertion supplies pure optimizers and does not claim that every optimizer is pure.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P31
noncomputable section
open Filter Asymptotics
open scoped ComplexConjugate ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P31
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
open QAlgorithms.Papers.Independent.Information100.P63 (schatten)
open QAlgorithms.Papers.Independent.Gap48.P03 (holevoQuantity)
open QAlgorithms.Papers.Independent.Claimed50.P38 (tensorSuperop)
open QAlgorithms.Papers.Independent.Dependency50.P44 (tensorChannels)
/-- PDF pp.3–4: existence of pure optimizers for (4)–(6), not exclusivity.
Includes p = 1, infinity, and zero least eigenvalues. -/
theorem pureInputExtrema {I : Type} [Fintype I] [DecidableEq I] [Nonempty I]
(Phi : Superop I I) (hPhi : IsChannel Phi) :
(∀ p : ℝ≥0∞, 1 ≤ p → ∃ v : EuclideanSpace ℂ I, ‖v‖ = 1 ∧
pPurity p (Phi (pureDensity v)) = nuP p Phi) ∧
(∃ v : EuclideanSpace ℂ I, ‖v‖ = 1 ∧ entropy (Phi (pureDensity v)) = nuH Phi) ∧
(∃ v : EuclideanSpace ℂ I, ‖v‖ = 1 ∧
minEigenvalue (Phi (pureDensity v)) = nuMinus Phi) := by sorry
end QAlgorithms.Papers.Independent.Support50.P31
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite nonempty type with decidable equality, and let map complex matrices to complex matrices. Assume that there exist a natural number and matrices such that and for every matrix . Write for the positive semidefinite matrices of trace one, and, for a density matrix , define
where the eigenvalues are counted with multiplicity, and put with natural logarithms and , , and . Then for every extended nonnegative real , including , there exists a vector of Euclidean norm one such that ; there also exists a unit vector attaining , and there exists a unit vector attaining . These three existential assertions do not require their vectors to be the same, and the first vector may depend on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.