paper

On a Norm Compression Inequality for 2XN Partitioned Block Matrices

arXiv:math/0702186

Abstract

We conjecture the following so-called norm compression inequality for partitioned block matrices and the Schatten -norms: for , $$ ||({array}{cccc} A_1 & A_2 & ... & A_N B_1 & B_2 & >... & B_N {array})||_p \le ||({array}{cccc} ||A_1||_p & ||A_2||_p & ... & ||A_N||_p \ ||B_1||_p & ||B_2||_p & ... & ||B_N||_p {array})||_p $$ while for the ordering of the inequality is reversed. This inequality includes Hanner's inequality for matrices as a special case. We prove several special cases of this inequality and give examples for and larger partitionings where it does not hold.

arXiv comment22 pages; mistake in section on duality corrected, additional results added

Cited by in corpus (1)