Define the matrix A=[1101] and the identity matrix I=[1001]. We have to show, for every integer n≥1, that
An=nA−(n−1)I−(1)
We prove statement (1) by the Principle of Mathematical Induction (PMI).
Base case (n=1):
A1=A and 1A−(1−1)I=A−0⋅I=A.
Thus (1) is true for n=1.
Inductive hypothesis:
Assume (1) is true for some n=k(≥1), i.e.
Ak=kA−(k−1)I−(2)
Inductive step (n=k+1):
Start with Ak+1=AkA and substitute (2):
Ak+1=(kA−(k−1)I)A=kA2−(k−1)A−(3)
First compute A2 once for all:
A2=[1101][1101]=[1201]−(4)
Insert (4) into (3):
Ak+1=k[1201]−(k−1)[1101]
=[k2k0k]−[k−1k−10k−1]
=[k−(k−1)2k−(k−1)0k−(k−1)]
=[1k+101]−(5)
Now evaluate the right-hand side of (1) for n=k+1:
(k+1)A−kI=(k+1)[1101]−k[1001]
=[k+1k+10k+1]−[k00k]
=[1k+101]−(6)
Expressions (5) and (6) are identical, so
Ak+1=(k+1)A−kI
Consequently (1) holds for n=k+1 whenever it holds for n=k. By the Principle of Mathematical Induction, statement (1) is true for all integers n≥1.
Hence the correct option is:
Option A which is: An=nA−(n−1)I.