Numerical range explained

n x n

matrix A is the set

W(A)=\left\{

x*Ax
x*x

\midx\inCn, x ≠ 0\right\}=\left\{\langlex,Ax\rangle\mid

n, \|x\|
x\inC
2=1\right\}

where

x*

denotes the conjugate transpose of the vector

x

. The numerical range includes, in particular, the diagonal entries of the matrix (obtained by choosing x equal to the unit vectors along the coordinate axes) and the eigenvalues of the matrix (obtained by choosing x equal to the eigenvectors).

Equivalently, the elements of W(A) are of the form \operatorname(AP), where P is a Hermitian projection operator from \C^2 to a one-dimensional subspace.

In engineering, numerical ranges are used as a rough estimate of eigenvalues of A. Recently, generalizations of the numerical range are used to study quantum computing.

A related concept is the numerical radius, which is the largest absolute value of the numbers in the numerical range, i.e.

r(A)=\sup\{|λ|:λ\inW(A)\}=

\sup
\|x\|2=1

|\langlex,Ax\rangle|.

Properties

Let sum of sets denote a sumset.

General properties

  1. The numerical range is the range of the Rayleigh quotient.
  2. (Hausdorff–Toeplitz theorem) The numerical range is convex and compact.

W(\alphaA+\betaI)=\alphaW(A)+\{\beta\}

for all square matrix

A

and complex numbers

\alpha

and

\beta

. Here

I

is the identity matrix.

W(A)

is a subset of the closed right half-plane if and only if

A+A*

is positive semidefinite.
  1. The numerical range

W( ⋅ )

is the only function on the set of square matrices that satisfies (2), (3) and (4).

W(UAU*)=W(A)

for any unitary

U

.

W(A*)=W(A)*

.
  1. If

A

is Hermitian, then

W(A)

is on the real line. If

A

is anti-Hermitian, then

W(A)

is on the imaginary line.

W(A)=\{z\}

if and only if

A=zI

.
  1. (Sub-additive)

W(A+B)\subseteqW(A)+W(B)

.

W(A)

contains all the eigenvalues of

A

.
  1. The numerical range of a

2 x 2

matrix is a filled ellipse.

W(A)

is a real line segment

[\alpha,\beta]

if and only if

A

is a Hermitian matrix with its smallest and the largest eigenvalues being

\alpha

and

\beta

.Normal matrices
  1. If A is normal, and x \in \operatorname(v_1, \dots, v_k), where v_1, \ldots, v_k are eigenvectors of A corresponding to \lambda_1, \ldots, \lambda_k, respectively, then \langle x,Ax\rangle \in \operatorname\left(\lambda_1, \ldots, \lambda_k\right).
  2. If

A

is a normal matrix then

W(A)

is the convex hull of its eigenvalues.
  1. If

\alpha

is a sharp point on the boundary of

W(A)

, then

\alpha

is a normal eigenvalue of

A

.Numerical radius

r( ⋅ )

is a unitarily invariant norm on the space of

n x n

matrices.

r(A)\leq\|A\|\operatorname{op

} \leq 2r(A) , where

\| ⋅ \|\operatorname{op

} denotes the operator norm.[1] [2] [3] [4]

r(A)=\|A\|\operatorname{op

} if (but not only if)

A

is normal.

r(An)\ler(A)n

.

Proofs

Most of the claims are obvious. Some are not.

General properties

The following proof is due to[5]

Numerical radius

Generalisations

Higher-rank numerical range

The numerical range is equivalent to the following definition:W(A) = \This allows a generalization to higher-rank numerical ranges, one for each

k=1,2,3,...

:[6] W_k(A) = \

Wk(A)

is always closed and convex,[7] [8] but it might be empty. It is guaranteed to be nonempty if

k<n/3+1

, and there exists some

A

such that

Wk(A)

is empty if

k\geqn/3+1

.[9]

See also

Bibliography

Books

Papers

Notes and References

  1. Web site: "well-known" inequality for numerical radius of an operator . StackExchange.
  2. Web site: Upper bound for norm of Hilbert space operator . StackExchange.
  3. Web site: Inequalities for numerical radius of complex Hilbert space operator . StackExchange.
  4. Web site: B4b hilbert spaces: extended synopses 9. Spectral theory. Hilary Priestley. Hilary Priestley. In fact, ‖T‖ = max(−mT, MT) = wT. This fails for non-self-adjoint operators, but wT ≤ ‖T‖ ≤ 2wT in the complex case..
  5. Davis . Chandler . June 1971 . The Toeplitz-Hausdorff Theorem Explained . Canadian Mathematical Bulletin . en . 14 . 2 . 245–246 . 10.4153/CMB-1971-042-7 . 0008-4395.
  6. Choi . Man-Duen . Kribs . David W. . Życzkowski . Karol . October 2006 . Higher-rank numerical ranges and compression problems . Linear Algebra and its Applications . en . 418 . 2-3 . 828–839 . 10.1016/j.laa.2006.03.019. subscription .
  7. Li . Chi-Kwong . Sze . Nung-Sing . 2008 . Canonical Forms, Higher Rank Numerical Ranges, Totally Isotropic Subspaces, and Matrix Equations . Proceedings of the American Mathematical Society . 136 . 9 . 3013–3023 . 0002-9939.
  8. Woerdeman . Hugo J. . 2008-01-01 . The higher rank numerical range is convex . Linear and Multilinear Algebra . 56 . 1-2 . 65–67 . 10.1080/03081080701352211 . 0308-1087. subscription .
  9. Li . Chi-Kwong . Poon . Yiu-Tung . Sze . Nung-Sing . 2009-06-01 . Condition for the higher rank numerical range to be non-empty . Linear and Multilinear Algebra . 57 . 4 . 365–368 . 10.1080/03081080701786384 . 0308-1087. 0706.1540 .