Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. 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

Find an example of matrices, $A$ and $B$, with $AB=BA$ and for which $\lambda$ is an eigenvalue of $A$, $\mu$ an eigenvalue of $B$, but $\lambda+\mu$ is not an eigenvalue of $A+B$, and $\lambda \mu$ not an eigenvalue of $AB$. Can anyone please provide an example of two such matrices?matrices should not be triangular and diagonal

share|cite|improve this question
Pick for A and B two matrices that are really easy to calculate with that satisfy the conditions. Which ones did you pick? Do they work? If not, why not? – I like Serena Mar 22 '14 at 13:53
"low"?? Not even a single accepted Question/Answer.. I am not sure if any body would wish to help you if you do not react properly for users who spared their time to help you... – Praphulla Koushik Mar 22 '14 at 14:23
up vote 2 down vote accepted

Ok trying again. Take $$A = \begin{bmatrix} 0 & 0 & 1\\ 0 & 0 & 0\\ 1 & 0 & 0\end{bmatrix}, \qquad B = \begin{bmatrix} 1 & 0 & 1\\ 0 & 2 & 0\\ 1 & 0 & 1\end{bmatrix}\,.$$

These matrices commute, neither is diagonal, and neither is triangular.

Eigenvalues of $A$: $-1, 1, 0$.

Eigenvalues of $B$: $2, 2, 0$.

Eigenvalues of $A+B$: $3,2,-1$.

Eigenvalues of $AB$: $2,0,0$.

So take $\lambda = -1$ and $\mu = 2$.

share|cite|improve this answer

$A=\begin{pmatrix}0&1\\1&0\end{pmatrix}$ has eigenvalue 1, $B=\begin{pmatrix}0&2\\2&0\end{pmatrix}$ has eigenvalue -2

$A+B=\begin{pmatrix}0&3\\3&0\end{pmatrix}$ does not have eigenvalue $1-2=-1$

$AB=\begin{pmatrix}2&0\\0&2\end{pmatrix}$ does not have eigenvalue $1\cdot-2=-2$

share|cite|improve this answer
A better answer than mine, obviously! – Jason Zimba Mar 22 '14 at 15:37
Nice one.${{}}$ – Git Gud Mar 22 '14 at 15:53

I don't understand how this question makes sense the way it is posed here. If each square matrix has dimension $n$, then you have $n^2$ possible products/sums of the individual eigenvalues whereas the matrix product/sum can only have $n$ eigenvalues. So some of these eigenvalue products/sums have to be left out by construction (unless you get exactly $n$ unique numbers out of the possible $n^2$ combinations. Wouldn't it make more sense to ask whether the eigenvalues of the matrix product/sum are always a subset of the possible eigenvalue products/sums?

share|cite|improve this answer

@ hafsah, your sentence "matrices should not be triangular" shows that you did not understand one word about this problem. Indeed, if $A,B$ are complex matrices s.t. $AB=BA$, then $A,B$ are simultaneously triangularizable. Thus there are orderings $(\lambda_i)_i,(\mu_i)_i$ of the eigenvalues of $A,B$ s.t. the eigenvalues of $A+B$ are $(\lambda_i+\mu_i)_i$ and the eigenvalues of $AB$ are $(\lambda_i\mu_i)_i$.

share|cite|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.