RULES IN MATH 313

1. ENTER classroom on time,

2. WEAR appropriate attire,
3. LISTEN to the Lecture,
4. WORK your Class activity
5. CELPHONE is NOT ALLOWED during Classes and Examination.
6. CHEATING is a major offense, penalty 5.0 for that specific exam or activity,
7. Be RESPONSIBLE student (Do not blame others), tuition is FREE, and others have
stipend, STUDY seriously to PASS the subject DO NOT expect mercy or FAVOR.
8. MAINTAIN Classroom Cleanliness.
TOPIC CONTENT:

3. Matrices
3.1 Definition, Types of Matrices, Difference between a Matrix and a
Determinant, Equal Matrices , Operation of Matrices, Various kinds
of Matrices
3.2 Transpose of a Matrix, Symmetric Matrix, Orthogonal Matrix,
Complex Conjugate of a Matrix, Hermitian Matrix, Unitary Matrix,
Determinant of a Matrix.
3.3 Adjoint of a Matrix, Elementary Row Operation, Matrix Polynomial,
Inverse of a Matrix, Equivalent Matrices, Use of Mathematical
Induction.
3.4 Solution of Linear Simultaneous Equations Using Matrix Method
MATRIX

Learning Objectives:
At the end of this topic, you should be able to:
❖ explain adjoint matrix.
❖ apply elementary row operation in matrix and
matrix polynomial.
❖ solve inverse of a matrix.
❖ apply mathematical induction matrix.
MATRICES

Adjoint of a Matrix
Let 𝐴 = 𝑎𝑖𝑗 be a square matrix of order 𝑛 and let 𝐶𝑖𝑗 be cofactor of
𝑎𝑖𝑗 in 𝐴.Then, the transpose of the matrix of cofactors of elements of 𝐴
is called the adjoint of 𝐴′and is denoted by 𝑎𝑑𝑗(𝐴).
Thus, 𝑎𝑑𝑗 𝐴 = 𝐶𝑖𝑗
1 2 3
Example 1. Find the adjoint of the matrix 𝐴 = 0 5 0
2 4 3
𝐶11 𝐶12 𝐶13
Solving 𝐶 = 𝐶21 𝐶22 𝐶23
𝐶31 𝐶32 𝐶33
MATRICES

Adjoint of a Matrix
1 2 3
Example 1. Find the adjoint of the matrix 𝐴 = 0 5 0
2 4 3
5 0 0 0 0 5
−
4 3 2 3 2 4 15 0 −10
2 3 1 3 1 2
Solving 𝐶 = − − = 6 −3 0
4 3 2 3 2 4
2 3 1 3 1 2 −15 0 5
−
5 0 0 0 0 5
15 6 −15
⇒𝐴𝑑𝑗 𝐴 = 𝐶 ′ = 0 −3 0
−10 0 5
MATRIX

Properties of Adjoint Matrix

Property 1 If 𝐴 be a square matrix order n, then
𝐴 𝑎𝑑𝑗 𝐴 = 𝑎𝑑𝑗 𝐴 𝐴 = 𝐴 𝐼𝑛
i.e., the product of a matrix and its adjoint is commutative.
Deductions of Property 1
Deduction 1 If 𝐴 be a square singular matrix of order 𝑛, then
𝐴 𝑎𝑑𝑗 𝐴 = 𝑎𝑑𝑗 𝐴 𝐴 = 0 [null matrix]
Since, for singular matrix, 𝐴 = 0.
Deduction 2 If 𝐴 be a square non-singular matrix of order 𝑛, then
𝑎𝑑𝑗 𝐴 = 𝐴 𝑛−1
Since, for non-singular matrix, 𝐴 ≠ 0.
MATRIX

Properties of Adjoint Matrix

Property 2 If 𝐴 and 𝐵 are square matrices of order 𝑛, then
𝑎𝑑𝑗 𝐴𝐵 = 𝑎𝑑𝑗 𝐵 𝑎𝑑𝑗 𝐴
Property 3 If 𝐴 is a square matrix of order 𝑛, then
𝑎𝑑𝑗 𝐴 ′ = 𝑎𝑑𝑗𝐴′
Property 4 If 𝐴 be a square non-singular matrix of order 𝑛, then
𝑎𝑑𝑗 𝑎𝑑𝑗 𝐴 = 𝐴 𝑛−2 𝐴
Property 5 If 𝐴 be a square non-singular matrix of order 𝑛, then
𝑛−1 2
𝑎𝑑𝑗 𝑎𝑑𝑗 𝐴 = 𝐴
Property 6 If 𝐴 be a square matrix of order 𝑛 and 𝑘 is a scalar, then
𝑎𝑑𝑗 𝑘𝐴 = 𝑘 𝑛−1 ∙ 𝑎𝑑𝑗 𝐴
MATRIX

Properties of Adjoint Matrix

Property 7 If 𝐴 be a square matrix of order 𝑛 and 𝑚 ∈ 𝑁 , then
𝑎𝑑𝑗 𝐴𝑚 = 𝑎𝑑𝑗 𝐴 𝑚
Property 8 If 𝐴 and 𝐵 be two square matrices of order 𝑛 such that 𝐵 is the
adjoint of 𝐴 and 𝑘 is a scalar, then
𝐴𝐵 + 𝑘𝐼𝑛 = 𝐴 + 𝑘 𝑛
Property 9 Adjoint of a diagonal matrix is a diagonal matrix.
𝑎 0 0 𝑏𝑐 0 0
i.e. If 𝐴 = 0 𝑏 0 , then 𝑎𝑑𝑗 𝐴 = 0 𝑐𝑎 0
0 0 𝑐 0 0 𝑎𝑏
MATRIX

Inverse of a Matrix
(Reciprocal Matrix)
A square matrix 𝐴 (non-singular) of order 𝑛 is said to be invertible, if there
exists a square matrix 𝐵 of the same order such that 𝐴𝐵 = 𝐼𝑛 = 𝐵𝐴,
then 𝐵 is called the inverse (reciprocal) of 𝐴 and is denoted by 𝐴−1 .
Thus, 𝐴−1 = 𝐵 ⇔ 𝐴𝐵 = 𝐼𝑛 = 𝐵𝐴
We have, 𝐴 𝑎𝑑𝑗 𝐴 = 𝐴 𝐼𝑛
⇒ 𝐴−1 𝐴 𝑎𝑑𝑗 𝐴 = 𝐴−1 𝐼𝑛 𝐴
⇒ 𝐼𝑛 𝑎𝑑𝑗 𝐴 = 𝐴−1 𝐴 𝐼𝑛
−1 𝑎𝑑𝑗 𝐴
∴ 𝐴 = ; provided 𝐴 ≠ 0
𝐴
MATRIX

Properties of Inverse of a Matrix

Property1 (Uniqueness of inverse) Every invertible matrix possesses a
unique inverse.
Proof Let 𝐴 be an invertible matrix of order 𝑛 𝑥 𝑛. Let 𝐵 and 𝐶 be two
inverses of 𝐴. Then, 𝐴𝐵 = 𝐵𝐴 = 𝐼𝑛 … (𝑖)
and 𝐴𝐶 = 𝐶𝐴 = 𝐼𝑛 … (𝑖𝑖)
Now, 𝐴𝐵 = 𝐼𝑛
⇒ 𝐶 𝐴𝐵 = 𝐶𝐼𝑛 [pre-multiplying by 𝐶]
⇒ 𝐶𝐴 𝐵 = 𝐶𝐼𝑛 [by associativity]
⇒ 𝐼𝑛 𝐵 = 𝐶𝐼𝑛 [ ∵ 𝐶𝐴 = 𝐼𝑛 by Eq. (𝑖𝑖)
⇒ 𝐵=𝐶
Hence, an invertible matrix possesses a unique inverse.
MATRIX

Properties of Inverse of a Matrix

Property 2 (Reversal law) If 𝐴 and 𝐵 are invertible matrices of order
𝑛 𝑥 𝑛 then 𝐴𝐵 is invertible and 𝐴𝐵 −1 = 𝐴−1 𝐵−1
Proof It is given that 𝐴 and 𝐵 are invertible matrices.
𝐴 ≠ 0 and 𝐵 ≠ 0⇒ 𝐴 𝐵 ≠ 0 ⇒ 𝐴𝐵 ≠ 0
Hence, 𝐴𝐵 is an invertible matrix.
Now, 𝐴𝐵 𝐵−1 𝐴−1 = 𝐴 𝐵𝐵 −1 𝐴−1 [by associativity]
= 𝐴𝐼𝑛 𝐴−1 [∵ 𝐵𝐵 −1 = 𝐼𝑛 ]
= 𝐴𝐴−1 [∵ 𝐴𝐼𝑛 = 𝐴]
= 𝐼𝑛 [∵ 𝐴𝐴−1 = 𝐼𝑛 ]
MATRIX

Properties of Inverse of a Matrix

Also, 𝐵−1 𝐴−1 𝐴𝐵 = 𝐵−1 𝐴−1 𝐴 𝐵 [by associativity]
= 𝐵−1 𝐼𝑛 𝐵 [∵𝐴−1 𝐴 = 𝐼𝑛 ]
= 𝐵−1 𝐵 [∵ 𝐼𝑛 𝐵 = 𝐵]
= 𝐼𝑛 [∵𝐵−1 𝐵 = 𝐼𝑛 ]
Thus, 𝐴𝐵 𝐵−1 𝐴−1 = 𝐼𝑛 = 𝐵−1 𝐴−1 𝐴𝐵
Hence, 𝐴𝐵 −1 = 𝐵 −1 𝐴−1
MATRIX

Properties of Inverse of a Matrix

Property 3 Let 𝐴 be an invertible matrix of order 𝑛 then 𝐴′ is also
invertible and 𝐴′ −1 = 𝐴−1 ′
Proof ∵ 𝐴 is invertible matrices.
𝐴 ≠ 0 ⇒ 𝐴′ ≠ 0 [∵ 𝐴 = 𝐴′ ]
Hence, 𝐴−1 is also invertible.
Now, 𝐴𝐴−1 = 𝐼𝑛 = 𝐴−1 𝐴
⇒ 𝐴𝐴−1 ′ = 𝐼𝑛 ′ = 𝐴−1 𝐴 ′

⇒ 𝐴−1 ′ 𝐴′ = 𝐼𝑛 = 𝐴′ 𝐴−1 ′ [by reversal law for transpose]

⇒ 𝐴′ −1 = 𝐴−1 ′ [by definition of inverse]
MATRIX

Properties of Inverse of a Matrix

Property 4 Let 𝐴 be an invertible matrix of order 𝑛 and 𝑘 ∈ 𝑁, then
𝑘 −1
𝐴 = 𝐴−1 𝑘
= 𝐴−𝑘
Proof We have
𝑘 −1
𝐴 = 𝐴 𝑥 𝐴 𝑥 𝐴 𝑥 𝐴 … … 𝑥 𝐴 −1
= 𝐴−1 𝑥 𝐴−1 𝑥 𝐴−1 𝑥 𝐴−1 … . 𝑥 𝐴−1 [by reversal law
repeat 𝑘 times for inverse]
= 𝐴−1 𝑘
= 𝐴−𝑘
MATRIX

Properties of Inverse of a Matrix

Property 5 Let 𝐴 be an invertible matrix of order 𝑛, then 𝐴−1 −1
= 𝐴.
Proof We have 𝐴−1 𝐴 = 𝐼𝑛
∴ Inverse of 𝐴−1 = 𝐴 ⇒ 𝐴−1 −1
=𝐴
Note:
𝐼𝑛−1 = 𝐼𝑛 as 𝐼𝑛−1 𝐼𝑛 = 𝐼𝑛
MATRIX

Properties of Inverse of a Matrix

Property 6 Let 𝐴 be an invertible matrix of order 𝑛, then
−1 1
𝐴 =
𝐴
Proof ∴ 𝐴 is invertible, then 𝐴 ≠ 0
Now, 𝐴𝐴−1 = 𝐼𝑛 = 𝐴−1 𝐴
⇒ 𝐴𝐴−1 = 𝐼𝑛
⇒ 𝐴 𝐴−1 = 1 [∵ 𝐴𝐵 = 𝐴 𝐵 and 𝐼𝑛 = 1]
−1 1
⇒ 𝐴 = [∵ 𝐴 ≠ 0]
𝐴
MATRIX

Properties of Inverse of a Matrix

Property 7 Inverse of a non-singular diagonal matrix is a diagonal matrix
𝑎 0 0
i.e. If 𝐴 = 𝑜 𝑏 0 and 𝐴 ≠ 0, then
0 0 𝑐

1
0 0
𝑎
−1 1
𝐴 = 0 𝑏
0
1
0 0
𝑐
MATRIX

0 1 2
Example 1. Compute the inverse of the matrix 𝐴 = 1 2 3
3 1 1
Solution,
0 1 2
Solving 𝐴 = 1 2 3 = −2 ≠ 0 ∴ 𝐴−1 exists.
3 1 1
Now solving cofactors: 𝑅1 = −1, 8, −5
𝑅2 = 1, −6, 3
𝑅3 = −1, 2, −1
MATRIX
0 1 2
Example 1. Compute the inverse of the matrix 𝐴 = 1 2 3
3 1 1
Let 𝐶 is a matrix of cofactors of the elements in 𝐴
−1 8 −5 −1 1 −1
∴ 𝐶 = 1 −6 3 ; 𝑎𝑑𝑗 𝐴 = 𝐶 ′ = 8 −6 2
−1 2 −1 −5 3 −1
1 1 1
−1 1 −1 −
2 2 2
−1 𝑎𝑑𝑗𝐴 1
hence, 𝐴 = = − 8 −6 2 = −4 3 −1 ans.
𝐴 2 5 3 1
−5 3 −1 −
2 2 2
MATRIX

Elementary Row Operations (Transformations)

The following three types of operations (transformations) on the rows of a
given matrix are known as elementary row operation (transformations).
(𝑖) The interchange of 𝑖𝑡ℎ and 𝑗𝑡ℎ rows is denoted by 𝑅𝑖 𝑅𝑗 or 𝑅𝑖𝑗 .
(𝑖𝑖) The multiplication of the 𝑖𝑡ℎ row by a constant 𝑘 𝑘 ≠ 0 is denoted
by 𝑅𝑖 𝑘𝑅𝑖 or 𝑅𝑖 𝑘 .
(𝑖𝑖𝑖) The addition of the 𝑖𝑡ℎ row to the elements of the 𝑗𝑡ℎ row multiplied
by constant 𝑘 𝑘 ≠ 0 is denoted by 𝑅𝑖 𝑅𝑖 + 𝑘𝑅𝑗 or 𝑅𝑖𝑗 𝑘 .
Note: Similarly, we can define the three column operations, 𝐶𝑖𝑗 𝐶𝑖 𝐶𝑗 ,
𝐶𝑖 𝑘 𝐶𝑖 → 𝑘𝐶𝑖 and 𝐶𝑖𝑗 𝑘 𝐶𝑖 → 𝐶𝑖 + 𝑘𝐶𝑗 .
MATRIX
Equivalent Matrices
Two matrices are said to be equivalent if one is obtained from the other by
elementary operations (transformations). The symbol ~ is used for
equivalence.
Properties of Equivalent Matrices
(𝑖) If 𝐴 and 𝐵 are equivalent matrices, there exist non-singular matrices 𝑃
and 𝑄 such that 𝐵 = 𝑃𝐴𝑄
(𝑖𝑖) If 𝐴 and 𝐵 are equivalent matrices such that 𝐵 = 𝑃𝐴𝑄, then
𝑃−1 𝐵𝑄 −1 = 𝐴
(𝑖𝑖𝑖) Every non-singular square matrix can be expressed as the product of
elementary matrices.
MATRIX
1 3 3
Example 2. Transform 2 4 10 into a unit matrix.
3 8 4
Solution,
1 3 3
Let 𝐴 = 2 4 10
3 8 4
Applying 𝑅2 → 𝑅2 − 2𝑅1 and 𝑅3 → 𝑅3 − 3𝑅1 , we get
1 3 3
𝐴~ 0 −2 4
0 −1 −5
MATRIX
1 3 3
Example 2. Transform 2 4 10 into a unit matrix.
3 8 4
1
Applying 𝑅2 → − 𝑅2 and 𝑅3 → −1 𝑅3 , we get
2
1 3 3
𝐴~ 0 1 −2
0 1 5
Applying 𝑅1 → 𝑅1 − 3𝑅2 and 𝑅3 → 𝑅3 − 𝑅2 , we get
1 0 9
𝐴~ 0 1 −2
0 0 7
MATRIX
1 3 3
Example 2. Transform 2 4 10 into a unit matrix.
3 8 4
1
Applying 𝑅3 → 𝑅3 , we get
7
1 0 9
𝐴~ 0 1 −2
0 0 1
Applying 𝑅1 → 𝑅1 − 9𝑅3 and 𝑅2 → 𝑅2 + 2𝑅3 , we get
1 0 0
𝐴~ 0 1 0 hence 𝐴~𝐼
0 0 1
MATRIX

To Compute the Inverse of a Non-Singular Matrix by Elementary Operations

(Gauss-Jordan Method)
If 𝐴 be a non-singular matrix of order 𝑛, then write 𝐴 = 𝐼𝑛 𝐴.
If 𝐴 is reduced to 𝐼𝑛 by elementary operations (𝐿𝐻𝑆), then suppose 𝐼𝑛 is
reduced to 𝑃(𝑅𝐻𝑆) and not change 𝐴 in 𝑅𝐻𝑆, then after elementary
operations, we get 𝐼𝑛 = 𝑃𝐴,
then 𝑃 is the inverse of 𝐴 ∴ 𝑃 = 𝐴−1
MATRIX
1 2 5
Example 3. Find the inverse of the matrix 2 3 1 , using elementary row
−1 1 1
operations.
Solution,
1 2 5
Let 𝐴= 2 3 1
−1 1 1

1 2 5
∴ 𝐴 = 2 3 1 = 1 3 − 1 − 2 2 + 1 + 5 2 + 3 = 21 ≠ 0
−1 1 1

∴ 𝐴−1 exist. Write 𝐴 = 𝐼𝐴

MATRIX
1 2 5
Example 3. Find the inverse of the matrix 2 3 1 , using elementary
−1 1 1
row operations..
write 𝐴 = 𝐼𝐴
1 2 5 1 0 0
⇒ 2 3 1 = 0 1 0 𝐴
−1 1 1 0 0 1
Applying 𝑅2 → 𝑅2 − 2𝑅1 and 𝑅3 → 𝑅3 + 𝑅1 , we get
1 2 5 1 0 0
0 −1 −9 = −2 1 0 𝐴
0 3 6 1 0 1
MATRIX
1 3 3
Example 2. Transform 2 4 10 into a unit matrix.
3 8 4
1
Applying 𝑅2 → −1 𝑅2 , and 𝑅3 → 𝑅3 , we get
3

1 2 5 1 0 0
0 1 9 = 21 −1 01 𝐴
0 1 2 0
3 3
Applying 𝑅1 → 𝑅1 − 2𝑅2 and 𝑅3 → 𝑅3 − 𝑅2 , we get
1 0 −13 −3 2 0
0 1 9 = 25 −1 01 𝐴
0 0 −7 − 1
3 3
MATRIX
1 3 3
Example 2. Transform 2 4 10 into a unit matrix.
3 8 4
1
Applying 𝑅3 → − 𝑅3 , we get
7

1 0 −13 −3 2 0
0 1 9 = 25 −11 0 𝐴
1
0 0 1 − −
21 7 21
Applying 𝑅2 → 𝑅2 − 9𝑅3 and 𝑅1 → 𝑅1 + 13𝑅3 , we get
2 1 13 2 1 13
− −
1 0 0 21 7 21 21 7 21
1 2 3 1 2 3
0 1 0 = −
7 7 7
𝐴 hence, 𝐴−1 = −
7 7 7
0 0 1 5 1 1 5 1 1
− − − −
21 7 21 21 7 21
MATRIX

Matrix Polynomial
Let 𝑓 𝑥 = 𝑎0 𝑥 𝑚 + 𝑎1 𝑥 𝑚−1 + 𝑎2 𝑥 𝑚−2 + ⋯ . . 𝑎𝑚−1 𝑥 + 𝑎𝑚
be a polynomial in 𝑥 and let 𝐴 = 𝑎𝑖𝑗 , then expression of the form
𝑛𝑥𝑛
𝑓 𝐴 = 𝑎0 𝐴𝑚 + 𝑎1 𝐴𝑚−1 + 𝑎2 𝐴𝑚−2 + ⋯ . . 𝑎𝑚−1 𝐴 + 𝑎𝑚 𝐼𝑛 is called
a matrix polynomial.
Thus, to obtain 𝑓 𝐴 replace 𝑥 by 𝐴 in 𝑓 𝑥 and the constant term is
multiplied by the identity matrix of order equal to that of 𝐴.
For example, If 𝑓 𝑥 = 𝑥 2 − 7𝑥 + 32 is a polynomial in 𝑥 and 𝐴 is a
square matrix of order 3, then 𝑓 𝐴 = 𝐴2 − 7𝐴 + 32𝐼3 is a matrix
polynomial.
MATRIX

Note
1. The polynomial equation 𝑓 𝑥 = 0 is satisfied by the matrix
𝐴 = 𝐴𝑖𝑗 , then 𝑓 𝐴 = 0.
𝑛𝑥𝑛
2. Let 𝐴 = 𝐴𝑖𝑗 satisfies the equation
𝑛𝑥𝑛
𝑎0 + 𝑎1 𝑥 + 𝑎2 𝑥 2 + ⋯ . . 𝑎𝑟 𝑥 𝑟 = 0, then 𝐴 is invertible of
𝑎0 ≠ 0, 𝐴 = 0 and its inverse is given by
1
𝐴−1 = 𝑎1 𝐼𝑛 + 𝑎2 𝐴 + ⋯ 𝑎𝑟 𝐴𝑟−1
𝑎0
MATRIX

𝑘 𝑙
Example 4. If 𝐴 = and 𝑘𝑛 ≠ 𝑙𝑚, show that
𝑚 𝑛
𝐴2 − 𝑘 + 𝑛 𝐴 + 𝑘𝑛 − 𝑙𝑚 𝑙 = 0, hence, find 𝐴−1 .
Solution.
𝑘 𝑙 𝑘 𝑙
We have, 𝐴 = then 𝐴 = = 𝑘𝑛 − 𝑚𝑙 ≠ 0 [given]
𝑚 𝑛 𝑚 𝑛
∴ 𝐴−1 exists.
𝑘 𝑙 𝑘 𝑙 𝑘 2 + 𝑙𝑚 𝑘𝑙 + 𝑙𝑛
Now, 𝐴2 = 𝐴𝐴 = =
𝑚 𝑛 𝑚 𝑛 𝑚𝑘 + 𝑛𝑚 𝑚𝑙 + 𝑛2
 MATRIX
𝑘 𝑙
Example 4. If 𝐴 = and 𝑘𝑛 ≠ 𝑙𝑚, show that
𝑚 𝑛
∴ 𝐴2 − 𝑘 + 𝑛 𝐴 + 𝑘𝑛 − 𝑙𝑚 𝐼
𝑘 2 + 𝑙𝑚 𝑘𝑙 + 𝑙𝑛 − 𝑘 + 𝑛 𝑘 𝑙 1 0
= + 𝑘𝑛 − 𝑙𝑚
𝑚𝑘 + 𝑛𝑚 𝑚𝑙 + 𝑛2 𝑚 𝑛 0 1
𝑘 2 + 𝑙𝑚 𝑘𝑙 + 𝑙𝑛 − 𝑘 2 + 𝑛𝑘 𝑘𝑙 + 𝑙𝑛 + 𝑘𝑛 − 𝑙𝑚 0
=
𝑚𝑘 + 𝑛𝑚 𝑚𝑙 + 𝑛2 𝑘𝑚 + 𝑛𝑚 𝑘𝑛 + 𝑛2 0 𝑘𝑛 − 𝑙𝑚
𝑘 2 + 𝑙𝑚 − 𝑘 2 − 𝑛𝑘 + 𝑘𝑛 − 𝑙𝑚 𝑘𝑙 + 𝑙𝑛 − 𝑘𝑙 − 𝑙𝑛
=
𝑚𝑘 + 𝑛𝑚 − 𝑘𝑚 − 𝑛𝑚 𝑚𝑙 + 𝑛2 − 𝑘𝑛 − 𝑛2 + 𝑘𝑛 − 𝑙𝑚
0 0
= =0
0 0
MATRIX
𝑘 𝑙
Example 4. If 𝐴 = and 𝑘𝑛 ≠ 𝑙𝑚, show that
𝑚 𝑛
As 𝐴2 − 𝑘 + 𝑛 𝐴 + 𝑘𝑛 − 𝑙𝑚 𝐼 = 0
⇒ 𝑘𝑛 − 𝑙𝑚 𝐼 = 𝑘 + 𝑛 𝐴 − 𝐴2
⇒ 𝑘𝑛 − 𝑙𝑚 𝐼𝐴−1 = 𝑘 + 𝑛 𝐴 − 𝐴2 𝐴−1
⇒ 𝑘𝑛 − 𝑙𝑚 𝐴−1 = 𝑘 + 𝑛 𝐴𝐴−1 − 𝐴 𝐴𝐴−1
= 𝑘+𝑛 𝐼−𝐴 [∵ 𝐴𝐴−1 = 𝐼]
1 0 𝑘 𝑙
= 𝑘+𝑛 −
0 1 𝑚 𝑛
𝑘+𝑛 0 𝑘 𝑙 𝑘 −𝑙
= − =
0 𝑘+𝑛 𝑚 𝑛 −𝑚 𝑘
MATRIX

𝑘𝑙
Example 4. If 𝐴 = and 𝑘𝑛 ≠ 𝑙𝑚, show that
𝑚𝑛
𝑘 −𝑙
⇒ 𝑘𝑛 − 𝑙𝑚 𝐴−1 =
−𝑚 𝑘
1 𝑘 −𝑙
Hence, −1
𝐴 = ans.
𝑘𝑛−𝑙𝑚 −𝑚 𝑘
 MATRIX

Principle of Mathematical Induction Solution and Proof

Consider a statement 𝑃(𝑛), where 𝑛 is a natural number. Then to determine
the validity of 𝑃(𝑛) for every 𝑛, use the following principle:
Step 1: Check whether the given statement is true for 𝑛 = 1.
Step 2: Assume that given statement 𝑃(𝑛) is also true for 𝑛 = 𝑘, where 𝑘 is
any positive integer.
Step 3: Prove that the result is true for 𝑃(𝑘 + 1) for any positive integer 𝑘.
If the above-mentioned conditions are satisfied, then it can be concluded that
𝑃(𝑛) is true for all 𝑛 natural numbers.
MATRIX

Principle of Mathematical Induction Solution and Proof

Proof:
The first step of the principle is a 𝑓𝑎𝑐𝑡𝑢𝑎𝑙 𝑠𝑡𝑎𝑡𝑒𝑚𝑒𝑛𝑡 and the second step is
a 𝑐𝑜𝑛𝑑𝑖𝑡𝑖𝑜𝑛𝑎𝑙 𝑜𝑛𝑒. According to this if the given statement is true for some
positive integer 𝑘 only then it can be concluded that the statement 𝑃(𝑛) is
valid for 𝑛 = 𝑘 + 1.
This is also known as the 𝑖𝑛𝑑𝑢𝑐𝑡𝑖𝑣𝑒 𝑠𝑡𝑒𝑝 and the assumption that 𝑃(𝑛) is
true for 𝑛 = 𝑘 is known as 𝑡ℎ𝑒 𝑖𝑛𝑑𝑢𝑐𝑡𝑖𝑣𝑒 ℎ𝑦𝑝𝑜𝑡ℎ𝑒𝑠𝑖𝑠.
MATRIX

Use of Mathematical Induction

0 1
Example 5. 𝐴 = show that
0 0
𝑎𝐼 + 𝑏𝐴 𝑛 = 𝑎𝑛 𝐼 + 𝑛𝑎𝑛−1 𝑏𝐴, ∀ 𝑛 ∈ 𝑁.
𝑛
Solution, Let 𝑃 𝑛 : 𝑎𝐼 + 𝑏𝐴 = 𝑎𝑛 𝐼 + 𝑛𝑎𝑛−1 𝑏𝐴
Step 1. For 𝑛 = 1
LHS = 𝑎𝐼 + 𝑏𝐴 1 = 𝑎𝐼 + 𝑏𝐴
and RHS = 𝑎1 𝐼 + 1𝑎1−1 𝑏𝐴 = 𝑎𝐼 + 𝑏𝐴
LHS=RHS
Therefore, 𝑃 1 is true.
MATRIX

Use of Mathematical Induction

0 1
Example 5. 𝐴 = show that
0 0
𝑎𝐼 + 𝑏𝐴 𝑛 = 𝑎𝑛 𝐼 + 𝑛𝑎𝑛−1 𝑏𝐴, ∀ 𝑛 ∈ 𝑁.
Step 2. Assume that 𝑃 𝑘 is true
𝑃 𝑘 : 𝑎𝐼 + 𝑏𝐴 𝑘 = 𝑎𝑘 𝐼 + 𝑘𝑎𝑘−1 𝑏𝐴
Step 3. For 𝑛 = 𝑘 + 1, we have to prove that
𝑃 𝑘 + 1 : 𝑎𝐼 + 𝑏𝐴 𝑘+1 = 𝑎𝑘+1 𝐼 + 𝑘 + 1 𝑎𝑘 𝑏𝐴
𝑘+1 𝑘
LHS = 𝑎𝐼 + 𝑏𝐴 = 𝑎𝐼 + 𝑏𝐴 𝑎𝐼 + 𝑏𝐴
= 𝑎𝑘 𝐼 + 𝑘𝑎𝑘−1 𝑏𝐴 𝑎𝐼 + 𝑏𝐴 [from step 2]
MATRIX
Use of Mathematical Induction
0 1
Example 5. 𝐴 = show that
0𝑛 0 𝑛
𝑎𝐼 + 𝑏𝐴 = 𝑎 𝐼 + 𝑛𝑎𝑛−1 𝑏𝐴, ∀ 𝑛 ∈ 𝑁.
= 𝑎𝑘 𝐼 + 𝑘𝑎𝑘−1 𝑏𝐴 𝑎𝐼 + 𝑏𝐴 [from step 2]
= 𝑎𝑘+1 𝐼2 + 𝑎𝑘 𝑏 𝐼𝐴 + 𝑘𝑎𝑘 𝑏 𝐼𝐴 + 𝑘𝑎𝑘−1 𝑏 2 𝐴2
= 𝑎𝑘+1 𝐼 + 𝑘 + 1 𝑎𝑘 𝑏𝐴 + 0 [∵ 𝐴𝐼 = 𝐴, 𝐴2 = 0 and 𝐼2 = 𝐼]
= 𝑎𝑘+1 𝐼 + 𝑘 + 1 𝑎𝑘 𝑏𝐴 + 0 = 𝑅𝐻𝑆
Therefore, 𝑃 𝑘 + 1 is true.
Hence, by the principle of mathematical induction 𝑃 𝑛 is true for all 𝑛 ∈ 𝑁.