 Largest-eigenvalue interlacing for a principal submatrix

Let a real symmetric matrix $M$ have ordered eigenvalues ${\lambda }_1\ge {\lambda }_2\ge \cdots \ge {\lambda }_n$, with $n\ge 2$. If $A$ is obtained by deleting one matching row and column, its largest eigenvalue ${\mu }_1$ satisfiesThe Rayleigh quotient of $A$ is that of $M$ restricted to vectors whose deleted coordinate is zero. This gives the upper bound. Some nonzero linear combination of the top two orthonormal eigenvectors has that coordinate zero; normalizing it gives a quotient at least ${\lambda }_2$. The argument does not require distinct eigenvalues.