![Slide38.JPG](https://d1avenlh0i1xmr.cloudfront.net/6f94f9b4-fd27-4611-88c9-dd5df4337878/slide38.jpg)
![Slide39.JPG](https://d1avenlh0i1xmr.cloudfront.net/b5e9360b-7ac7-4b22-b3a9-3a84a14d11aa/slide39.jpg)
![Slide40.JPG](https://d1avenlh0i1xmr.cloudfront.net/4f56abc6-3df0-4e56-b8a0-eb76b8b5a8b2/slide40.jpg)
![Slide41.JPG](https://d1avenlh0i1xmr.cloudfront.net/7fde73cb-6982-4c05-9711-00ee18d68bf6/slide41.jpg)
![Slide42.JPG](https://d1avenlh0i1xmr.cloudfront.net/b8bb22d8-5051-4083-8a25-3ae3a019ba54/slide42.jpg)
Miscellaneous
Last updated at April 16, 2024 by Teachoo
Question 1 Let A = [■8(0&1@0&0)] , show that (aI + bA)n = anI + nan-1 bA , where I is the identity matrix of order 2 and n ∈ N We shall prove the result by using Mathematical induction Step 1: Given A = [■8(0&1@0&0)] Let I be the identity matrix of 2 × 2 i.e. I = [■8(1&0@0&1)] Let P(n) : (aI + bA)n = anI + nan-1 bA, n ∈ N Step 2: Prove for n = 1 For n = 1 L.H.S = (aI + bA)1 = aI + bA R.H.S = a1I + 1a1–1 bA = aI + a0 bA = aI + 1 . bA = aI + bA So, L.H.S = R.H.S ∴ P(n) is true for n = 1 Step 3: Assume P(k) to be true and then prove P(k + 1) is true Assume that P(k) is true P(k) : (aI + bA)k = akI + kak-1 bA , k ∈ N We will prove that P (k + 1) is true Putting k = k + 1. P (k + 1): (aI + bA)k+1 = ak+1 I + (k+1)ak + 1 – 1 bA. P (k + 1): (aI + bA)k+1 = ak+1 I + (k+1)ak bA Solving L.H.S (aI + bA)k+1 = (aI + bA)k . (aI + bA)1 = (aI + bA)k . (aI + bA) From (1) : (aI + bA)k = akI + kak − 1 bA = (akI + kak – 1 bA) (aI + bA) = (aI + bA) (ak I + kak – 1 bA) = aI (ak I + kak – 1 bA) + bA (ak I + kak – 1 bA) = aI (akI) + aI (kak – 1 bA) + bA (akI) + bA (kak – 1 bA) = (aka) (I × I) + kb (aak – 1) IA + bak (AI) + (bb) k ak – 1 (AA) = ak + 1 I2 + k ak – 1 + 1 b A + bak A + (b)2 kak – 1 (A2) = ak + 1 I + k ak b A + bak A + b2 k ak – 1 (A2) Finding value of A2 A2 = A . A = [■8(0&1@0&0)] [■8(0&1@0&0)] = [■8(0(0)+1(0)&0(1)+1(0)@0(0)+0(0)&0(1)+0(0))] = [■8(𝟎&𝟎@𝟎&𝟎)] ∴ A2 = O Putting A2 = O in L.H.S ak + 1 I + k ak b A + bak A + b2 k ak – 1 (A2) = ak + 1 I + k ak b A + bak A + b2 k ak – 1 (O) = ak + 1 I + k ak b A + bak A + O = ak + 1I + bAak (k + 1) = R.H.S Hence P(k + 1) is true Hence, P(k + 1) is true ∴ By the principle of mathematical induction P(n) is true for all n when n is natural number. Thus, (aI + bA)n = anI + nan-1 bA when I = [■8(1&0@0&1)], A = [■8(0&1@0&0)] For all n ∈ N