§4.3.1 (4.52): pinching under CP preprocessing
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.cp_preprocessing_pinchingAll quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Tildes denote sandwiched Rényi quantities and bars denote Petz quantities. Their trace functionals are and ; the divergences include division by inside the logarithm. Matrix powers vanish on the kernel, including power zero. The notation means support inclusion.
For CP E,F,α>0 and positive operators in the stated domain, Qtilde_α(Eρ||Fσ)≤|specσ|^α Qtilde_α(E(Pσρ)||Fσ).
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#4.generalpinching
§4.3.1 (4.52): pinching under CP preprocessing, arXiv:1504.00233v5, PDF p.62,63. -/
theorem cp_preprocessing_pinching [Nonempty I] [Nonempty J] (r s : paperMat I)
(hr : IsDensityMatrix r) (hs : IsDensityMatrix s) (hc : paperSupported r s)
(E F : paperMat I →ₗ[ℂ] paperMat J) (hE : QAlgorithms.Entanglement.IsCompletelyPositive E)
(hF : QAlgorithms.Entanglement.IsCompletelyPositive F) (a : ℝ) (ha : 0 < a) :
paperRenyiQ true (E r) (F s) a ≤ ((spectralValues s).card:ℝ)^a*paperRenyiQ true (E (paperPinch s r)) (F s) a := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite, nonempty index types with decidable equality, let be positive semidefinite complex matrices indexed by , each of trace , and suppose . Let be complex-linear maps from matrices indexed by to matrices indexed by , each completely positive: for every natural number , including zero, its amplification by the identity on a -dimensional register sends every positive semidefinite block matrix to a positive semidefinite block matrix. Let . Write for functional calculus of the function equal to off zero and zero at zero, even for zero or negative exponents, and define
Let be the finite set of distinct eigenvalues of , including zero if present, let be functional calculus of the indicator of applied to , and set . Then
Neither map is required to preserve trace, their outputs may be zero, and no upper bound on is assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.