Prove Lieb’s concavity theorem (Theorem 8.1.1, also stated as Theorem 3.4.1): for fixed Hermitian H, the function A ↦ tr exp(H + log A) is concave on positive-definite matrices. This is the deterministic foundation of Chapter 3’s probabilistic argument.
Milestones follow the book’s route through generalized Klein, relative-entropy nonnegativity, variational trace formulas, operator Jensen, matrix perspectives, and joint convexity of relative entropy. Logarithm and trace-exponential monotonicity are included as reusable comparisons. The domain allows noncommuting positive-definite matrices without trace normalization.
Source: Tropp, January 2015 version, Chapter 8. Lean statements compile; proofs remain open.
Shared definitions: Chapter 3; submit that draft first.
namespace TroppMatrixConcentration
theorem lieb_concavity {d : ℕ} [NeZero d]
(H : Matrix (Fin d) (Fin d) ℂ) (hH : H.IsHermitian) :
ConcaveOn ℝ {A : Matrix (Fin d) (Fin d) ℂ | A.PosDef}
(fun A => traceExp (H + matrixLog A)) := by sorry
end TroppMatrixConcentration
Fix a Hermitian complex matrix , with . The real-valued function
is concave on the convex cone of positive-definite complex matrices, viewed as a real convex set. The logarithm is the spectral matrix logarithm. This concavity result is a reusable matrix-analysis input to the concentration theory.
No open leaves. Every sub-goal is proved or awaiting decomposition.