Relative entropy decreases when a positive trace-nonincreasing map preserves the first input trace
OpenQAlgorithms.Papers.Independent.Intakethird100.P46.relative_entropy_monotonicity_trace_nonincreasingLet be complex separable Hilbert spaces, and let be complex-linear, positive, and trace-nonincreasing on every positive trace-class input. Let be trace-class operators satisfying only the additional local equality . Then
The divergence is the unnormalized natural-log Umegaki relative entropy, with extended values and . No trace condition is imposed on , no global trace preservation is required, and no support or entropy-finiteness assumption is made. This identifies the input-dependent trace condition that suffices beyond trace-preserving maps.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P46
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
namespace QAlgorithms.Papers.Independent.Intakethird100.P46
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms
open QAlgorithms.Papers.Independent.Dependency50.P13
(IsTraceClass TraceClass IsPositive operatorTrace)
open QAlgorithms.Papers.Independent.Dependency50.P35 (Dominates)
open QAlgorithms.Papers.Independent.Bridge50.P49 (beigiSandwichedDivergence)
variable {H K : Type*}
[NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
[NormedAddCommGroup K] [InnerProductSpace ℂ K] [CompleteSpace K]
/-- Müller-Hermes–Reeb, arXiv:1512.06117v3, PDF p.3, Theorem 1', (6).
Global trace nonincrease is supplemented by trace preservation only at rho.
Neither global trace preservation nor preservation at sigma is assumed. -/
theorem relative_entropy_monotonicity_trace_nonincreasing
{I J : Type*} [Countable I] [Countable J]
(b : HilbertBasis I ℂ H) (c : HilbertBasis J ℂ K)
(Phi : (H →L[ℂ] H) → (K →L[ℂ] K))
(hPhi : PositiveTraceNonincreasingBetween b c Phi)
(rho sigma : TraceClass H) (hrho : IsPositive rho.val) (hsigma : IsPositive sigma.val)
(hTrace : operatorTrace c (Phi rho.val) = operatorTrace b rho.val) :
literalTraceClassRelativeEntropy c
(traceClassImage Phi hPhi.1 rho) (traceClassImage Phi hPhi.1 sigma) ≤
literalTraceClassRelativeEntropy b rho sigma := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P46
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let and be complete complex inner product spaces, let be countable index types, and let and be Hilbert bases of and , respectively. Here a bounded complex linear operator is called trace class if there exist sequences such that converges and for every ; write , and call positive when and for every . Let map bounded complex linear operators on to such operators on . Assume that maps trace-class operators to trace-class operators, is additive and complex homogeneous on trace-class operators, and, for every positive trace-class , satisfies and . Let be positive trace-class operators, and assume the complex trace equality . To specify the asserted quantity, for positive semidefinite finite matrices , put
where the matrix functions use continuous functional calculus and the logarithm is natural, with its total real convention . For trace-class on either space, define
The supremum defining is taken in , and is valued in the extended real numbers. Then
Neither input is required to have trace one or to be nonzero; zero-dimensional spaces and the empty orthonormal family are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.