Study Guide

Further Matrix Algebra (FP3)

Edexcel International A-Level Further MathematicsΒ· FP3 Topic 6 (2018 Spec Issue 3)Β· 45 min read

1. 3D Linear Transformations & Combined Matricesβ˜…β˜…β˜…β˜†β˜†β± 10 min

βœ“ Calculator OK

πŸ“˜ Definition

3D Linear Transformation

A transformation T of 3D column vectors such that for all scalars and vectors , represented by a 3x3 matrix where .

This extends FP1 2D transformation work: each column of the 3x3 transformation matrix is the image of the standard basis vectors respectively. For combined transformations, the first transformation applied is the right-hand matrix in the product: performing transformation B then A is represented by , per Edexcel specification.

πŸ“ Worked Example

Let transformation B be a reflection in the xy-plane, and transformation A be a 90Β° anticlockwise rotation about the x-axis. Find the matrix representing B followed by A.

  1. 1

    Matrix B (reflection in xy-plane) maps :

  2. 2
  3. 3

    Matrix A (90Β° anticlockwise rotation about x-axis) maps :

  4. 4
  5. 5

    Combined matrix for B then A is :

  6. 6

Exam tip:

Always double-check the order of multiplication for combined transformations: the first transformation performed is the right-hand matrix in the product.

2. Transpose, 3x3 Determinants & Non-Singular Matricesβ˜…β˜…β˜…β˜†β˜†β± 10 min

βœ“ Calculator OK

πŸ“˜ Definition

Matrix Transpose

The matrix formed by swapping the rows and columns of , so the entry at row , column of is at row , column of . The product transpose rule is .

To calculate a 3x3 determinant, expand along the row or column with the most zeros, applying the alternating cofactor sign matrix: . A matrix is singular if its determinant is 0, meaning it has no inverse.

πŸ“ Worked Example

Calculate the determinant of and state if it is singular.

  1. 1

    Expand along row 1 (has one zero to simplify calculation):

  2. 2
  3. 3

    Compute each minor determinant:

  4. 4
  5. 5

    , so is non-singular.

Exam tip:

Always pick the row or column with the most zeros to expand the determinant, to minimize arithmetic errors.

3. 3x3 Matrix Inversesβ˜…β˜…β˜…β˜…β˜†β± 12 min

βœ“ Calculator OK

πŸ“˜ Definition

Adjugate Matrix

The transpose of the cofactor matrix of a square matrix, where cofactor and is the minor (determinant of the matrix with row , column removed). The inverse formula is , and the product inverse rule is .

The inverse of a transformation matrix corresponds to the inverse transformation, which maps image vectors back to their original positions. Always confirm the determinant is non-zero before calculating an inverse, as singular matrices have no inverse.

πŸ“ Worked Example

Find the inverse of , for which .

  1. 1

    Calculate the cofactor matrix using the alternating sign rule:

  2. 2
  3. 3

    Transpose the cofactor matrix to get the adjugate:

  4. 4
  5. 5

    Divide by to get the inverse:

  6. 6

Exam tip:

Verify your inverse calculation by checking that , the identity matrix, to catch any transposition or arithmetic errors.

4. Eigenvalues & Eigenvectorsβ˜…β˜…β˜…β˜…β˜†β± 12 min

βœ“ Calculator OK

πŸ“˜ Definition

Eigenvalue & Eigenvector

For a square matrix , an eigenvalue is a scalar such that for a non-zero vector , which is the corresponding eigenvector. Normalised eigenvectors have a magnitude of 1, calculated by dividing by .

Find eigenvalues by solving the characteristic equation . For each eigenvalue, solve to find the corresponding eigenvectors. For symmetric matrices, eigenvectors for distinct eigenvalues are always orthogonal.

πŸ“ Worked Example

Find the eigenvalues and normalised eigenvectors of symmetric matrix .

  1. 1

    Set up and solve the characteristic equation:

  2. 2
  3. 3

    Eigenvalues: , (repeated)

  4. 4

    For , solve to get eigenvector , normalise to

  5. 5

    For , solve to get orthogonal eigenvectors and , normalise to and

Exam tip:

For repeated eigenvalues of symmetric matrices, select orthogonal eigenvectors by inspection to avoid extra orthogonalisation steps later.

5. Orthogonal Diagonalisation of Symmetric Matricesβ˜…β˜…β˜…β˜…β˜…β± 11 min

βœ“ Calculator OK

πŸ“˜ Definition

Orthogonal Diagonalisation

For a symmetric matrix , the process of finding an orthogonal matrix such that , where is a diagonal matrix with the eigenvalues of on its leading diagonal.

To construct , use normalised, orthogonal eigenvectors of as its columns. Since is orthogonal, , so this process is equivalent to diagonalising using an orthonormal basis of eigenvectors.

πŸ“ Worked Example

Find an orthogonal matrix such that is diagonal for .

  1. 1

    Use the normalised orthogonal eigenvectors from the previous example as columns of :

  2. 2
  3. 3

    Confirm is orthogonal (), then compute :

  4. 4

Exam tip:

The order of columns in corresponds to the order of eigenvalues on the leading diagonal of , so you can arrange eigenvalues in any order as long as the eigenvectors match.

6. Common Pitfalls

Wrong move:

Multiplying combined transformation matrices in order A then B for "A then B"

Why:

Edexcel specification defines the first transformation as the right-hand matrix in the product, so reverse order is required

Correct move:

Always write the first transformation as the rightmost matrix, multiply by the second transformation on the left

Wrong move:

Forgetting to transpose the cofactor matrix when calculating the adjugate for 3x3 inverses

Why:

The adjugate is the transpose of the cofactor matrix, not the cofactor matrix itself, so skipping this step gives an incorrect inverse

Correct move:

After calculating the cofactor matrix, swap its rows and columns to get the adjugate before dividing by the determinant

Wrong move:

Using the order or for products

Why:

Both inverse and transpose reverse the order of the matrix product, so these incorrect orders lead to wrong results

Correct move:

Always reverse the order of matrices when taking the transpose or inverse of a product: ,

Wrong move:

Failing to normalise eigenvectors when constructing an orthogonal matrix for diagonalisation

Why:

Orthogonal matrices require columns of magnitude 1, so unnormalised eigenvectors will make non-orthogonal, so will not be diagonal

Correct move:

Divide each eigenvector by its magnitude before using it as a column of when orthogonal diagonalisation is required

Wrong move:

Expanding a 3x3 determinant without applying the cofactor sign alternation

Why:

The cofactor sign (+/-) alternates with each row and column position, so omitting it gives an incorrect determinant value

Correct move:

Use the sign matrix when expanding a 3x3 determinant along any row or column

7. Quick Reference Cheatsheet

Concept

Formula/Rule

Key Note

3D Transformation Matrix

Columns = images of

B then A = (right matrix first)

Transpose Product Rule

Swap rows and columns of to get

3x3 Determinant

Expand along row/column with cofactor signs

β†’ singular, no inverse

3x3 Inverse

Eigenvalues

Solve

solves

Eigenvectors

Solve

Normalise: divide by for orthonormal vectors

Orthogonal Diagonalisation

, orthogonal

has eigenvalues of on leading diagonal

8. Frequently Asked

Do I need to memorise 3x3 determinant and inverse formulas for FP3?

Yes, no 3x3 matrix operation formulas are provided in the FP3 formula book. You must recall the cofactor/adjugate inverse method and 3x3 determinant calculation procedure.

Why do I multiply matrices in reverse order for combined transformations?

The Edexcel specification defines that transformation B followed by transformation A is represented by the product matrix AB, as column vectors are multiplied on the left by the transformation matrix.

When do I need to normalise eigenvectors for diagonalisation?

For symmetric matrices, if you are asked for an orthogonal matrix P such that Pα΅€AP is diagonal, you must normalise each eigenvector to form the columns of P to ensure P is orthogonal.

Going deeper

What's Next

Now that you have mastered further matrix algebra for FP3, you can apply these concepts to other FP3 topics including linear systems of equations and 3D geometry, where matrices are used to represent planes and intersections. Eigenvalues and diagonalisation are also foundational for university-level linear algebra, engineering, and data science if you plan to pursue these fields at higher education. Make sure to practice full past paper questions on this topic to build speed and accuracy, as matrix questions are often worth 10+ marks and require careful step-by-step calculation to avoid arithmetic errors. Recap FP1 matrix content if you struggled with prerequisite knowledge, as gaps in basic matrix arithmetic will slow you down significantly in FP3 exam questions.