Numerical range

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Unsourced section In the mathematical field of linear algebra and convex analysis, the numerical range or field of values or Wertvorrat or Wertevorrat of a complex n×n matrix A is the set W(A)={𝐱∗A𝐱𝐱∗𝐱|𝐱∈ℂn, 𝐱≠0}={⟨𝐱,A𝐱⟩|𝐱∈ℂn, ‖𝐱‖2=1} where 𝐱∗ denotes the conjugate transpose of the vector 𝐱. 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 tr⁡(AP), where P is a Hermitian projection operator from ℂn 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⁡{|λ|:λ∈W(A)}=sup‖x‖2=1|⟨𝐱,A𝐱⟩|.

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.
  3. W(αA+βI)=αW(A)+{β} for all square matrix A and complex numbers α and β. Here I is the identity matrix.
  4. W(A) is a subset of the closed right half-plane if and only if A+A∗ is positive semidefinite.
  5. The numerical range W(⋅) is the only function on the set of square matrices that satisfies (2), (3) and (4).
  6. W(UAU∗)=W(A) for any unitary U.
  7. W(A∗)=W(A)∗.
  8. 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.
  9. W(A)={z} if and only if A=zI.
  10. (Sub-additive) W(A+B)⊆W(A)+W(B).
  11. W(A) contains all the eigenvalues of A.
  12. The numerical range of a 2×2 matrix is a filled ellipse.
  13. W(A) is a real line segment [α,β] if and only if A is a Hermitian matrix with its smallest and the largest eigenvalues being α and β.

Normal matrices

  1. If A is normal, and x∈span⁡(v1,…,vk), where v1,…,vk are eigenvectors of A corresponding to λ1,…,λk, respectively, then ⟨x,Ax⟩∈hull⁡(λ1,…,λk).
  2. If A is a normal matrix, then W(A) is the convex hull of its eigenvalues.
  3. If α is a sharp point on the boundary of W(A), then α is a normal eigenvalue of A.

Numerical radius

  1. r(⋅) is a unitarily invariant norm on the space of n×n matrices.
  2. r(A)≤‖A‖op≤2r(A), where ‖⋅‖op denotes the operator norm.[1][2][3][4]
  3. r(A)=‖A‖op if (but not only if) A is normal.
  4. r(An)≤r(A)n.

Proofs

Most of the claims are obvious. Some are not.

General properties

Template:Math proofThe following proof is due to[5]Template:Math proof

Template:Math proof

Template:Math proof

Normal matrices

Template:Math proof

Template:Math proof

Numerical radius

Template:Math proof

Generalisations

Higher-rank numerical range

The numerical range is equivalent to the following definition: W(A)={λ∈ℂ:PMP=λP for some Hermitian projector P of rank 1}. This allows a generalization to higher-rank numerical ranges, one for each k=1,2,3,…:[6] Wk(A)={λ∈ℂ:PMP=λP for some Hermitian projector P of rank k}. 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≥n/3+1.[9]

See also

Bibliography

Books

Papers

References

Template:Reflist

Template:Functional analysis