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

It's a simple exercise to show that two similar matrices has the same eigenvalues and eigenvectors (my favorite way is noting that they represent the same linear transformation in different bases).

However, to show that two matrices has the same characteristic polynomial it does not suffice to show that they have the same eigenvalues and eigenvectors - one needs to say something smart about the algebraic multiplicities of the eigenvalues. Moreover, we might be working over a field which is not algebraically closed and hence simply "don't have" all the eigenvalues. This can be overcome, of course, by working in the algebraic closure of the field, but it complicates the explanation.

I'm looking for a proof that is simple and stand-alone as much as possible (the goal is writing an expository article about the subject, so clarity is the most important thing, not efficiency).

share|cite|improve this question
How do you prove that two similar matrices have the same eigenvectors? – Manos Dec 2 '11 at 22:23
Take the matrix $A=diag(2,1)$. Then this is similar to $B=\left[\begin{array} 1 & 1 \\ 0 & 1\end{array}\right] diag(2,1) \left[\begin{array} 1 & -1 \\ 0 & 1\end{array}\right]=\left[\begin{array} 2 & -1 \\ 0 & 1\end{array}\right]$. Now, $\left[\begin{array} 0 \\ 1 \end{array}\right]$ is an eigenvector of $A$ but not of $B$. – Manos Dec 2 '11 at 22:29
sorry, i messed up with latex typing... – Manos Dec 2 '11 at 22:35
My point is that similar matrices do not have in general identical eigenvectors. – Manos Dec 2 '11 at 22:37
$A = [2 \, \, \, 0; 0 \, \, \, 1]$, $T = [1\, \, \, 1; 0 \, \, \, 1]$, $B=T A T^{-1}$. Check that $e_2=[0;1]$ is an eigenvector of $A$ but not of $B$. – Manos Dec 2 '11 at 22:38
up vote 28 down vote accepted

If you define the characteristic polynomial of a matrix $A$ to be $\det(xI - A)$ then for $M$ invertible we have

$\det(xI - M^{-1} A M)=$

$= \det(M^{-1} xI M - M^{-1} A M)$

$= \det(M^{-1} (xI-A) M)$

$= \det (M^{-1}) \det(xI-a) \det(M)$

$=\det(xI - A)$

share|cite|improve this answer
That was simple. Very simple. Thank you! – Gadi A Dec 2 '11 at 11:03
This proof should be standard in any text, in order to even define the characteristic polynomial of a vector space endomorphism (as opposed to that of a matrix). Certainly you don't want to have to refer to eigenvalues and algebraic multiplicities in order to define the characteristic polynomial of an endomorphism. – Marc van Leeuwen Dec 2 '11 at 11:07
@Marc, how would you define determinants of general vector space endomorphisms? – Henning Makholm Dec 2 '11 at 12:24
@Henning Makholm: Maybe my comment was not so clear. I would define the characteristic polynomial of a matrix in the usual way, then prove that it is invariant under similitude, which allows defining the characteristic polynomial of a vector space endomorphism as that of its matrix in any basis. One can define the determinant of general vector space endomorphisms without using bases, but I don't think that is very useful for characteristic polynomials, since there one needs a determinant over $K[X]$, not over a field. – Marc van Leeuwen Dec 2 '11 at 12:37
@RobertS.Barnes, $xM$ commutes with the identity matrix $I$. – lhf Jun 24 '12 at 12:11

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.