A very short proof of Cauchy's interlace theorem for eigenvalues of Hermitian matrices
Steve Fisk

TL;DR
This paper provides a concise proof of Cauchy's interlace theorem for eigenvalues of Hermitian matrices, using only basic properties of determinants and real eigenvalues.
Contribution
It offers a remarkably short and straightforward proof of a classical eigenvalue interlacing theorem for Hermitian matrices.
Findings
Proof uses only linearity of determinant and real eigenvalues
The proof is only two sentences long
Clarifies the fundamental nature of eigenvalue interlacing
Abstract
Cauchy's interlace theorem states that the characteristic polynomial of a symmetric matrix is interlaced by the characteristic polynomial of any principle submatrix. We prove this in two sentences using only the linearity of the determinant, and the fact that all eigenvalues of a symmetric matrix are real.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Advanced Topics in Algebra · Algebraic and Geometric Analysis
