Lecture 17

[[lecture-data]]

2024-10-07

Caution

Exam on the 15th from 7-10pm

4. Chapter 4

The main theorem of this chapter is Courant-Fisher Theorem

Courant-Fisher Theorem

let A∈Mn be hermitian with eigenvalues λ1≤⋯≤λn (since A is hermitian, its eigenvalues are real (see this theorem)). Then ∀k=1,2,…n we have

maxy1,y2,…,yk−1∈Cn{minx∈Cn≠0,x⊥y1,y2,…,yk+1x∗Axx∗x}=λk

and

minyk+1,…,yn∈Cn{maxx∈Cn≠0,x⊥yk+1,…,ynx∗Axx∗x}=λk
Claim

Consider {ai}i∈I and {bi}i∈I. Suppose for all i, we have that ai≤bi. Then

mini∈Iai≤mini∈Ibi

and

maxi∈Iai≤maxi∈Ibi

Further, if I minimize (or maximize) over some conditions κ, these inequalities still hold provided I apply the same conditions to both sides. I can even make one of these conditions a minimization (or maximization) over some more conditions!

We also have for conditions κ and additional conditions κ′ that

minκxyz≤minκ∪κ′xyz

("the minimization might not work as well")

And so

maxminκxyz≤maxminκ∪κ′xyz
Weyl's Theorem

For any A,B∈Mn hermitian, for any k=1,2,…,n we have

λk(A)+λ1(B)≤λk(A+B)≤λk(A)+λn(B)

(where λi is the ith largest eigenvalue)

Proof

λk(A+B)=minmaxcourant-fisher conditionsx∗(A+B)xx∗x=minmaxCFx∗Axx∗x+x∗Bxx∗x=minmaxCFx∗Axx∗x+λn(B)(∗)=λn(B)+λk(A)(∗∗)

Where (∗) is due to Rayleigh-Ritz and (∗∗) is due to Courant-Fisher. The other inequality follows analogously

(see Weyl's Theorem)

Corollary

If A,B∈Mn hermitian and B is postive semidefinite, then for all k=1,2,…,n we have

λk(A)≤λk(A+B)
Proof

Since λ1(B)>0, by Weyl λk(A)≤λk(A)+λ1(B)≤λk(A+B)

Interlacing Theorem I

If A∈Mn is hermitian, a∈R, z∈Cn, then for all k:

λk(A+azz∗)≤λk+1(A)
Proof

λk(A+azz∗)=maxy1,y2,…,yk−1∈Cnminx∈Cn≠0,x⊥y1,…,yk−1x∗(A+azz∗)x∗x∗x≤maxy1,…,yk−1∈Cnminx∈Cn≠0,x⊥y1,…,yk−1,x⊥zx∗(A+azz∗)x∗x∗x=maxy1,…,yk−1∈Cnminx∈Cn≠0,x⊥y1,…,yk−1,zx∗Ax∗x∗x(∗)≤maxy1,y2,…,yk∈Cnminx∈Cn≠0,x⊥y1,…,ykx∗Ax∗x∗x(∗∗)=λk+1(A) by Courant-Fisher

  • (∗) since if z⊥x, then ax∗zz∗x=0
  • (∗∗) since we can choose yk=z

(see interlacing theorem 1)

Theorem

In general, if B∈Mn is hermitian, then it is unitarily diagonalizable, say B=UDU∗,U=[u1|u2|…|un] and λ1,λ2,…,λn the diagonal elements of D. Then

B=UDU∗=∑i=1nλiuiui∗

(see normal matrices are the sum of rank-1 matrices)

Corollary

Let A,B∈Mn be hermitian and rank of B is r, then for all k,

λk(A+B)≤λk+r(A)
Proof

This follows directly from the interlacing theorem 1 and the fact that hermitian matrices are the sum of rank-1 matrices

Say B=UDU∗,U=[u1|u2|…|un] unitary. WLOG let the entries d11,d22,…,drr be the only non-zero eigenvalues / nonzero entries of D (we can do this because B is diagonalizable). Then

λk+r(A)≥λk+r−1(A+drrurur∗)(∗)≥λk+r−2(A+drrurur∗+d(r−1)(r−1)ur−1ur−1∗)≥…≥λk(A+∑i=1rdiiuiui∗)=λk(A+B)(∗∗)

Where we get (∗) from the interlacing theorem 1 and (∗∗) from hermitian matrices are the sum of rank-1 matrices

Corollary

Let A,B∈Mn be hermitian and B is rank r. Then for all k

λk−r(A+B)≤λk(A)≤λk+r(A+B)
Proof

This is a direct result/generalization of the above corollary.

λk−r(A)≤λk(A+B)≤λk+r(A)

Let A+B=A and −B=B. Then from the above we have

λk(A+B)≤λk+r(A)

(see bounds on eigenvalues for sums of hermitian matrices)