# 2020-16 A convex function of matrices

Let $$A$$ be an $$n \times n$$ Hermitian matrix and $$\lambda_1 (A) \geq \lambda_2 (A) \geq \dots \geq \lambda_n (A)$$ the eigenvalues of $$A$$. Prove that for any $$1 \leq k \leq n$$
$A \mapsto \lambda_1 (A) + \lambda_2 (A) + \dots + \lambda_k (A)$
is a convex function.

GD Star Rating