Cauchy interlacing
The eigenvalues of a Hermitian matrix and of any principal submatrix of one smaller size interlace, and so do the characteristic polynomials in the real symmetric case.
Results
Theorem (Cauchy). Let $A$ be a Hermitian $(n+1)\times(n+1)$ matrix over $\mathbb R$ or $\mathbb C$ with eigenvalues $\lambda_0\ge\dots\ge\lambda_n$. Let $A'$ be obtained by deleting the $i$-th row and column, with eigenvalues $\mu_0\ge\dots\ge\mu_{n-1}$. Then $$ \lambda_{k+1}\le\mu_k\le\lambda_k\qquad(0\le k<n). $$ If $A$ is real symmetric, then $\chi_{A'}\ll\chi_A$ for the characteristic polynomials.
Theorem (Weyl, rank-one update). Let $A$ be an $N\times N$ Hermitian matrix and $v$ a vector, with eigenvalues of $A$ and $B=A+vv^*$ listed in decreasing order. Then $\lambda_k(A)\le\lambda_k(B)$ for all $k$, and $\lambda_k(B)\le\lambda_{k-1}(A)$ for $k\ge1$. If $A$ is real symmetric and $v$ is real, then $\chi_A\ll\chi_{A+vv^T}$.
Proof
Both statements follow from the Courant–Fischer theorem.
References
See [God17]; [Fis05] and the Cauchy interlacing entry on symmetricfunctions.com.
- [God17] Algebraic combinatorics. 2017.
BibTeX
@book{Godsil2017, doi = {10.1201/9781315137131}, url2 = {https://doi.org/10.1201/9781315137131}, year = {2017}, month = oct, publisher = {Routledge}, author = {C.D. Godsil}, title = {Algebraic Combinatorics} } - [Fis05] A very short proof of Cauchy's interlace theorem for eigenvalues of Hermitian matrices. arXiv e-prints, 2005.
BibTeX
@article{Fisk2005x, author = {Steve Fisk}, title = {A very short proof of {C}auchy's interlace theorem for eigenvalues of {H}ermitian matrices}, year = {2005}, eprint = {math/0502408}, url = {https://arxiv.org/abs/math/0502408}, journal = {arXiv e-prints}, journalref = {Amer. Math. Monthly, Vol 112, No. 2, Feb. 2005, page 118} }