Data processing of extended quantum relative entropy
OpenQAlgorithms.Papers.Independent.Intakethird100.P04.relative_entropy_data_processingLet be positive trace-class operators of trace one on an arbitrary complex Hilbert space , and let be a trace-preserving completely positive linear map on trace-class operators, with arbitrary output Hilbert space. Let denote Umegaki relative entropy in natural logarithm units, taking the value on support failure and allowing infinite relative entropy. Then
This expresses the loss of statistical distinguishability under physical processing. The author explicitly draws this known corollary from the overlap inequality; differentiability and entropy finiteness are not additional hypotheses.
Formalization Note The accepted extended relative entropy uses finite orthogonal compressions with the generalized trace correction; on normalized states it is Umegaki relative entropy in nats.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P04
noncomputable section
open Filter
open scoped ENNReal NNReal BigOperators ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakethird100.P04
attribute [local instance] Classical.propDecidable Classical.decEq
attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus
open QAlgorithms.Papers.Independent.Dependency50.P13
(State operatorTrace relativeEntropy)
open QAlgorithms.Papers.Independent.Support50.P20
(Effect traceAcceptance IsHilbertCPTP BlockHilbert blockBasis)
open QAlgorithms.Papers.Independent.Frontier18.P18 (boundedOperator)
variable {H K : Type*}
variable [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
variable [NormedAddCommGroup K] [InnerProductSpace ℂ K] [CompleteSpace K]
/-- Remark 2, PDF p.7, (33): extended Umegaki entropy data processing in nats,
including support failure and infinite entropy. Differentiability is not a premise.
The accepted finite-compression trace correction vanishes on normalized states. -/
theorem relative_entropy_data_processing {I J : Type*}
(b : HilbertBasis I ℂ H) (d : HilbertBasis J ℂ K)
(rho sigma : State b)
(Phi : (H →L[ℂ] H) → (K →L[ℂ] K)) (hPhi : IsHilbertCPTP b d Phi) :
relativeEntropy
⟨Phi rho.val.val, (hPhi.2.2.1 rho.val.val rho.val.property).1⟩
⟨Phi sigma.val.val, (hPhi.2.2.1 sigma.val.val sigma.val.property).1⟩ ≤
relativeEntropy rho.val sigma.val := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be complete complex inner-product spaces, with Hilbert bases and for arbitrary types . Define , and similarly for . A bounded operator is trace class here when it has a representation with , and is positive when it is self-adjoint and for every . Let be positive trace-class operators on with complex trace . Let be a function from bounded operators on to bounded operators on , additive and complex homogeneous on trace-class operators, mapping them to trace-class operators and preserving their complex traces. Assume it also preserves every finite positive operator block: for every and trace-class block , if is real and nonnegative for every tuple , the corresponding expression for is real and nonnegative as well. Then
For trace-class operators on a space , the quantity is defined as the supremum in , over every integer and every orthonormal family , of , where and . If , then ; otherwise it is
regarded as an extended nonnegative real, with and defined by continuous functional calculus and the scalar logarithm being the total real natural logarithm used in the code, including . The supremum includes the empty orthonormal family , and either side of the asserted inequality may be infinite; no finiteness assumption on these quantities is made. The output operators are supplied with the trace-class witnesses guaranteed by . No countability, separability, or nonzero-dimension assumption is imposed; uses total summation, returning zero for nonsummable families, and the state hypotheses have no instances when normalized states do not exist.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.