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

Let $A$ and $B$ be symmetric non-negative matrices. If $A\geq B$ (i.e., $A-B$ is a nonnegative matrix), can we say that $\lambda_i(A) \geq \lambda_i(B)$ for all $i$, where $\lambda_i$ denotes the i--th largest eigenvalue

(I know it holds for the largest eigenvalue but I am interested in the second largest one). If it does not always hold, what condition on it makes my statement true.

share|cite|improve this question
trivial application of minmax formulae. – Denis Serre Mar 22 '13 at 21:43

Consider $\pmatrix{1 & 1\cr 1 & 1\cr}$ and $\pmatrix{1 & 0\cr 0 & 1\cr}$. Or did you mean positive semidefinite instead of nonnegative?

share|cite|improve this answer
Thanks, your counterexample disproves my statement. Now I am looking for a condition that makes my statement true. – Jamil Tau Mar 23 '13 at 12:14

Your Answer


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

Not the answer you're looking for? Browse other questions tagged or ask your own question.