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

If $A$ and $B$ are similar matrices then every eigenvector of $A$ is an eigenvector of $B$.

Is the above statement is true? I know that similar matrices have same eigenvalue but I'm not sure about the eigenvectors.

share|cite|improve this question
It's false. Exercise: come up with an example. Almost any pair of similar $2\times2$ matrices will do. – Gerry Myerson Dec 10 '12 at 5:12

You can, and often should, think of similar matrices $A,B$ as being matrices of a same linear transformation $f:V\to V$ in different bases of $V$. Then if $f$ has eigenvalues $\lambda$, the corresponding eigenvectors are (abstract) vectors of $V$, and expressing these in the bases used repectively for $A$ and for $B$ gives (concrete) eigenvectors for the matrices $A$ and $B$ respectively. It is clear that $A$ and $B$ have the same eigenvalues as $f$, which are independent of any basis, but what you are essentially asking is wheter the concrete coordinates of these vectors are the same in the bases used for $A$ and for $B$, and the answer is of course "no".

share|cite|improve this answer

False. For an easy reasoning, suppose $A$ is diagonalizable and $B$ is the diagonalization of $A$. $A$ and $B$ are similar by the definition of diagonalizable: there exists an invertible matrix $P$ such that $P^{-1}AP=B$, and $B$ is a diagonal matrix.

Then the standard basis vectors are the eigenvectors of $B$, but clearly these need not be the eigenvectors of $A$. (In fact, if your claim was true, then the every eigenvector of a diagonalizable matrix would be a standard basis vector, which is false.)

share|cite|improve this answer

Take $A=\begin{bmatrix}0 & 1 \\ 1 & 0\end{bmatrix}$, $V=\frac{1}{\sqrt{2}} \begin{bmatrix} -1 & 1 \\ 1 & 1\end{bmatrix}$, and let $\Lambda = V^{-1} A V = \begin{bmatrix} -1 & 0 \\ 0 & 1 \end{bmatrix}$.

Then $A \begin{bmatrix} 1 \\ 1 \end{bmatrix}= \begin{bmatrix} 1 \\ 1 \end{bmatrix}$, but $\Lambda \begin{bmatrix} 1 \\ 1 \end{bmatrix}= \begin{bmatrix} -1 \\ 1 \end{bmatrix}$.

share|cite|improve this answer

If $A$ and $B$ are similar matrices, then they represent the same linear transformation $T$, albeit written in different bases. So really the two matrices have the same eigenvectors, they just look different because you're expressing them in terms of a different basis.

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.