May 2022 Paper 2 Q9
9. The matrix \(A\) is given by \(A=\begin{pmatrix}3&-2\\0&1\end{pmatrix}\).
Prove by induction that
\[A^n=\begin{pmatrix}3^n&1-3^n\\0&1\end{pmatrix},\ \forall n\in N.\]
[5]
| Mark | Generic scheme | Illustrative scheme |
|---|---|---|
| •1 | show true for \(n=1\) 1 | when \(n=1\) \(\begin{pmatrix}3&1-3\\0&1\end{pmatrix}=\begin{pmatrix}3&-2\\0&1\end{pmatrix}\) so true for \(n=1\). |
| •2 | assume true for \(n=k\) and consider \(n=k+1\) 2 | assume true for \(n=k\) AND \(A^k=\begin{pmatrix}3^k&1-3^k\\0&1\end{pmatrix}\) AND \(A^{k+1}=\ldots\) |
| •3 | use inductive hypothesis | \(\begin{pmatrix}3&-2\\0&1\end{pmatrix}\begin{pmatrix}3^k&1-3^k\\0&1\end{pmatrix}\) |
| •4 | multiply matrices 3 | \(\begin{pmatrix}3\times 3^k&3\times\left(1-3^k\right)+\left(-2\right)\\0&1\end{pmatrix}\) |
| •5 | simplify to appropriate form and communicate result 4, 5, 6 | \(\begin{pmatrix}3^{k+1}&3-3^{k+1}-2\\0&1\end{pmatrix}\) leading to \(\begin{pmatrix}3^{k+1}&1-3^{k+1}\\0&1\end{pmatrix}\) so if result is true for \(n=k\) then it is true for \(n=k+1\). But it is true for \(n=1\) and so it is true \(\forall n\in N\) by mathematical induction. |
| (5) |
Notes:
- ‘\(A=\begin{pmatrix}3&-2\\0&1\end{pmatrix}\), \(A^1=\begin{pmatrix}3&-2\\0&1\end{pmatrix}\)’ and/or ‘True for n =1’ are insufficient for the award of •1. A candidate must demonstrate evidence of substitution.
- For •2 sufficient phrases for \(n=k\) contain:
- ‘If true for...’; ‘Suppose true for…’; ‘Assume true for…’.
- ‘Consider \(n=k\)’, ‘assume \(n=k\)’, ‘assume \(n=k\) is true’ and ‘True for \(n=k\)’.
A sufficient phrase for the award of •2 may appear at •5.
For •2, accept:- assume true for \(n=k\) AND \(A^k=\begin{pmatrix}3^k&1-3^k\\0&1\end{pmatrix}\) AND ‘Aim/goal: \(A^{k+1}=\begin{pmatrix}3^{k+1}&1-3^{k+1}\\0&1\end{pmatrix}\)’.
- ‘Consider true for \(n=k+1\)’, ‘true for \(n=k+1\)’;
- ‘\(A^{k+1}=\begin{pmatrix}3^{k+1}&1-3^{k+1}\\0&1\end{pmatrix}\)’ (with no reference to aim/goal or no further processing).
- Award •4 where products resulting in zero are shown.
- •5 is unavailable to candidates who write down the correct expression without algebraic justification.
- Full marks are available to candidates who state an aim/goal earlier in the proof and who subsequently reference the stated aim/goal.
- Following the required algebra and statement of the inductive hypothesis, the minimum acceptable response for •5 is ‘Then true for \(n=k+1\), but since true for \(n=1\), then true for all \(n\)’ or equivalent.
Commonly Observed Responses:
Multiplication order \(A^kA\)
| \(\begin{pmatrix}3^k&1-3^k\\0&1\end{pmatrix}\begin{pmatrix}3&-2\\0&1\end{pmatrix}\) | •3 |
| \(\begin{pmatrix}3^k\times 3&3^k\times\left(-2\right)+1-3^k\\0&1\end{pmatrix}\) stated or implied by | •4 |
| \(\begin{pmatrix}3^{k+1}&3^k\times\left(-2\right)+1-3^k\\0&1\end{pmatrix}\) leading to \(\begin{pmatrix}3^{k+1}&1-3^{k+1}\\0&1\end{pmatrix}\) | •5 |
so if result is true for \(n=k\) then it is true for \(n=k+1\). But it is true for \(n=1\) and so it is true \(\forall n\in N\) by mathematical induction.