grandes-ecoles 2015 Q8d

grandes-ecoles · France · x-ens-maths__pc Matrices Matrix Norm, Convergence, and Inequality
We denote by $a_{ii}$ for $1 \leqslant i \leqslant n$ the diagonal elements of $A \in \mathcal{S}_{n}(\mathbb{R})$ with ordered spectrum $a = s^{\downarrow}(A)$. Deduce that for every integer $1 \leqslant j \leqslant n$ $$\sum_{i=1}^{j} a_{i} = \sup_{\left(x_{1}, \ldots, x_{j}\right) \in \mathcal{R}_{j}} \sum_{i=1}^{j} \langle x_{i}, A x_{i} \rangle,$$ where $\mathcal{R}_{j}$ is the set of orthonormal families of cardinality $j$ in $\mathbb{R}^{n}$.
We denote by $a_{ii}$ for $1 \leqslant i \leqslant n$ the diagonal elements of $A \in \mathcal{S}_{n}(\mathbb{R})$ with ordered spectrum $a = s^{\downarrow}(A)$. Deduce that for every integer $1 \leqslant j \leqslant n$
$$\sum_{i=1}^{j} a_{i} = \sup_{\left(x_{1}, \ldots, x_{j}\right) \in \mathcal{R}_{j}} \sum_{i=1}^{j} \langle x_{i}, A x_{i} \rangle,$$
where $\mathcal{R}_{j}$ is the set of orthonormal families of cardinality $j$ in $\mathbb{R}^{n}$.