Theorem 8.1.1 — Lieb concavity
ProvedTroppMatrixConcentration.lieb_concavityFix 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.
import Definitions.Def_TroppMatrixConcentration_probability import Definitions.Def_TroppMatrixConcentration_dilation import Mathlib.Analysis.Convex.Function open MeasureTheory ProbabilityTheory open scoped Matrix.Norms.L2Operator ComplexOrder
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
Read-back
What the Lean code literally says, in plain math · gpt-6
For every natural number and every complex matrix satisfying , let be the set of Hermitian matrices such that is a strictly positive real number for every nonzero vector . Define by applying the real logarithm to through the continuous functional calculus; for , this means whenever is a unitary diagonalization, with all . Define and , where the trace is the sum of the diagonal entries. Then is convex under real scalar combinations, and for every and every pair of real numbers satisfying , one has and . The quantifiers include , , and the endpoint weights and ; dimension zero and matrices that are singular or merely positive semidefinite are excluded from the asserted domain, and no concavity assertion is made outside .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.