What is the geometric meaning of an eigenvector?

An eigenvector represents a direction that is unchanged by the linear transformation represented by the matrix. The vector itself is stretched or shrunk by a factor equal to its corresponding eigenvalue, but it still points along the same line through the origin. This line is called an invariant line.

Can an eigenvalue be zero?

Yes. An eigenvalue of zero means that there is a non-zero vector $\mathbf{x}$ such that $\mathbf{A}\mathbf{x} = 0\mathbf{x} = \mathbf{0}$. This means that the matrix maps a non-zero vector to the zero vector. This is only possible if the matrix is singular, i.e., its determinant is zero. The product of eigenvalues equals the determinant, so if one eigenvalue is zero, the determinant must be zero.

What happens if I get repeated eigenvalues for a 3x3 matrix?

If an eigenvalue $\lambda$ is a repeated root of the characteristic equation (e.g., has algebraic multiplicity 2), you might find one or two linearly independent eigenvectors for it. If you can find two linearly independent eigenvectors, they will form an 'invariant plane'. If you can only find one, it corresponds to an invariant line. The number of linearly independent eigenvectors for a given eigenvalue is its 'geometric multiplicity'.

Where can I learn Matrices for Cambridge 9231?

This free lesson on MarkScheme covers syllabus point 2.2 (Matrices) for Cambridge A-Level Further Mathematics. It includes visual revision, key points, and links to real past-paper questions with mark-scheme marking at markscheme.app/courses/9231/2-2-matrices.

Is Matrices (2.2) on 9231 free to study?

Yes. The Further Mathematics 9231 course on MarkScheme is 100% free — including premium visual lessons, exam tips, and past-paper marking. No paywall for Matrices.

How do I revise Matrices for 9231 exams?

Start with the visual steps on this page, note the key exam points, then attempt a 9231 past-paper question on Matrices using MarkScheme's /mark tool. Mark strictly against the official scheme and re-read any marks you lost.

Matrices 9231 — Free A-Level Further

Matrices

In Further Pure 1, you saw matrices as tools for representing linear transformations like rotations, reflections, and stretches. A key question arises: for a given transformation, are there any lines that are mapped onto themselves? That is, are there vectors whose direction is unchanged by the transformation, even if their magnitude is scaled? The answer is yes, and these special vectors and their associated scaling factors are called eigenvectors and eigenvalues. They are fundamental to understanding the properties of a matrix and have wide applications in fields like physics, engineering, and data science.

BY THE END, YOU CAN…

1Calculate the characteristic equation, eigenvalues, and corresponding eigenvectors of a square matrix up to 3x3.
2Apply the Cayley-Hamilton theorem to a square matrix to find powers of the matrix or its inverse.
3Recall and use the properties of eigenvalues and eigenvectors, including the relationship between eigenvalues and the trace and determinant.
4Understand the geometric interpretation of eigenvectors as invariant lines under the transformation represented by the matrix.

In simple terms

A friendly intro before the formal notes — no formulas yet.

Unlocking a Matrix's DNA

Eigenvalues and eigenvectors reveal the fundamental 'stretching' behaviour of a matrix transformation. They show us which directions remain unchanged, and by how much they are scaled.

THINK OF IT LIKE…

Imagine drawing lines on a sheet of rubber and then stretching it. Most lines will change direction, but some special lines will only get longer or shorter while pointing the same way. These special lines are like eigenvectors, and the amount they stretch by is the eigenvalue.

1
Form the characteristic equation $\det(\mathbf{A} - \lambda\mathbf{I}) = 0$ to create a polynomial in $\lambda$ .
2
Solve the characteristic equation to find the roots, which are the eigenvalues $\lambda$ of the matrix.
3
For each eigenvalue, solve the system of equations $(\mathbf{A} - \lambda\mathbf{I})\mathbf{x} = \mathbf{0}$ to find the corresponding non-zero eigenvectors $\mathbf{x}$ .
4
Apply the Cayley-Hamilton theorem by substituting the matrix $\mathbf{A}$ into its characteristic equation to find matrix powers or the inverse.

Explore the concept

Use the live diagram and synced steps — play it or tap a step card to walk through.

Key formulas

Tap any symbol to reveal exactly what it means and its units.

$\mathbf{A}\mathbf{x} = \lambda\mathbf{x}$

Tap a symbol — great for exam definitions

$\det(\mathbf{A} - \lambda\mathbf{I}) = 0$

Tap a symbol — great for exam definitions

$p(\lambda) = c_n\lambda^n + \dots + c_1\lambda + c_0 = 0$

Tap a symbol — great for exam definitions

Full topic notes

Formal explanation with the rigour you need for the exam.

Eigenvalues and Eigenvectors: The Fundamentals

For a square matrix $\mathbf{A}$ of order $n$ , an eigenvector is a non-zero column vector $\mathbf{x}$ of size $n \times 1$ which, when transformed by $\mathbf{A}$ , results in a vector that is a scalar multiple of itself. The scalar, denoted by $\lambda$ , is the eigenvalue corresponding to that eigenvector. This relationship is captured by the fundamental eigenvalue equation:

$\mathbf{A}\mathbf{x} = \lambda\mathbf{x}$

It is crucial that the eigenvector $\mathbf{x}$ is non-zero. If we allowed $\mathbf{x} = \mathbf{0}$ , the equation would hold for any matrix $\mathbf{A}$ and any scalar $\lambda$ , which is not useful. The geometric interpretation is that the vector $\mathbf{x}$ lies on an 'invariant line' passing through the origin. Any vector on this line is simply stretched or shrunk by a factor of $\lambda$ when the transformation $\mathbf{A}$ is applied.

Finding Eigenvalues: The Characteristic Equation

To find the eigenvalues, we rearrange the fundamental equation. $\mathbf{A}\mathbf{x} = \lambda\mathbf{x}$ $\mathbf{A}\mathbf{x} - \lambda\mathbf{x} = \mathbf{0}$ $\mathbf{A}\mathbf{x} - \lambda\mathbf{I}\mathbf{x} = \mathbf{0}$ (where $\mathbf{I}$ is the identity matrix) $(\mathbf{A} - \lambda\mathbf{I})\mathbf{x} = \mathbf{0}$ This is a system of homogeneous linear equations. We are looking for a non-trivial (non-zero) solution for $\mathbf{x}$ . This only exists if the matrix $(\mathbf{A} - \lambda\mathbf{I})$ is singular, which means its determinant must be zero.

$\det(\mathbf{A} - \lambda\mathbf{I}) = 0$

This equation is called the characteristic equation of matrix $\mathbf{A}$ .
For an $n \times n$ matrix, the characteristic equation will be a polynomial of degree $n$ in $\lambda$ .
The roots of this polynomial are the eigenvalues of the matrix $\mathbf{A}$ .
An $n \times n$ matrix will have $n$ eigenvalues, though they may not all be distinct (repeated roots) and may be complex numbers (for non-symmetric real matrices).

Finding Eigenvectors

Once we have found the eigenvalues, we can find the corresponding eigenvectors. For each distinct eigenvalue $\lambda$ , we substitute it back into the equation $(\mathbf{A} - \lambda\mathbf{I})\mathbf{x} = \mathbf{0}$ and solve for the vector $\mathbf{x} = \begin{pmatrix} x \\ y \end{pmatrix}$ . Since the determinant is zero, the system of equations will be consistent and have infinitely many solutions. These solutions lie on a line (or a plane for 3x3 matrices with repeated eigenvalues), and we can choose any simple non-zero vector from this set as our eigenvector.

The Cayley-Hamilton Theorem

This is a remarkable and powerful theorem in linear algebra. It states that any square matrix satisfies its own characteristic equation. For example, if the characteristic equation of a matrix $\mathbf{A}$ is $\lambda^2 - 5\lambda + 6 = 0$ , then the Cayley-Hamilton theorem states that $\mathbf{A}^2 - 5\mathbf{A} + 6\mathbf{I} = \mathbf{0}$ . Note that the constant term 6 becomes $6\mathbf{I}$ and the result is the zero matrix $\mathbf{0}$ . This theorem is incredibly useful for finding high powers of a matrix without direct multiplication, and for finding the inverse of a matrix.

If $p(\lambda) = c_n\lambda^n + \dots + c_1\lambda + c_0 = 0$ is the characteristic equation for $\mathbf{A}$ , then $p(\mathbf{A}) = c_n\mathbf{A}^n + \dots + c_1\mathbf{A} + c_0\mathbf{I} = \mathbf{0}$ .

Properties of Eigenvalues and Eigenvectors

The sum of the eigenvalues of a matrix equals its trace: $\sum_{i=1}^{n} \lambda_i = \text{tr}(\mathbf{A})$ . This is a very useful check.
The product of the eigenvalues of a matrix equals its determinant: $\prod_{i=1}^{n} \lambda_i = \det(\mathbf{A})$ . This tells you that a matrix is singular if and only if it has at least one eigenvalue equal to zero.
For a real symmetric matrix (where $\mathbf{A} = \mathbf{A}^T$ ), all eigenvalues are real numbers.
For a real symmetric matrix, eigenvectors corresponding to distinct eigenvalues are orthogonal. This means their dot product is zero: $\mathbf{e}_i \cdot \mathbf{e}_j = 0$ for $\lambda_i \neq \lambda_j$ .
If $\lambda$ is an eigenvalue of $\mathbf{A}$ with eigenvector $\mathbf{x}$ , then $\lambda^k$ is an eigenvalue of $\mathbf{A}^k$ for any positive integer $k$ , with the same eigenvector $\mathbf{x}$ .
If $\mathbf{A}$ is invertible and has eigenvalue $\lambda$ , then $\mathbf{A}^{-1}$ has eigenvalue $1/\lambda$ .

Worked examples

See the formulas applied — reveal one step at a time, like the exam.

EXAMPLE 1

Find the eigenvalues of the matrix $\mathbf{A} = \begin{pmatrix} 4 & -2 \\ 1 & 1 \end{pmatrix}$ .

1
First, we set up the matrix $(\mathbf{A} - \lambda\mathbf{I})$ .

EXAMPLE 2

For the matrix $\mathbf{A} = \begin{pmatrix} 4 & -2 \\ 1 & 1 \end{pmatrix}$ , find the eigenvectors corresponding to the eigenvalues $\lambda_1 = 2$ and $\lambda_2 = 3$ .

1
We solve $(\mathbf{A} - \lambda\mathbf{I})\mathbf{x} = \mathbf{0}$ for each eigenvalue. Let $\mathbf{x} = \begin{pmatrix} x \\ y \end{pmatrix}$ .

EXAMPLE 3

The characteristic equation of a 3x3 matrix $\mathbf{M}$ is given by $\lambda^3 - 2\lambda^2 - 5\lambda + 6 = 0$ . (a) Find an expression for $\mathbf{M}^{-1}$ in terms of $\mathbf{M}^2$ , $\mathbf{M}$ and $\mathbf{I}$ . (b) Find an expression for $\mathbf{M}^4$ in terms of $\mathbf{M}^2$ , $\mathbf{M}$ and $\mathbf{I}$ .

1
By the Cayley-Hamilton theorem, the matrix $\mathbf{M}$ satisfies its own characteristic equation: $\mathbf{M}^3 - 2\mathbf{M}^2 - 5\mathbf{M} + 6\mathbf{I} = \mathbf{0}$ .

How it all connects

The big idea sits in the middle — tap a linked idea to explore the link.

MAIN IDEAMatrices

Tap a linked idea to see how it connects back to the main topic — that connection is what examiners reward.

Glossary

Try to recall each definition before you reveal it.

Quick check

Answer in your head first — then tap to check. No pressure.

Revision flashcards

Flip the card. Test yourself before the exam.

QUESTION · 1 / 12

What is an eigenvalue of a matrix $\mathbf{A}$ ?

TAP OR SPACE TO FLIP

ANSWER

A scalar $\lambda$ such that for a non-zero vector $\mathbf{x}$ , the equation $\mathbf{A}\mathbf{x} = \lambda\mathbf{x}$ holds. It represents a scaling factor.

TAP OR SPACE TO FLIP BACK

1 / 12 · ← → space

Key takeaways

Review these before you close the topic — retrieval beats re-reading.

✓
This equation is called the characteristic equation of matrix $\mathbf{A}$ .
✓
For an $n \times n$ matrix, the characteristic equation will be a polynomial of degree $n$ in $\lambda$ .
✓
The roots of this polynomial are the eigenvalues of the matrix $\mathbf{A}$ .
✓
An $n \times n$ matrix will have $n$ eigenvalues, though they may not all be distinct (repeated roots) and may be complex numbers (for non-symmetric real matrices).

Practice — then mark it

The whole point: a real Cambridge question, marked mark-by-mark.

Real past paper[0]

Practice Questions on Eigenvalues, Eigenvectors, and Cayley-Hamilton Theorem

Do it on paper → mark itMARKED MARK-BY-MARK · B1 / M1 / A1 · OFFICIAL SCHEME

Extra simulations & links

PhET, GeoGebra and other curated tools — open in a new tab.

Frequently asked

✓

Checkpoint

One marked question is worth ten re-reads — close the loop before you move on.

Checkpoint

Reading it isn’t knowing it — prove it.

Before you move on: do Practice Questions on Eigenvalues, Eigenvectors, and Cayley-Hamilton Theorem on paper, snap a photo, and get examiner-style feedback on exactly where you win and lose marks.

Attempt & get marked →Takes about a minute · you’ll land back on this lesson

← PREVIOUS2.1 Hyperbolic functions NEXT →2.3 Differentiation

Matrices

BY THE END, YOU CAN…

1Calculate the characteristic equation, eigenvalues, and corresponding eigenvectors of a square matrix up to 3x3.
2Apply the Cayley-Hamilton theorem to a square matrix to find powers of the matrix or its inverse.
3Recall and use the properties of eigenvalues and eigenvectors, including the relationship between eigenvalues and the trace and determinant.
4Understand the geometric interpretation of eigenvectors as invariant lines under the transformation represented by the matrix.

In simple terms

A friendly intro before the formal notes — no formulas yet.

Unlocking a Matrix's DNA

Eigenvalues and eigenvectors reveal the fundamental 'stretching' behaviour of a matrix transformation. They show us which directions remain unchanged, and by how much they are scaled.

THINK OF IT LIKE…

1
Form the characteristic equation $\det(\mathbf{A} - \lambda\mathbf{I}) = 0$ to create a polynomial in $\lambda$ .
2
Solve the characteristic equation to find the roots, which are the eigenvalues $\lambda$ of the matrix.
3
For each eigenvalue, solve the system of equations $(\mathbf{A} - \lambda\mathbf{I})\mathbf{x} = \mathbf{0}$ to find the corresponding non-zero eigenvectors $\mathbf{x}$ .
4
Apply the Cayley-Hamilton theorem by substituting the matrix $\mathbf{A}$ into its characteristic equation to find matrix powers or the inverse.

Explore the concept

Use the live diagram and synced steps — play it or tap a step card to walk through.

Key formulas

Tap any symbol to reveal exactly what it means and its units.

$\mathbf{A}\mathbf{x} = \lambda\mathbf{x}$

Tap a symbol — great for exam definitions

$\det(\mathbf{A} - \lambda\mathbf{I}) = 0$

Tap a symbol — great for exam definitions

$p(\lambda) = c_n\lambda^n + \dots + c_1\lambda + c_0 = 0$

Tap a symbol — great for exam definitions

Full topic notes

Formal explanation with the rigour you need for the exam.

Eigenvalues and Eigenvectors: The Fundamentals

$\mathbf{A}\mathbf{x} = \lambda\mathbf{x}$

Finding Eigenvalues: The Characteristic Equation

$\det(\mathbf{A} - \lambda\mathbf{I}) = 0$

This equation is called the characteristic equation of matrix $\mathbf{A}$ .
For an $n \times n$ matrix, the characteristic equation will be a polynomial of degree $n$ in $\lambda$ .
The roots of this polynomial are the eigenvalues of the matrix $\mathbf{A}$ .
An $n \times n$ matrix will have $n$ eigenvalues, though they may not all be distinct (repeated roots) and may be complex numbers (for non-symmetric real matrices).

Finding Eigenvectors

The Cayley-Hamilton Theorem

Properties of Eigenvalues and Eigenvectors

The sum of the eigenvalues of a matrix equals its trace: $\sum_{i=1}^{n} \lambda_i = \text{tr}(\mathbf{A})$ . This is a very useful check.
The product of the eigenvalues of a matrix equals its determinant: $\prod_{i=1}^{n} \lambda_i = \det(\mathbf{A})$ . This tells you that a matrix is singular if and only if it has at least one eigenvalue equal to zero.
For a real symmetric matrix (where $\mathbf{A} = \mathbf{A}^T$ ), all eigenvalues are real numbers.
For a real symmetric matrix, eigenvectors corresponding to distinct eigenvalues are orthogonal. This means their dot product is zero: $\mathbf{e}_i \cdot \mathbf{e}_j = 0$ for $\lambda_i \neq \lambda_j$ .
If $\lambda$ is an eigenvalue of $\mathbf{A}$ with eigenvector $\mathbf{x}$ , then $\lambda^k$ is an eigenvalue of $\mathbf{A}^k$ for any positive integer $k$ , with the same eigenvector $\mathbf{x}$ .
If $\mathbf{A}$ is invertible and has eigenvalue $\lambda$ , then $\mathbf{A}^{-1}$ has eigenvalue $1/\lambda$ .

Worked examples

See the formulas applied — reveal one step at a time, like the exam.

EXAMPLE 1

Find the eigenvalues of the matrix $\mathbf{A} = \begin{pmatrix} 4 & -2 \\ 1 & 1 \end{pmatrix}$ .

1
First, we set up the matrix $(\mathbf{A} - \lambda\mathbf{I})$ .

EXAMPLE 2

For the matrix $\mathbf{A} = \begin{pmatrix} 4 & -2 \\ 1 & 1 \end{pmatrix}$ , find the eigenvectors corresponding to the eigenvalues $\lambda_1 = 2$ and $\lambda_2 = 3$ .

1
We solve $(\mathbf{A} - \lambda\mathbf{I})\mathbf{x} = \mathbf{0}$ for each eigenvalue. Let $\mathbf{x} = \begin{pmatrix} x \\ y \end{pmatrix}$ .

EXAMPLE 3

1
By the Cayley-Hamilton theorem, the matrix $\mathbf{M}$ satisfies its own characteristic equation: $\mathbf{M}^3 - 2\mathbf{M}^2 - 5\mathbf{M} + 6\mathbf{I} = \mathbf{0}$ .

How it all connects

The big idea sits in the middle — tap a linked idea to explore the link.

MAIN IDEAMatrices

Tap a linked idea to see how it connects back to the main topic — that connection is what examiners reward.

Glossary

Try to recall each definition before you reveal it.

Quick check

Answer in your head first — then tap to check. No pressure.

Revision flashcards

Flip the card. Test yourself before the exam.

QUESTION · 1 / 12

What is an eigenvalue of a matrix $\mathbf{A}$ ?

TAP OR SPACE TO FLIP

ANSWER

A scalar $\lambda$ such that for a non-zero vector $\mathbf{x}$ , the equation $\mathbf{A}\mathbf{x} = \lambda\mathbf{x}$ holds. It represents a scaling factor.

TAP OR SPACE TO FLIP BACK

1 / 12 · ← → space

Key takeaways

Review these before you close the topic — retrieval beats re-reading.

✓
This equation is called the characteristic equation of matrix $\mathbf{A}$ .
✓
For an $n \times n$ matrix, the characteristic equation will be a polynomial of degree $n$ in $\lambda$ .
✓
The roots of this polynomial are the eigenvalues of the matrix $\mathbf{A}$ .
✓
An $n \times n$ matrix will have $n$ eigenvalues, though they may not all be distinct (repeated roots) and may be complex numbers (for non-symmetric real matrices).

Practice — then mark it

The whole point: a real Cambridge question, marked mark-by-mark.

Real past paper[0]

Practice Questions on Eigenvalues, Eigenvectors, and Cayley-Hamilton Theorem

Do it on paper → mark itMARKED MARK-BY-MARK · B1 / M1 / A1 · OFFICIAL SCHEME

Extra simulations & links

PhET, GeoGebra and other curated tools — open in a new tab.

Frequently asked

✓

Checkpoint

One marked question is worth ten re-reads — close the loop before you move on.

Checkpoint

Reading it isn’t knowing it — prove it.

Attempt & get marked →Takes about a minute · you’ll land back on this lesson

← PREVIOUS2.1 Hyperbolic functions NEXT →2.3 Differentiation

Revise Matrices for Cambridge 9231 (2.2)

In simple terms

Explore the concept

Key formulas

Full topic notes

Eigenvalues and Eigenvectors: The Fundamentals

Finding Eigenvalues: The Characteristic Equation

Finding Eigenvectors

The Cayley-Hamilton Theorem

Properties of Eigenvalues and Eigenvectors

Worked examples

How it all connects

Glossary

Quick check

Revision flashcards

Key takeaways

Practice — then mark it

Practice Questions on Eigenvalues, Eigenvectors, and Cayley-Hamilton Theorem

Extra simulations & links

Frequently asked

Checkpoint

Reading it isn’t knowing it — prove it.

In simple terms

Explore the concept

Key formulas

Full topic notes

Eigenvalues and Eigenvectors: The Fundamentals

Finding Eigenvalues: The Characteristic Equation

Finding Eigenvectors

The Cayley-Hamilton Theorem

Properties of Eigenvalues and Eigenvectors

Worked examples

How it all connects

Glossary

Quick check

Revision flashcards

Key takeaways

Practice — then mark it

Practice Questions on Eigenvalues, Eigenvectors, and Cayley-Hamilton Theorem

Extra simulations & links

Frequently asked

Checkpoint

Reading it isn’t knowing it — prove it.

Discuss Matrices