Relative entropy decreases under positive trace-preserving maps
OpenQAlgorithms.Papers.Independent.Intakethird100.P46.relative_entropy_monotonicityLet and be complex separable Hilbert spaces, let denote all trace-class operators, and let be complex-linear, positive, and trace-preserving on every positive trace-class input. For arbitrary positive trace-class operators , with no trace normalization, support, or finite-entropy assumption,
Here is the literal unnormalized Umegaki relative entropy in natural units, interpreted as on support failure or a divergent logarithmic expectation, and . This gives data processing under positivity alone.
Formalization Note Arbitrary countable Hilbert bases represent the two separable spaces. The accepted corrected extended divergence is embedded in the extended reals and only the finite correction is subtracted.
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.2, Theorem 1, (3).
Countable arbitrary Hilbert bases represent exactly the separable Hilbert-space
setting; no eigenbasis, normalization, support, or finite-entropy premise is used. -/
theorem relative_entropy_monotonicity {I J : Type*} [Countable I] [Countable J]
(b : HilbertBasis I ℂ H) (c : HilbertBasis J ℂ K)
(Phi : (H →L[ℂ] H) → (K →L[ℂ] K))
(hPhi : PositiveTracePreservingBetween b c Phi)
(rho sigma : TraceClass H) (hrho : IsPositive rho.val) (hsigma : IsPositive sigma.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
For complex Hilbert spaces , countable index types , Hilbert bases and , and a function between bounded complex-linear operators, suppose preserves trace-class operators, is additive and complex homogeneous on them, and maps every positive trace-class operator to a positive operator with the same complex basis trace. Then, for every pair of positive trace-class operators on ,
Here trace class means admitting with summable; positivity means and for every ; the basis trace is ; and . The value is the supremum in over all finite orthonormal families, including the empty family, of the compressed-matrix quantity: for compressions , , take when , and otherwise take , where and matrix functions use continuous functional calculus. The outputs in the inequality carry the trace-class membership supplied by . Neither input must have trace one or be nonzero, and infinite entropy values are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.