Corollary 5: Renyi monotonicity from one half through infinity
OpenQAlgorithms.Papers.Independent.Intakethird100.P19.renyi_monotone_pureAll Hilbert spaces are finite-dimensional complex spaces with fixed product bases and positive local dimensions. States are positive semidefinite operators of trace one; pure kets have norm one. A non-entangling map is completely positive and preserves the full separable positive cone. A channel is also trace preserving. For every , every pure input , every pure output , and every non-entangling channel satisfying ,
The entropies use squared Schmidt coefficients and base-two logarithms, with the Shannon and min-entropy endpoint branches.
This constrains deterministic pure-state conversions.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P19
noncomputable section
open QAlgorithms QAlgorithms.Entanglement Filter
open scoped Matrix ComplexOrder ComplexConjugate ENNReal
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Intakethird100.P19
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Information100.P19 (Bip)
open QAlgorithms.Papers.Independent.Information100.P69 (CP)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)
open QAlgorithms.Papers.Independent.Dependency50.P19 (epr)
/-- Corollary 5, PDF p.10: deterministic pure-to-pure monotonicity,
including infinite order and the endpoint one half. -/
theorem renyi_monotone_pure {a b c d : ℕ}
(ha : 0 < a) (hb : 0 < b) (hc : 0 < c) (hd : 0 < d)
(alpha : RenyiOrder) (hhalf : (1 / 2 : ℝ≥0∞) ≤ alpha)
(psi : UnitBipartiteKet a b) (phi : UnitBipartiteKet c d)
(L : Superop (Fin a × Fin b) (Fin c × Fin d))
(hL : IsChannel L) (hne : NE L) (hconvert : L psi.rho = phi.rho) :
schmidtRenyi alpha phi.ket ≤ schmidtRenyi alpha psi.ket := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P19
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all positive natural numbers , every order with , and all unit vectors and , suppose is a map from operators on the first space to operators on the second that is a channel, preserves the separable positive cone, and satisfies . Here being a channel means that there is a finite family of matrices such that for every and ; the non-entangling hypothesis additionally requires a finite Kraus representation, without a normalization requirement on that representation, and preservation of every finite nonnegative sum of tensor products of positive semidefinite trace-one matrices, including the empty sum . Then . To define this quantity for a vector , let be the eigenvalues, in nonincreasing order and with multiplicities, of the matrix with entries , and let be the number of strictly positive . The definition is , , , and, for any other finite order , . The order-zero case is excluded by the hypothesis, while order one, infinite order, and zero eigenvalues are included; the real logarithm at zero is assigned the value .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.