This paper fully characterizes the higher rank numerical ranges of Jordan-like matrices, providing insights into their extreme properties and offering concrete examples.
Contribution
It offers a complete characterization of higher rank numerical ranges for matrices combining Jordan blocks and scalar multiples of the identity, a novel theoretical result.
Findings
01
Complete characterization of higher rank numerical ranges for Jordan-like matrices
02
Identification of extreme properties of these numerical ranges
03
Provision of concrete examples illustrating these properties
Abstract
We completely characterize the higher rank numerical range of the matrices of the form Jn(α)⊕βIm, where Jn(α) is the n×n Jordan block with eigenvalue α. Our characterization allows us to obtain concrete examples of several extreme properties of higher rank numerical ranges.
Equations166
Λ1(T)={⟨Tx,x⟩:x∈H,∥x∥=1}.
Λ1(T)={⟨Tx,x⟩:x∈H,∥x∥=1}.
Λ1(T)={Tr(TP):P is a projection of rank one}
Λ1(T)={Tr(TP):P is a projection of rank one}
Wk(T)={Tr(TP):P is a projection of rank k}.
Wk(T)={Tr(TP):P is a projection of rank k}.
Λ1(T)={λ∈C: there exists a rank-one projection P with PTP=λP}
Λ1(T)={λ∈C: there exists a rank-one projection P with PTP=λP}
Λk(T)={λ∈C: there exists a rank-k projection P with PTP=λP},
Λk(T)={λ∈C: there exists a rank-k projection P with PTP=λP},
Λk(T)=Γ⊂{λ1,…,λn},∣Γ∣=n−k+1⋂convΓ,
Λk(T)=Γ⊂{λ1,…,λn},∣Γ∣=n−k+1⋂convΓ,
Λ1(T)={μ:Reeiθμ≤λ1(ReeiθT),0≤θ≤2π}
Λ1(T)={μ:Reeiθμ≤λ1(ReeiθT),0≤θ≤2π}
Λk(T)={μ:Reeiθμ≤λk(ReeiθT),0≤θ≤2π}.
Λk(T)={μ:Reeiθμ≤λk(ReeiθT),0≤θ≤2π}.
ϕk=n+1kπ,ψk,m=n+1(k−m)π.
ϕk=n+1kπ,ψk,m=n+1(k−m)π.
Dk={θ:∣β−α∣cosθ≤cosϕk}
Dk={θ:∣β−α∣cosθ≤cosϕk}
Ck,m=⎩⎨⎧{θ:∣β−α∣cosθ>cosψk,m},∅,k>mk≤m
Ck,m=⎩⎨⎧{θ:∣β−α∣cosθ>cosψk,m},∅,k>mk≤m
δk=⎩⎨⎧arccos(∣β−α∣1cosϕk),0,∣β−α∣≥∣cosϕk∣ and β=αotherwise
δk=⎩⎨⎧arccos(∣β−α∣1cosϕk),0,∣β−α∣≥∣cosϕk∣ and β=αotherwise
Rr,k={μ=x+iy∈C:x≤r, and (x−r)cotδk≤y≤(r−x)cotδk}.
Rr,k={μ=x+iy∈C:x≤r, and (x−r)cotδk≤y≤(r−x)cotδk}.
(x−r)cotθ≤y,0≤θ<δk.
(x−r)cotθ≤y,0≤θ<δk.
y≤(x−r)cotθ,−δk<θ<0.
y≤(x−r)cotθ,−δk<θ<0.
y≤(r−x)cotθ,0<θ<δk.
y≤(r−x)cotθ,0<θ<δk.
(x−r)cotθ≤y≤(r−x)cotθ,0<θ<δk.
(x−r)cotθ≤y≤(r−x)cotθ,0<θ<δk.
(x−r)cotδk≤y≤(r−x)cotδk.
(x−r)cotδk≤y≤(r−x)cotδk.
xcotδk−y≤rcotδk,xcotδk+y≤rcotδk.
xcotδk−y≤rcotδk,xcotδk+y≤rcotδk.
xcosδk−ysinδk≤rcosδk,xcosδk+ysinδk≤rcosδk.
xcosδk−ysinδk≤rcosδk,xcosδk+ysinδk≤rcosδk.
xcotδk±y≤rcotδk,
xcotδk±y≤rcotδk,
(x−r)cotδk≤±y.
(x−r)cotδk≤±y.
(x−r)cotδk≤y≤(r−x)cotδk.
(x−r)cotδk≤y≤(r−x)cotδk.
(x−r)cotθ≤(x−r)cotδk≤y,
(x−r)cotθ≤(x−r)cotδk≤y,
y≤(r−x)cotδk<−(r−x)cotθ=(x−r)cotθ,
y≤(r−x)cotδk<−(r−x)cotθ=(x−r)cotθ,
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.
Full text
Higher Rank Numerical Ranges of Jordan-Like Matrices
Martín Argerami
Department of Mathematics and Statistics, University of Regina
We completely characterize the higher rank numerical range of the matrices of the form Jn(α)⊕βIm, where Jn(α) is the n×n Jordan block with eigenvalue α. Our characterization allows us to obtain concrete examples of several extreme properties of higher rank numerical ranges.
Key words and phrases:
Numerical Range; Higher-Rank Numerical Range; Jordan Matrix
1991 Mathematics Subject Classification:
15A60,15B05
1. Introduction
For a linear operator T acting on a Hilbert space H, its numerical range is the set
[TABLE]
When H is finite-dimensional, which will always be the case for us, it is easy to see that Λ1(T) is compact. A less obvious fact is that it is always convex: this is the famous Toeplitz–Hausdorff Theorem. The (closure of, in the infinite-dimensional case) the numerical range of T always contains the spectrum σ(T). The numerical range has applications in and is related to many areas, like matrix analysis, inequalities, operator theory, numerical analysis, perturbation theory, quantum computing, and others, see [1, 2, 3, 4, 5, 6, 7, 8, 9] for a few examples. We refer a reader who is not familiar with the numerical range to [10, Chapter 1].
Being such a well-known and important object, several generalizations of the numerical range have been considered, though we will only mention two of them. If we write
[TABLE]
we get a generalization by taking different values for the rank of P; that way we get Halmos’ k-numerical range [11]:
[TABLE]
If we write
[TABLE]
we obtain as a generalization the higher rank k-numerical range [12]:
[TABLE]
that we consider in this paper.
For a given T, we have Λ1(T)⊃Λ2(T)⊃⋯ and each Λk(T) is compact and convex. This last fact—convexity—is not obvious and was proven independently by Woerdeman [13] and Li-Sze [6] by very different means.
Higher-rank numerical ranges have been calculated explicitly in some cases, but the list is fairly limited. The higher numerical range is invariant under unitary conjugation and respects translations—that is, Λk(T+βI)=β+Λk(T)—which expands a bit on whatever examples one has. For normal T it was conjectured in [14] and proven in [6] that
[TABLE]
where λ1,…,λn are the eigenvalues of T.
The first case where higher rank numerical ranges of non-normal operators were calculated explicitly is [15], where the author shows that Λk(T) is either a disk or empty whenever the n×n matrix T is a power of a shift. In [16] the authors determine the higher rank numerical ranges of direct sums of the form λI⊕A1⊕⋯⊕An, where the matrices Aj are 2×2, all with the same diagonal; this allows them—via unitary equivalence—to determine the higher numerical ranges of certain 2-Toeplitz tridiagonal matrices. In the cases where the structure of the chain Λ1(T),…,Λn(T) is determined explicitly, its structure is fairly simple, going from a fixed type of area (a disk in [15] and an ellipse in [16]) to the empty set. By contrast, the higher rank numerical ranges we find have more variety, see Theorem 3.7.
As in the aforementioned works, the convexity proof by Li–Sze gives us the tool that we use to calculate Λk in our examples (a method derived from Li–Sze’s formula (1.2) is considered in [17], but it does not look like it could be effectively used in our case). Recall the following well-known characterization of the numerical range: if λ1(T) denotes the largest eigenvalue of T, then by focusing on the convexity of the numerical range it is possible to prove that
[TABLE]
(see [10, Theorem 1.5.12]).
What Li and Sze showed is that that the equality (1.2) extends naturally to the generalization (1.1). Namely,
This is very useful from a practical point of view, because the inequality Reeiθμ≤λk(ReeiθT) describes a semi-plane in the complex plane, and one can sometimes plot or analyze the lines Reeiθμ=λk(ReeiθT) for each θ.
The paper is organized as follows. In Section 2 we develop some notation and discuss the sets that will arise in our description of higher rank numerical ranges. In Section 3 we determine explicitly the higher rank numerical ranges of matrices of the form Jn(α)⊕βIm. And in Section 4 we consider some applications and relations with previous work.
2. Preliminaries
We begin by developing a bit of notation to express the sets that will arise as higher rank numerical ranges.
Our data consists of m,n∈N with n≥2, k∈{1,…,n+m}, and α,β∈C. In terms of those numbers we will define angles ϕk,ψk,m,δk,ηk,m, sets Dk,Ck,m⊂R and DkB,Ck,mB⊂C, and cones Rr,k⊂C for some r≥0.
Define
[TABLE]
The numbers cosϕk and cosψk,m play an essential role in the statements and proofs to follow, so we encourage the reader to keep them in mind. In terms of these two numbers we define two subsets of the real line, depending also on α,β:
[TABLE]
and
[TABLE]
Note that we have −Dk=Dk and −Ck,m=Ck,m. These sets will only be relevant for k≤n/2. When n/2≥k>m we have ψk,m<ϕk<π and so cosϕk<cosψk,m; from this it is clear that we always have Dk∩Ck,m=∅.
To characterize the sets Dk and Ck,m we will define two auxiliary angles, δk and ηk,m. First, let
[TABLE]
We remark that 0≤δk≤π, and that cosϕk≥0 if and only if k≤2n+1.
Lemma 2.1**.**
We have
[TABLE]
Proof.
Assume first that δk>0; in particular, β=α. If θ∈[δk,2π−δk], we have cosθ≤cosδk. That is,
[TABLE]
and so θ∈Dk. Conversely, if θ∈Dk we have cosθ≤∣β−α∣1cosϕk=cosδk, so θ∈[δk,2π−δk]. Thus Dk=[δk,2π−δk].
When δk=0, we have ∣β−α∣≤∣cosϕk∣. If k≤2n+1, we have cosϕk≥0; then for any θ we have ∣β−α∣cosθ≤∣β−α∣≤∣cosϕk∣=cosϕk, so Dk=[0,2π]. And if k>2n+1, now cosϕk<0; then ∣β−α∣cosθ≤cosϕk<0 is impossible, giving us Dk=∅.
∎
Our second auxiliary angle is
[TABLE]
Lemma 2.2**.**
We have
[TABLE]
Proof.
Consider first the case where ηk,m>0 (note that this includes the case cosψk,m=0). If θ∈[0,ηk,m)∪(2π−ηk,m,2π], we have cosθ>cosηk,m=∣β−α∣1cosψk,m, so θ∈Ck,m. Conversely, if θ∈[ηk,m,2π−ηk,m] we have cosθ≤cosηk,m=∣β−α∣1cosψk,m, so θ∈Ck,m.
When ηk,m=0, we either have k≤m, in which case Ck,m=∅ by definition, or k>m. In this latter case we have ∣β−α∣≤∣cosψk,m∣. If cosψk,m>0, then ∣β−α∣cosθ>cosψk,m is impossible, and so Ck,m=∅; when cosψk,m<0, now ∣β−α∣cosθ≥−∣β−α∣≥−∣cosψk,m∣=cosψk,m. If the inequality is always strict, we have Ck,m=[0,2π]. Equality could only occur when cosθ=−1 and ∣β−α∣=−cosψk,m; but this last equality, unless β=α, implies ηk,m=π, contrary to our assumption of ηkm=0. And if β=α, Ck,m=[0,2π] since cosψk,m<0.
∎
Define, for each k, disjoint sets DkB,EkB⊂C, with C=DkB∪EkB, by
[TABLE]
We will write Br(λ) for the closed ball of radius r centered at λ. We allow r to be negative, in which case Br(λ)=∅. For r≥0 denote by Rr,k the cone
[TABLE]
For a graphic description of these regions, we defer to 3.8 and Remark 3.9.
Lemma 2.3**.**
Let x,y∈R, r≥0.
Assume that 0<δk<π.
Then the following conditions are equivalent:
(1)
xcosθ−ysinθ≤rcosθ* for all θ∈Dk;*
2. (2)
x+iy∈Rr,k;
3. (3)
xcosδk±ysinδk≤rcosδk.
Proof.
(1)⟹(2) Since we only consider θ∈Dk and δk>0, by Lemma 2.1 we may assume that −δk<θ<δk. Assume first that 0≤θ<δk, so that sinθ≥0. The case θ=0 (we have 0∈Dk by the hypothesis δk>0), gives us x≤r. When θ=0, dividing the inequality xcosθ−ysinθ≤rcosθ by sinθ, we get xcotθ−y≤rcotθ, which we rewrite as
[TABLE]
When −δk<θ<0, we have sinθ<0 and when we divide xcosθ−ysinθ≤rcosθ by sinθ, we get xcotθ−y≥rcotθ, so
[TABLE]
Replacing θ with −θ and using that cot(−θ)=−cotθ, the inequality (2.2) becomes
As the cotangent is decreasing on (0,π), we have cotδk≤cotθ if 0<θ<δk. From (x−r)≤0, we obtain (x−r)cotθ≤(x−r)cotδk; since y is at least as big as (x−r)cotθ for all θ∈(0,δk), we get that (x−r)cotδk≤y. Similarly, we have (r−x)cotδk≤(r−x)cotθ for all θ∈(0,δk), so
[TABLE]
(2)⟹(3) We may rewrite the inequality (x−r)cotδk≤y≤(r−x)cotδk as the two inequalities
[TABLE]
Since sinδk>0 we can multiply by sinδk to get
[TABLE]
(3)⟹(1) We have sinδk>0 by hypothesis. Dividing by sinδk we get
[TABLE]
or
[TABLE]
It follows that x−r is less than or equal both a non-negative and a non-positive number, so x−r≤0. Now rewrite (2.5) as
[TABLE]
If 0<θ<δk, using that the cotangent is decreasing and that x−r≤0 we obtain
[TABLE]
which we may write as xcosθ−ysinθ≤rcosθ (since sinθ>0). Similarly, when −δk<θ<0, we have (r−x)cotθ<(r−x)cot(−δk)=−(r−x)cotδk. Thus
[TABLE]
which is (after multiplying by sinθ, which is negative) xcosθ−ysinθ≤rcosθ. Thus
[TABLE]
3. Matrices of the form Jn(α)⊕βIm
As before, our data is m,n∈N with n≥2, k∈{1,…,m+n}, α,β∈C. We denote by Jn(α) the n×n Jordan block with eigenvalue α. Our goal is to calculate Λk(Jn(α)⊕βIm). For any T∈Mn(C), we will denote by λ1(T),…,λn(T) its eigenvalues in non-increasing order, counting multiplicities.
Consider T=Jn(α)⊕βIm∈Mn+m(C). Let ψ=arg(β−α). Then
[TABLE]
By considering Tα,β0 we are translating and rotating T so that the eigenvalue of the Jordan block is zero, and the eigenvalue of the scalar part is real and non-negative. Because translations and rotations apply trivially to the higher-rank numerical range, we will analyze the operators Tα,β0.
Our goal is to apply Theorem 1.1, so we need to calculate λk(ReeiθTα,β0).
3.1. The case k≤n
Lemma 3.1**.**
Let Tα,β0=e−iψJn(0)⊕∣β−α∣Im, and k∈{1,…,n}. Then
[TABLE]
Proof.
Since Tα,β0 is a block-diagonal sum of two matrices, its eigenvalues will be the union of the eigenvalues of each block. The only eigenvalue of
[TABLE]
is ∣β−α∣cosθ, with multiplicity m. For Re(eiθe−iψJn(0))=Re(ei(θ−ψ)Jn(0)), since unitary conjugation preserves the eigenvalues, we can apply the following well-known trick (it appears in [18], though it was likely known before). Write Jn(0)=∑k=1n−1Ek,k+1. Then
[TABLE]
Now we conjugate with the diagonal unitary ∑j=1neij(θ−ψ)Ejj:
[TABLE]
Thus the eigenvalues of Re(ei(θ−ψ)Jn(0)) are the same as those of Re(Jn(0)), and these are well-known to be {cosn+1jπ:j=1,…,n}; this can be seen by working explicitly with the eigenvectors
[TABLE]
The above calculation is mentioned explicitly in [18], where they mention that it was known to Lagrange. The eigenvalues indeed appear in [19, Page 76], although his argument does not seem to be as clear as Haagerup–de La Harpe’s.
Now we know that the eigenvalues of Re(eiθTα,β0) are ∣β−α∣cosθ (m times) and {cosn+1jπ:j=1,…,n}. These last n are already in non-increasing order. Remember that our goal is to find the kth entry in the list.
Consider first the case k≤m, where Ck,m=∅. If θ∈Dk then ∣β−α∣cosθ>cosϕk; this implies that the m instances of ∣β−α∣cosθ appear in the (ordered) list of eigenvalues of Re(eiθTα,β0) at most after cosn+1(k−1)π. As k≤m, the kth largest eigenvalue is then ∣β−α∣cosθ. When θ∈Dk, we now have ∣β−α∣cosθ≤cosϕk, so the first k elements in the ordered list of eigenvalues are {cosn+1jπ:j=1,…,k}. Thus the kth eigenvalue is cosϕk.
When m<k≤n, the situation is a bit different, since now Ck,m=∅. When θ∈Ck,m, we have ∣β−α∣cosθ>cosψk,m.
So the m elements ∣β−α∣cosθ appear, in the list of eigenvalues, before cosψk,m; the list of eigenvalues looks like
[TABLE]
As the m equal entries will always appear before cosn+1(k−m)π, the kth eigenvalue is cosn+1(k−m)π=cosψk,m. When θ∈[0,2π]∖(Dk∪Ck,m), the m eigenvalues ∣β−α∣cosθ sit somewhere between cosn+1(k−m)π and cosn+1kπ. Since there are at most k−1 elements of the form cosn+1jπ above the m elements ∣β−α∣cosθ in the list, now the kth eigenvalue is ∣β−α∣cosθ. Finally, when θ∈Dk, the first k eigenvalues in the list are cosn+1jπ, j=1,…,k, so the kth element in the list is cosn+1kπ=cosϕk.
∎
Proposition 3.2**.**
Let Tα,β0=e−iψJn(0)⊕∣β−α∣Im, and k≤n. Then
[TABLE]
where
[TABLE]
Proof.
We consider first the case k≤m or Ck,m=∅; in both cases we have Ck,m=∅. Throughout the proof, we will use Theorem 1.1 and Lemma 3.1 repeatedly.
Suppose first that μ∈Λk(Tα,β0). We write μ=∣μ∣eiξ=x+iy. We split in two complementary cases:
•
μ∈DkB. So ξ=argμ∈Dk. We have, for all θ∈Dk,
[TABLE]
As Dk=−Dk, we have that −ξ∈Dk, so
[TABLE]
That is, μ∈Bcosϕk(0).
•
μ∈EkB.
For all θ∈Dk,
[TABLE]
By Lemma 2.3, μ=x+iy∈R∣β−α∣,k and thus μ∈EkB∩R∣β−α∣,k.
Now, for the converse, we also consider two complementary cases:
•
μ∈DkB∩Bcosϕk(0). We have ξ=argμ∈Dk and ∣μ∣≤cosϕk. Then, for every θ∈Dk,
[TABLE]
and, for θ∈Dk,
[TABLE]
Now (3.1) and (3.2) together imply that μ∈Λk(Tα,β0).
•
μ∈EkB∩R∣β−α∣,k. So ξ=argμ∈Dk. For any θ∈Dk, and using Lemma 2.3,
[TABLE]
When θ∈Dk, by Lemma 2.1 the distance between θ and ξ is minimized at δk (if 0≤ξ≤π), or at −δk (if π<ξ<2π). Thus, using again Lemma 2.3,
[TABLE]
So μ∈Λk(Tα,β0).
When k>m, the above proof still applies, with the only exception of the case where μ∈Λk(Tα,β0) and μ∈EkB—that is, the second bullet above. We still get that μ∈R∣β−α∣,k, but now we can consider whether ξ∈Ck,m or not. Recall that ξ∈Dk since μ∈EkB. If ξ∈Ck,m, then we also have −ξ∈Ck,m. Then
[TABLE]
When ξ∈(Dk∪Ck,m), we have ηk,m≤ξ≤δk or 2π−δk≤ξ≤2π−ηk,m (Lemmas 2.1 and 2.2). Then
[TABLE]
So in both cases μ∈Bcosψk,m(0) and we are done.
∎
Now we can gather some insight on the shape of Λk(Tα,β0) when k≤n/2 (the case k>n/2 is always somewhat degenerate, as we will see). When k≤m, the convex set Λk(Tα,β0) is the union of two sets: DkB∩Bcosϕk(0) and EkB∩R∣β−α∣,k. The former is a circular sector, while the latter is the intersection of two cones. We refer the reader to Figures 2 and 2 to visualize the shape. What is not obvious from the description in Proposition 3.2 is how the two regions are joined. It turns out that the edges coming from the corner point ∣β−α∣ (or β in the general case) are tangent to the disk Bcosϕk precisely at the point where they intersect the edges of EkB. That is what we prove in the next two propositions.
Proposition 3.3**.**
If k≤n/2 and ∣β−α∣≤cosϕk, then Λk(Tα,β0)=Bcosϕk(0). That is, if the distance between the eigenvalue of the scalar block and eigenvalue of the Jordan block is less than cosϕk, the kth higher rank numerical range is a disk.
Proof.
The hypothesis ∣β−α∣≤cosϕk guarantees that Dk=[0,2π] and so DkB=C; thus EkB=∅ and the result follows from Proposition 3.2.
∎
Proposition 3.4**.**
If k≤n/2 and ∣β−α∣>cosϕk, then
[TABLE]
where X=C if k≤m, and X=Bcosψk,m(0) if k>m.
Moreover, the lines xcosδk±ysinδk=∣β−α∣cosδk that form the boundary of R∣β−α∣,k are tangent to the circle x2+y2=cos2ϕk (that is, to the boundary of Bcosϕk(0)).
Proof.
The condition k≤n/2 guarantees that cosϕk>0. When k>m (the only case where ψk,m matters) we always have cosψk,m>cosϕk (since 0<k−m<k≤n/2). So whenever z∈Bcosϕk(0), we have z∈Bcosψk,m(0).
If z∈EkB∩Bcosϕk(0), we have z=reiξ with 0≤r≤cosϕk and −δk<ξ<δk. Then (recall that δk<π/2 from k≤n/2)
[TABLE]
and so by Lemma 2.3 we have z=rcosξ+irsinξ∈R∣β−α∣,k. Thus
[TABLE]
which is the nontrivial inclusion.
Now for the lines, let us look the intersection of each of the two lines xcosδk±ysinδk=∣β−α∣cosδk and the circle x2+y2=cos2ϕk. Recall that ∣β−α∣cosδk=cosϕk. A point in the circle has coordinates (cosϕkcosθ,cosϕksinθ) for some θ. If this point belongs to the line xcosδk−ysinδk=cosϕk, we get
[TABLE]
The hypothesis k≤n/2 guarantees that cosϕk=0, so we get
[TABLE]
and thus θ=−δk. The slope of the line is cotδk; the slope of the circle at the point (cosϕkcos(−δk),cosϕksin(−δk)) is −1/tan(−δk)=cotδk, so the line is tangent to the circle.
The other line gives θ=δk, and a similar computation shows that it is also tangent to the circle.
∎
3.2. The case k>n
In this case we have ϕk≥π/2.
Recall that Ck,m=∅ if k≤m.
Lemma 3.5**.**
If Tα,β0=e−iψJn(0)⊕∣β−α∣Im and k>n, then
[TABLE]
As a consequence,
[TABLE]
Proof.
If θ∈Ck,m, this means by definition that that k>m and ∣β−α∣cosθ>cosψk,m. So the first k eigenvalues of Re(eiθTα,β0) will be
[TABLE]
where j∈{1,…,n−m−1}.
Thus the kth eigenvalue is cosn+1(k−m)π=cosψk,m. When θ∈Ck,m, the m numbers ∣β−α∣cosθ will sit after cosψk,m; that is the list looks like
[TABLE]
where now j∈{k−m+1,…,k}. Thus the kth eigenvalue will always be ∣β−α∣cosθ. That is,
[TABLE]
Now if μ=x+iy∈Λk(Tα,β0), we have by the above
[TABLE]
and
[TABLE]
Suppose that ∣β−α∣>cosψk,m. Then 0∈Ck,m; we get from (3.3), with θ=0, that x≤cosψk,m. If π∈Ck,m, we get from (3.4) that −x≤−∣β−α∣; so x≥∣β−α∣>cosψk,m and we get a contradiction. And if π∈Ck,m, now Ck,m=[0,2π] and so (3.3) gives us 0≤∣μ∣≤cosψk,m; but then, using that π∈Ck,m,
−∣β−α∣=∣β−α∣cosπ>cosψk,m giving us ∣β−α∣<−cosψk,m≤0, a contradiction. Thus Λk(Tα,β0)=∅ when ∣β−α∣>cosψk,m.
If ∣β−α∣≤cosψk,m, then Ck,m=∅, so (3.4) applies for all θ. Taking θ=±π/2, we get ±y≤0, so y=0. Then with θ=0 and θ=π we get
x≤∣β−α∣ and x≥∣β−α∣, so x=∣β−α∣. Now (3.4) reads ∣β−α∣cosθ≤∣β−α∣cosθ, which obviously holds for all θ and so Λk(Tα,β0)={∣β−α∣}.
When k≤m, we have Ck,m=∅ and the previous paragraph applies.
∎
We can now prove our main result. We remark that the area Bcosϕk(0)∪(EkB∩R∣β−α∣,k) below is precisely the sector {μ∈C:Reeiθμ≤r,δk≤θ≤2π−δk}; we use the former notation to avoid using δk in the statements.
Proposition 3.6**.**
*Let Tα,β0=eiψJn(0)⊕∣β−α∣Im. Let k∈{1,…,n+m}. Then Λk(Tα,β0) is as in the following table:
k≤2n,k≤m,∣β−α∣>cosϕk: Here ϕk<π/2, so cosϕk>0. By Proposition 3.4,
[TABLE]
3. (3)
k≤2n,k>m,∣β−α∣>cosϕk: Again ϕk<π/2, so cosϕk>0. By Proposition 3.4,
[TABLE]
4. (4)
k=2n+1≤m: now cosϕk=cosπ/2=0, so δk=π/2 and Dk=[π/2,3π/2]. From Proposition 3.2 we have
[TABLE]
Since cosϕk=0, the first intersection is {0}. And EkB consists of those μ with argμ∈(−π/2,π/2), that is with non-negative real part. As δk=π/2, we have cotδk=0, and with arguments like those in the proof of Lemma 2.3 we get that R∣β−α∣,k=(−∞,∣β−α∣]. So EkB∩R∣β−α∣,k=[0,∣β−α∣] and thus Λk(Tα,β0)=[0,∣β−α∣].
When k=2n+1>m and ∣β−α∣≤cosψk,m, even though k>m we have Ck,m=∅; then the exact reasoning from previous paragraph applies.
5. (5)
k=2n+1>m,∣β−α∣>cosψk,m: now Ck,m=∅. From Proposition 3.2 we have
[TABLE]
As in the previous step, we get EkB∩R∣β−α∣,k=[0,∣β−α∣], but now we also have to cut with Bcosψk,m(0). So Λk(Tα,β0)=[0,cosψk,m].
6. (6)
From k>(n+1)/2 we get that ϕk>π/2, so cosϕk<0. This makes DkB∩Bcosϕk(0)=∅ and ±π/2∈Dk. By Lemma 2.3, if x+iy∈R∣β−α∣,k, we have
[TABLE]
With θ=±π/2, we get ±y≤0, so y=0. Now the inequality (3.5) is xcosθ≤∣β−α∣cosθ for all θ∈Dk. Since δk>π/2, the set [0,2π]∖Dk contains θ with θ<π/2 and also θ with θ>π/2. Using these θ we get x≤∣β−α∣ and −x≤−∣β−α∣, so x=∣β−α∣. Thus R∣β−α∣,k={∣β−α∣} and so Λk(Tα,β0)={∣β−α∣}.
When n<k≤m: Lemma 3.5 gives us directly that Λk(Tα,β0)={∣β−α∣}.
When 2n+1<k, k>m, ∣β−α∣≤cosψk,m: Assume first that k≤n. From Proposition 3.2, and noting that cosϕk<0, we have
[TABLE]
Using, as above, that ±π/2∈Dk, we get that R∣β−α∣,k={∣β−α∣}. As ∣β−α∣≤cosψk,m, we have Λk(Tα,β0)={∣β−α∣}.
When k>n, k>m, and ∣β−α∣≤cosψk,m, Lemma 3.5 gives us the result.
7. (7)
2n+1<k, k>m, ∣β−α∣>cosψk,m: Assume first that k≤n. As in the previous cases, the only possible value for x is ∣β−α∣. But now the condition ∣β−α∣>cosψk,m means that ∣β−α∣∈Bcosψk,m(0), so by Proposition 3.2 we have Λk(Tα,β0)=∅.
Now we can do the rotated and translated version of Proposition 3.6. For this
we consider the translated and rotated versions of EkB and Rr,k,
[TABLE]
We will use the notation
[TABLE]
Finally, we get to write explicitly the higher rank numerical ranges of Jn(α)⊕βIm.
Theorem 3.7**.**
*Let T=Jn(α)⊕βIm. Let k∈{1,…,n+m}. Put ψ=arg(β−α). Then
Λk(T) is expressed by the following table:
T=Jn(α)⊕βIm
[TABLE]
Proof.
We have T=αIn+m+eiψTα,β0. So Λk(T)=α+eiψΛk(Tα,β0). Thus the result is a direct application of Proposition 3.6. Note that α+eiψ∣β−α∣=α+β−α=β, and
[TABLE]
Also,
[TABLE]
Examples 3.8**.**
We include a few graphic examples of Λk(Jn(α)⊕βIm). The graphs were produced with a Javascript program that draws the lines xcosθ−ycosθ=λk(T) for θ ranging (in degrees) from 1 to 359. This is not always an accurate representation, because in some cases the intersection of the semiplanes is empty but the lines still leave a clearly unshaded region; for this we produced a version of the script that indicates the semiplanes instead of just drawing the lines. This issue does not make an appearance in the examples we included. The tool is available upon request.
We can see in these pictures the situation described in Propositions 3.3 and 3.4.
(1)
In Fig. 2, the unshaded region represents Λ1(J4(0)⊕I4). In Fig. 2 we see Λ2(J4(0)⊕I4). Grid lines are set on integer multiples of 0.2.
2. (2)
In Fig. 4, we have Λ1(J5(−1−i)⊕(1−2i)I5), and in Fig. 4, we have Λ2(J5(−1−i)⊕(1−2i)I5)
Remark 3.9**.**
When m<n, a new radius, cosψk,m, makes an appearance if m<k≤n/2. In Fig. 4 this does not occur, but it does in Fig. 6, for Λ2(J5(−1−i)⊕(1−2i)). This is a case where Λk(T) is not a convex combination of certain (higher) numerical ranges of its direct summands. In Fig. 6 we can see a representation of the (areas corresponding to the) sets Dk—in blue—and Ck,m—in red.
4. Remarks and Applications
Remark 4.1**.**
The results in Theorem 3.7 and the accompanying images show concrete examples of the following result of Chang, Gau, and Wang (here Wk(T) denotes Halmos’ higher numerical range):
Let T∈Mn(C), k∈{1,…,n}, and β∈Λ1(T) a point that is a corner. The following statements are equivalent:
(1)
β* is a corner of Wk(T);*
2. (2)
β* is a corner of Λk(T);*
3. (3)
T* is unitarily equivalent to βIm⊕C, with m≥k and β∈Λ1(C).*
In particular, Figure 6 shows an example of how the corner β can disappear as soon as k>m. We note also that in the same example two new corners appear in Λ2(T), which are not eigenvalues. Thus there is no Donoghue’s Theorem [21] for k≥2.
Remark 4.3**.**
It was proven in [12, Proposition 2.2] that Λk(T) is at most a singleton when k>n/2. In the opposite direction, it was shown in [22] that, for T∈Mn(C), Λk(T) is always nonempty if k<n/3+1, and that it can be empty as early as k=n/3+1 in specific examples.
The example they give is of a normal operator, and they mention that their example can be perturbed to obtain a non-normal example. Here, Theorem 3.7 gives us a natural non-normal example. Indeed, in the context of Theorem 3.7 their n becomes n+m; if k=(n+m)/3+1 and m>(n−3)/2, then
[TABLE]
If we also require m<2n+1, it follows that k>m.
Taking α=0, β≥1, condition (7) in Theorem 3.7 guarantees that Λk(Jn(0)⊕βIm)=∅. So, for instance, with n=4, m=2, k=(n+m)/3+1=3 we have that Λ3(J4(0)⊕I2)=∅ and 3=k=6/3+1. Or, for another example, Λ5(J8(0)⊕I4)=∅, where k=5=312+1.
It is also possible to find cases where our examples have nonempty Λk(T) for fairly big k. Most examples in the literature of these extreme situations are normal, while—as we mentioned—ours are non-normal. One straightforward way to force the issue is to take very large m (the size of the scalar block) as then we will always have Λk(Tα,β0)=∅ for k=m. But nonempty higher rank numerical ranges for big k appear in our examples even without the need of a big m relative to n.
We see from Theorem 3.7 that Λk(Jn(α)⊕βIm)=∅ when k>m and cosψk,m<0. The condition cosψk,m≥0 is n+1(k−m)π≤2π, which we write as k≤m+2n+1. When n is odd and k=m+2n+1, we have cosψk,m=0. So to have Λk(Jn(α)⊕βIm)=∅ with the biggest possible k, we need (by 6 and 7 in Theorem 3.7) that ∣β−α∣=0. We also need k≤n+m−1 as Λn+m(Tα,β0)=∅. The condition m+(n+1)/2≤m+n−1 forces n≥3 and the equality can only occur when n=3.
To see an example of this consider T=J3(0)⊕0m∈M3+m(C). If we take k=2+m, then k>m and cosψk,m=0. As ∣β−α∣=0, we get from Theorem 3.7 that Λ2+m(T)={0}. An explicit rank-(m+2) projection P with P(J3(0)⊕0m)P=0 is given by
[TABLE]
Similarly, consider n=5. Now 2n+1=3<4=n−1. Since cosψ4+m=cos64π=−21, we have that Λ4+m(J5(α)⊕βIm)=∅ for any α,β. But Λ3+m(J5(0)⊕0m)={0} by case 4 in Theorem 3.7. As Λ3(J5(0))={0}, it is enough to find a projection Q∈M5(C), of rank 3, such that QJ5(0)Q=0. An easy concrete realization of such Q is
[TABLE]
If we put P=Q⊕Im, then P is a projection of rank 3+m and we have P(J5(0)⊕0m)P=05+m.
In general, if n=2ℓ+1, then Λℓ+1(J2ℓ+1(0))={0} and we can form Q=∑j=1ℓ+1E2j−1,2j−1 to get a rank-(ℓ+1) projection Q with QJ2ℓ+1(0)Q=0. Indeed,
[TABLE]
since k and k+1 cannot be both odd. Then P=Q⊕Im is a rank-(ℓ+1+m) projection with P(J2ℓ+1(0)⊕0m)P=02ℓ+1+m, showing explicitly (note that it also follows directly from case 6 in Theorem 3.7) that Λℓ+1+m(J2ℓ+1(0)⊕0m)={0}. For k=ℓ+2+m, we have cosψℓ+2+m,m=cos2ℓ+2(ℓ+2)π<0, so Λℓ+2+m(J2ℓ+1(0)⊕0m)=∅ by case 7 in Theorem 3.7.
Question 4.4**.**
The only way to have T∈Mn(C) with Λn(T)=∅ is to have T=βI for some β. We see from Remark 4.3 that Λ2+m−1(J2(0)⊕0m)=∅, and Λ3+m−1(J3(0)⊕0m)=∅, while Λn+m−1(Jn(α)⊕βIm)=∅ for n≥4 and any α,β.
This suggests the following question:
Given n≥4, does there exist non-normal T∈Mn(C) with Λn−1(T)=∅? The existence of a normal irreducible T∈Mn(C), not a scalar multiple of the identity, with Λn−1(T)=∅ was established in [22, Theorem 3].
Remark 4.5**.**
The following result due to J. Anderson. There is a nice proof in [23], where it is attributed to Pei-Yuan Wu (who published more general results in [24]). An infinite-dimensional version appears in [25], where the authors briefly discuss the story of the theorem and the various proofs that have been published.
Proposition 4.6** (J. Anderson).**
Let n≥2 and T∈Mn(C). Let α∈C, r>0. If Λ1(T)⊂Br(α) and ∣Λ1(T)∩∂Br(α)∣≥n+1, then Λ1(T)=Br(α).
One might be tempted to try to think of Λk(T) as the numerical range of some amplification/dilation of T. Actually, this works for some of our examples: for instance, we see from Theorem 3.7 that Λ2(J5(0)⊕I4)=conv(B1/2(0)∪{1})=Λ1(J2(0)⊕I4). But, at the same time Proposition 4.6, together with some of our examples above show that this is not the case in general. Concretely, if we look at the example from Fig. 6, namely Λ2(Jn(−1−i)⊕(1−2i)I1), we can see that the whole set is contained in the disk of radius cosψ2=cos5+1(2−1)π=23 centered at −1−i, and it shares a nontrivial part of the arc; thus Proposition 4.6 implies that Λ2(Jn(−1−i)⊕(1−2i)I1) is not the numerical range of any matrix. We also conclude that there is no analogue of Proposition 4.6 for any k>1.
Remark 4.7**.**
An easy and well-known property of the higher numerical range is that
[TABLE]
As Λk(T⊕S) is convex, it will always contain conv{Λk(T)∪Λk(S)}. But it is often the case that the inclusion is strict, as for instance when Λk(T⊕T) with T∈Mn(C) and k>n. In Theorem 3.7, case 2, we see that the inclusion (4.1) can be an equality for several values of k; indeed, under the conditions of case 2 we have Λk(Jn(α))=Bcosϕk(α), and Λk(βIm)={β} and Λk(Jn(α)⊕βIm)=convΛk(Jn(α))∪Λk(βIm).
Remark 4.8**.**
If T1,T2 are unitarily equivalent, then Λk(T1)=Λk(T2) for all k. The converse is known to be false in general [26]. The class of matrices of the form Jn(α)⊕βIm is rigid enough that the family of higher rank numerical ranges characterizes unitary equivalence (equality, actually). Namely,
Corollary 4.9**.**
Let Tj=Jnj(αj)⊕βjImj, j=1,2, such that n1+m1=n2+m2 and such that for all k we have Λk(T1)=Λk(T2). Then T1=T2.
Proof.
We refer to the cases that appear in the table in Theorem 3.7. Consider first k=1. From Theorem 3.7 we know that both T1,T2 fall in the same of cases 1 or 2. In both cases we have that part of the boundary of Λ1(Tj) is an arc of a circle of radius cosϕk centered at αj (the number cosϕk is in principle different for T1 and T2, but since we are arguing that in this case it is the same for both, there is no need for a particular notation for that). Thus α1=α2, and looking at the cosines we need 1/(n1+1)=1/(n2+1), so n1=n2 and then m1=m2.
If any of cases 2 or 3 arise for some k,
as the (extensions of the, in case 3) line segments intercept at β (recall that R∣β−α∣,kψ=α+eiψR∣β−α∣,k and α+eiψ∣β−α∣=β), we get that β1=β2.
If neither case 2 nor 3 arises, we are in case 1 for all 1≤k≤n/2 for both T1 and T2. So ∣β1−α∣,∣β2−α∣≤cosϕk<1 for all such k. Thus
[TABLE]
If case 6 arises for some k, we get β1=β2. And case 6 will always arise in the presence of (4.2); for if case 7 occurs already for k=⌊n/2⌋+1, we have mj<⌊n/2⌋+1 so
[TABLE]
and thus
[TABLE]
a contradiction.
∎
5. Acknowledgements
This work has been supported in part by the Discovery Grant program of the Natural
Sciences and Engineering Research Council of Canada grant RGPIN-2015-03762.
Bibliography26
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:11–15, 1973.
2[2] K. Bickel and P. Gorkin. Compressions of the shift on the bidisk and their numerical ranges. J. Operator Theory , 79(1):225–265, 2018.
3[3] H.-L. Gau and C.-K. Li. C ∗ superscript 𝐶 C^{*} -isomorphisms, Jordan isomorphisms, and numerical range preserving maps. Proc. Amer. Math. Soc. , 135(9):2907–2914, 2007.
4[4] T. Kato. Perturbation theory for linear operators . Classics in Mathematics. Springer-Verlag, Berlin, 1995. Reprint of the 1980 edition.
5[5] D. W. Kribs, A. Pasieka, M. Laforest, C. Ryan, and M. P. da Silva. Research problems on numerical ranges in quantum computing. Linear Multilinear Algebra , 57(5):491–502, 2009.
6[6] C.-K. Li and N.-S. Sze. Canonical forms, higher rank numerical ranges, totally isotropic subspaces, and matrix equations. Proceedings of the American Mathematical Society , 136(9):3013–3023, 2008.
7[7] C.-K. Li, B.-S. Tam, and P. Y. Wu. The numerical range of a nonnegative matrix. Linear Algebra Appl. , 350:1–23, 2002.
8[8] C.-K. Li. Inequalities relating norms invariant under unitary similarities. Linear and Multilinear Algebra , 29(3-4):155–167, 1991.