TITLE: Can the zero vector be an eigenvector for a matrix?
QUESTION [22 upvotes]: I was checking over my work on WolfRamAlpha, and it says one of my eigenvalues (this one with multiplicity 2), has an eigenvector of (0,0,0). How can the zero vector be an eigenvector?

REPLY [8 votes]: Note that some authors allow $0$ to be an eigenvector.  For example, in the book Linear Algebra Done Right (which is very popular), an eigenvector is defined as follows:

Suppose $T \in \mathcal L(V)$ and $\lambda \in \mathbf F$ is an
  eigenvalue of $T$.  A vector $u \in V$ is called an
  eigenvector of $T$ (corresponding to $\lambda$) if $Tu =
 \lambda u$.

The book then states,

...we see that the set of eigenvectors of $T$ corresponding to
  $\lambda$ equals $\text{null}(T - \lambda I)$.  In particular, the set
  of eigenvectors of $T$ corresponding to $\lambda$ is a subspace of
  $V$.

However, an eigenvalue is defined as follows:

a scalar $\lambda \in \mathbf F$ is called an eigenvalue of $T \in
 \mathcal L(V)$ if there exists a nonzero vector $u \in V$ such that
  $Tu = \lambda u$.  We must require $u$ to be nonzero because with $u =
 0$ every scalar $\lambda \in \mathbf F$ satisfies [the equation $Tu =
 \lambda u$].

Hoffman and Kunze, another highly esteemed Linear Algebra book, also allows $0$ to be an eigenvector.  (See the definition of "characteristic vector" in section 6.2, p. 182.)