# Eigenvalue

In linear algebra an **eigenvalue** of a square matrix *A* is a number λ that satisfies the eigenvalue equation,

where det means the determinant, *I* is the identity matrix of the same dimension as *A*,
and in general λ can be complex.
The left-hand side is the characteristic polynomial of *A*.
The origin of this equation is the eigenvalue problem, which is to find the eigenvalues and associated eigenvectors of *A*.
That is, to find a number λ and a vector that together satisfy

What this equation says is that even though *A* is a matrix its action on is the same as multiplying the vector by the number λ.
This means that the vector and the vector are parallel (or anti-parallel if λ is negative).
Note that generally this will *not* be true. This is most easily seen with a quick example. Suppose

- and

Then

whereas

In general the ratio (*a*_{11}*v*_{1} + *a*_{12}*v*_{2}) / (*a*_{21}*v*_{1} + *a*_{22}*v*_{2}) is different from *v*_{1} / *v*_{2}, thus, no λ fits.

## [edit] The eigenvalue equation

So where did the eigenvalue equation det(*A* − λ*I*) = 0 come from? Well, we assume that we know the matrix *A* and want to find a number λ and a non-zero vector so that . (Note that if then the equation is always true, and therefore uninteresting.) So now we have
. It doesn't make sense to subtract a number from a matrix, but we can factor out the vector if we first multiply the right-hand term by the identity, giving us

Now we have to remember the fact that *A* − λ*I* is a square matrix, and so it might be invertible.
If it was invertible then we could simply multiply on the left by its inverse to get

but we have already said that can't be the zero vector! The only way around this is if *A* − λ*I* is in fact non-invertible. It can be shown that a square matrix is non-invertible if and only if its determinant is zero. That is, we require

which is the eigenvalue equation stated above.

## [edit] A more technical approach

So far we have looked eigenvalues in terms of square matrices. As usual in mathematics though we like things to be as general as possible, since then anything we prove will be true in as many different applications as possible. So instead we can define eigenvalues in the following way.

Definition: Let *V* be a vector space over a field *F*, and let be a linear map. An **eigenvalue** of *A* is an element for which there exists a non-zero vector such that

Then is called the **eigenvector** of *A* associated with λ.

Some content on this page may previously have appeared on Citizendium. |