Eigenvalues Unveiled Visual Connections
Eigenvalues and Eigenvectors
The Unchanging Vector
When a matrix acts on a vector, it usually transforms it, changing its direction, its length, or both. Think of a matrix as a function that takes an input vector and produces a new, output vector.
But for any given matrix, there are often special vectors that don't change their direction under the transformation. They might get stretched or shrunk, but their direction remains exactly the same. These special vectors are called eigenvectors.
An eigenvector of a matrix is a vector that is only scaled by the matrix; its direction is left unchanged.
The amount by which the eigenvector is scaled is called its eigenvalue. If the eigenvalue is 2, the eigenvector is doubled in length. If it's -0.5, it's halved and points in the opposite direction. If it's 1, it's completely unchanged.
This relationship is captured in a simple, powerful equation. If is a square matrix, is an eigenvector, and (the Greek letter lambda) is its corresponding eigenvalue, then:
This equation states that the action of the matrix on the vector is the same as just scaling by the number . For this to be meaningful, we're only interested in non-zero eigenvectors. The zero vector always satisfies this equation, but it doesn't tell us anything useful.
Finding the Eigenvalues
How do we find these special values? We start with the defining equation and rearrange it. To work with both sides as matrices, we can rewrite the right side by multiplying by the identity matrix, .
Now we can move everything to one side:
And factor out the vector :
This equation is the key. We are looking for a non-zero vector that the matrix transforms into the zero vector. This only happens if the matrix squishes space into a lower dimension. A matrix that does this has a determinant of zero.
So, to find the eigenvalues, we must find the values of that make this determinant zero.
This leads us to the characteristic equation: .
Solving this equation for will give us all the eigenvalues of the matrix . The expression is a polynomial in , known as the characteristic polynomial.
Calculating Eigenvectors
Once we have the eigenvalues, finding the corresponding eigenvectors is straightforward. We take each eigenvalue one by one and plug it back into our rearranged equation:
For a given , this becomes a system of linear equations. The solutions for form the set of eigenvectors for that eigenvalue. Let's walk through an example.
Suppose we have the matrix :
First, we find the eigenvalues using the characteristic equation, .
Now, we calculate the determinant:
This simplifies to , giving us two eigenvalues: and .
Next, let's find the eigenvector for each eigenvalue.
For : We solve .
This matrix equation gives us the linear system and . Both equations tell us that . The value of can be anything. So, any vector of the form where is an eigenvector. A simple choice is:
For : Now we solve .
This gives us the equation , or . Any vector where the x-component is the negative of the y-component is an eigenvector. If we choose , then . A simple choice is:
So, we've found the eigenvalues and , with their corresponding eigenvectors and .
A Geometric View
Eigenvectors represent the axes of a linear transformation. They are the directions that are preserved. Imagine stretching a sheet of rubber. The directions in which the material is only stretched, without any rotation or shear, are the directions of the eigenvectors.
The matrix from our example performs a shear and stretch. Vectors along the x-axis, like our first eigenvector , are simply stretched by a factor of 3. Vectors along the line , like our second eigenvector , are stretched by a factor of 2. Any other vector will have its direction changed.
The diagram shows how the eigenvectors and stay on the same line after being transformed by matrix , while another vector is knocked off its original line. This geometric property is what makes eigenvectors and eigenvalues so fundamental to understanding the behavior of matrices.
What is the defining characteristic of a non-zero eigenvector of a matrix A?
Which equation is solved to find the eigenvalues () of a square matrix A?