Audenaert–Kittenah Schatten norm compression conjecture

About 2 years old · traced to

Let TTcolon obreak⨁j=1N(obreak⨁) obreak\bigoplus_{j=1}^N\bigl( obreak\bigoplus\bigr) be the partitioned operator

T=(A1A2⋯ANB1B2⋯BN).T=\begin{pmatrix} A_1&A_2&\cdots&A_N\\ B_1&B_2&\cdots&B_N \end{pmatrix}.

For its Schatten pp-norm compression, define

Cp(T)=(∥A1∥p∥A2∥p⋯∥AN∥p∥B1∥p∥B2∥p⋯∥BN∥p).C_p(T)=\begin{pmatrix} \|A_1\|_p&\|A_2\|_p&\cdots&\|A_N\|_p\\ \|B_1\|_p&\|B_2\|_p&\cdots&\|B_N\|_p \end{pmatrix}.

Audenaert–Kittenah conjecture. For 1≤p≤21\le p\le 2,

∥T∥p≥∥Cp(T)∥p.\|T\|_p\ge \|C_p(T)\|_p.

For 2≤p≤∞2\le p\le\infty, the inequality is reversed. The conjecture generalizes the cited two-row Schatten inequalities; the source notes that the positive case for N=2N=2 is known, while the full assertion is presented as conjectural.

References

Primary source

Teng Zhang, “Clarkson–McCarthy type inequalities, part I: _p–_p and _q–_p Schatten p-estimates”, arXiv:2410.21961 (2026).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.