Eigenvectors are a special type of vector related to linear transformations. It is a vector with the property that when a linear transformation is applied to it, the output differs from the input by a scalar number.

Put more formally, suppose that L is a linear mapping. If is a non-zero vector, such that , then is an eigenvector of the linear transformation L. Furthermore, we refer to as the eigenvalue of the linear transformation.

**Example:
**Let , and let .
Show that is an eigenvector of A.

If we want to show that is an eigenvector of A, we need to show that . In this case, we can do direct matrix multiplication, and show that the result differs from by a scalar multiple.

As you can see, the result differs from the original by a constant value 2, therefore, is an eigenvector of A.

From this example, we can see that it is easy to verify if a vector is an eigenvector for some linear transformation. The next step is to derive a way to find eigenvectors for any linear transformation. To do this, consider that the following equation holds true for eigenvectors: . All we are saying here is that if we apply a linear transformation to , and then subtract the eigenvalue multiplied to the same , we would get .

From here, we can factor out the term to get: . The idea is that if we can find some that satisfies this equation, then we have an eigenvector.

**Theorem:
**Suppose that A is an n x n matrix. A real number
is an eigenvalue if and only if . If
is an eigenvalue of A, then all non-trivial solutions to

This theorem will allow us to solve for eigenvalues, which in turn allow us to construct eigenvectors.

**Example:
**Find all the eigenvalues and eigenvectors of

To do this, we need to solve the equation .

To do this, let’s first construct . In , the identity matrix, I, is . If we take , we get

Now, we compute

If we take the determinate of this matrix, we end up with a quadratic function:

This gives us two eigenvalues to work with, and

To find our eigenvectors, we just need to determine where . Notice that this is just a linear system of equations:

You can solve this system in any way you prefer. In this case, I’m going to use row reduction. I’ll start by solving the case where . Using this lambda value gives us the system below.

This system has a coefficient matrix of:

This shows us that any scalar multiple of is an eigenvector of A. We can do the same steps with

This system has a coefficient matrix of:

This shows us that any scalar multiple of is an eigenvector as A. Therefore, we now know every possible eigenvector and eigenvalue of A.

Notice that in our example, the determinate used to find the eigenvalues was a quadratic polynomial. In general, we refer to this equation, as the characteristic polynomial of A. By analyzing the characteristic polynomial, we can conclude details about of eigenvectors, such as how many roots exist, and whether the roots are real and complex.

## 1 thought on “Eigenvalues and Eigenvectors”