Joint convexity of assemblage relative entropy
OpenQAlgorithms.Papers.Independent.Intakethird100.P36.assemblageEntropy_jointConvexityLet , and let and be normalized no-signaling assemblages with the same finite dimensions and alphabets. For positive real weights satisfying , the relative entropy defined in (18) obeys
Both mixtures use exactly the same weights and finite index family. Divergences may be infinite. This is joint convexity of the source’s adaptive-instrument assemblage divergence, used in proving convexity of the relative entropy of steering.
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 2, PDF p.11, (C2); proof pp.18–19. Positive weights on a
single nonempty finite family sum to one and mix both arguments identically. -/
theorem assemblageEntropy_jointConvexity {n : ℕ} (hn : 0 < n)
(p : Fin n → ℝ) (hp : ∀ j, 0 < p j) (hsum : ∑ j, p j = 1)
(rho sigma : Fin n → AssemblageBlocks d r s)
(hrho : ∀ j, IsNormalized (rho j)) (hsigma : ∀ j, IsNormalized (sigma j)) :
assemblageEntropy (assemblageFamilyMixture p rho) (assemblageFamilyMixture p sigma) ≤
∑ j, ENNReal.ofReal (p j) * assemblageEntropy (rho j) (sigma j) := 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, let be a natural number, and let be strictly positive real numbers with . For each , let be normalized families of complex matrices indexed by : this means , every block is positive semidefinite, the sum over is independent of , and the mass is one, where and ; the underlying assemblage condition also requires . Define the mixtures blockwise by and . The entropy used here is defined as follows. For square matrices of the same finite size, let unless are both positive semidefinite with trace one and ; when those conditions hold, let it be the nonnegative part of , where , matrix functions use functional calculus, and . Write . For every entropy strategy consisting of a natural number , matrices with , and nonnegative numbers with , put , , and let be block diagonal matrices with respective outcome blocks and . Put when , put when , and put when . Then is the supremum, over all such finite strategies, of . The declaration asserts
The inequality is in the extended nonnegative reals, real nonnegative weights are embedded into that space, and ; the entropies need not be finite. The hypotheses exclude both an empty mixture and zero mixture weights.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.