ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let 4A1,ldots,AninBp(H)4A_1,ldots,A_nin \mathbb{B}_p(\mathscr{H}). Let q>0q>0 satisfy

1p+1q=1.\frac{1}{p}+\frac{1}{q}=1.

Audenaert–Kittaneh's conjecture. For 1<p≤21<p\le 2,

∥∑i=1nAi∥pq+∑1≤i<j≤n∥Ai−Aj∥pq≤n(∑i=1n∥Ai∥pp)qp,\left\| \sum_{i=1}^nA_i\right\| _p^q+\sum_{1\le i<j\le n}\|A_i-A_j\|_p^q\le n\left( \sum_{i=1}^n\|A_i\|^p_p\right)^\frac{q}{p},

and for p≥2p\ge 2,

n(∑i=1n∥Ai∥pp)qp≤∥∑i=1nAi∥pq+∑1≤i<j≤n∥Ai−Aj∥pq.n\left( \sum_{i=1}^n\|A_i\|^p_p\right)^\frac{q}{p}\le \left\| \sum_{i=1}^nA_i\right\| _p^q+\sum_{1\le i<j\le n}\|A_i-A_j\|_p^q.

The conjecture is a several-operator extension of the Clarkson–McCarthy inequalities. The paper proves the first inequality for 1<p≤21<p\le 2 and obtains the reverse inequality for 2≤p<∞2\le p<\infty from a duality theorem, so the conjecture is solved.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.