On a norm compression inequality for \(2\times N\) partitioned block matrices (Q2469507): Difference between revisions

A conjecture is made about the following so-called norm compression inequality for \(2\times N\) partitioned block matrices and the Schatten \(p\)-norms: for \(p\geq 2\), \[ \left\| \left(\begin{matrix} A_1 & A_2 & \dots & A_N\\ B_1 & B_2 & \dots & B_N \end{matrix}\right)\right\| _p \leqslant \left\| \left(\begin{matrix} \| A_1\| _p & \| A_2\| _p & \dots & \| A_N\| _p \\ \| B_1\| _p & \| B_2\| _p & \dots & \| B_N\| _p \end{matrix}\right)\right\| _p; \] for \(1\leq p\leq 2\) the ordering of the inequality being reversed. This inequality includes Hanner's inequality for matrices as a special case. The author establishes several special cases of this inequality and gives examples for \(3\times 3\) and larger partitionings where it does not hold.