All subjects · Further Mathematics · WFM01 Further Pure Mathematics 1

Proof by induction: matrices

Edexcel IAL Further Mathematics · WFM01 Further Pure Mathematics 1

Induction can prove a formula for the nth power of a matrix. The inductive step multiplies the assumed form of Mk by M.

Practise this in the app: instant marking and a fix for every mistake. Free, no email needed to start.

Practise this lesson

Structure

To prove Mn = A(n):

Example

Prove (3 -4; 1 -1)n = (2n + 1 -4n; n 1 - 2n).

n = 1: (3 -4; 1 -1). True.

Assume Mk = (2k + 1 -4k; k 1 - 2k). Then

Mk+1 = (2k + 1 -4k; k 1 - 2k)(3 -4; 1 -1)

= (6k + 3 - 4k, -8k - 4 + 4k; 3k + 1 - 2k, -4k - 1 + 2k)

= (2k + 3 -4k - 4; k + 1 -2k - 1) = (2(k + 1) + 1 -4(k + 1); k + 1 1 - 2(k + 1)).

That is the formula with n = k + 1.

Tips

Multiply carefully entry by entry and set out the four entries clearly. Finish by writing each entry in terms of (k + 1), so the examiner can see it matches.

Worked example

Prove by induction that (1 2; 0 1)n = (1 2n; 0 1).

  1. n = 1: (1 2; 0 1). True.
  2. Assume (1 2; 0 1)k = (1 2k; 0 1).
  3. (1 2k; 0 1)(1 2; 0 1) = (1 2 + 2k; 0 1) = (1 2(k + 1); 0 1).
  4. True for n = 1, and true for k implies true for k + 1, so true for all positive integers n.

Answer: Proved

Key idea: Matrices: check n = 1, assume Mk, then Mk+1 = Mk M; simplify each entry into the n = k + 1 form.

Check yourself

  1. M = (3 -4; 1 -1) and Mn = (2n + 1 -4n; n 1 - 2n). Find the top-right entry of M5.
    Show answer

    -20. -4n with n = 5 gives -20.

  2. M = (3 -4; 1 -1). Calculate M2 directly and give its top-left entry.
    Show answer

    5. Row 1 times column 1: 3×3 + (-4)×1 = 5, which agrees with 2n + 1 = 5.

  3. (1 2; 0 1)n = (1 2n; 0 1). Find the top-right entry of (1 2; 0 1)10.
    Show answer

    20. 2n = 20.

  4. (2 1; 0 1)n = (2n 2n - 1; 0 1). Find the top-right entry of (2 1; 0 1)6.
    Show answer

    63. 26 - 1 = 63.

  5. In the inductive step for Mn, which product gives Mk+1?
    • Mk + M
    • Mk M
    • Mk × k
    • (Mk)2
    Show answer

    Mk M. Mk+1 = Mk × M (or M × Mk).

  6. In the step for (2 1; 0 1)n, you compute (2k 2k - 1; 0 1)(2 1; 0 1). What is the top-right entry?
    • 2k - 1
    • 2k+1
    • 2k × (2k - 1)
    • 2k + 2k - 1 = 2k+1 - 1
    Show answer

    2k + 2k - 1 = 2k+1 - 1. Row 1 times column 2: 2k × 1 + (2k - 1) × 1 = 2 × 2k - 1 = 2k+1 - 1.

Practise with instant feedback

Sources

Last updated 8 November 2026. Spotted a mistake? Tell us.