Math AA HL: Eigenvalues and Eigenvectors

Understanding eigenvalues and eigenvectors is not just a procedural exercise in linear algebra; it is a gateway to mastering how matrices, which represent complex transformations, behave at their core. These concepts are fundamental for analyzing systems that evolve over time, such as in physics and economics, and are essential for simplifying complex matrix operations through diagonalization. In your IB Math AA HL course, you will learn to find these special scalars and vectors, interpret them geometrically, and apply them to solve real-world problems, including systems of differential equations.

The Core Idea: Scaling Directions

Before diving into calculations, grasp the fundamental concept. When a square matrix $A$ acts on a vector $v$ via multiplication, it typically rotates and stretches the vector, changing its direction. An eigenvector is a special nonzero vector $v$ that, when transformed by $A$ , does not change its direction. It may only be scaled (stretched or shrunk) by a specific factor. That scaling factor is the corresponding eigenvalue, often denoted by $λ$ (lambda).

Formally, for an $n \times n$ matrix $A$ , a nonzero vector $v$ is an eigenvector if it satisfies the equation: $A v = λ v$ The scalar $λ$ is the eigenvalue associated with eigenvector $v$ .

Geometrically, imagine a transformation represented by $A$ . An eigenvector points along a line that remains unchanged under that transformation. Every vector on that line is simply stretched or compressed by the factor $λ$ . If $λ$ is positive, the direction is preserved; if negative, it is reversed; and if $λ = 0$ , the eigenvector is mapped to the zero vector. This interpretation is key to visualizing matrix behavior.

Finding Eigenvalues: The Characteristic Equation

To find eigenvalues, we rearrange the eigenvector equation: $A v = λ v$ becomes $A v - λ v = 0$ , or $(A - λ I) v = 0$ , where $I$ is the identity matrix.

For nonzero solutions $v$ to exist, the matrix $(A - λ I)$ must be singular—its determinant must be zero. This leads to the characteristic equation: $det (A - λ I) = 0$

The determinant of $(A - λ I)$ yields a polynomial in $λ$ , called the characteristic polynomial. The roots of this polynomial are the eigenvalues of $A$ .

Worked Example: Let $A = (3012)$ . Find its eigenvalues.

Form $A - λ I = (3 - λ 0 1 2 - λ)$ .
Compute the determinant: $det (A - λ I) = (3 - λ) (2 - λ) - (1) (0) = (3 - λ) (2 - λ)$ .
Set the characteristic polynomial equal to zero: $(3 - λ) (2 - λ) = 0$ .
Solve for $λ$ : $λ_{1} = 3$ , $λ_{2} = 2$ .

Thus, the eigenvalues are $λ = 3$ and $λ = 2$ .

Finding Eigenvectors: Solving $(A - λ I) v = 0$

Once an eigenvalue $λ$ is known, its corresponding eigenvectors are found by solving the homogeneous system of linear equations $(A - λ I) v = 0$ . The solutions form the eigenspace for that $λ$ .

Continuing our example, find the eigenvectors for $A = (3012)$ .

*For $λ_{1} = 3$ :*

Substitute into $(A - λ I)$ : $A - 3 I = (00 1 - 1)$ .
Solve $(00 1 - 1) (x y) = (00)$ .

This gives the equations $0 x + 1 y = 0$ and $0 x - 1 y = 0$ , both simplifying to $y = 0$ .

$x$ is a free variable. Therefore, eigenvectors are of the form $(t 0)$ for any $t \neq = 0$ . A basis for this eigenspace is $(10)$ .

*For $λ_{2} = 2$ :*

$A - 2 I = (1010)$ .
Solve $(1010) (x y) = (00)$ .

This gives $1 x + 1 y = 0$ , or $x = - y$ .

$y$ is a free variable. So eigenvectors are of the form $(- t t)$ . A basis is $(- 1 1)$ .

Diagonalization: Simplifying Matrix Powers

A square matrix $A$ is diagonalizable if it can be expressed in the form $A = P D P^{- 1}$ , where $D$ is a diagonal matrix containing the eigenvalues of $A$ , and $P$ is an invertible matrix whose columns are the corresponding eigenvectors of $A$ .

This decomposition is incredibly powerful. For instance, computing high powers of $A$ becomes trivial: $A^{n} = (P D P^{- 1})^{n} = P D^{n} P^{- 1}$ Since $D$ is diagonal, $D^{n}$ is simply each diagonal entry (eigenvalue) raised to the $n$ th power.

A matrix is diagonalizable if and only if it has a full set of $n$ linearly independent eigenvectors. This is guaranteed if all eigenvalues are distinct.

Applying to our example: We have eigenvalues $λ_{1} = 3, λ_{2} = 2$ with corresponding eigenvectors $(10)$ and $(- 1 1)$ . We can form: $P = (10 - 1 1), D = (3002)$ You can verify that $A = P D P^{- 1}$ and that $A^{10} = P D^{10} P^{- 1} = P (3^{10} 0 0 2^{10}) P^{- 1}$ , a much simpler calculation.

Application: Solving Systems of Linear Differential Equations

One of the most important applications is solving a system of first-order linear differential equations of the form: $\frac{d x}{d t} = A x$ where $x (t)$ is a vector of functions and $A$ is a constant matrix.

The diagonalization process decouples this intertwined system. Let $x = P y$ , where $P$ is the eigenvector matrix. Substituting: $P \frac{d y}{d t} = A P y ⟹ \frac{d y}{d t} = P^{- 1} A P y = D y$ Since $D$ is diagonal, the system becomes: $\frac{d y _{1}}{d t} = λ_{1} y_{1}, \frac{d y _{2}}{d t} = λ_{2} y_{2}, ...$ These are simple, decoupled equations with solutions $y_{i} (t) = C_{i} e^{λ_{i} t}$ . The general solution for the original system is then $x (t) = P y (t)$ , which is a linear combination of terms of the form $e^{λ t} v$ , where $(λ, v)$ are eigenvalue-eigenvector pairs.

This elegantly shows how the long-term behavior of the system (growth, decay, oscillation) is governed by the eigenvalues, while the eigenvectors determine the "modes" or patterns of behavior.

Common Pitfalls

Algebraic Errors in the Characteristic Polynomial: A single sign error when computing $det (A - λ I)$ will yield incorrect eigenvalues. Always double-check your arithmetic, especially with larger matrices. Use the trace and determinant as a quick check: for a $2 \times 2$ matrix, the sum of eigenvalues equals the trace, and their product equals the determinant.

Confusing Eigenvectors with Eigenspaces: An eigenvector is not unique; any nonzero scalar multiple of an eigenvector is also an eigenvector for the same eigenvalue. When asked to "find the eigenvectors," you are typically finding a basis for the eigenspace. Do not make the mistake of thinking $(10)$ is the only eigenvector for $λ = 3$ in our example; $(- 5 0)$ is equally valid.

Assuming Diagonalizability is Guaranteed: Not all matrices are diagonalizable. A matrix may fail if it has repeated eigenvalues but does not have enough linearly independent eigenvectors (a defective matrix). You must verify you can form a full set of independent eigenvectors before writing $A = P D P^{- 1}$ .

Misapplying to Non-Square Matrices: Eigenvalues and eigenvectors are only defined for square matrices. The equation $A v = λ v$ requires $A$ to be $n \times n$ and $v$ to be $n \times 1$ .

Summary

Eigenvalues ( $λ$ ) and eigenvectors ( $v$ ) satisfy the defining equation $A v = λ v$ , where an eigenvector's direction is invariant under the transformation by $A$ , only scaled by $λ$ .
You find eigenvalues by solving the characteristic equation $det (A - λ I) = 0$ . You find corresponding eigenvectors by solving the homogeneous system $(A - λ I) v = 0$ .
Diagonalization, expressed as $A = P D P^{- 1}$ , decomposes a matrix using its eigenvalues (in $D$ ) and eigenvectors (in $P$ ). This simplifies computing matrix powers and analyzing matrix functions.
A key application is solving systems of linear differential equations $\frac{d x}{d t} = A x$ , where the general solution is built from terms $e^{λ t} v$ , directly linking the system's dynamics to the eigenvalues and eigenvectors of $A$ .
Mastering these concepts provides a powerful toolkit for simplifying and analyzing linear transformations across pure and applied mathematics.

Math AA HL: Eigenvalues and Eigenvectors

The Core Idea: Scaling Directions

Formally, for an $n \times n$ matrix $A$ , a nonzero vector $v$ is an eigenvector if it satisfies the equation: $$A \mathbf{v} = \lambda \mathbf{v}$$ The scalar $\lambda$ is the eigenvalue associated with eigenvector $v$ .

Geometrically, imagine a transformation represented by $A$ . An eigenvector points along a line that remains unchanged under that transformation. Every vector on that line is simply stretched or compressed by the factor $\lambda$ . If $\lambda$ is positive, the direction is preserved; if negative, it is reversed; and if $\lambda=0$ , the eigenvector is mapped to the zero vector. This interpretation is key to visualizing matrix behavior.

Finding Eigenvalues: The Characteristic Equation

To find eigenvalues, we rearrange the eigenvector equation: $A\mathbf{v} = \lambda \mathbf{v}$ becomes $A\mathbf{v} - \lambda \mathbf{v} = \mathbf{0}$ , or $(A - \lambda I)\mathbf{v} = \mathbf{0}$ , where $I$ is the identity matrix.

For nonzero solutions $\mathbf{v}$ to exist, the matrix $(A - \lambda I)$ must be singular—its determinant must be zero. This leads to the characteristic equation: $$\det(A - \lambda I) = 0$$

The determinant of $(A - \lambda I)$ yields a polynomial in $\lambda$ , called the characteristic polynomial. The roots of this polynomial are the eigenvalues of $A$ .

Worked Example: Let $A = \begin{pmatrix} 3 & 1 \\ 0 & 2 \end{pmatrix}$ . Find its eigenvalues.

Form $A - \lambda I = \begin{pmatrix} 3-\lambda & 1 \\ 0 & 2-\lambda \end{pmatrix}$ .
Compute the determinant: $\det(A - \lambda I) = (3-\lambda)(2-\lambda) - (1)(0) = (3-\lambda)(2-\lambda)$ .
Set the characteristic polynomial equal to zero: $(3-\lambda)(2-\lambda)=0$ .
Solve for $\lambda$ : $\lambda_1 = 3$ , $\lambda_2 = 2$ .

Thus, the eigenvalues are $\lambda = 3$ and $\lambda = 2$ .

Finding Eigenvectors: Solving $(A - \lambda I)\mathbf{v} = \mathbf{0}$

Once an eigenvalue $\lambda$ is known, its corresponding eigenvectors are found by solving the homogeneous system of linear equations $(A - \lambda I)\mathbf{v} = \mathbf{0}$ . The solutions form the eigenspace for that $\lambda$ .

Continuing our example, find the eigenvectors for $A = \begin{pmatrix} 3 & 1 \\ 0 & 2 \end{pmatrix}$ .

*For $\lambda_1 = 3$ :*

Substitute into $(A - \lambda I)$ : $A - 3I = \begin{pmatrix} 0 & 1 \\ 0 & -1 \end{pmatrix}$ .
Solve $\begin{pmatrix} 0 & 1 \\ 0 & -1 \end{pmatrix} \begin{pmatrix} x \\ y \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \end{pmatrix}$ .

This gives the equations $0x + 1y = 0$ and $0x - 1y = 0$ , both simplifying to $y=0$ .

$x$ is a free variable. Therefore, eigenvectors are of the form $\begin{pmatrix} t \\ 0 \end{pmatrix}$ for any $t \neq 0$ . A basis for this eigenspace is $\begin{pmatrix} 1 \\ 0 \end{pmatrix}$ .

*For $\lambda_2 = 2$ :*

$A - 2I = \begin{pmatrix} 1 & 1 \\ 0 & 0 \end{pmatrix}$ .
Solve $\begin{pmatrix} 1 & 1 \\ 0 & 0 \end{pmatrix} \begin{pmatrix} x \\ y \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \end{pmatrix}$ .

This gives $1x + 1y = 0$ , or $x = -y$ .

$y$ is a free variable. So eigenvectors are of the form $\begin{pmatrix} -t \\ t \end{pmatrix}$ . A basis is $\begin{pmatrix} -1 \\ 1 \end{pmatrix}$ .

Diagonalization: Simplifying Matrix Powers

A square matrix $A$ is diagonalizable if it can be expressed in the form $A = PDP^{-1}$ , where $D$ is a diagonal matrix containing the eigenvalues of $A$ , and $P$ is an invertible matrix whose columns are the corresponding eigenvectors of $A$ .

This decomposition is incredibly powerful. For instance, computing high powers of $A$ becomes trivial: $$A^n = (PDP^{-1})^n = P D^n P^{-1}$$ Since $D$ is diagonal, $D^n$ is simply each diagonal entry (eigenvalue) raised to the $n$ th power.

A matrix is diagonalizable if and only if it has a full set of $n$ linearly independent eigenvectors. This is guaranteed if all eigenvalues are distinct.

Applying to our example: We have eigenvalues $\lambda_1=3, \lambda_2=2$ with corresponding eigenvectors $\begin{pmatrix} 1 \\ 0 \end{pmatrix}$ and $\begin{pmatrix} -1 \\ 1 \end{pmatrix}$ . We can form: $$P = \begin{pmatrix} 1 & -1 \\ 0 & 1 \end{pmatrix}, \quad D = \begin{pmatrix} 3 & 0 \\ 0 & 2 \end{pmatrix}$$ You can verify that $A = PDP^{-1}$ and that $A^{10} = P D^{10} P^{-1} = P \begin{pmatrix} 3^{10} & 0 \\ 0 & 2^{10} \end{pmatrix} P^{-1}$ , a much simpler calculation.

Application: Solving Systems of Linear Differential Equations

One of the most important applications is solving a system of first-order linear differential equations of the form: $$\frac{d\mathbf{x}}{dt} = A\mathbf{x}$$ where $\mathbf{x}(t)$ is a vector of functions and $A$ is a constant matrix.

The diagonalization process decouples this intertwined system. Let $\mathbf{x} = P\mathbf{y}$ , where $P$ is the eigenvector matrix. Substituting: $$P \frac{d\mathbf{y}}{dt} = A P \mathbf{y} \implies \frac{d\mathbf{y}}{dt} = P^{-1}AP\mathbf{y} = D\mathbf{y}$$ Since $D$ is diagonal, the system becomes: $$\frac{dy_1}{dt} = \lambda_1 y_1, \quad \frac{dy_2}{dt} = \lambda_2 y_2, \quad ...$$ These are simple, decoupled equations with solutions $y_i(t) = C_i e^{\lambda_i t}$ . The general solution for the original system is then $\mathbf{x}(t) = P\mathbf{y}(t)$ , which is a linear combination of terms of the form $e^{\lambda t}\mathbf{v}$ , where $(\lambda, \mathbf{v})$ are eigenvalue-eigenvector pairs.

This elegantly shows how the long-term behavior of the system (growth, decay, oscillation) is governed by the eigenvalues, while the eigenvectors determine the "modes" or patterns of behavior.

Common Pitfalls

Algebraic Errors in the Characteristic Polynomial: A single sign error when computing $\det(A - \lambda I)$ will yield incorrect eigenvalues. Always double-check your arithmetic, especially with larger matrices. Use the trace and determinant as a quick check: for a $2 \times 2$ matrix, the sum of eigenvalues equals the trace, and their product equals the determinant.

Confusing Eigenvectors with Eigenspaces: An eigenvector is not unique; any nonzero scalar multiple of an eigenvector is also an eigenvector for the same eigenvalue. When asked to "find the eigenvectors," you are typically finding a basis for the eigenspace. Do not make the mistake of thinking $\begin{pmatrix} 1 \\ 0 \end{pmatrix}$ is the only eigenvector for $\lambda=3$ in our example; $\begin{pmatrix} -5 \\ 0 \end{pmatrix}$ is equally valid.

Assuming Diagonalizability is Guaranteed: Not all matrices are diagonalizable. A matrix may fail if it has repeated eigenvalues but does not have enough linearly independent eigenvectors (a defective matrix). You must verify you can form a full set of independent eigenvectors before writing $A = PDP^{-1}$ .

Misapplying to Non-Square Matrices: Eigenvalues and eigenvectors are only defined for square matrices. The equation $A\mathbf{v} = \lambda \mathbf{v}$ requires $A$ to be $n \times n$ and $\mathbf{v}$ to be $n \times 1$ .

Summary

Eigenvalues ( $\lambda$ ) and eigenvectors ( $\mathbf{v}$ ) satisfy the defining equation $A\mathbf{v} = \lambda \mathbf{v}$ , where an eigenvector's direction is invariant under the transformation by $A$ , only scaled by $\lambda$ .
You find eigenvalues by solving the characteristic equation $\det(A - \lambda I) = 0$ . You find corresponding eigenvectors by solving the homogeneous system $(A - \lambda I)\mathbf{v} = \mathbf{0}$ .
Diagonalization, expressed as $A = PDP^{-1}$ , decomposes a matrix using its eigenvalues (in $D$ ) and eigenvectors (in $P$ ). This simplifies computing matrix powers and analyzing matrix functions.
A key application is solving systems of linear differential equations $\frac{d\mathbf{x}}{dt} = A\mathbf{x}$ , where the general solution is built from terms $e^{\lambda t}\mathbf{v}$ , directly linking the system's dynamics to the eigenvalues and eigenvectors of $A$ .
Mastering these concepts provides a powerful toolkit for simplifying and analyzing linear transformations across pure and applied mathematics.

Math AA HL: Eigenvalues and Eigenvectors

Math AA HL: Eigenvalues and Eigenvectors

The Core Idea: Scaling Directions

Finding Eigenvalues: The Characteristic Equation

Finding Eigenvectors: Solving (A−λI)v=0

Diagonalization: Simplifying Matrix Powers

Application: Solving Systems of Linear Differential Equations

Common Pitfalls

Summary

Math AA HL: Eigenvalues and Eigenvectors

The Core Idea: Scaling Directions

Finding Eigenvalues: The Characteristic Equation

Finding Eigenvectors: Solving $(A - \lambda I)\mathbf{v} = \mathbf{0}$

Diagonalization: Simplifying Matrix Powers

Application: Solving Systems of Linear Differential Equations

Common Pitfalls

Summary

Write better notes with AI

Math AA HL: Eigenvalues and Eigenvectors

The Core Idea: Scaling Directions

Finding Eigenvalues: The Characteristic Equation

Finding Eigenvectors: Solving (A−λI)v=0

Diagonalization: Simplifying Matrix Powers

Application: Solving Systems of Linear Differential Equations

Common Pitfalls

Summary

Finding Eigenvectors: Solving $(A - λ I) v = 0$

Finding Eigenvectors: Solving $(A - λ I) v = 0$