Sharp Quasi-Reverse Minkowski Inequality for Schatten Norms
Published 18 Aug 2026 in math.FA and math.CA | (2608.17565v1)
Abstract: Let ∣⋅∣p denote the Schatten p-norm and let ∣A∣=(A<sup>∗A)<sup>1/2. For $2\leq p<\infty$, let $x_p>1$ be the unique solution of xp<sup>p=2xp+1, and set [ C_p=\frac{\sqrt{x_p(x_p+1)}}{(x_pp+1){1/p}}. ] We prove the sharp inequality [ |A+B|_p\leq C_p\bigl||A|+|B|\bigr|_p ] for arbitrary complex matrices of arbitrary size. Equivalently, if q=p/(p−1) and R,X,Y are positive semidefinite, then [ |RX|_1+|RY|_1 \leq C_p|R|_q|X+Y|_p. ] For $1<p<2$, we also show that the formula proposed for the optimal constant fails. We give both a numerical counterexample and a systematic analytic construction.
The paper proves that for every p≥2, the optimal constant is C_p=√[x_p(x_p+1)]/(x_p^p+1)^(1/p), where x_p^p=2x_p+1, with C_∞=√2 and rank-one examples showing sharpness.
Its proof combines tensor domination, complex interpolation, and a rank-two reduction to control arbitrary matrices and derive an equivalent inequality for positive semidefinite operators.
For every 1<p<2, the proposed formula fails—including an explicit p=3/2 counterexample—and higher-dimensional examples suggest that determining the true sharp constant may require dimension-dependent analysis.
Background and problem statement
For a complex matrix A on a finite-dimensional Hilbert space H, write ∣A∣=(A∗A)1/2 and let ∥⋅∥p denote the Schatten p-norm. The paper studies the optimal constant cp in the inequality
∥A+B∥p≤cp∣A∣+∣B∣p,
a "quasi-reverse Minkowski" estimate comparing the norm of a sum of operators with the norm of the sum of their moduli. The p=2 case was conjectured by Lee and proved by Lin–Zhang, with alternative proofs due to Zamani and Zhang. Tang and Zhang subsequently posed the optimal-constant problem for m summands and proposed, for two summands, the explicit candidate
Cp=(xpp+1)1/pxp(xp+1),xp>1,xpp=2xp+1,
verifying it only at the endpoints H0. The paper under review settles this conjecture affirmatively for all H1, and refutes it for every H2.
Main result
The central theorem states that for all H3 and arbitrary matrices H4,
H5
with H6 exactly as above, and that the constant is sharp; at H7 the sharp constant is H8. An equivalent dual formulation (Corollary on positive semidefinite triples) reads: for H9 and positive semidefinite ∣A∣=(A∗A)1/20,
∣A∣=(A∗A)1/21
The sharpness example is elementary: take rank-one operators ∣A∣=(A∗A)1/22 and ∣A∣=(A∗A)1/23 with ∣A∣=(A∗A)1/24; the resulting quotient equals ∣A∣=(A∗A)1/25 identically.
Proof architecture
The argument combines three independent ingredients.
Tensor domination lemma. For positive semidefinite ∣A∣=(A∗A)1/26 with ∣A∣=(A∗A)1/27, the paper proves
∣A∣=(A∗A)1/28
The proof is operator-algebraic: after compressing to the support of ∣A∣=(A∗A)1/29, one forms Kraus operators ∥⋅∥p0 satisfying ∥⋅∥p1, so the associated completely positive trace-preserving map has spectral radius at most one. Its matrix representation ∥⋅∥p2 is similar to the positive matrix ∥⋅∥p3 with ∥⋅∥p4, forcing all eigenvalues into ∥⋅∥p5. A corollary extends this to two families ∥⋅∥p6, ∥⋅∥p7 simultaneously.
A Schatten-∥⋅∥p8 triangle-type inequality. Via the tensor result, the paper constructs a linear map ∥⋅∥p9 that is contractive both from p0 to p1 and from p2 to p3. Complex interpolation between these noncommutative p4 spaces (p5, p6) yields
p7
Reduction to rank two. The key scalar computation concerns p8 positive semidefinite of rank at most two, with eigenvalues p9. Schatten Cauchy–Schwarz gives cp0, and the ratio cp1 is maximized precisely when cp2, i.e., at cp3, where its value is cp4. Duality then converts this to cp5 for rank-two cp6.
The full theorem follows by decomposing cp7 along its left singular vectors cp8: each compression cp9 is rank one, and writing ∥A+B∥p≤cp∣A∣+∣B∣p,0, ∥A+B∥p≤cp∣A∣+∣B∣p,1 with ∥A+B∥p≤cp∣A∣+∣B∣p,2, the rank-two lemma bounds each singular value ∥A+B∥p≤cp∣A∣+∣B∣p,3 by ∥A+B∥p≤cp∣A∣+∣B∣p,4. Summing over ∥A+B∥p≤cp∣A∣+∣B∣p,5 and applying the interpolated inequality with ∥A+B∥p≤cp∣A∣+∣B∣p,6, ∥A+B∥p≤cp∣A∣+∣B∣p,7 completes the proof. The structure is clean: pointwise rank-two control plus a global summation device handles arbitrary dimension without approximation arguments.
Failure of the proposed formula for ∥A+B∥p≤cp∣A∣+∣B∣p,8
The paper shows the Tang–Zhang formula fails for every exponent in ∥A+B∥p≤cp∣A∣+∣B∣p,9, first numerically and then analytically. At p=20, the rank-one pair
p=21
gives quotient p=22, exceeding the proposed p=23 — a strict counterexample.
The systematic construction considers p=24, p=25 with real unit vectors and inner products p=26, p=27. The quotient becomes an explicit function p=28; for fixed p=29 its unique maximizer over m0 is interior, attained at
m1
and choosing m2 with m3 yields m4. The mechanism is transparent: the Tang–Zhang extremizer corresponds to m5 (aligned left vectors), which is suboptimal once m6 because the exponent penalizes concentration differently.
Notably, even m7 is not the true sharp constant: at m8 a three-dimensional example achieves quotient m9 while Cp=(xpp+1)1/pxp(xp+1),xp>1,xpp=2xp+1,0. This suggests the universal sharp constant may not be attained by any fixed configuration and may grow with ambient dimension — an observation the paper records without resolving.
Limitations and open questions
Three caveats qualify the results. First, the main theorem covers only Cp=(xpp+1)1/pxp(xp+1),xp>1,xpp=2xp+1,1; the range Cp=(xpp+1)1/pxp(xp+1),xp>1,xpp=2xp+1,2 is left entirely open, with the sharp constant Cp=(xpp+1)1/pxp(xp+1),xp>1,xpp=2xp+1,3 in Question stated but not computed — the paper's own analysis shows neither the Tang–Zhang formula nor the two-parameter maximization of Cp=(xpp+1)1/pxp(xp+1),xp>1,xpp=2xp+1,4 provides it. Second, the multi-summand version of the Tang–Zhang conjecture for Cp=(xpp+1)1/pxp(xp+1),xp>1,xpp=2xp+1,5 remains untouched; the tensor lemma and interpolation step are formulated for general Cp=(xpp+1)1/pxp(xp+1),xp>1,xpp=2xp+1,6, but the rank-reduction argument is specific to two summands. Third, the possibility that Cp=(xpp+1)1/pxp(xp+1),xp>1,xpp=2xp+1,7 over configurations increases with dimension (raised by the Cp=(xpp+1)1/pxp(xp+1),xp>1,xpp=2xp+1,8 example) means finite-dimensional computations cannot certify sharp constants in low exponents without a dimension-independent argument.
Conclusion
The paper resolves the two-summand optimal-constant problem for Schatten norms in the range Cp=(xpp+1)1/pxp(xp+1),xp>1,xpp=2xp+1,9: the Tang–Zhang closed-form constant H00, defined through the unique solution of H01, is correct and sharp, proved via a tensor domination lemma, complex interpolation of noncommutative H02 spaces, and exact rank-two reduction. In the complementary range H03 the same formula provably fails for every exponent, and the true sharp constant is identified as a genuinely open problem whose solution likely requires going beyond rank-one extremizers.