Question 1 · Structured Proof and Calculation
10.7 marksThe matrix \(\mathbf{M}\) is given by \(\mathbf{M} = \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix}\).
(i) Prove by mathematical induction that for all positive integers \(n\),
\[\mathbf{M}^n = \begin{pmatrix} 2n+1 & -4n \\ n & 1-2n \end{pmatrix}.\]
(ii) Hence, find the matrix \(\mathbf{A}\) such that \(\mathbf{A} = \sum_{r=1}^N \mathbf{M}^r\), expressing your answer in terms of \(N\).
(i) Prove by mathematical induction that for all positive integers \(n\),
\[\mathbf{M}^n = \begin{pmatrix} 2n+1 & -4n \\ n & 1-2n \end{pmatrix}.\]
(ii) Hence, find the matrix \(\mathbf{A}\) such that \(\mathbf{A} = \sum_{r=1}^N \mathbf{M}^r\), expressing your answer in terms of \(N\).
Show answer & marking schemeHide answer & marking scheme
Worked solution
**(i)** Let the statement be \(P(n): \mathbf{M}^n = \begin{pmatrix} 2n+1 & -4n \\ n & 1-2n \end{pmatrix}\).
**Base case:** For \(n = 1\),
\(\mathbf{M}^1 = \begin{pmatrix} 2(1)+1 & -4(1) \\ 1 & 1-2(1) \end{pmatrix} = \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix}\).
This is equal to \(\mathbf{M}\), so \(P(1)\) is true.
**Inductive step:** Assume that \(P(k)\) is true for some positive integer \(k\), i.e.,
\(\mathbf{M}^k = \begin{pmatrix} 2k+1 & -4k \\ k & 1-2k \end{pmatrix}\).
We must show that \(P(k+1)\) is true:
\(\mathbf{M}^{k+1} = \mathbf{M}^k \mathbf{M} = \begin{pmatrix} 2k+1 & -4k \\ k & 1-2k \end{pmatrix} \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix}\)
\(= \begin{pmatrix} (2k+1)(3) + (-4k)(1) & (2k+1)(-4) + (-4k)(-1) \\ k(3) + (1-2k)(1) & k(-4) + (1-2k)(-1) \end{pmatrix}\)
\(= \begin{pmatrix} 6k+3-4k & -8k-4+4k \\ 3k+1-2k & -4k-1+2k \end{pmatrix}\)
\(= \begin{pmatrix} 2k+3 & -4k-4 \\ k+1 & -2k-1 \end{pmatrix}\)
\(= \begin{pmatrix} 2(k+1)+1 & -4(k+1) \\ k+1 & 1-2(k+1) \end{pmatrix}\).
Since \(P(1)\) is true, and \(P(k) \implies P(k+1)\), by the principle of mathematical induction, \(P(n)\) is true for all positive integers \(n\).
**(ii)** Using the definition of \(\mathbf{A}\):
\(\mathbf{A} = \sum_{r=1}^N \mathbf{M}^r = \sum_{r=1}^N \begin{pmatrix} 2r+1 & -4r \\ r & 1-2r \end{pmatrix} = \begin{pmatrix} \sum_{r=1}^N (2r+1) & \sum_{r=1}^N (-4r) \\ \sum_{r=1}^N r & \sum_{r=1}^N (1-2r) \end{pmatrix}\).
We calculate each component sum using standard series formulae:
- \(\sum_{r=1}^N r = \frac{1}{2}N(N+1)\)
- \(\sum_{r=1}^N (2r+1) = 2\sum_{r=1}^N r + N = 2\left(\frac{1}{2}N(N+1)\right) + N = N^2 + 2N\)
- \(\sum_{r=1}^N (-4r) = -4 \sum_{r=1}^N r = -4 \left(\frac{1}{2}N(N+1)\right) = -2N(N+1)\)
- \(\sum_{r=1}^N (1-2r) = N - 2\sum_{r=1}^N r = N - N(N+1) = -N^2\).
Therefore:
\(\mathbf{A} = \begin{pmatrix} N^2+2N & -2N(N+1) \\ \frac{1}{2}N(N+1) & -N^2 \end{pmatrix}\).
**Base case:** For \(n = 1\),
\(\mathbf{M}^1 = \begin{pmatrix} 2(1)+1 & -4(1) \\ 1 & 1-2(1) \end{pmatrix} = \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix}\).
This is equal to \(\mathbf{M}\), so \(P(1)\) is true.
**Inductive step:** Assume that \(P(k)\) is true for some positive integer \(k\), i.e.,
\(\mathbf{M}^k = \begin{pmatrix} 2k+1 & -4k \\ k & 1-2k \end{pmatrix}\).
We must show that \(P(k+1)\) is true:
\(\mathbf{M}^{k+1} = \mathbf{M}^k \mathbf{M} = \begin{pmatrix} 2k+1 & -4k \\ k & 1-2k \end{pmatrix} \begin{pmatrix} 3 & -4 \\ 1 & -1 \end{pmatrix}\)
\(= \begin{pmatrix} (2k+1)(3) + (-4k)(1) & (2k+1)(-4) + (-4k)(-1) \\ k(3) + (1-2k)(1) & k(-4) + (1-2k)(-1) \end{pmatrix}\)
\(= \begin{pmatrix} 6k+3-4k & -8k-4+4k \\ 3k+1-2k & -4k-1+2k \end{pmatrix}\)
\(= \begin{pmatrix} 2k+3 & -4k-4 \\ k+1 & -2k-1 \end{pmatrix}\)
\(= \begin{pmatrix} 2(k+1)+1 & -4(k+1) \\ k+1 & 1-2(k+1) \end{pmatrix}\).
Since \(P(1)\) is true, and \(P(k) \implies P(k+1)\), by the principle of mathematical induction, \(P(n)\) is true for all positive integers \(n\).
**(ii)** Using the definition of \(\mathbf{A}\):
\(\mathbf{A} = \sum_{r=1}^N \mathbf{M}^r = \sum_{r=1}^N \begin{pmatrix} 2r+1 & -4r \\ r & 1-2r \end{pmatrix} = \begin{pmatrix} \sum_{r=1}^N (2r+1) & \sum_{r=1}^N (-4r) \\ \sum_{r=1}^N r & \sum_{r=1}^N (1-2r) \end{pmatrix}\).
We calculate each component sum using standard series formulae:
- \(\sum_{r=1}^N r = \frac{1}{2}N(N+1)\)
- \(\sum_{r=1}^N (2r+1) = 2\sum_{r=1}^N r + N = 2\left(\frac{1}{2}N(N+1)\right) + N = N^2 + 2N\)
- \(\sum_{r=1}^N (-4r) = -4 \sum_{r=1}^N r = -4 \left(\frac{1}{2}N(N+1)\right) = -2N(N+1)\)
- \(\sum_{r=1}^N (1-2r) = N - 2\sum_{r=1}^N r = N - N(N+1) = -N^2\).
Therefore:
\(\mathbf{A} = \begin{pmatrix} N^2+2N & -2N(N+1) \\ \frac{1}{2}N(N+1) & -N^2 \end{pmatrix}\).
Marking scheme
**(i)**
- **M1**: Verifies base case \(n=1\).
- **M1**: Assumes statement for \(n=k\) and writes down \(\mathbf{M}^k \mathbf{M}\).
- **A1**: Correct expansion of the matrix multiplication.
- **A1**: Simplifies to the form in terms of \(k+1\).
- **A1**: Provides a complete and clear inductive conclusion. (6 marks)
**(ii)**
- **M1**: Recognizes that each element of the matrix sum can be summed individually.
- **M1**: Uses standard summation formulae for \(\sum r\).
- **A1**: Obtains correct expressions for diagonal elements.
- **A1**: Obtains correct expressions for non-diagonal elements. (4.7 marks)
- **M1**: Verifies base case \(n=1\).
- **M1**: Assumes statement for \(n=k\) and writes down \(\mathbf{M}^k \mathbf{M}\).
- **A1**: Correct expansion of the matrix multiplication.
- **A1**: Simplifies to the form in terms of \(k+1\).
- **A1**: Provides a complete and clear inductive conclusion. (6 marks)
**(ii)**
- **M1**: Recognizes that each element of the matrix sum can be summed individually.
- **M1**: Uses standard summation formulae for \(\sum r\).
- **A1**: Obtains correct expressions for diagonal elements.
- **A1**: Obtains correct expressions for non-diagonal elements. (4.7 marks)