A bridge between quaternionic and complex numerical ranges
Lu\'is Carvalho, Cristina Diogo, S\'ergio Mendes

TL;DR
This paper establishes conditions under which quaternionic numerical ranges are convex for complex matrices, showing that real matrices always have convex quaternionic numerical ranges and fully characterizing the case for 2x2 real matrices.
Contribution
It introduces a sufficient condition linking quaternionic and complex numerical ranges, and characterizes the quaternionic numerical range for 2x2 real matrices.
Findings
Convexity of quaternionic numerical range for complex matrices under certain conditions.
Real matrices have convex quaternionic numerical range.
Complete characterization of quaternionic numerical range for 2x2 real matrices.
Abstract
We obtain a sufficient condition for the convexity of quaternionic numerical range for complex matrices in terms of its complex numerical range. It is also shown that the Bild coincides with complex numerical range for real matrices. From this result we derive that all real matrices have convex quaternionic numerical range. As an example we fully characterize the quaternionic numerical range of real matrices.
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.
A bridge between quaternionic and complex numerical ranges
Luís Carvalho
Luís Carvalho, ISCTE - Lisbon University Institute
Av. das Forças Armadas
1649-026, Lisbon
Portugal
,
Cristina Diogo
Cristina Diogo, ISCTE - Lisbon University Institute
Av. das Forças Armadas
1649-026, Lisbon
Portugal
and
Center for Mathematical Analysis, Geometry, and Dynamical Systems
Mathematics Department,
Instituto Superior Técnico, Universidade de Lisboa
Av. Rovisco Pais, 1049-001 Lisboa, Portugal
and
Sérgio Mendes
Sérgio Mendes, ISCTE - Lisbon University Institute
Av. das Forças Armadas
1649-026, Lisbon
Portugal
and Centro de Matemática e Aplicações
Universidade da Beira Interior
Rua Marquês d’Ávila e Bolama
6201-001, Covilhã
Abstract.
We obtain a sufficient condition for the convexity of quaternionic numerical range for complex matrices in terms of its complex numerical range. It is also shown that the Bild coincides with complex numerical range for real matrices. From this result we derive that all real matrices have convex quaternionic numerical range. As an example we fully characterize the quaternionic numerical range of real matrices.
Key words and phrases:
quaternions, numerical range
2010 Mathematics Subject Classification:
15B33, 47A12
The second author was partially supported by FCT through project UID/MAT/04459/2013 and the third author was partially supported by FCT through CMA-UBI, project PEst-OE/MAT/UI0212/2013.
1. Introduction
The quaternionic numerical range [Ki, R, STZ, To, Ye1, Ye2, Zh], the natural counterpart to the complex numerical range111From now on whenever a concept has no adjective it is because we are considering it over the quaternions.[GR], is the image of a quadratic operator over the unit sphere. A striking difference between the quaternionic and complex numerical ranges is convexity. Contrary to what happens in the complex case, the quaternionic numerical range is not convex in general (see, for instance, [R, Ye1, K]). Moreover, for a given finite operator it is very difficult to characterize its numerical range whose shape is, for the most part, unknown. A noticeable exception regarding the study of convexity and shape of the numerical range is the case of normal matrices (see [Ye1, Ye2, STZ]).
The numerical range is a subset of a -dimensional space and so it is hard to figure out its geometry. However we can still get a visualization of the numerical range through the Bild, its two dimensional equivalent, introduced by Kippenhahn [Ki]. Although tremendously useful to study the convexity and to represent the numerical range, to compute the Bild one needs first to compute the numerical range, which is algebraically very difficult. Even for matrices the full characterization of the numerical range is still unknown.
In this paper we obtain a sufficient condition for complex matrices to have convex quaternionic numerical range. It turns out that this condition only involves properties of the complex numerical range of the same matrix (see theorem 3.4). That is, to figure out if a quaternionic numerical range is convex we only need to compute the complex numerical range. We emphasize that the condition is not necessary, as a simple example shows, see remark 3.5. For the class of real matrices, or their unitary equivalent, we conclude that the quaternionic numerical range is always convex (see theorem 3.6). Specifically, we establish that the Bild and the complex numerical range are equal. This result is not true in general as Thompson has shown in [To]. Another consequence of this result is that we can now transport what happens in the complex case to the Bild and, by similarity, to the quaternionic numerical range (see theorem 3.7). The strength of these results is that it breaks off the usual difficulties to calculate and understand what is the numerical range. Using these results we fully characterize the numerical range of the real matrices (see example 4.1). In examples 4.2 and 4.3 we characterize the shape of certain classes of and complex matrices. The number of examples we could add is as big as the number of results that we have for real matrices in the complex case. It should also be noted that results on some other features of the numerical range, as the numerical radius or the Crawford number, may also be fully transposed to the quaternionic case.
2. Preliminaries
In this section we present some well known facts about quaternions and fix some notation. The quaternionic skew-field is an algebra of rank over with basis . The product in is given by . Denote the pure quaternions by . For any let and be the real and imaginary parts of , respectively. The conjugate of is given by and the norm is defined by . Two quaternions are called similar if there exists a unitary quaternion such that . Similarity is an equivalence relation and we denote by the equivalence class containing . A necessary and sufficient condition for the similarity of and is that .
Let denote , or . Let be the -dimensional -space. The disk with centre and radius is the set and its boundary is the sphere . In particular, if and , we simply write and . With this notation, the group of unitary quaternions is denoted by .
Let be the set of all matrices with entries over . For , and denote the conjugate and the conjugate transpose of , respectively. The set
[TABLE]
is called the numerical range of in . It is well known that the numerical range is invariant under unitary equivalence, i.e., , for every unitary .
Let . It is well known that if then . Therefore, it is enough to study the subset of complex elements in each similarity class. This set is known as , the Bild of
[TABLE]
Although the Bild may not be convex, the upper bild is always convex, see [Zh].
Taking into account that can be seen as a real subspace of , we denote the projection of over by . The projection of over is
[TABLE]
Given there exists an associated complex matrix
[TABLE]
where and .
Au-Yeung found [Ye1] necessary and sufficient conditions for the convexity of . One of these conditions is an equality between the Bild and the projection over of the numerical range. In [Ye2], he proved that the projection over of the numerical range is the complex numerical range of .
Theorem 2.1**.**
[Ye1, Ye2]** Let . Then is convex if and only if one the following statements hold:
- (i)
; 2. (ii)
.
3. On the convexity of the numerical range
Firstly, it should be noted that the complex numerical range is invariant under the transpose operator. This is a trivial conclusion of x^{*}Ax=\big{(}x^{*}Ax\big{)}^{t}=x^{t}A^{t}\overline{x}, for . We have:
Lemma 3.1**.**
Let . Then
The next proposition is the stepping stone of further results in the paper. It provides a more intuitive formulation of when is a complex matrix. As usual, denotes the convex hull of .
Proposition 3.2**.**
Let . Then .
Proof.
Since is complex,
[TABLE]
Then, denoting , with and , we have
[TABLE]
where the last equality is a consequence of convexity of the complex numerical range, lemma 3.1 and the following equality
[TABLE]
[TABLE]
∎
By theorem 2.1, we have that is convex if, and only if, . From Proposition 3.2 it follows:
Corollary 3.3**.**
Let . is convex if, and only if, .
Next theorem gives a sufficient condition for the convexity of quaternionic numerical range of a complex matrix in terms of the complex numerical range. This condition is a complex analogue of the well known result which states that is convex if and only if (see (ii) in theorem 2.1).
Theorem 3.4**.**
Let . If then is convex.
Proof.
We begin by proving the following result:
If is convex then is convex if, and only if, .
Suppose is convex. Then, given ,
[TABLE]
and so .
For the converse, suppose is non convex and consider , with and . We claim that . In fact, if , there is a point in the segment with such that , for some , which is impossible since is convex. Since
[TABLE]
we conclude that either or for if we would have .
Now, suppose . From , since is convex, is convex and so
[TABLE]
On the other hand, by corollary 3.3, is convex if, and only if, . Since , we may identify with a subset of . On the other hand, and, by similarity, . Hence, .
The converse inclusion comes from
[TABLE]
∎
Remark 3.5*.*
The previous sufficient condition is not necessary as a simple example clarifies. Take . We claim that the numerical range is the disk over the pure quaternions of radius centered at zero, .
Let , where . We may write
[TABLE]
where and . Since , clearly, and, by the triangle inequality,
[TABLE]
Hence, . Conversely, by similarity, it is enough to show that
[TABLE]
The set is the segment and, since the upper Bild is convex [Zh], we only need to prove that . Taking and in (3.1) we have that . To show that simply take and in (3.1).
From the previous discussion we conclude that is convex. On the other hand, the complex numerical range is the segment joining and , , and
[TABLE]
When the matrix is real we can improve further our previous results since in this case . From theorem 2.1 and proposition 3.2 we have
[TABLE]
Therefore,
[TABLE]
From the above we see that the Bild coincides with the complex numerical range. Using theorem 2.1, we conclude the following:
Theorem 3.6**.**
If then is convex.
This result is not true in general since Thompson [To] proved the existence of a quaternionic matrix whose upper Bild does not coincide with the upper part of the complex numerical range for any complex matrix. We can even find a way to compute out of the complex numerical range of . In fact, since is given by the equivalence classes of the Bild , from (3.2) we conclude:
Theorem 3.7**.**
Let . Then, W_{\mathbb{H}}(A)=\Big{[}W_{\mathbb{C}}(A)\Big{]}.
The above result essentially says that the quaternionic numerical range of a real matrix corresponds to the rotation in , over the reals, of the complex numerical range of .
4. Examples and applications
There is a vast class of complex matrices to which we can apply the previous results, namely theorem 3.4 and theorem 3.7, to conclude about convexity and shape of quaternionic numerical range. In this section we give some examples that show how we can transport some results from complex numerical range to the quaternionic setting. However, we would like to stress that there are as many examples as the known results for complex numerical range.
The first example provides a full characterization of the numerical range of real matrices. Naturally, as in the complex case, we have three possible and distinct cases: the numerical range is a line segment, a disk or an ellipsoid.
Example 4.1*.*
Let . By the Elliptical Range Theorem [GR], the complex numerical range of is an elliptical disc with foci , at the eigenvalues of . Notice that the numerical range of can be a line segment or a disk, which can be viewed as a degenerated ellipse. Since the matrix is real, its eigenvalues are real or a pair of complex conjugate.
If is normal, then is unitarily similar to a diagonal matrix . Then , if or W_{\mathbb{H}}(A)=\Big{[}W_{\mathbb{C}}(A)\Big{]}=\Big{[}[\lambda_{1},\overline{\lambda_{1}}]\Big{]}=\mathbb{D}_{\mathbb{P}}({Re}(\lambda_{1}),|{Im}(\lambda_{1})|), if , by theorem 3.7.
If is not normal, then is unitarily equivalent to an upper triangular matrix
[TABLE]
If , then W_{\mathbb{H}}(B)=\Big{[}W_{\mathbb{C}}(B)\Big{]}=\Big{[}\mathbb{D}_{\mathbb{C}}\left(\lambda_{1},\frac{|\omega|}{2}\right)\Big{]}=\mathbb{D}_{\mathbb{H}}\left(\lambda_{1},\frac{|\omega|}{2}\right). If , is the elliptical disk
[TABLE]
where and are the semiaxes. Let . From theorem 3.7 we have W_{\mathbb{H}}(B)=\Big{[}W_{\mathbb{C}}(B)\Big{]}, so
[TABLE]
Therefore, is a line segment, a disk or a 4-dimensional ellipsoid.
Example 4.2*.*
Let be the matrix
[TABLE]
with and . From [KRS, Theorem 4.1], is a disk with centre and radius . In this case so, from theorem 3.4, we have that is convex.
When, in addition, we have , i.e., is a real matrix with , we can characterize the shape of the quaternionic numerical range of . Since \Big{[}\mathbb{D}_{\mathbb{C}}(p,r)\Big{]}=\mathbb{D}_{\mathbb{H}}(p,r), it follows from theorem 3.7 that
[TABLE]
Example 4.3*.*
According to [BS, Corollary 2.3], if is unitarily equivalent to a matrix of the form
[TABLE]
then is an ellipse (see formulas of foci in [BS, Corollary 2.3]). If the foci of the ellipse are real or a pair of complex conjugate, the centre of the ellipse is real and . By theorem 3.4 we have is convex.
We can say more about the shape of the numerical range when is a real matrix. From theorem 3.7 and using the same reasoning of example 4.1 it follows that the quaternionic numerical range of A is a 4-dimensional ellipsoid centered at the real line.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BS] E. Brown, I. Spitkovsky, On matrices with elliptical numerical ranges . Linear and Multilinear Algebra, 52:3-4 (2004), 177–193, DOI:10.1080/0308108031000112589
- 2[GR] K. Gustafson, D. Rao, Numerical Range , Springer-Verlag, New York, 1997.
- 3[Ki] R. Kippenhahn, O n the numerical range of a matrix , Translated from the German by Paul F. Zachlin and Michiel E. Hochstenbach. Linear Multilinear Algebra 56:1-2 (2008), 185-225.
- 4[KRS] D. Keeler, L. Rodman, I. Spitkovsky, The numerical range of 3 × 3 3 3 3\times 3 matrices , Linear Algebra and its Applications, 252 (1997), 115–139
- 5[K] P. Kumar, A note on convexity of sections of quaternionic numerical range , Linear Algebra and its Applications, 572 (2019), 92–116.
- 6[R] L. Rodman, Topics in Quaternion Linear Algebra , Princeton University Press, 2014.
- 7[STZ] W. So, R. Thompson, F. Zhang, The numerical range of normal matrices with quaternion entries , Linear and Multilinear Algebra, 37 (1994), 175–195.
- 8[To] R. Thompson, The upper numerical range of a quaternionic matrix is not a complex numerical range , Linear Algebra and its Applications, 254:1-3 (1997), 19-28.
