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 be hermitian with eigenvalues (since is hermitian, its eigenvalues are real (see this theorem)). Then we have and

Claim

Consider and . Suppose for all , we have that . Then and

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 (“the minimization might not work as well”)

And so

Weyl's Theorem

For any hermitian, for any we have (where is the th largest eigenvalue)

Proof

\lambda_{k}(A+B) &= \min\max_{\text{courant-fisher conditions}} \frac{x^*(A+B)x}{x^*x} \\ &= \min \max_{CF} \frac{x^*Ax}{x^*x} + \frac{x^*Bx}{x^*x} \\ &= \min \max_{CF} \frac{x^*Ax}{x^*x} + \lambda_{n}(B) \;\;\;(*) \\ &= \lambda_{n}(B) + \lambda_{k}(A) \;\;\;\;(* *) \end{aligned}$$ Where $(*)$ is due to [[Concept Wiki/Rayleigh-Ritz Theorem\|Rayleigh-Ritz]] and $(* *)$ is due to [[Concept Wiki/Courant-Fisher Theorem\|Courant-Fisher]]. The other inequality follows analogously

(see Weyl’s Theorem)

Corollary

If hermitian and is postive semidefinite, then for all we have

, by Weyl

Since

Interlacing Theorem I

If is hermitian, , , then for all :

Proof

\lambda_{k}(A + azz^*) &= \max_{y_{1}, y_{2}, \dots, y_{k-1} \in \mathbb{C}^n} \min_{x \in \mathbb{C}^n \neq 0, x \perp y_{1}, \dots, y_{k-1}} \frac{x^*(A + azz^*)x^*}{x^*x} \\ &\leq \max_{y_{1}, \dots, y_{k-1} \in \mathbb{C}^n} \min_{x \in \mathbb{C}^n \neq 0, x \perp y_{1}, \dots, y_{k-1}, x \perp z} \frac{x^*(A + azz^*)x^*}{x^*x} \\ &= \max_{y_{1}, \dots, y_{k-1} \in \mathbb{C}^n} \min_{x \in \mathbb{C}^n \neq 0, x \perp y_{1}, \dots, y_{k-1},z} \frac{x^*Ax^*}{x^*x} \;\;\; (*) \\ &\leq \max_{y_{1}, y_{2}, \dots, y_{k} \in \mathbb{C}^n} \min_{x \in \mathbb{C}^n \neq 0, x \perp y_{1}, \dots, y_{k}} \frac{x^*Ax^*}{x^*x} \;\;\;\;(* *) \\ &= \lambda_{k+1}(A) \;\;\;\;\text{ by Courant-Fisher} \end{aligned}$$ - $(*)$ since if $z \perp x$, then $ax^*zz^*x = 0$ - $(* *)$ since we can choose $y_{k} = z$

(see interlacing theorem 1)

Theorem

In general, if is hermitian, then it is unitarily diagonalizable, say and the diagonal elements of . Then

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

Corollary

Let be hermitian and rank of is , then for all ,

This follows directly from the

Say unitary. WLOG let the entries be the only non-zero eigenvalues / nonzero entries of (we can do this because is diagonalizable). Then

\lambda_{k+r}(A) & \geq \lambda_{k+r-1}(A + d_{rr}u_{r}u_{r}^*) \;\;\;\;(*)\\ & \geq \lambda_{k+r-2}(A + d_{rr}u_{r}u_{r}^* + d_{(r-1)(r-1)}u_{r-1}u_{r-1}^*) \\ & \geq \dots \\ & \geq \lambda_{k}\left( A + \sum_{i=1}^r d_{ii}u_{i}u_{i}^* \right) \\ &= \lambda_{k}(A+B) \;\;\;\; (* *) \end{aligned}$$ Where we get $(*)$ from the [[Concept Wiki/interlacing theorem 1]] and $( * *)$ from [[Concept Wiki/normal matrices are the sum of rank-1 matrices\|hermitian matrices are the sum of rank-1 matrices]]

Corollary

Let be hermitian and is rank . Then for all

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

Let and . Then from the above we have

(see bounds on eigenvalues for sums of hermitian matrices)