pith. sign in

arxiv: math/0502408 · v1 · submitted 2005-02-18 · 🧮 math.CA

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

classification 🧮 math.CA
keywords cauchycharacteristiceigenvaluesinterlacematrixpolynomialsymmetrictheorem
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.