Submultiplicativity of the numerical radius of commuting matrices of order two
Chi-Kwong Li, Yiu-Tung Poon

TL;DR
This paper provides an elementary proof that the numerical radius of the product of two commuting 2x2 matrices is at most the product of their numerical radii, including a characterization of cases where equality holds.
Contribution
It offers a simple proof of submultiplicativity of the numerical radius for commuting 2x2 matrices and characterizes the cases of equality.
Findings
Proof of $w(AB) \,\leq\, w(A)w(B)$ for commuting 2x2 matrices
Characterization of matrix pairs attaining equality
Elementary approach to a known inequality
Abstract
Denote by the numerical radius of a matrix . An elementary proof is given to the fact that for a pair of commuting matrices of order two, and characterization is given for the matrix pairs that attain the quality.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Advanced Topics in Algebra · Mathematics and Applications
Submultiplicativity of the numerical radius of
commuting matrices of order two
Chi-Kwong Li111 Department of Mathematics, College of William and Mary, Williamsburg, VA 23187. ([email protected]) and Yiu-Tung Poon222Department of Mathematics, Iowa Sate University, Ames, IA 50011. ([email protected])
Abstract
Denote by the numerical radius of a matrix . An elementary proof is given to the fact that for a pair of commuting matrices of order two, and characterization is given for the matrix pairs that attain the quality.
Dedicated to Professor Pei Yuan Wu.
AMS Classification. 47A12, 15A60.
Keywords. Numerical radius, submultiplicative.
1 Introduction
Let be the set of matrices. The numerical range and numerical radius of are defined by
[TABLE]
respectively. The numerical range and numerical radius are useful tools in studying matrices and operators. There are strong connection between the algebraic properties of a matrix and the geometric properties of . For example, if and only if ; if and only if ; if and only if is positive semi-definite.
The numerical radius is a norm on , and has been used in the analysis of basic iterative solution methods [2]. Researchers have obtained interesting inequalities related to the numerical radius; for example, see [4, 5, 6, 7, 8]. We mention a few of them in the following. Let be the operator norm of . It is known that
[TABLE]
While the spectral norm is submultiplicative, i.e., for all , the numerical radius is not. In general,
[TABLE]
if and only if ; e.g., see [3]. Despite the fact that the numerical radius is not submultiplicative,
[TABLE]
For a normal matrix , we have . Thus, for a normal matrix and any ,
[TABLE]
and also
[TABLE]
In case are normal matrices,
[TABLE]
Also, for any pairs of commuting matrices ,
[TABLE]
To see this, we may assume , and observe that
[TABLE]
The constant 2 is best (smallest) possible for matrices of order at least 4 because if and , where has at the position and [math] elsewhere; see [3, Theorem 3.1].
In connection to the above discussion, there has been interest in studying the best (smallest) constant such that
[TABLE]
for all commuting matrices with . For , the best constant is one; the existing proofs of the case depend on deep theory on analytic functions, von Neumann inequality, and functional calculus on operators with numerical radius equal to one, etc.; for example, see [6, 7].
Researchers have been trying to find an elementary proof for this result in view of the fact that the numerical range of is well understood, namely, is an elliptical disk with the eigenvalues as foci and the length of minor axis ; for example, see [10, 11] and [8, Theorem 1.3.6].
The purpose of this note is to provide such a proof. Our analysis is based on elementary theory in convex analysis, co-ordinate geometry, and inequalities. Using our approach, we readily give a characterization of commuting pairs of matrices satisfying , which was done in [3, Theorem 4.1] using yet another deep result of Ando [1] that a matrix has numerical radius bounded by one if and only if for some contractions and , where . Here is our main result.
Theorem 1
Let be nonzero matrices such that . Then . The equality holds if and only if one of the following holds.
- (a)
* or is a scalar matrix, i.e. of the form for some .*
- (b)
There is a unitary such that and with and .
One can associate the conditions (a) and (b) in the theorem with the geometry of the numerical range of and as follows. Condition (a) means that or is a single point; condition (b) means that , , are line segments with three sets of end points, , respectively, such that and .
2 Proof of Theorem 1
Let be commuting matrices. We may replace by and assume that . We need to show that .
Since , there is a unitary matrix such that both and are in triangular form; for example, see [9, Theorem 2.3.3]. We may replace by and assume that , and . The result is clear if or is normal. So, we assume that . Furthermore, comparing the entries on both sides of , we see that . Applying a diagonal unitary similarity to both and , we may further assume that . Let . We have . Then and with
, and .
Note that is the elliptical disk with boundary
[TABLE]
see [10] and [8, Theorem 1.3.6]. Replacing with for suitable , if necessary, we may assume that and are real.
Suppose with and the boundary of touches the unit circle at the point with . Then has boundary
[TABLE]
We claim that the matrix is a convex combination of and another matrix of the form for some such that .
To prove our claim, we first determine satisfying
[TABLE]
Since the boundary of touches the unit circle at the point , using the parametric equation
[TABLE]
of the boundary of , we see that the direction of the tangent at the intersection point is , which agrees with , the direction of the tangent line of the unit circle at the same point. As a result, we have
[TABLE]
Furthermore, since , we have
[TABLE]
**Assertion. **If , then .
If , then , and hence .
If , then , and so that the parametric equation of the boundary of in (1) becomes
[TABLE]
Since and , for all , we have
[TABLE]
Therefore, , which gives .
Now, we show that our claim holds with
[TABLE]
where if and if .
Note that is the elliptical disk with boundary , and for every , we have
[TABLE]
Therefore, . By the Assertion, . Hence is a convex combination of and .
Similarly, if touches the unit circle at with , then is a convex combination of
[TABLE]
with and . Let . Then . If , we may replace by so that will change to . So, we may further assume that .
By the above analysis, is a convex combination of and . Since for all and , the first three matrices have numerical radius 1. We will prove that
[TABLE]
It will then follow that , where the equality holds only when or .
For simplicity of notation, let and . Then
[TABLE]
Recall from (2) and (3) that and because . Since , we have
[TABLE]
where
[TABLE]
If , then . Assume that . We need to show that
[TABLE]
Because is an elliptical disk with boundary , it suffices to show that
[TABLE]
Note that
[TABLE]
Consequently, we have as asserted in (4). Moreover, by the comment after (4), if , then or . Conversely, if or , then we clearly have . The proof of the theorem is complete.
Acknowledgment
We would like to thank Professor Pei Yuan Wu, Professor Hwa-Long Gau, and the referee for some helpful comments. Li is an affiliate member of the Institute for Quantum Computing, University of Waterloo, and is an honorary professor of the Shanghai University. His research was supported by USA NSF grant DMS 1331021, Simons Foundation Grant 351047, and NNSF of China Grant 11571220.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] T. Ando, Structure of operators with numerical radius one, Acta Sci. Math. (Szeged) 34 (1973), 11–15.
- 2[2] O. Axelsson, H. Lu and B. Pollman On the numerical radius of matrices and its application to iterative solution methods, Linear and Multilinear Algebra, 37 (1994), 225-238.
- 3[3] H.L. Gau and P.Y. Wu, Extremality of numerical radii of matrix products, Linear Algebra Appl. 501 (2016), 17–36.
- 4[4] K.E. Gustafson and D.K.M. Rao, Numerical range: The Field of values of linear operators and matrices, Universitext, Springer-Verlag, New York, 1997.
- 5[5] P.R. Halmos, A Hilbert space problem book, D. Van Nostrand Co., Inc., Princeton (1967).
- 6[6] J.A.R. Holbrook, Inequalities of von Neumann type for small matrices, in: Function Spaces, K. Jarosz, ed., Marcel Dekker, New York, 1992, pp. 189-193.
- 7[7] J.A.R. Holbrook and J.P. Schoch, Theory vs. Experiment: Multiplicative Inequalities for the Numerical Radius of Commuting Matrices. In: Topics in Operator Theory. Operator Theory: Advances and Applications, vol 202. Birkhäuser Basel, 2010. pp. 273-284
- 8[8] R.A. Horn and C.R. Johnson, Topics in Matrix Analysis, Cambridge University Press, Cambridge, 1991.
