Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Is there a relationship between the eigenvalues of individual matrices and the eigenvalues of their sum?

What about the special case when they are Hermitian and positive-definite?

I am investigating this with regard to finding the normalized graph cut under general convex constraints.

Any pointers will be very helpful.

Thanks. B.

share|improve this question

4 Answers 4

up vote 32 down vote accepted

The problem of describing the possible eigenvalues of the sum of two hermitian matrices in terms of the spectra of the summands leads into deep waters. The most complete description was conjectured by Horn, and has now been proved by work of Knutson and Tao (and others?) - for a good discussion, see the Notices AMS article by those two authors

Depending on what you want, there should be simpler results giving estimates on the eigenvalues of the sum. A book like Bhatia's Matrix Analysis might have some helpful material.

share|improve this answer

A simple estimate which is often useful is that, if A and B are Hermitian matrices with eigenvalues a_1 > a_2 > ... > a_n and b_1 > b_2 > ... > b_n and the eigenvalues of the sum are c_1 > c_2 > ... > c_n, then

c_{i+j-1} ≤ a_i + b_j and c_{n-i-j} ≥ a_{n-i} + b_{n-j}.

The above conditions are necessary but not sufficient for A+B=C to have a solution; see the Knutson-Tao article if you want sufficient conditions.

If you do not impose that A and B are Hermitian then there are very few restrictions besides the trace being equal. More specifically, the 3n-tuples (a_1, ..., a_n, b_1, ..., b_n, c_1,...,c_n) which occur as eigenvalues of (A,B,C) with A+B=C are dense in the hyperplane \sum a_i + \sum b_i = \sum c_i.

share|improve this answer

If 2 positive matrices commute, than each eigenvalue of the sum is a sum of eigenvalues of the summands. This would be true more generally for commuting normal matrices. For arbitrary positive matrices, the largest eigenvalue of the sum will be less than or equal to the sum of the largest eigenvalues of the summands.

share|improve this answer

If M is Hermitian then H + aI is positive semidefinite when a is large enough. So the Hermitian + positive semidefinite case is essentially the same as the Hermitian case

share|improve this answer

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.