All Questions
1 question
4
votes
2
answers
222
views
Bound on sum of $n$th super-diagonal entries in a $2n$ by $2n$ PSD matrix
Let $A,B,C\in\mathbb{R}^{n\times n}$ be such that
$\left(\begin{array}{} A & B \\ B^T & C \end{array}\right)\succeq 0$. I would like to prove that
$$\mathrm{trace}\,B \le \sum_{i=1}^n \sqrt{\...
- 392