Quantitative comparison near order one
OpenQAlgorithms.Papers.Independent.Support50.P19.quantitative_relativeLet be density operators on a nonzero finite complex space with . Define
For ,
Here denotes Petz divergence in bits, and ordinary relative entropy. The local definition computes the two powers of two by their equal finite trace expressions, so no infinite divergence is silently converted to a real zero. This estimate controls the limit quantitatively.
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.22, (21), with (20): strict alpha cap and the half factors in renyiNu. -/
theorem quantitative_relative [Nonempty I] (rho sigma : {X : Matrix I I ℂ // IsDensityMatrix X}) (hsupp : Dominates sigma.1 rho.1)
(a : ℝ) (ha : 1 < a) (hcap : a < 1 + Real.logb 2 3 / (4 * Real.logb 2 (renyiNu rho.1 sigma.1))) :
sandwichedD a rho.1 sigma.1 ≤ relativeD rho.1 sigma.1 +
((4 * (a - 1) * (Real.logb 2 (renyiNu rho.1 sigma.1)) ^ 2 : ℝ) : EReal) := 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 a finite nonempty index type with decidable equality, and let be positive semidefinite complex matrices on , each of trace , satisfying . Define
where applies the real power to each nonzero eigenvalue and sends zero eigenvalues to . For every real satisfying
the following extended-real inequality holds:
Here , with the matrix logarithms assigning value at zero eigenvalues, and
The real correction term is embedded into the extended reals. In the underlying definitions both divergences are upon failure of the stated kernel inclusion; that failure is excluded here. No upper bound is a hypothesis of this declaration.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.