Audenaert–Kittenah Schatten norm compression conjecture

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

T=(A1A2ANB1B2BN).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)=(A1pA2pANpB1pB2pBNp).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 1p21\le p\le 2,

TpCp(T)p.\|T\|_p\ge \|C_p(T)\|_p.

For 2p2\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.

Sources & referencesView supporting material

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.