Loading [MathJax]/jax/output/HTML-CSS/jax.js

Monday, March 11, 2024

19.13 - Invertible Matrices

In the previous section, we completed a discussion on symmetric and skew symmetric matrices. In this section, we will see elementary operations. Later in this section, we will see invertible matrices also.

Elementary Operation of a Matrix

• There are six operations on a matrix.
    ♦ They are known as elementary operations.
    ♦ They are also known as transformations.

Operation I:
This can be explained in 2 steps:
1. First pick two suitable rows. They need not be adjacent rows. Then interchange those two rows.
• For example, suppose that, we pick the first and third rows. After the operation, we will get a new matrix such that:
    ♦ First row in the original matrix, is the third row in the new matrix.
    ♦ Third row in the original matrix, is the first row in the new matrix.
2. Symbolically, we write this operation as: RiRj.
• The example operation that we saw above, can be written symbolically as follows:
Applying R1R3 to [3108114921213], gives [2121311493108].

Operation II:
This can be explained in 2 steps:
1. First pick a single suitable row. Then multiply each element of that row by a non zero number k.
• For example, suppose that, we pick the second row. After the operation, we will get a new matrix such that:
Each element in the second row is k times the original element.
2. Symbolically, we write this operation as: RikRi.
• The example operation that we saw above, can be written symbolically as follows:
Applying R23R2 to [3108114921213], gives [310833122721213].

Operation III:
This can be explained in 2 steps:
1. First pick a single suitable row. Then multiply each element of that row by a non zero number k. Finally, add each member of the new row with the corresponding element of another suitable row.
2. Symbolically, we write this operation as: RiRi+kRj.
• Let us see an example:
Applying R3R32R1 to [3108114921213], gives [310811494323].

Operation IV:
• This is similar to the operation I. Instead of rows, we deal with columns.
• An example:
Applying C2C3 to [3108114921213], gives [3810119421312].

Operation V:
• This is similar to the operation II. Instead of rows, we deal with columns.
• An example:
Applying C32C3 to [3108114921213], gives [310161141821226].

Operation VI:
• This is similar to the operation III. Instead of rows, we deal with columns.
• An example:
Applying C1C1+1.5C2 to [3108114921213], gives [12108549201213].


Invertible Matrices

This can be explained in 5 steps:
1. Consider two matrices A and B.
2. Suppose that, A and B satisfy three conditions:
(i) Both A and B are square matrices.
(ii) Both A and B are of the same order m.
(iii) AB = BA = I
3. If the three conditions are satisfied, then:
• B is called the inverse matrix of A.
    ♦ The inverse matrix of A is denoted as A-1.
    ♦ So B = A-1.
• A is called the inverse matrix of B.
    ♦ The inverse matrix of B is denoted as B-1.
    ♦ So A = B-1.
4. If it is possible to find A-1, then we say that:
A is an invertible matrix.
5. An example is shown below:


• In the above example, we can write:
    ♦ AB = BA = I
    ♦ B is the inverse of A. In other words, B = A-1.
    ♦ A is the inverse of B. In other words, A = B-1.
    ♦ A is an invertible matrix.
    ♦ B is an invertible matrix.


Note:
A rectangular matrix will not have an inverse. This can be demonstrated using an example. It can be written in 6 steps:
1. Suppose that, A is a rectangular matrix, of order 2 × 3
2. Let B be the inverse of A
Then AB = BA
3. If A is to be multiplied by B, then a possible order of B is: 3 × 2
• In that case, the order of AB will be 2 × 2.
4. The order of BA will be 3 × 3.
5. So we get:
    ♦ Order of AB = 2 × 2
    ♦ Order of BA = 3 × 3
• In such a situation, AB cannot be equal to BA.
• So B cannot be the inverse of A.
6. We can write:
Both A and B must be square matrices and both should be of the same order.


In the next section, we will see theorems related to invertible matrices.

Previous

Contents

Next

Copyright©2024 Higher secondary mathematics.blogspot.com

No comments:

Post a Comment