Data processing for both sandwiched quantities
OpenQAlgorithms.Papers.Independent.Support50.P19.monotonicityLet , let on a positive-dimensional finite complex input space, and let be a CPTP map to another such space. Then
The quasi-relative entropy is unnormalized and extended nonnegative; its base-two logarithmic divergence is extended real. The inputs need not be density operators. This gives monotonicity in precisely the order range proved in the paper.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P19
noncomputable section
open scoped Matrix ComplexOrder ComplexConjugate ENNReal
open Filter Topology
namespace QAlgorithms.Papers.Independent.Support50.P19
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Dependency50.P35
(tr Dominates spectralPower elog elogNN rawTrace cq)
open QAlgorithms.Papers.Independent.Dependency50.P09 (sandwichedD petzD relativeD)
open QAlgorithms.Papers.Independent.Information100.P56 (sandwichedTrace)
open QAlgorithms.Papers.Independent.Information100.P27 (average)
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel)
open QAlgorithms.Papers.Independent.Claimed50.P48 (FiniteKrausCP)
open QAlgorithms.Papers.Independent.Dependency50.P23
(UACode uaCodeSuccess ordinaryClassicalCapacity IsEB IsHadamard)
open QAlgorithms.Papers.Independent.Information100.P08 (Ensemble)
open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.Papers.Independent.Information100.P63 (tensorPower)
open QAlgorithms.Papers.Independent.Claimed50.P26
(CovariantIrreducible minOutput UnassistedExponentialConverse)
variable {I J K L : Type} [Fintype I] [Fintype J] [Fintype K] [Fintype L]
variable [DecidableEq I] [DecidableEq J] [DecidableEq K] [DecidableEq L]
/-- PDF p.14, Corollary 6: both monotonicity inequalities, on unnormalized positives. -/
theorem monotonicity [Nonempty I] [Nonempty J] (a : ℝ) (ha : 1 < a) (ha2 : a ≤ 2)
(A B : Matrix I I ℂ) (hA : A.PosSemidef) (hB : B.PosSemidef)
(N : Superop I J) (hN : IsChannel N) :
sandwichedTrace a (N A) (N B) ≤ sandwichedTrace a A B ∧
sandwichedD a (N A) (N B) ≤ sandwichedD a A B := by sorry
end QAlgorithms.Papers.Independent.Support50.P19
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty index sets with decidable equality, let , and let be positive semidefinite complex matrices indexed by , possibly zero and without trace normalization. Let be a map from matrices indexed by to matrices indexed by for which there are a natural number and matrices satisfying
For positive semidefinite , put , where spectral powers send zero eigenvalues to zero, and put . Define when , and otherwise in . Define under the same support failure, and otherwise , where for and for . Then
The first inequality is in the extended nonnegative reals and the second in the extended reals; in particular, a zero first matrix gives and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.