Theorem 8.1.4 — Joint convexity of matrix relative entropy
ProvedTroppMatrixConcentration.ch8_entropy_joint_convexFor every positive matrix dimension, the set of pairs of positive-definite complex matrices is convex, and the function is convex on this set. Thus for any two such pairs and any ,
The domain includes arbitrary noncommuting, unnormalized positive-definite matrices. This is the joint convexity statement supporting Lieb’s theorem.
import Definitions.Def_TroppMatrixConcentration_ch8_entropy open scoped Matrix.Norms.L2Operator ComplexOrder
namespace TroppMatrixConcentration
theorem ch8_entropy_joint_convex {d : ℕ} [NeZero d] :
ConvexOn ℝ {P : Matrix (Fin d) (Fin d) ℂ × Matrix (Fin d) (Fin d) ℂ |
P.1.PosDef ∧ P.2.PosDef} (fun P => ch8_relativeEntropy P.1 P.2) := by sorry
end TroppMatrixConcentration
Read-back
What the Lean code literally says, in plain math · gpt-6
For every natural number , let be the set of ordered pairs of complex positive-definite matrices (each matrix is Hermitian and its quadratic form is strictly positive on every nonzero vector). Define to be the continuous functional calculus of the real logarithm applied to ; for a positive-definite matrix, this applies the real logarithm to each positive eigenvalue. Define the real-valued function . Then is convex over , and for every and every pair of real numbers satisfying , one has . Convexity of asserts that both matrices in this combined pair are again positive definite. The weights may equal zero, including the two endpoint choices; dimension zero is excluded. No normalization of the traces or commutativity of the matrices is assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.