Numerical radii of nonnegative matrices (Q6924150)

The paper establishes a formula for the Schatten \(p\)-numerical radius of entrywise nonnegative matrices: Theorem 2.1 asserts that if \(A\) has nonnegative entries and \(p\ge 2\) is even, then\N\[\N\omega_p(A)=\lVert \operatorname{Re}(A)\rVert_p,\N\]\Nwhere \(\operatorname{Re}(A) = \frac 12(A+A^*)\) is the real part of \(A\). Consequences include monotonicity (\(0\le A\le B\) entrywise \(\Rightarrow \omega_p(A)\le \omega_p(B)\)), a refined power inequality \(\omega_p(A^2)\le [\omega_{2p}(A)]^2\), and an exact trace formula\N\[\N\omega_p^p(A)=\frac 1{2^p}\,\operatorname{tr}\!\Big(|A|^2+|A^*|^2+2\,\operatorname{Re}(A^2)\Big)^{p/2}.\N\]\NThe authors also show the equality holds for all \(p\ge2\) when \(A\) is \(2\times 2\), and give a \(3\times 3\) counterexample for \(p=3\), underscoring the necessity of even \(p\). Applications to block matrices include sharp bounds such as\N\[\N\omega\!\begin{pmatrix}A&B\\\NC&D\end{pmatrix} \le \max\{\omega(A),\omega(D)\}+\tfrac12\lVert B+C^*\rVert,\N\]\Nfor nonnegative blocks and exact identities like\N\[\N\omega\!\begin{pmatrix}0&B\\\NC&0\end{pmatrix}=\tfrac12\lVert B+C^*\rVert;\N\]\Nfor the \(p\)-numerical radius,\N\[\N\omega_p\!\begin{pmatrix}A&0\\\N0&B\end{pmatrix} =\big(\omega_p^p(A)+\omega_p^p(B)\big)^{1/p}, \qquad \omega_p\!\begin{pmatrix}0&A\\\NB&0\end{pmatrix} =2^{1/p-1}\lVert A+B^*\rVert_p.\N\]