Skip to main content

Welcome to a Grasp lesson

Create a free account to keep studying and create your own study path.

Lesson 19

Eigenvalues, Eigenvectors, and the Cayley-Hamilton Theorem

Recommended resources

Hello! In our last lesson, we mastered the art of solving systems of linear equations using Gaussian elimination and the Rouché–Capelli theorem. We saw that for a square system , a unique solution exists if and only if . This implied that for the homogeneous system , a non-trivial (non-zero) solution exists only when . This very idea is the key that unlocks today's topic.

This lesson delves into eigenvalues and eigenvectors, which are arguably the most important concepts in linear algebra. They reveal the deep, intrinsic properties of a matrix. Your goal is to learn how to calculate these special values and vectors, and then use a powerful result called the Cayley-Hamilton theorem to perform complex matrix calculations, like finding high powers or inverses, in a very efficient way. These are classic GATE questions, and mastering this topic will give you a significant edge.

1. What Are Eigenvectors and Eigenvalues?

In essence, a linear transformation (represented by a matrix) can stretch, shrink, rotate, and shear vectors. Amidst all this complex movement, certain vectors stand out. These special vectors, called eigenvectors, are not knocked off their original direction (their "span") by the transformation. They are only stretched or shrunk. The factor by which they are scaled is their corresponding eigenvalue.

To build a strong intuition for this, let's watch a segment from the highly acclaimed "Essence of linear algebra" series by 3Blue1Brown.

Eigenvectors and eigenvalues | Chapter 14, Essence of linear algebra

This video provides a superb visual explanation of what eigenvectors and eigenvalues represent geometrically.

Watch the introductory part from the beginning. Focus on the idea of a vector "remaining on its own span" after the transformation. Notice how the eigenvector for a 3D rotation corresponds to its axis of rotation—a concept that simplifies the entire transformation.

As the video explains, if is a square matrix, is a non-zero vector, and is a scalar, their relationship is formally defined by the equation:

  • is the eigenvector of matrix .
  • is the corresponding eigenvalue.

Let's quickly verify this relationship with a concrete example.

Finding Eigenvalues and Eigenvectors

This clip from Professor Dave Explains demonstrates how to check if a given vector is an eigenvector of a matrix.

Watch the short segment from this demonstration. You'll see how multiplying the matrix A by the proposed eigenvector x results in a vector that is simply a scaled version of the original x. The scaling factor is the eigenvalue.


2. Finding Eigenvalues: The Characteristic Equation

Now that we understand the concept, how do we find these values without knowing them beforehand? We start by rearranging the defining equation:

To factor out the vector , we need to express as a matrix-vector product. We can do this by introducing the identity matrix :

This equation should look familiar! It's a homogeneous system of linear equations. We are looking for a non-trivial solution for (since eigenvectors are, by definition, non-zero). As we recalled from our last lesson, a homogeneous system has non-trivial solutions if and only if the determinant of the coefficient matrix is zero.

Therefore, we must have:

This is the characteristic equation of matrix . The roots of this equation are the eigenvalues ().

The following videos will walk you through this derivation and the subsequent calculation.

Eigenvectors and eigenvalues | Chapter 14, Essence of linear algebra

3Blue1Brown again provides the deep conceptual reasoning behind why the determinant must be zero.

Watch from this section. The key insight is that for (A - \lambda I)X = 0 to have a non-zero solution X, the transformation represented by the matrix (A - \lambda I) must "squish" space into a lower dimension, which is precisely what a zero determinant signifies.

Now, let's see the step-by-step mechanical process of finding the eigenvalues, which is what you'll execute in the exam.

Finding Eigenvalues and Eigenvectors

Professor Dave provides a very clear, procedural guide to finding eigenvalues.

Follow the example from the walkthrough. The steps are: Construct the matrix A - \lambda I. Calculate its determinant, which will give you a polynomial in \lambda (the characteristic polynomial). Set the determinant to zero and solve for \lambda. The solutions are your eigenvalues.


3. Finding Eigenvectors

Once you have found the eigenvalues, you can find the corresponding eigenvectors. For each eigenvalue , you must solve the system of equations:

The set of all solutions for a given forms the eigenspace for that eigenvalue. Any non-zero vector in this space is a valid eigenvector. The process involves substituting a found value of into the matrix and solving the resulting homogeneous system, usually by reducing it to row echelon form.

Finding Eigenvalues and Eigenvectors

Professor Dave continues by demonstrating how to find the eigenvectors for both a 2x2 and a more complex 3x3 matrix. This is essential practice for GATE.

First, watch the 2x2 example from this segment. Notice how after row reduction, you get an equation relating the components of the eigenvector (e.g., x_2 = 2x_1), leading to a "free" variable. You can choose a simple value (like 1) for the free variable to get a representative eigenvector. Next, watch the 3x3 example from the example. This is a more realistic GATE-level problem. Follow the process for each of the three eigenvalues to find their corresponding eigenvectors.


4. The Cayley-Hamilton Theorem

This powerful theorem provides a remarkable link between a matrix and its own characteristic equation.

Theorem Statement: Every square matrix satisfies its own characteristic equation.

This means if the characteristic equation for matrix is , then substituting the matrix for (and for the constant term) will result in the zero matrix:

This theorem has two killer applications for GATE.

Application 1: Finding the Inverse of a Matrix

If the matrix is invertible, we can multiply the matrix equation by :

We can then rearrange this to solve for in terms of powers of and the identity matrix . This is often much faster than using the adjoint-determinant method.

Example:
Let's find the inverse of .

  1. Characteristic Equation:
  2. Apply Cayley-Hamilton:
  3. Solve for : Multiply by .

Application 2: Finding High Powers of a Matrix

We can use the characteristic equation to express the highest power of in terms of lower powers.
From our example, .
Suppose we need to find . Instead of a costly matrix multiplication, we can do:

Now substitute again:

This reduces the problem of finding to simple matrix addition and scalar multiplication, which is computationally much cheaper.


Conclusion

This lesson introduced the core concepts of eigenvalues and eigenvectors, which describe how a transformation acts along certain invariant directions.

Key Takeaways:

  • Eigen-equation: The defining relationship is , where .
  • Finding Eigenvalues: Solve the characteristic equation . The roots of this polynomial are the eigenvalues.
  • Finding Eigenvectors: For each eigenvalue , solve the homogeneous system to find the corresponding eigenvectors .
  • Cayley-Hamilton Theorem: A matrix satisfies its own characteristic equation. This provides a powerful shortcut for finding the inverse or high powers of a matrix, a frequent pattern in GATE questions.

We have now concluded the Linear Algebra portion of this module. In our next lesson, we will transition to the second major topic of Engineering Mathematics: Calculus. We will start with the fundamental concepts of limits, continuity, and differentiability, which form the bedrock of analyzing functions and their behavior.