0% found this document useful (0 votes)
19 views8 pagesUploaded by
Abhishek PatraCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
19 views8 pagesUploaded by
Abhishek PatraCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
/ 8
RANK OF MATRIX
Presented By = Mrs. Arun Lekha,
Associate Professor,
Post Graduate,
Govt. College for Girls,
Sector-11, Chandigarh RANK OF A MATRIX
Rank of Matrix
‘The number ris called the rank of a matrix A if
(@ Bvery minor of order (r + 1) of A is zero and (ji) There exists at least one minor of ordeg
Se which is non-zero.
Note. (1) The rank of matrix A is 42noted by p (A),
(2) Rank of a null matrix is zero.
@) IEA = idm xn then p (A) < Min, (m,n)
@ pin) =n 6) pO) =0
. 123
Example. (1) Let A =|2 3 4
357
2a
=p3 4.
1 1-55 p34
A minor of order 2 = [3 3] =3-4#0.-p &) =2
‘Theorem. The rank ofthe transpose of a matrix is equal to the raik of the matrix.
Proof : Let p(A) = r = There exists a square submatrix B of A such that det B + 0 and determinant
of every square submatiix of A of order > ris 0. Since A‘ is obtained by changing rows into columns and
‘columns into rows of A. BY would be a square submatrix of At of order r and det (B‘) = det B # 0.
‘Therefore, p(A‘) > r. We shall prove that p(A) +r. Suppose that there is a square submatrix C of A‘ of
order > rsuch that det C +0, then C’ would be square submatrix of A of order > r such that det (C)) =
det #0 => p(A) > r, a contradiction.
Hence, pa) =
pA).
Elementary Row Transformations
‘The following three types of operations on the rows of a given matrix are known as elementary roy
transformations. (j.e. E-row transformation)
(@) Inerchanging any two rows of the given matrix.
(ii) Multiplying every element of any row of the given matrix by a non-zero number.
oy Adding a non-zero scalar multiple of the elements of any row to the corresponding elements 0
another row.
Note 1. (i) is denoted by Ry (ii) is denoted by Rigs (iti) Ry + Ray or Ryacy
‘Note 2. Similarly we can have elementary column transformations.
Note 3. Since the order of the largest non-singular square sub matrix of a given matrix is no
affected by any of the elementary row transformations.
+. rank of a matrix. remains unchanged by the application of any of the elementary row transformation
onit.
Elementary Operations. The above six operations (i) three elementary row operations (ii) three
clementary column operations, are called elementary operations.
Def. Row Equivalent. A matrix A is said to be row equivalent to a matrix B if B can be obtained
from A by applying in succession a finite number of elementary row operations on A and we write
ae Def. Column Equivalent
‘A matzix A is said (o be column equivalent toa matrix BifB can be obtained from A by applying in
seesiona finite mamber of elementary columa operation on A and we write A & B.
Note. Column-equivalent matrices have the same order and the same rank.
Echelon Form of a Matrix
A matrix is said to be in echelon form: if:
(@ all the zero rows occur below non-zero rows
(i) the number of zero before the first non-zero element in a row is less than the number of such
zeros in the next row
(ii) the first non-zeros element in every non-zero row is 1.
For example, the matrix
ae. 2 28 48
60 to 5 |lia A al Nose a 34
2 O02 2 6r 0 0-6-6 and}O 0 0 1 4
2 oe ee 9 6°66
are matrices in row-echelon form.
Note.. From the above example, itis clear tha if a matrix isin row-echelon form, then any column
that coftains a leading entry 1 must contain zeros below the leading entry 1. However the entree above
the leading entry 1, are arbitrary,
Def. Row-reduced echelon form
‘A matrix in row-echelon form satisfying the following additional condition is said to be in row-
reduced echelon form condition. Each column which contains a leading entry I of a row hai all the
other entries zero, ,
For example, the matrix
14 0 OM Ap 0. ¢ 70
0201-1 Ser (0 0.21 aro
0 0 0 0 OF 10 O 0 0 1} areinsow-reduced echelon form,
0.0 0:0 oll0-0 0-0 0
Note 1. 4 zero matrix and an identity matrix are always in row reduced echelon fom.
Note 2. Row reduced echelon form ts generally preferred to a row-echelon form in the solution ofa
system of linear equations.
(@) Method to find Rank of a Matrix
Reduce the given matrix to echelon form by using elementary row transformations. ‘Then, the
‘umber of non-zero rows in the echelon form, is the rank of the given matrix.
0123
Example. (i) Tremeica = [3 o1 Hl is in echelon form and it has 2 non-zero rows.
0000 :
ce pia) =2
‘Theorem. 1/4 and B are two matrices conformable for multiplication, then
(AB) < PIA), p (AB) < p(B)
oR
‘rank (AB) O in one of
the forms.
“Le ole of
(where I, is the identity matrix of order r and O is some row matrix).
All these are known as normal form of A.
Ifr = 0, then A is in the normal form iff A = O.
0 vs
rant’, fete of Janow
IA is an n-square matrix in the normal form, then A is non-singular iff A = Ip.
Be
de®
+ Theorem [fA is an m x n matrix of rank r, then A is equivalent to the var od
‘he normal form
‘Theorem. If A and B square matrices of order n, prove that p(AB) > p{A) + p(B) -n
‘Theorem. Show that p (AA) = p(A); where A’is the transpose of A.
Sol. We know that p (AA) < p(A) -)
Again ADSTA'=ATAA = p(A9 = (AT AAD
But P(A) = pla)
(A)
You might also like