Rank

Every matrix has a rank. A non zero matrix is said to have rank r if at
least one of its minors of order r is nonzero, while every minor of order
(r+1) , if any , is zero. A zero matrix is said to have rank 0. The
statement the rank of A is r then it is denoted 𝜌 𝐴 = 𝑟

Equivalence matrices: Two matrices are called equivalent if one can be

obtain from the other by a sequence of elementary transformations. Two
equivalent matrices A and B are symbolically written as A  B and
read A is equivalent to B.

1
Rank
Three types of transformations are :
1. The symbol 𝑅𝑖𝑗 stands for the interchange of the ith and jth rows.
The symbol 𝐶𝑖𝑗 stands for the interchange of the ith and jth
colummns
1 2 4 1 2 4
𝑅23
Exam 1 2 3 4 5 6

4 5 6 1 2 3

2
Rank
2. The symbol 𝑅𝑖 (𝑘) stands for the multiplication of every element
of the ith row by k , where k is a number other than zero.
The symbol 𝐶𝑖 (𝑘) stands for the multiplication of every element
of the ith column by k , where k is a number other than zero.

1 2 4
𝑅2 3
Exam 1 2 3

4 5 6
1 2 4 1 2 4
1×3 2×3 3×3  3 6 9
4 5 6 4 5 6

3
Rank
3. The symbol 𝑅𝑖𝑗 (𝑘) stands for the addition with each element
of the ith row of k times the corresponding element of the jth row
where k is a non zero number .
The symbol 𝐶𝑖𝑗 (𝑘) stands for the addition with each element of the
ith column of k times the corresponding element of the jth column ,
where k is a non zero number .
1 2 4
𝑅32 −3
Exam 1 2 3

4 5 6
1 2 4 1 2 4
1 2 3  1 2 3
−3 × 1 + 4 −3 × 1 + 2 −3 × 3 + 6 1 −1 −3
4
Theorem: Elementary transformations do not alter the rank of a matrix
Theorem: Rank of a matrix is equal to the number rows in matrix
minus number of zero rows equivalent matrix i ,e 𝜌 𝐴 = (number
rows in A) –( minus number of zero rows
1 2 4 𝑅31 −1 1 2 4
Example: A= 1 2 3  0 0 −1
4 8 16 𝑅31 −4 0 0 0
∴ 𝜌 𝐴 = (number rows in A) –( minus number of zero rows )=3-1=2

5
Rank
Canonical matrix:
A non-zero matrix A of rank r is row equivalent to a unique matrix C,
called a canonical matrix of A which is obtained from A
Working rule for canonical matrix: The working rule is defined into
two parts
First part
In the first row of the given matrix A the first nonzero element a11 ≠ 1 .
As it not already 1 , make it 1 by using the row transformations of the
type (1) or type (3)

6
Rank
Next make the elements a21 = a31 = a41 ---- = 0 in succession , using
row transformation of type (3) with appropriate multiples of the first
row.
Next make the elements a22 = 1 using row transformation of type (2)
Next make the elements a32 = a42------= 0 , using row transformation of
type (3) with appropriate multiples of the 2nd row.
Next make the elements a33 = 1 using row transformation of type (2)
Next make the a43 ----= 0 , using row transformation of type (3) with
appropriate multiples of the 3rd row. And so on
7
 Rank

nd
2 part
Now our aim will be make some other elements zero elements ,
whatever possible . Make the elements a23 = a13 = a12 ---- = 0 in
succession , using row transformation of type (3) and we have arrived at
the unique canonical matrix C.

8
Rank

2 7 3 5
Example: Find the canonical matrix of 𝐴 = 1 2 3 4 and
3 8 1 −2
4 13 1 −1
hence find rank.
Solution:
2 7 3 5 1 2 3 4 𝑅21 −2
𝐴= 1 2 3 4 𝑅12 2 7 3 5 𝑅31 −3
3 8 1 −2  3 8 1 −2 
4 13 1 −1 4 13 1 −1 𝑅41 −4

Cont 9
Rank
1 2 3 4 1 2 3 4 𝑅32 −2
1
0 3 −3 −3 𝑅2 0 1 −1 −1 
3
0 2 −8 −14  0 2 −8 −14
𝑅42 −5
0 5 −11 −17 0 5 −11 −17

1 2 3 4 1 2 3 4
1
0 1 −1 −1 𝑅3 − 0 1 −1 −1 𝑅43 (6)
0 0 −6 −12 
6
0 0 1 2 
0 0 −6 −12 0 0 −6 −12

Cont 10
Rank

1 2 3 4 𝑅 1 1 2 0 4
23
0 1 −1 −1  0 1 0 −1 𝑅 (6)
0 0 1 2 0 0 1 2 43
𝑅21 −3
0 0 0 0 0 0 0 0

1 0 0 4
0 1 0 −1 = C and 𝜌 𝐴 = 4 − 1 = 3
0 0 1 2
0 0 0 0

11
Rank
Inverse from elementary row transformations:
For a non singular matrix A, write A = IA and go on performing
suitable elementary row transformations to A of the left side and to I of
the right , kepping A of the right side fixed , till we arrive at the result I
= BA. Thus B is the inverse of A, i,e. B = A-1

Example: Using elementary row transformations, to reduce A to I, find

1 2 3 4
inverse of A, where A= 2 3 4 5
3 4 5 7
4 5 5 7
Solution: Write 𝐴 = 𝐼𝐴
Cont 12
Rank
Inverse from elementary row transformation
1 2 3 4 1 0 0 0
2 3 4 5 = 0 1 0 0 A
3 4 5 7 0 0 1 0
4 5 5 7 0 0 0 1
Performing R21 (-2), R31 (-3), R41 (-4), we get
1 2 3 4 1 0 0 0
0 −1 −2 −3 = −2 1 0 0 A
0 −2 −4 −5 −3 0 1 0
0 −3 −7 −9 −4 0 0 1
Performing R2 (-1), we get

Cont 13
Rank
Inverse from elementary row transformation
1 2 3 4 1 0 0 0
0 1 2 3 = 2 −1 0 0 A
0 −2 −4 −5 −3 0 1 0
0 −3 −7 −9 −4 0 0 1

Performing R32 (2), R42 (3), we get

1 2 3 4 1 0 0 0
0 1 2 3 = 2 −1 0 0 A
0 0 0 1 1 −2 1 0
0 0 −1 0 2 −3 0 1
Performing R34 , we get Cont 14
Rank
Inverse from elementary row transformation

1 2 3 4 1 0 0 0
0 1 2 3 = 2 −1 0 0 A
0 0 −1 0 2 −3 0 1
0 0 0 1 1 −2 1 0
Performing R3(-1) , we get
1 2 3 4 1 0 0 0
0 1 2 3 = 2 −1 0 0 A
0 0 1 0 −2 3 0 −1
0 0 0 1 1 −2 1 0
Performing R24 (-3), R14 (-4), we get
Cont 15
Rank
Inverse from elementary row transformation
1 2 3 0 −3 8 −4 0
0 1 2 0 = −1 5 −3 0 A
0 0 1 0 −2 3 0 −1
0 0 0 1 1 −2 1 0

Performing R23 (-2), R13 (-3), we get

1 2 0 0 3 −1 −4 3
0 1 0 0 = 3 −1 −3 2
0 0 1 0 −2 3 0 −1
0 0 0 1 1 −2 1 0

Performing R12 (-2), we getCont

16
Rank
Inverse from elementary row transformation

1 0 0 0 −3 1 2 −1
0 1 0 0 = 3 −1 −3 2 A
0 0 1 0 −2 3 0 −1
0 0 0 1 1 −2 1 0

−3 1 2 −1
∴ A-1 = 3 −1 −3 2 Ans
−2 3 0 −1
1 −2 1 0

17
Performing R21 (-3), R31 (2), R41 (3), we get
1 −2 1 0 0 0 0 1
0 5 −6 2 = 0 1 0 −3 A
0 −1 2 −1 0 0 1 2
0 −5 5 −1 1 0 0 3
Performing R23, we get
1 −2 1 0 0 0 0 1
0 −1 2 −1 = 0 0 1 2 A
0 5 −6 2 0 1 0 −3
0 −5 5 −1 1 0 0 3
Performing R2 (-1), we get
1 −2 1 0 0 0 0 1
0 1 −2 1 = 0 0 −1 −2 A
0 5 −6 2 0 1 0 −3
0 −5 5 −1 1 0 0 3
19
Performing R32 (-5), R42 (5), we get
1 −2 1 0 0 0 0 1
0 1 −2 1 = 0 0 −1 −2 A
0 0 4 −3 0 1 5 7
0 0 −5 4 1 0 −5 −7
Performing R34 (1), we get
1 −2 1 0 0 0 0 1
0 1 −2 1 = 0 0 −1 −2 A
0 0 −1 1 1 1 0 0
0 0 −5 4 1 0 −5 −7
Performing R3(-1) , we get
1 −2 1 0 0 0 0 1
0 1 −2 1 = 0 0 −1 −2 A
0 0 1 −1 −1 −1 0 0
0 0 −5 4 1 0 −5 −7
20
Performing R43 (5), we get
1 −2 1 0 0 0 0 1
0 1 −2 1 = 0 0 −1 −2 A
0 0 1 −1 −1 −1 0 0
0 0 0 −1 −4 −5 −5 −7
Performing R4 (-1), we get
1 −2 1 0 0 0 0 1
0 1 −2 1 = 0 0 −1 −2 A
0 0 1 −1 −1 −1 0 0
0 0 0 1 4 5 5 7
Performing R24 (-1), R34 (1), we get
1 −2 1 0 0 0 0 1
0 1 −2 0 = −4 −5 −6 −9 A
0 0 1 0 3 4 5 7
0 0 0 1 4 5 5 7
21
Performing R13 (-1), R23 (2), we get
1 −2 0 0 −3 −4 −5 −6
0 1 0 0 = 2 3 4 5 A
0 0 1 0 3 4 5 7
0 0 0 1 4 5 5 7
Performing R12 (2), we get
1 0 0 0 1 2 3 4
0 1 0 0 = 2 3 4 5 A
0 0 1 0 3 4 5 7
0 0 0 1 4 5 5 7
1 2 3 4
∴ A-1 = 2 3 4 5 Ans
3 4 5 7
4 5 5 7
22
23
24
25
26
27