# Matrix non-identity

Let $M,N$ be $n\times n$ matrices. Then why is it that $MN-NM=I_n$ cannot be true, where $I_n$ is the $n\times n$ identity matrix?

I am thinking of perhaps there is an argument using determinants? (Of course I am probably way out.)

Thanks.

-
You weren't way out: Consider the trace instead of the determinant and remember that $\operatorname{tr}{AB} = \operatorname{tr}{BA}$. – t.b. Nov 7 '11 at 0:24
And if you don't remember that fact about the trace, try to prove it. – Gerry Myerson Nov 7 '11 at 0:37
asker: Since you are new to Math.SE, let me point out that you are explicitly permitted and encouraged in this site to answer your own question; so if you understood @t.b.'s comment, please consider posting your answer. That way, this post will appear as answered in the question, and other users will get a chance to upvote your solution. – Srivatsan Nov 7 '11 at 0:41
You could note that $MN$ and $NM$ have the same eigenvalues, but $MN=NM+I_n$ would imply that the eigenvalues of $MN$ are all shifted by $1$ from those of $NM$. – Jonas Meyer Nov 7 '11 at 3:43

$\operatorname{tr}(AB-BA)=\operatorname{tr}(I) \implies \operatorname{tr}(AB)-\operatorname{tr}(AB)=n$
Do you know about modular arithmetic? Working modulo 2 (for example), $1+1=0$, so the $2\times2$ identity matrix with entries taken from the integers mod 2 has trace zero. So in that setting, trace of $AB$ equals trace of $BA$ doesn't contradict $AB-BA=I$. – Gerry Myerson Nov 8 '11 at 12:16