Numerical range

From Wikipedia, the free encyclopedia

Template:Short description 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)}=supx2=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 xspan(v1,,vk), where v1,,vk are eigenvectors of A corresponding to λ1,,λk, respectively, then x,Axhull(λ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)Aop2r(A), where op denotes the operator norm.[1][2][3][4]
  3. r(A)=Aop 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

Page Template:Math proof/styles.css has no content.

Proof of (13)

If A is Hermitian, then it is normal, so it is the convex hull of its eigenvalues, which are all real.

Conversely, assume W(A) is on the real line. Decompose A=B+C, where B is a Hermitian matrix, and C an anti-Hermitian matrix. Since W(C) is on the imaginary line, if C0, then W(A) would stray from the real line. Thus C=0, and A is Hermitian.

The following proof is due to[5]Page Template:Math proof/styles.css has no content.

Proof of (12)

The elements of W(A) are of the form tr(AP), where P is projection from 2 to a one-dimensional subspace.

The space of all one-dimensional subspaces of 2 is 1, which is a 2-sphere. The image of a 2-sphere under a linear projection is a filled ellipse.

In more detail, such P are of the form 12I+12[cos2θeiϕsin2θeiϕsin2θcos2θ]=12[1+zx+iyxiy1z] where x,y,z, satisfying x2+y2+z2=1, is a point on the unit 2-sphere.

Therefore, the elements of W(A), regarded as elements of 2 is the composition of two real linear maps (x,y,z)12[1+zx+iyxiy1z] and Mtr(AM), which maps the 2-sphere to a filled ellipse.

Page Template:Math proof/styles.css has no content.

Proof of (2)

W(A) is the image of a continuous map xx,Ax from the n, so it is compact.

Given two complex nonzero vectors x,y, let Px,Py be their corresponding Hermitian projectors from n to their respective spans. Let P be the Hermitian projector to the span of both. We have that PAP is an operator on Span(x,y).

Therefore, the “restricted numerical range” of PAP, defined by {Tr(PAPPz):zSpan(x,y),z0}, is a closed ellipse, according to (12). It is also the case that if zSpan(x,y) is nonzero, then Tr(PAPPz)=Tr(APPzP)=Tr(APz)W(A). Therefore, the restricted numerical range is contained in the full numerical range of A.

Thus, if W(A) contains Tr(APx),Tr(APy), then it contains a closed ellipse that also contains Tr(APx),Tr(APy), so it contains the line segment between them.

Page Template:Math proof/styles.css has no content.

Proof of (5)

Let W satisfy these properties. Let W0 be the original numerical range.

Fix some matrix A. We show that the supporting planes of W(A) and W0(A) are identical. This would then imply that W(A)=W0(A) since they are both convex and compact.

By property (4), W(A) is nonempty. Let z be a point on the boundary of W(A), then we can translate and rotate the complex plane so that the point translates to the origin, and the region W(A) falls entirely within +. That is, for some ϕ, the set eiϕ(W(A)z) lies entirely within +, while for any t>0, the set eiϕ(W(A)z)tI does not lie entirely in +.

The two properties of W then imply that eiϕ(Az)+eiϕ(Az)0 and that inequality is sharp, meaning that eiϕ(Az)+eiϕ(Az) has a zero eigenvalue. This is a complete characterization of the supporting planes of W(A).

The same argument applies to W0(A), so they have the same supporting planes.

Normal matrices

Page Template:Math proof/styles.css has no content.

Proof of (1), (2)

For (2), if A is normal, then it has a full eigenbasis, so it reduces to (1).

Since A is normal, by the spectral theorem, there exists a unitary matrix U such that A=UDU, where D is a diagonal matrix containing the eigenvalues λ1,λ2,,λn of A.

Let x=c1v1+c2v2++ckvk. Using the linearity of the inner product, that Avj=λjvj, and that {vi} are orthonormal, we have:

x,Ax=i,j=1kcicjvi,λjvj=i=1k|ci|2λihull(λ1,,λk)

Page Template:Math proof/styles.css has no content.

Proof (3)

By affineness of W, we can translate and rotate the complex plane, so that we reduce to the case where W(A) has a sharp point at 0, and that the two supporting planes at that point both make an angle ϕ1,ϕ2 with the imaginary axis, such that ϕ1<ϕ2,eiϕ1eiϕ2 since the point is sharp.

Since 0W(A), there exists a unit vector x0 such that x0Ax0=0.

By general property (4), the numerical range lies in the sectors defined by: Re(eiθx,Ax)0for all θ[ϕ1,ϕ2] and nonzero xn. At x=x0, the directional derivative in any direction y must vanish to maintain non-negativity. Specifically:
ddtRe(eiθx0+ty,A(x0+ty))|t=0=0yn,θ[ϕ1,ϕ2]. Expanding this derivative:
Re(eiθ(y,Ax0+x0,Ay))=0yn,θ[ϕ1,ϕ2].

Since the above holds for all θ[ϕ1,ϕ2], we must have: y,Ax0+x0,Ay=0yn.

For any yn and α, substitute αy into the equation: αy,Ax0+αx0,Ay=0. Choose α=1 and α=i, then simplify, we obtain y,Ax0=0 for all y, thus Ax0=0.

Numerical radius

Page Template:Math proof/styles.css has no content.

Proof of (2)

Let v=argmaxx2=1|x,Ax|. We have r(A)=|v,Av|.

By Cauchy–Schwarz, |v,Av|v2Av2=Av2Aop

For the other one, let A=B+iC, where B,C are Hermitian. AopBop+Cop

Since W(B) is on the real line, and W(iC) is on the imaginary line, the extremal points of W(B),W(iC) appear in W(A), shifted, thus both Bop=r(B)r(A),Cop=r(iC)r(A).

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 kn/3+1.[9]

See also

Bibliography

Books

Papers

References

Page Template:Reflist/styles.css has no content.

  1. ^ Page Module:Citation/CS1/styles.css has no content.""well-known" inequality for numerical radius of an operator". StackExchange.
  2. ^ Page Module:Citation/CS1/styles.css has no content."Upper bound for norm of Hilbert space operator". StackExchange.
  3. ^ Page Module:Citation/CS1/styles.css has no content."Inequalities for numerical radius of complex Hilbert space operator". StackExchange.
  4. ^ Page Module:Citation/CS1/styles.css has no content.Hilary Priestley. "B4b hilbert spaces: extended synopses 9. Spectral theory" (PDF). In fact, ‖T‖ = max(−mT , MT) = wT. This fails for non-self-adjoint operators, but wT ≤ ‖T‖ ≤ 2wT in the complex case.
  5. ^ Page Module:Citation/CS1/styles.css has no content.Davis, Chandler (June 1971). "The Toeplitz-Hausdorff Theorem Explained". Canadian Mathematical Bulletin. 14 (2): 245–246. doi:10.4153/CMB-1971-042-7. ISSN 0008-4395.
  6. ^ Page Module:Citation/CS1/styles.css has no content.Choi, Man-Duen; Kribs, David W.; Życzkowski, Karol (October 2006). "Higher-rank numerical ranges and compression problems". Linear Algebra and its Applications. 418 (2–3): 828–839. doi:10.1016/j.laa.2006.03.019.
  7. ^ Page Module:Citation/CS1/styles.css has no content.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. ISSN 0002-9939.
  8. ^ Page Module:Citation/CS1/styles.css has no content.Woerdeman, Hugo J. (2008-01-01). "The higher rank numerical range is convex". Linear and Multilinear Algebra. 56 (1–2): 65–67. doi:10.1080/03081080701352211. ISSN 0308-1087.
  9. ^ Page Module:Citation/CS1/styles.css has no content.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. arXiv:0706.1540. doi:10.1080/03081080701786384. ISSN 0308-1087.

Lua error in package.lua at line 80: module 'Module:Navbox/configuration' not found.