MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The usual interlacing inequalities say that if $M$ is a Hermitian $n \times n$ matrix and $\hat{M}$ is a principal submatrix of order $n-1$, then $\lambda_{\min}(M) \leq \lambda_{\min}(\hat{M})$. I would like to know if there are some results of the form $\lambda_{\min}(M)+f(M) \leq \lambda_{\min}(\hat{M})$, where $f$ is a function of the entries of $M$.

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.