Eigenvalues and Eigenvectors
This is a Helper Page for:


Social Networks 
Systems of Linear Differential Equations 
Contents
Introduction
If you are familiar with matrix multiplication, you know that a matrix times a vector gives out some vector, and most vectors resulting from the product of a vector and a matrix turns out different than the original vector,
 i.e. where and are different vectors.
What if I told you that there are certain vectors that when multiplied to a matrix, the final vector is the same vector multiplied by a scalar?
 i.e. , where is a scalar.
Amazing right? These vectors are called eigenvectors. We can figure out how to compute these vectors from any square (rows and columns are the same) matrix!
 Definition: For a square matrix A and a nonzero vector , is an eigenvector of A if and only if , where is an eigenvalue of A associated with .
Before we begin our analysis, here are some concepts you need to be familiar with:
 Determinant
 Is a value attributed to a square matrix.
 Invertibility
 Definition can be found in Matrix
 A square matrix A is not invertible if and only if the determinant of A is zero. Or, implies that A is not invertible.
 If a square matrix A is invertible, then has only one solution for all .
 Identity Matrix
 Definition can be found in Matrix
Eigenvalues
In this section, we will see how certain values will change the entries of an original matrix A so that it can have eigenvectors. Let's try to find the eigenvector given that we know the definition:
 , where I is the identity matrix.
So we have , where B is the square matrix (A  λI).
If B is invertible, then the only solution to is the zero vector. But cannot be zero (nontrivial), so we know that the zero vector cannot be the only solution. Therefore, B is not invertible. Since B is not invertible, we know that its determinant will equal zero!
We have to ask ourselves: what values can make B have a determinant of zero? Well we can take the determinant of (which B represented) and see for what that determinant will equal zero. Since the only unknown value is λ and the determinant of a n×n matrix is just a n^{th} degree polynomial (we call this the characteristic polynomial), we know this method always works. The values of are called eigenvalues, and we will work through a simple example.
Example
Suppose we have
 .
To find the eigenvalues of A, we find the determinant of (A  λI):
So our eigenvalues are 2 and 1. We write these as λ_{1} = 2 and λ_{2} = 1. In general, an n×n matrix will have n eigenvalues because an n^{th} degree polynomial will typically have n solutions (given that there are no repeated solutions).
The General 2×2 Case
Consider the general 2×2 matrix
 .
We find the eigenvalues of A by finding the determinant of (A  λI):
Using the quadratic formula, we see that our eigenvalues are
 .
Note that we will typically have two eigenvalues for a 2×2 matrix (except in the case when we have repeating solutions), since we're solving for a seconddegree polynomial. Likewise, an n×n matrix will probably have n eigenvalues because an n^{th} degree polynomial will typically have n solutions (once again given that there are no repeated solutions).
Another way of writing the Characteristic Polynomial
Eigenvectors
After finding the eigenvalues of A, we must find the corresponding eigenvectors. Since we already have the equation available, why don't we use it? Plug one of the value of λ for A into the equation and find vector(s) that satisfy the equation.
We continue our previous example to illustrate this idea.
Example
Remember that for our matrix
 , we have λ_{1} = 2 and λ_{2} = 1.
In this case, we will have two eigenvectors, one for each eigenvalue. Note that this is not always true. If for a n×n matrix there are fewer than n eigenvalues (repeated solutions for our polynomial), then at least one eigenvalue will have more than one eigenvector that corresponds to it. However in our case, we have two eigenvalues for a 2×2 matrix, so we know we will definitely have one eigenvector per eigenvalue.
We plug our λ's into the equation and find our eigenvectors.
 λ_{1} = 2: Note that the two rows of the matrix are identical. So what vector, when multiplied by this matrix, gives the zero vector? One that could work is . This is our first eigenvector.
 λ_{2} = 1: While the two rows of the matrix aren't identical, they are scalar multiples of each other. A vector that works is . This is our second eigenvector.
Thus we have the eigenvalues and the corresponding eigenvectors for A.
A Property of Eigenvectors
In the previous example, note that there are actually infinitely many eigenvectors. For example, works as well. However, all the possible eigenvectors for an eigenvalue are scalar multiples of each other. We defined eigenvalues and eigenvectors by stating
 , where is the eigenvector and λ is the eigenvalue of A.
From here, we see that the vector for any scalar c is an eigenvector too.
 .
Another way to visualize this is to derive an equation for the eigenvectors in terms of their components. Suppose our eigenvector is
 .
Then the equation can be written as
 .
Multiplying this out, we get two equations
 and .
Since they are both equal to 0, we set them equal to each other and solve for v_{1} and v_{2}.
We have shown that for an eigenvalue λ of A, the components of its eigenvectors maintain the same ratio. Thus multiplying the eigenvectors by scalar constants will still work, since this ratio is preserved.
We have shown that the eigenvectors for an eigenvalue are actually a set of vectors. The eigenvector we write down as THE eigenvector is just a basis for this set of vectors.