Sandwiched divergence is bounded by Petz divergence
OpenQAlgorithms.Papers.Independent.Support50.P19.sandwiched_le_petzLet be arbitrary operators on a positive-dimensional finite complex Hilbert space and let . Write for the unnormalized sandwiched divergence and for the unnormalized traditional Petz divergence, both in bits and both infinite when . Then
The logarithmic convention includes . Neither argument is required to have trace one. This comparison transfers traditional divergence bounds to the sandwiched quantity.
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.12, (13): comparison for all alpha>1 and arbitrary positive operators. -/
theorem sandwiched_le_petz [Nonempty I] (a : ℝ) (ha : 1 < a) (A B : Matrix I I ℂ)
(hA : A.PosSemidef) (hB : B.PosSemidef) : sandwichedD a A B ≤ petzD 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 any finite nonempty index set with decidable equality, let be real, and let be positive semidefinite complex matrices indexed by ; neither matrix is required to have trace one or to be nonzero. For a positive semidefinite matrix , write for the spectral function that sends a positive eigenvalue to and a zero eigenvalue to zero, including when . Define for and for . If , set ; otherwise set
Then , as an inequality in the extended real numbers. In particular, is included and gives both quantities the value ; support failure gives both quantities .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.