where denotes theconjugate transpose of thevector. The numerical range includes, in particular, the diagonal entries of the matrix (obtained by choosingx equal to the unit vectors along the coordinate axes) and the eigenvalues of the matrix (obtained by choosingx equal to the eigenvectors).
Equivalently, the elements of are of the form, where is a Hermitianprojection operator from to a one-dimensional subspace.
In engineering, numerical ranges are used as a rough estimate ofeigenvalues ofA. Recently, generalizations of the numerical range are used to studyquantum computing.
A related concept is thenumerical radius, which is the largest absolute value of the numbers in the numerical range, i.e.
If is Hermitian, then it is normal, so it is the convex hull of its eigenvalues, which are all real.
Conversely, assume is on the real line. Decompose, where is a Hermitian matrix, and an anti-Hermitian matrix. Since is on the imaginary line, if, then would stray from the real line. Thus, and is Hermitian.
The elements of are of the form, where is projection from to a one-dimensional subspace.
The space of all one-dimensional subspaces of is, which is a 2-sphere. The image of a 2-sphere under a linear projection is a filled ellipse.
In more detail, such are of the form where, satisfying, is a point on the unit 2-sphere.
Therefore, the elements of, regarded as elements of is the composition of two real linear maps and, which maps the 2-sphere to a filled ellipse.
Proof of (2)
is the image of a continuous map from the, so it is compact.
Given two complex nonzero vectors, let be their corresponding Hermitian projectors from to their respective spans. Let be the Hermitian projector to the span of both. We have that is an operator on.
Therefore, the “restricted numerical range” of, defined by, is a closed ellipse, according to (12). It is also the case that if is nonzero, then. Therefore, the restricted numerical range is contained in the full numerical range of.
Thus, if contains, then it contains a closed ellipse that also contains, so it contains the line segment between them.
Proof of (5)
Let satisfy these properties. Let be the original numerical range.
Fix some matrix. We show that thesupporting planes of and are identical. This would then imply that since they are both convex and compact.
By property (4), is nonempty. Let be a point on the boundary of, then we can translate and rotate the complex plane so that the point translates to the origin, and the region falls entirely within. That is, for some, the set lies entirely within, while for any, the set does not lie entirely in.
The two properties of then imply that and that inequality is sharp, meaning that has a zero eigenvalue. This is a complete characterization of the supporting planes of.
The same argument applies to, so they have the same supporting planes.
For (2), if is normal, then it has a full eigenbasis, so it reduces to (1).
Since is normal, by the spectral theorem, there exists a unitary matrix such that, where is a diagonal matrix containing the eigenvalues of.
Let. Using the linearity of the inner product, that, and that are orthonormal, we have:
Proof (3)
By affineness of, we can translate and rotate the complex plane, so that we reduce to the case where has a sharp point at, and that the two supporting planes at that point both make an angle with the imaginary axis, such that since the point is sharp.
Since, there exists a unit vector such that.
By general property (4), the numerical range lies in the sectors defined by: At, the directional derivative in any direction must vanish to maintain non-negativity. Specifically: Expanding this derivative:
Since the above holds for all, we must have:
For any and, substitute into the equation: Choose and, then simplify, we obtain for all, thus.
The numerical range is equivalent to the following definition:This allows a generalization tohigher-rank numerical ranges, one for each:[6] is always closed and convex,[7][8] but it might be empty. It is guaranteed to be nonempty if, and there exists some such that is empty if.[9]
Dirr, G.; Helmkel, U.; Kleinsteuber, M.; Schulte-Herbrüggen, Th. (2006), "A new type of C-numerical range arising in quantum computing",Proc. Appl. Math. Mech.,6:711–712,doi:10.1002/pamm.200610336
Li, C.K. (1996), "A simple proof of the elliptical range theorem",Proc. Am. Math. Soc.,124 (7): 1985,doi:10.1090/S0002-9939-96-03307-2.
Keeler, Dennis S.; Rodman, Leiba; Spitkovsky, Ilya M. (1997), "The numerical range of 3 × 3 matrices",Linear Algebra and Its Applications,252 (1–3): 115,doi:10.1016/0024-3795(95)00674-5.