Lemma 8.1.6 — Attained variational formula for trace
ProvedTroppMatrixConcentration.ch8_variational_traceFor every positive-definite complex matrix of positive dimension,
The feasible matrices have the same size as . The assertion includes that every feasible value is bounded above by the displayed trace and that this value is attained. It is the source’s supremum formula with the attainment established in its proof retained explicitly.
import Definitions.Def_TroppMatrixConcentration_ch8_entropy open scoped Matrix.Norms.L2Operator ComplexOrder
namespace TroppMatrixConcentration
theorem ch8_variational_trace {d : ℕ} [NeZero d]
(M : Matrix (Fin d) (Fin d) ℂ) (hM : M.PosDef) :
IsGreatest {r : ℝ | ∃ T : Matrix (Fin d) (Fin d) ℂ,
T.PosDef ∧ r = (Matrix.trace (T * matrixLog M - T * matrixLog T + T)).re}
(Matrix.trace M).re := by sorry
end TroppMatrixConcentration
Read-back
What the Lean code literally says, in plain math · gpt-6
For every natural number and every positive-definite complex matrix , the real number is the greatest element of the set . Here positive definiteness includes being Hermitian and having strictly positive quadratic form on every nonzero complex vector, and denotes the matrix obtained by applying the real natural logarithm to through continuous functional calculus (equivalently, applying the logarithm to its positive eigenvalues in this setting). Explicitly, some such matrix attains , and every such matrix satisfies . The dimension-zero case is excluded; neither uniqueness of an attaining matrix nor a prescribed attaining matrix is asserted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.