The PSD block-sum Schatten maximization conjecture

From papers

Let Q(i)=[Q(jk)(i)]j,k=12Q^{(i)}=[Q^{(i)}_{(jk)}]_{j,k=1}^2 be arbitrary positive semidefinite 2×22\times2 block matrices, and let qk(i)q^{(i)}_k be arbitrary non-negative numbers. For a matrix AA, write Aq\lVert A\rVert_q for its Schatten qq-norm. The PSD block-sum Schatten maximization conjecture. Under the constraints

Q(kk)(i)q=qk(i),\lVert Q^{(i)}_{(kk)}\rVert_q=q^{(i)}_k,

the maximum attainable value of iQ(i)q\left\lVert\sum_iQ^{(i)}\right\rVert_q is

(iq1(i)iq1(i)q2(i)iq1(i)q2(i)iq2(i))q.\left\lVert \begin{pmatrix} \sum_i q^{(i)}_1 & \sum_i\sqrt{q^{(i)}_1q^{(i)}_2}\\ \sum_i\sqrt{q^{(i)}_1q^{(i)}_2} & \sum_i q^{(i)}_2 \end{pmatrix} \right\rVert_q.

This is presented as an equivalent formulation of the proposed norm-compression inequality in the case p=2qp=2q. The supplied text does not establish its resolution.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Koenraad M. R. Audenaert, “On a Norm Compression Inequality for 2XN Partitioned Block Matrices”, arXiv:math/0702186 (2007).

Solutions 0

No solutions have been posted yet.