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

Anyone know of a linear transformation for which there does not exist a basis of eigenvectors?

What would indicate to me that a particular linear transformation has/hasn't a basis of eigenvectors? It seems like if a linear transformation isn't invertible then it wont have a basis of eigenvectors. But I can't think of a linear transformation that isn't invertible.

share|cite|improve this question
Rotation by $90^\circ$ in $\mathbb{R}^2$ has no eigenvectors. – Henry T. Horton Apr 28 '12 at 21:01
Here's a fundamental example of a non-invertible linear transformation you should keep in mind: for any vector space $V$ of positive dimension, the map $Z:V\to V$ with $Z(v)=0$ for all $v\in V$ is linear and is not invertible. – Zev Chonoles Apr 28 '12 at 21:01
But on the other hand, every vector is an eigenvector of that map. – Tara B Apr 28 '12 at 21:03
If the matrix is not invertible, it will definitely have at least one eigenvector, any vector in the kernel is an eigenvector with eigenvalue 0. – Brett Frankel Apr 28 '12 at 21:03
@Jim_CS: I didn't claim my example was the only type of rotation with no eigenvectors... However, a rotation in $\mathbb{R}^3$ is always equivalent to a rotation about some fixed axis, and hence a vector pointing in the direction of that axis is an eigenvector of the rotation (see Euler's rotation theorem). The general idea behind my example is to construct a real linear transformation whose characteristic polynomial has no real roots. – Henry T. Horton Apr 29 '12 at 20:22
up vote 8 down vote accepted

$\begin{bmatrix} 1 & 1\\ 0 & 1\end{bmatrix}$ has only one eigenvalue, 1, with algebraic multiplicity 2 but geometric multiplicity 1. In other words, there is only one eigenvector (up to taking scalar multiples) for this eigenvalue, so there is no a basis of eigenvectors.

To convince yourself that there is no basis of eigenvectors, think what would happen if there were: Since 1 is the only eigenvalue, any vector would then be mapped to itself, but then the matrix in question would have to be the identity matrix.

share|cite|improve this answer
P.S. What Brett has there is what's commonly called a Jordan block. – J. M. May 2 '12 at 14:34
To add to J.M.'s point, it turns out that this is, up to conjugation and its higher-dimensional analogues, the only thing that can go wrong. You can find out more by looking up Jordan canonical forms. – Brett Frankel May 2 '12 at 23:56
@BrettFrankel: To be more precise there are two things that can go wrong: (1) the characteristic (or equivalently the minimal) polynomial of $f$ does not split into linear factors (but this cannot happen over an algebraically closed field like $\Bbb C$), or (2) there is some eigenvalue $\lambda$ and a vector $v$ that is not an eigenvector but such that $(\lambda I-f)^2(v)=0$ (as happens here with $\lambda=1$ and $v$ the second standard basis vector). One can show (not so easily) that when (1) is excluded, $f$ has a matrix that has a list of Jordan blocks for each $\lambda$. – Marc van Leeuwen Dec 11 '12 at 7:20

May I suggest: $\begin{bmatrix} 0 & 1\\ -1 & 0\end{bmatrix}$ onto $\mathbb{R^2}$?!

share|cite|improve this answer
You may of course suggest it, but it was already mentioned in a comment by Henry T. Horton to the question. – Marc van Leeuwen Dec 7 '12 at 8:41
Oh, I'm so sorry. Scuse me. – Ivan Dec 7 '12 at 12:31

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.