Assemblage relative entropy does not increase on average
OpenQAlgorithms.Papers.Independent.Intakethird100.P36.assemblageEntropy_averageMonotonicityLet be normalized finite-dimensional no-signaling assemblages with identical alphabets and Bob space, and let be the same complete Bob-to-Alice 1W-LOCC instrument applied to both. Write and . For the assemblage relative entropy of (18),
A summand is zero for , and is for . The quantities are extended nonnegative reals, and no support-inclusion assumption is imposed. This conditional average contraction is the distinguishability result used to obtain steering monotonicity.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P36
noncomputable section
open scoped BigOperators ENNReal ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakethird100.P36
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
attribute [local instance] Classical.propDecidable
variable {d r s df rf sf m : ℕ}
/-- Appendix C, Lemma 1, PDF p.11, (C1); proof pp.16–18. The two denominators
and the averaging law are kept distinct, with homogeneous zero-assemblageMass handling. -/
theorem assemblageEntropy_averageMonotonicity (P : SteeringProtocol d r s df rf sf m)
(hcomplete : P.Complete) (rho sigma : AssemblageBlocks d r s)
(hrho : IsNormalized rho) (hsigma : IsNormalized sigma) :
∑ w, entropyBranch P rho sigma w ≤ assemblageEntropy rho sigma := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P36
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be natural numbers, and let be a protocol whose six dimensions are positive. It supplies matrices , , with positive semidefinite, probability vectors over , and probability vectors over . Assume also that it is complete, . Let be normalized input assemblages: their blocks are positive semidefinite, their sums over outcomes are independent of the setting, and each has mass one, where for a family of dimensions one sets and ; an assemblage additionally requires positive dimensions and . To specify the entropy used in the conclusion, define to be infinity unless both matrices are positive semidefinite with trace one and ; otherwise it is the nonnegative part of , with , using matrix functional calculus and the convention . For probability-sized real vectors , define , using this same definition even if the vectors fail to define density matrices. An entropy strategy on dimensions consists of a natural number , square matrices with , and nonnegative numbers with . For a family , put and let be the block diagonal matrix whose outcome block is . Define to be if , infinity if , and zero if , where nonnegative real factors are embedded into . Define
For each protocol branch put , , and , and normalize a branch family as , using inverse zero equal to zero. The conclusion is
All sums, suprema, and inequalities involving are in the extended nonnegative reals, with ; no finiteness assumption is imposed on either entropy.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.