A Norm Compression Inequality for Block Partitioned Positive Semidefinite Matrices
arXiv:math/0505680
Abstract
Let be a positive semidefinite matrix, block partitioned as $$ A=\twomat{B}{C}{C^*}{D}, $$ where and are square blocks. We prove the following inequalities for the Schatten -norm , which are sharp when the blocks are of size at least : and These bounds can be extended to symmetric partitionings into larger numbers of blocks, at the expense of no longer being sharp: and
24 pages