0% found this document useful (0 votes)
20 views25 pages

Unit - 7 Matrices

The document provides a comprehensive overview of matrices, defining them as rectangular arrays of numbers and detailing their various types, such as square, horizontal, vertical, row, and column matrices. It also explains matrix operations, including addition, subtraction, and multiplication, along with examples for clarity. Additionally, it covers concepts like diagonal, scalar, unit, and triangular matrices, as well as the conditions for matrix equality and comparability.

Uploaded by

mohd.mukeem
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
20 views25 pages

Unit - 7 Matrices

The document provides a comprehensive overview of matrices, defining them as rectangular arrays of numbers and detailing their various types, such as square, horizontal, vertical, row, and column matrices. It also explains matrix operations, including addition, subtraction, and multiplication, along with examples for clarity. Additionally, it covers concepts like diagonal, scalar, unit, and triangular matrices, as well as the conditions for matrix equality and comparability.

Uploaded by

mohd.mukeem
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 25

MATRICES

Unit- 7
MATRICES

1. Matrix Definition
Matrix is a rectangular array of real or complex numbers in horizontal and vertical lines called
rows and columns respectively. A matrix is denoted by the capital letters A, B, C etc. If there
are m rows and n columns in the matrix, then the matrix is called a m × n matrix or a m by n
matrix.
1 2 3  1 2 3 
Example: A =   or  
3 2 – 4 3 2 – 4
Here A is a 2 × 3 matrix because A has two rows and three columns.
 Note :
(i) Although a matrix is just a rectangular array of numbers but these numbers are enclosed
within big or small brackets to make it good looking,
(ii) Matrix is just an array of numbers and has no numerical value as in case of a determinant.

2. Elements of a Matrix
The number occurring in the rectangular array (matrix) are called the elements of the matrix.
The elements of the matrix denoted by the capital letters are usually denoted by the
corresponding small letters with lower suffixes. Thus the element of the ith row and jth column
of the matrix denoted by the capital letter A is usually denoted by the corresponding small
letter aij. The matrix A is sometimes also written as (aij) or [aij].

1 2 3 
Example: Let A =  
3 2 – 4 
Here a11 = 1, a12 = 2, a13 = 3, a21 = 3, a22 = 2, a23 = – 4

3. Types of Matrices
1. Square matrix : A matrix having equal number of rows and columns is called a square
matrix. If the matrix A has n rows and n columns it is said to be a square matrix of order n.
1 2 3 
Example: 2 3 4 is a square matrix or order 3.
2 0 5 

2. Horizontal matrix : A m × n matrix is called a horizontal matrix if m < n i.e., if


number of rows is less than the number of columns.
1 0 2
Example: A =   . Here A is horizontal matrix.
3 4 5

3. Vertical matrix : A m × n matrix is called a vertical matrix if m > n.


1 0
 
Example: A =  2 3  , Here B is a vertical matrix.
 4 5
 
4. Row matrix or row vector: A matrix having only one row is called a row matrix or a row
vector.
Example: A = (1 2 3), Here A is a row matrix.

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
1
MATRICES

5. Column matrix or column vector : A matrix having only one column is called a column
matrix or column vector.
1 
2
Example: B =   , Here B is a column matrix.
0 
 
4
6. Zero matrix or null matrix: A matrix whose each element is zero is called a zero matrix
or null matrix.

0 0 0 
 0 0 0
Example: A =  , B = 0 0 0 , Here A and B are zero matrix.
 
 0 0 0 0 0 0

7. Diagonal of a matrix. Let A be a square matrix of order n.


 a 11 a 12 a 13 .... a 1n 
a a 22 a 23 .... a 2 n 
 21
Let A = a 31 a 32 a 33 .... a 3n 
 
 ... ... ... .... a mn 
a n1 a n2 ... .... a nn 
Here the elements a11, a22, a33, ….ann are called the diagonal elements and the line along
which these elements lie is called the principal diagonal of the matrix.
1 2 3 
 
Example: Let A =  2 0 5 
3 2 4
Here 1, 0, 4 are the diagonal elements of the matrix A.

8. Diagonal matrix: A square matrix having all elements not occurring along the principal
diagonal are zero is called a diagonal matrix. Thus the square matrix (aij) is called the
diagonal matrix if aij = 0 for i  j.
2 0 0 0 0 0 
   
Example: A = 0 1 0, B = 0 0 0
0 0 2 0 0 0
Here A and B are diagonal matrices. Here matrix A can also be written as diagonal [2, 1,
2].

9. Scalar matrix: A square matrix is said to be a scalar matrix if all–elements along the
principal diagonal are equal and all elements not occurring along the principal diagonal
are zero.
2 0 0 0 0 0 
   
Example: A = 0 2 0  , B = 0 0 0 Here A and B are scalar matrices.
0 0 2 0 0 0

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
2
MATRICES

10. Unit matrix: A square matrix is said to be a unit matrix if all the elements along the
principal diagonal are unity (1) and all elements not occurring along the principal diagonal
are zero.
1 0 0 
1 0
Example: (i) A =   (ii) B = 0 1 0
 0 1  0 0 1 
A unit matrix of order n is denoted by In. Thus in the examples given above A = I2, B=
I3.

11. Triangular matrix:


(a) Lower triangular matrix: A square matrix (aij) is called a lower triangular matrix if aij =
0 when i < j. Thus a lower triangular matrix has all elements above the principal
diagonal equal to zero.
(b) Upper triangular matrix: A square matrix (aij) is called an upper triangular matrix of
aij = 0 when i > j. Thus an upper triangular matrix has all elements below the principal
diagonal equal to zero.
Example:
1 0 0  1 0 0 
 2 2 0  , B = 0 0 0 
(i)     Here A and B are lower triangular matrices.
0 5 3 0 2 0
1 – 1 4  1 3 5
(ii) C = 0 2 5, D = 0 0 0 Here C and D are upper triangular matrices.
 
0 0 3 0 0 2

12. Comparable matrices: Two matrices A and B are said to be comparable if they have same
number of rows and columns i.e., if they are of the same type.
1 2 3 0 1 5
Example: Let A =   ,B= 
 2 0 5  3 7 8
Here both A and B have two rows and three columns and hence A and B are comparable
matrices.

13. Equality of two matrices: Two m × n matrices A and B are said to be equal if the
corresponding elements of the two matrices are equal. Thus two matrices (aij) and (bij) are
equal if
aij = bij for i = 1, 2, ….,m; j = 1, 2, 3, …., n
i.e., if a11 = b11, a12 = b12 etc.
If two matrices A and B are equal we write A = B.
1 2 0 1 2 0
Example: A =  , B =  
3 2 4 3 2 4

14. Matrix Operations


Addition of matrices: Let A and B be two m × n matrices. The m × n matrix obtained by
adding the corresponding elements of the matrices A and B is called the sum of the
matrices A and B and is denoted by A + B.
i = 1,2,...., m
Thus if A = [aij], B = [bij],
j = 1,2,...., n

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
3
MATRICES

i = 1,2,...., m
Then A + B = [aij + bij],
j = 1,2,...., n
In other words [aij]m × n + [bij]m × n = [aij + bij]m × n
2 3 4   – 3 4 5
Example: Let A =   ,B= 
0 2 – 1  6 2 9
 2 – 3 3 + 4 4 + 5   – 1 7 9
Then A + B =   = 
0 + 6 2 + 2 – 1 + 9   6 4 8 
 Note :
A + B is defined only when they are matrices of the same type i.e., when the number of
rows in A is equal to the number of rows in B and the number of column in A is equal to the
number of columns in B.

15. (a) Negative of a Matrix


Let A = [aij] be a m × n matrix. Then the negative of the matrix A is denoted by –A and is
defined as [–aij].
In order of to find –A, sign of each element of A must be changed.
1 – 2 0   – 1 2 0
Example: Let A =   , then –A =  
3 2 – 5  – 3 – 2 5
 Note :
If A is a m × n matrix, then –A is also a m × n matrix.
(b) Subtraction of Two Matrices:
Let A and B be two m × n matrices. Then the difference of matrices A and B is denoted
by A – B and is defined as A – B = A + (–B). A – B will also be a m × n matrix. In order to
find A – B, the elements of B must be subtracted from the corresponding elements of A.
1 2 3  2 – 1 4
Example: Let A =   ,B= 
3 – 1 0 5 0 6 
1 – 2 2 + 1 3 – 4  – 1 3 – 1
Then A – B =   =  
3 – 5 – 1 – 0 0 – 6  – 2 – 1 – 6

16. Multiplication of Matrices:


Let A = [aij]m × n and B = [bik]n × p be two matrices such that the number of columns in
n
A is equal to the number of rows in B, then the matrix C = [cik]m ×p, where cik =  a ij b jk
j=1

= a i1 b1k + a i 2 b 2k + a i3 b 3k + .... + a in b nk is said to be the product of matrices A and B in


that order and is denoted by AB.
If number of columns in A is equal to the number of rows in B, then we say that A is
conformable to B for multiplication:

 Note :
(i) Product AB is defined only when the number of columns in A is equal to the number
of rows in B.
(ii) If A is a m × n matrix and B is a n × p matrix, then AB will be a m × p matrix.
B : np
A:m×n
AB : m  p
(iii) Element of i row and kth column of the product matrix is
th

a i1b1k + a i 2 b 2k + a i3 b 3k + ... + a in b nk
Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
4
MATRICES

Elements of ith rows of A are ai1, ai2, ai3, ….ain


Elements of kth column of B are b1k, b2k, b3k, …., bnk
Elements of ith row and kth column of AB = ai1 b1k + ai2 b2k + …..+ain bnk
Thus in order to write down the element of the ith row and kth column of AB, we take
the elements of ith row of the first matrix A and multiply them with the corresponding
elements of the kth column of the second matrix B and then add them.
(iv) In the product AB, A is called the pre–factor and B is called the post–factor.
(v) If the product AB is possible then it is not necessary that the product BA is also
possible.
(vi) If A be a m × n matrix and both AB and BA are defined, then B will be a n × m matrix.
 a 11 a 12 
b b 12 
Example: Let A = a 21 a 22 , B =  11 
a 31 a 32  b 21 b 22 

Here A is a 3 × 2 matrix and B is a 2 × 2 matrix therefore AB is defined and it will be a 3 × 2


matrix.
 a11b11 + a12 b 21 a11b12 + a12 b 22 
AB =  a 21b11 + a 22 b 21 a 21b12 + a 22 b 22 
 a 31b11 + b32 b 21 a 31b12 + a 32 b 22 
1 0 5 4 – 1 
Let A =  – 1 2 4, B = 2 – 2
 
 3 – 2 6 5 3 
 29 14
Then AB =  20 9 
38 19
• AB = 0 does not imply that A = 0 or B = 0
• AB = 0, then BA may not be zero
• AB = AC  B = C

17. Properties of Matrix Addition:


Property I.
Matrix addition is commutative i.e. if A and B be any two m × n matrices, then A + B = B +
A.
Property II.
Matrix addition in associative i.e., if A, B and C be three m × n matrices, then A + (B + C) =
(A + B) + C
Property III.
If A is m × n matrix and 0 is a m × n null matrix, then A + 0 = 0 + A
Property IV.
For any matrix A, A + (–A) = (–A) + A = O, where O is a null matrix.
Property V.
If A, B, C be any three m × n matrices, then
A + B = A + C  B = C (left cancellation law)
B + A = C + A  B = C (right cancellation law)

18. Multiplication of a matrix by a scalar:


Let A be a any m × n matrix and k be any scalar (real or complex number), then the scalar
multiple of matrix A by k is denoted by kA or Ak and is defined as m × n matrix obtained by
multiplying each element of A by k.
Thus if A = [aij]m × n then kA = [k aij]m × n
Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
5
MATRICES

1 2  3 6
Example : Let A = 3 0  , then 3A =  9 0 
 
5 4  15 12
Properties of Scalar Multiplication:
If A = [aij]m × n, B = [bij]m × n, and p and q are any two scalars then
(i) p(A + B) = pA + pB (ii) (–p)A = –(pA) = p(–A)
(ii) p(A – B) = pA – pB (iv) (p + q) A = pA + qA
(v) (pq)A = p(qA) = q(pA) (vi) 1A = A, A, (–1)A = –A

19. Properties of Matrix Multiplication


(i) (AB)C = A(BC), whenever both sides are defined. (Associative law)
(ii) A(B+C)=AB + AC, whenever both sides are defined.(Distributive law)
(iii) If A is a m × n matrix, then ImA = A -= AIn.
(iv) If A is a m × n matrix and O is a null matrix, then Am × n On × p = Om × p and Op × m Am × n =
Op × n.
(v) For a square matrix A.
Am . An = Am+n and (Am)n = Amn for all m, n  N.

20. Transpose of a matrix: Let A be any matrix then the matrix obtained by interchanging its
rows and columns is called the transpose of A and is denoted by A ' of A T . If A is a m × n
matrix then A ' will be a n × m matrix.
Thus if A [aij]m ×n’ then A ' = [aij]n × m i.e., element of ith row and jth column of A = element of
jth row and ith column of A ' .
1 2 
1 2 3
Example: A =   , then A ' = 2 0
2 0 5 3 5
i = 1,2,..., m j = 1,2,...., n
If A = [aij]; then A' = [a ij ];
j = 1,2,...., n i = 1,2,....., m

Properties of transpose of Matrices


(i) (A' )' = A (ii) (A)' = A' ,  being a scalar
(iii) (A + B)' = A'+ B' (iv) ( AB)' = B' A '
Also (ABC)' = C' B' A'. (Reversal law)

21. Symmetric and Skew–Symmetric Matrices


A square matrix A = [aij]m × n is said to be
(i) symmetric iff aij = aji for all i and j i.e. iff A' = A
(ii) skew–symmetric iff aij = –aji for all i and j i.e., iff A' = – A .

1. For a square matrix A = [aij]n × n’


(i) A + A ' is a symmetric matrix
(ii) A – A ' is skew–symmetric matrix
(iii) AA' and A' A, A 2 , are symmetric matrices
(iv) If A is a symmetric matrix, then A2 and An, n  N are symmetric matrices.

2. The diagonal elements of a skew–symmetric matrix are zero.

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
6
MATRICES

3. If A, B are symmetric matrices of same order then AB is symmetric iff AB = BA, i.e., A
and B commute.

4. B' AB is symmetric or skew–symmetric according as A is symmetric or skew–


symmetric.

5. Every square matrix A can be uniquely written as the sum of a symmetric and a skew–
symmetric matrix.
1 1 1 1
A = (A + A' ) + (A – A' ) where ( A + A ' ) is symmetric and ( A – A ' ) is skew–
2 2 2 2
symmetric.
22. Conjugate of a Matrix. Let A = [aij]m ×n be a given matrix. Then the matrix obtained from A
by replacing all the elements by their conjugate is called the conjugate of the matrix A and
is denoted by A. Thus A = [a ij ], where a ij is the conjugate of the corresponding element
aij.
Properties of Conjugate of matrices
(i) (A) = A
(ii) (A + B) = A + B
(iii) ( A = A where  is a scalar
(iii) (AB) = A B
A' is called the transposed conjugate of A and is denoted by A also A  = (A)'
Properties:
(i) (A  )  = A (ii) (A + B)  = A  + B
(iii) (A)  = A  (iv) (AB)  = B A 

23. Hermitian and Skew–hermitian Matrix


1. A square matrix A = [aij] is called Hermitian iff a ij = a ij , for all i and j, i.e., iff A  = A.
2. A square matrix A = [aij] is called Skew–Hermitian iff a ij = –a ij i.e. iff A  = – A.

Properties
(i) All the diagonal elements of a Skew–Hermitian matrix are (either zero or) purely
imaginary.
(ii) For a square matrix A, A + A  is a Hermitian matrix A – A  is a skew Hermitian matrix
AA  and A  A, are Hermitian matrices.
(iii) Every square matrix can be uniquely expressed as the sum of a Hermitian and a skew
Hermitian matrix
A + A A – A
Infact A = +
2 2
(iv) If A is Hermition matrix then An, n  N is a Hermition matrix.

24. Orthogonal matrix. A square matrix A is


called an orthogonal matrix if AA' = A' A = I
(i) Every orthogonal matrix is non–singular.
(ii) Every orthogonal matrix is invertible.
(iii) If A is orthogonal, then A ' and A −1 are also orthogonal.
(iv) If A and B are n–square orthogonal matrices then AB and BA are also orthogonal.

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
7
MATRICES

(v) Determinant of an orthogonal matrix is 1.


(vi) If A is an orthogonal matrix such that |A|=1, then each element of A is equal to its
cofactor in | A |.
(vii) If A is an orthogonal matrix such that |A|=–1, then each element of A is equal to the
negative of its cofactor in | A |.

25. Unitary matrix. A square matrix A is called unitary if AA  = A  A = I


(i) The determinant of a unitary matrix is 1.
(ii) If A is a unitary matrix then A' , A, A  , A −1 are unitary.
(iii) Product of two unitary matrices is unitary.

26. A square matrix A is said to be


(i) Idempotent if A2 = A
If AB = A and BA = B then A and B are idempotent.
Explanation: ABA = AA = A2 ( AB = A)
 AB = A2 ( BA = B)
 A=A 2
( AB = A)
(ii) Periodic matrix: A square matrix A is said to be periodic if A k +1 = A for some
positive integer k. The least value of k is called the period of A.
(iii) Nilpotent: A square matrix A is said to be nilpotent if Ak = O for some positive
integer k. Least value of k is called the index of the nilpotent matrix.
(iv) Involuntary:A square matrix A is said to be involuntary if A2 = I
Since I2 = I, therefore I is involuntary.

27. Determinant : To every square matrix A = [aij]n × n is associated a number called the
determinant of A and is denoted by|A|or det A |A|is the determinant whose elements are
corresponding elements of A.
Only square matrices have determinants.
Examples:
(i) If A = [a11]1 × 1, then | A | = a11
a a 12  a a 12
(ii) If A =  11  , then | A| = 11 = a11a22 – a21a12
a 21 a 22  a 21 a 22
 a 11 a 12 a 13  a 11 a 12 a 13
 
(iii) If A = a 21 a 22 a 23  , then | A | = a 21 a 22 a 23
a 31 a 32 a 33  a 31 a 32 a 33
Properties
(i) | In | = 1
(ii) | On | = 0
(iii) | A | = | A ' |
(iv) If A is a square matrix of order n, then | kA | = kn | A |
(v) If A and B are square matrices of same order, then|AB|=|A||B|
(vi) If A is a square matrix, then | An | = |A|n
(vii) Determinant of a skew symmetric matrix of odd order is zero.
A square matrix A is said to be singular or non–singular according as | A | = 0 or | A |
 0.

28. Submatrix of a matrix.


Let A = [aij]m × n

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
8
MATRICES

The matrix obtained from A by deleting some rows and some columns of A is called a
submatrix of the matrix A.

29. Adjoint of a square matrix. If A = [aij]n×n is a square matrix and Aij is the cofactor of aij
in A, then the transpose of the matrix obtained from A after replacing each element by
the corresponding cofactor is called the adjoint of A and is denoted by adj. A.
Thus adj. A = [Aij]'.
Rule for finding adjoint of 2 × 2 matrix. The adjoint of a square matrix of order 2 can be
easily obtained by interchanging the diagonal elements and changing signs of non–
diagonal elements.
a b   d – b
For example if, A =   , Then adj. A =  
c d  – c a 
Properties of adjoint of a square matrix.
(i) If A is a square matrix of order n, then A.(adj.A)=(adj.A)A=|A|In.
(ii) |Adj. A| = | A |n–1, if | A |  0
(iii) adj. (AB) = (adj. B) (adj. A)
(iv) adj. (adj. A) = | A |n – 2 A

30. Inverse of a Square Matrix


Let A be a square matrix of order n. Another square matrix B or order n is called the
inverse of A, if AB=BA = In and we write A −1 =B.
Properties of inverse of a square matrix
(i) Every square matrix does not have inverse.
(ii) A square matrix A has inverse iff A is non–singular, i.e., | A |  0
(iii) Inverse of a square matrix A, if it exists is unique.
1
(iv) A −1 = adj. A.
|A|
(v) If A is non–singular and AB = AC then B = C, where B and C are square matrices of
the same order.
(vi) Reversal law. If A, B, C are invertible matrices of same order, then
(i) (AB) −1 = B−1A −1
(ii) (ABC) −1 = C −1B−1A −1
(vii) If A is an invertible matrix then A ' is also invertiable and (A' ) −1 = (A −1 )'.
(viii) If a non–singular matrix A is symmetric then A −1 is also symmetric.
1
(ix) If A is a non–singular matrix, then | A −1 |=| A | −1 , i.e., | A -1 |=
|A|

31. Solution of simultaneous Linear Equations


Consider a system of simultaneous linear equations:
a 11 x 1 + a 12 x 2 + a 13 x 3 = b1
a 21 x 1 + a 22 x 2 + a 23 x 3 = b 2
a 31 x 1 + a 32 x 2 + a 33 x 3 = b 3
These equations can be written in the matrix form as:
AX = B, where

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
9
MATRICES

 a 11 a 12 a 13   x1  b1 
A = a 21 a 22 a 23  , X =  x 2 , B = b 2 
   
a 31 a 32 a 33   x 3  b 3 
The matrix A is called the coefficient matrix.
X is called the unknown vector.
A set of values of the variables x1, x2, x3 which simultaneously satisfy these three
equations is called a solution. A system may contain n equations in n variables.
A system of linear equations may have a unique solution or infinitely many solutions or
no solution at all. If a system has a solution (unique or infinitely many), the system is
said to be consistent. If it has no solution, it is called an inconsistent system.
If b1 = b2 = b3 = 0 i.e., B = O, then the system is called a homogeneous system.
Otherwise, it is called a non–homogeneous system of equations.

32. Condition of Consistency of a System of Linear Equations


(i) The non–homogeneous system of linear equations AX = B, B  0 has unique
solution if | A |  0 and the unique solution is given by X = A–1B.
(ii) If | A | = 0 and (Adj. A) B = O, the system AX = B is consistent and has infinitely
many solutions.
(iii) If | A | = 0 and (Adj. A)B  O, then the system AX = B is inconsistent.
(iv) If | A |  0, then the homogeneous system AX = O has only zero solution or trivial
solution i.e., x1 = 0, x2 = 0, ….., xn = 0
(v) If | A | = 0, then the system AX = O has a non–trivial solution.

33. System of Linear Equations


Consider a system of m linear equations in n unknowns x1, x2, …..,xn given by
a11 x1 + a12 x 2 + .... + a1n x n = b1
a 21 x1 + a 22 x 2 + .... + a 2n x n = b 2
………………………………
………………………………
………………………………
a m1 x1 + a m2 x 2 + .... + a mn x n = b m
This system can be written in matrix from as AX = B, where
 a 11 a 12 ... a 1n 
a a 22 ... a 2 n 
A =  21
 : : ... : 
 
a m1 a m 2 ... a mn  mn
The matrix A is called the coefficient matrix and the matrix
 a 11 a 12 ... a 1n : b1 
a a 22 ... a 2 n : b 2 
[A : B] =  21
 : : ... : : : 
 
a m1 a m 2 ... a mn : b m 
is called the augmented matrix of the system. The system of equations AX = B.
(i) is consistent iff  [A : B] =  (A).
where (A) denotes the rank of A.
(ii) has unique solution if [A : B] = (A) = n.
(iii) has an infinite number of solutions if [A : B] = (A) = r < n.

34. Elementary Transformations


Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
10
MATRICES

The following three operations applied on rows (columns) of a matrix are called
elementary row (column) transformations or operations.
(i) Interchange of any two rows (columns).
(ii) Multiplying all elements of a row (column) of a matrix by a non–zero scalar.
(iii) Adding to the elements of a row (column), the corresponding elements of any row
(column) multiplied by a scalar.

35. Elementary matrix


A matrix obtained from an identity matrix by a single elementary operation (transformation)
is called an elementary matrix.
Every elementary row (column) transformation of an m × n matrix (not identity matrix) can
be obtained by pre–multiplication (post multiplication) with the corresponding elementary
matrix obtained from the identity matrix. Im(In) by subjecting it to the same elementary row
(column) transformation.
If C = AB is the product of two matrices, then any elementary row (column) transformation
of AB can be obtained by subjecting the prefactor A (post factor B) to the same
elementary row (column) transformation.

36. Equivalent matrices


Two matrices A and B are said to be equivalent if one can be obtained from the other by
applying a sequence of elementary transformations and we write A ~ B.

37. Row–echelon from of a matrix


A matrix A is said to be in row–echelon from if either A = O or A satisfies the following
conditions:
(i) Non–zero rows are above the zero rows (rows with all entries zero).
(ii) In each row all non–zero elements occur on the right of zero elements.
(iii) Number of zeros in rows go on increasing with the rows.

38. Rank of a Matrix


A positive integer r is called the rank of an m × n matrix A if
(i) determinant of every square sub–matrix of A of order (r + 1) or more is zero and
(ii) there exist at a least one square sub–matrix of A of order r whose determinant is
non–zero.
Thus, the rank of a matrix A is the order of highest order non–singular square submatrix
of A. Following are some important results:
(i) (A)  min {m, n}
(ii) (A) = 0 iff A = O
(iii) If A  O, then (A)  1.
(iv) If A is n × n non–singular, then (A) = n.
(v) If A is n × n singular matrix, then (A) < n.
(vi) If B be an r × r square submatrix of A such that | B |  0, then (A)  r.
(vii) Rank of a matrix does not change if it is subjected to elementary row or column
operations.
(viii) (A) = number of non–zero rows in a row–echelon from of A.

39. Geometrical Transformations


(i) Reflection in x–axis. If P ' ( x ' , y' ) is the reflection of the point P (x, y) in x–axis, then
1 0 
the matrix describing the reflection is  .
0 – 1

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
11
MATRICES

 – 1 0
(ii) Reflection in y–axis:  
 0 1
– 1 0 
(iii) Reflection through origin :  
 0 – 1
0 1 
(iv) Reflection in the line y = x :  
1 0
 0 – 1
(v) Reflection in the line y = – x:  
– 1 0 
cos 2 sin 2 
(vi) Reflection in y = x tan  :  
 sin 2 – cos 2
cos  – sin 
(vii) Rotation through an angle :  
 sin  cos  

PRACTICE AT YOUR HOME

1 0 0 
1.

If A = 0 1 0  , then A2 is equal to

a b − 1
(a) A (b) – A (c) null matrix (d) I.

0 1
2. If A =   , I is the unit matrix of order 2 and a, b are arbitrary constants, then
0 0 
(aI + bA )
2
is equal to
(a) a I + abA (b) a I + 2abA (c) a I + b A (d) none of these.
2 2 2 2

Matrix A is such that A = 2A - I, where I is the identity matrix. Then for n  2, A =


2 n
3.
(a) n A – (n – 1)I (b) n A – I (c) 2
n −1
A − (n − 1) I (d) 2n −1 A − I.

4. If A is the square matrix, then adj(A’) – (adj.A)’ is equal to


(a) 2 |A| (b) 2 |A|I (c) null matrix (d) unit matrix.

1 1
and n  N then A is equal to
n
5. If A =  
1 1
n n −1
(a) 2 A (b) 2 A (c) n A (d) none of these.

6. If B is a non-singular matrix and A is a square matrix, then det (B-1 AB) is equal to
(a) det B (b) det A (c) det (B-1) (d) det (A-1).

 1 2 − 1
7.

If A = −1 1 2 , then det (adj. (adj. A)) is

 2 − 1 1 
Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
12
MATRICES

(a) (14) (b) (14) (c) (14) (d) (14) .


1 2 3 4

1 2 − 1
8.

If A = 1 1 2 , then

2 − 1 1
(a)  (A) = 2 (b)  (A) = 1 (c)  (A) = 3 (d) none of these.

9. If AB = A and BA = B, then B2 is equal to


(a) A (b) B (c) I (d) 0.

 1 1 3
10. If A =
 5 2 6  , then A is

 −2 −1 − 3
(a) nilpotent (b) idempotent (c) scalar (d) none of these.

 1
 −1 2 1 − 1 =
  
11.
 2 
 2  2 − 1
1
   1 (d) not defined.
 
(a) −1 (b) −1
 
(c) −2
 −1
 −2   4 2 − 2
1 0 
12. If A =  1  , then A50 is
 1
2 
1 0 1 0 1 25  1 0
(a)   (b)   (c) 
1
(d)  
0 50  50 1 0 25 1

0 1
13. The matrix   is the matrix of reflection in the line
1 0 
(a) x − y = 1 (b) x + y = 0 (c) x + y = 1 (d) x = y

 0 − tan    cos  − sin  


Let A =  , B =   and (I + A) (I – A) = 0 , then K is
-1 K
14.
 tan  1   sin  cos  
(a) 1 (b) 2 (c) 3 (d) 4.

a b
 satisfies the equation x − (a + d ) x + K = 0 , then
2
15. If A = 
c d
A−1 exists if
(a) K = bc (b) K = ad
Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
13
MATRICES

(c) K = a + b + c + d
2 2 2 2
(d) none of these.

1 2 x 1 −2 y
16.

If A = 0 1 0  and B = 0 1 0  and AB = I3, then x + y equals
 
0 0 1 0 0 1
(a) 0 (b) -1 (c) 2 (d) none of these.

17. If and is the inverse of , then the value

of is
a) 2 b) 0 c) 5 d) 4

18. The system of equations and


a) Possesses a trivial solution only
b) Possesses a non-zero unique solution
c) Does not have a common non-zero solution
d) Has infinitely many solutions

19. If , where then is equal to


a)
b)
c)
d) None of the above

20.
This system of equations has
a) Infinite solution b) No solution
c) No solution d) Unique solution

21. If is a skew symmetric matrix of order and is a column matrix of order


is
a) An identity matrix of order
b) An identity matrix of order1
c) A zero matrix of order 1
d) None of the above

22. If and ,
Then values of and are
a) 1, 1 b)
c) 1, 0 d) None of these

23. The system of simultaneous equations and


has a unique solution, if equals
a) b) c) 0 d) 1

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
14
MATRICES

24. Assuming that the sum and product given below are defined, which of the following is
not true for matrices?
a)
b) does not imply
c) implies or
d)
25. If
and then

a) 0 b) -4
c) 4 and not 1 d) 1 or 4

26. For what value of the following system of linear equations will have infinite
solutions

and
a) b) c) d)

27. If and are square matrices of size such that


?
a)
b) Either of or is a zero matrix
c) Either of or is an identity matrix
d)

28. The values of for which of the system of equations


infinite number of
solutions, are
a) b)
c) d)

29. Let for any matrix exist which of the following is not true?
a) b)
c) d)

30. If then the inverse of is


a) b) c) d)

31. If and , then is


a) b)

c) d) None of these

32. If , then equal to

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
15
MATRICES

a) b) c) d)

33. For what value of the system of equations


is consistent?
a) 1 b) 2 c) -1 d) 3

34. If is skew-symmetric matrix of order 3, then matrix is


a) Skew-symmetric matrix
b) Symmetric matrix
c) Diagonal matrix
d) None of the above

35. The rank of the matrix is

a) b)
c) d)

36. The real value of for which the system of equations


has non-trivial solution is
a) 2 b) -2 c) 3 d) -3

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
16
MATRICES

Answer key
Q. Ans. Q. Ans. Q. Ans Q. Ans
1 d 11 c 21 c 31 a
2 b 12 d 22 b 32 d
3 a 13 d 23 b 33 d
4 c 14 a 24 c 34 a
5 b 15 d 25 c 35 b
6 b 16 a 26 c 36 a
7 d 17 c 27 a
8 c 18 d 28 a
9 b 19 c 29 b
10 a 20 c 30 a
SOLUTIONS

1 0 0  1 0 0  1 0 0 
1.

A = 0 1
2
0  0 1 0  = 0 1 0  = I

a b − 1 a b − 1 0 0 1 

(aI + bA ) = (aI + bA )(aI + bA )


2
2.
= a2I . I + abI . A + ab A . I + b2A . A
= a2I + 2ab A + b2A2
0 1 0 1 0 0
Now A2 =    = 0 
=0
0 0  0 0  0
 b2A2 = b2(0) = 0
 (aI + bA ) = a2I + 2ab A
2

3. A2 = (2A – I) = 2A – (2 – 1)I
A3 = A2 . A = (2A – I) . A
= 2 A2 – AI = 2(2A – I) – AI
= 4A – 2I – A = 3A – 2I
= 3A(3 – 1) I
A4 = A3 . A = (3A – 2I) . A
= 3 A2 – 2A . I
= 3(2A – I) – 2A
= 4A – 3I = 4A – (4 – 1) I and so on.  An = nA – (n – 1) I

4. Since adj (A’) = (adj. A)’ [Result 1(iii) page 291]


 adj (A’) – (adj. A)’ = 0 = null matrix

1 1 1 1 2 2 1 1
A2 =   1 2 2 1 1
5. = = 2 = 21A
1 1 1 
2 2 1 1 4 4 1 1 1 1
A3 =   1 4 4 1 1 1 1 = 2 A
2 2
= = 4 = 2
2 2 1   

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
17
MATRICES

4 4 1 1 8 8 3 1 1
A4 = 
4 1 1 = 8 8 1 1 = 2 A
3
=2
4     
Hence An= 2n-1A

6. det. (B– 1 AB) = det. (B– 1) det A det B


= det. (B– 1) . det B . det A
= det. (B– 1 B) . det A
= det (I) det A
= 1. det A = det A
 det. (B AB) = det A
–1

 1 2 − 1
7. A = −1
 1 2

 2 − 1 1 
 3 5 − 1  3 −1 5

adj. A = −1 3  
5 =  5 3 − 1

 3 − 1 3   −1 5 3 
 14 − 14 28   1 −1 2
 adj. (adj. A) =
 28 14 − 14 = 14  2 1 − 1

 −14 28 14   −1 2 1 
 1 −1 2
 det. (adj. (adj. A)) = (14)3
 2 1 − 1 = (14)3 (3 + 1 + 2 (5)) = (14)4

 −1 2 1 

1 2 − 1
8.

Since |A| = 1 1 2

2 −1 1
= 3 – 2 (1 – 4) – 1 (-1 – 2)= 3 + 6 + 3 = 12  0
 A is non – singular.   (A) = 3

9. AB = A and BA = B
BAB = B2 BA = B2 [ AB = A]
B = B . Thus B2 = B
2
2
10. A =A.A
 1 1 3  1 1 3  0 0 0
=
 5 2 6   5 2 6  =  3 3 9 
  
 −2 −1 − 3  −2 −1 − 3  −1 −1 − 3 
3 2
A =A .A

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
18
MATRICES

 0 0 0  1 1 3 0 0 0
=
 3 3 9   5 2 6  = 0 0 0  = 0
  
 −1 −1 − 3   −2 −1 − 3 0 0 0 
 A = 0  A is nilpotent.
3

 1  2 1− 1
 −1 2 1 − 1 =  −2 1
    −1
11.
 2   4 2 − 2

1 0  1 0   1 0
A2 =  1  1  = 1 1  = 1 0
1  1 1 
12.
 1  1  +
2  2  2 2 
1 0  1 0  1 0 
A4 = (A2)2 =    = 
1 1  1 1  2 1
1 0  1 0  1 0 
A8 = A4 . A4 =    = 
2 1 2 1 4 1
1 0  1 0  1 0   1 1
 A50 = 
1
A16 = A8 . A8 =    =  and so on
4 1 4 1 8 1 25

 x ' 0 1  x  y 
13. Here  =   =  
y ' 1 0 y   x 
 x' = y
y' = x
Hence, reflection is on the line y = x

1
0  0 − tan    1 − tan  
14. I+A=  + = 
1  tan 
0 0   tan  1 
 1 tan  
I–A=  
 − tan  1 
 1 tan    1 − tan  
Adj. (I – A) =   −  
 − tan  1   tan  1 
 1 − tan    1 − tan  
   
 tan  1   tan  1 
(I – A) =
-1
=
1 + tan2  sec 2 
 cos2  − sin  cos  
=  
 sin  cos  cos 2  

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
19
MATRICES

 1 − tan    cos2  − sin  cos  


 (I + A)(I – A) =   
-1

 tan  1   sin  cos  cos 2  


 cos  − sin 
2 2
− sin  cos  − sin  cos  
=  
 sin  cos  + sin  cos  − sin2  + cos 2  
 cos 2 − sin2 
= 
 sin2 cos 2 
Again
 cos  − sin    cos  − sin  
B2 =   
 sin  cos    sin  cos  
 cos2  − sin2  − sin2   cos 2  − sin2  
=  = 
 sin2 cos2  − sin2    sin2  cos 2 
Since (I + A) (I – A)-1 = BK
 K=2

a b
15. A=   satisfies the equation
c d
x 2 − (a + d ) x + K = 0
 A 2 − (a + d )( A + KI ) = 0
 A − (a + d ) I + KA −1 = 0
a b  a + d 0  −1
 −  + KA = 0
c d  0 a +d
 −d b −1
   + KA = 0
 c −a
 d −c   d −b
Now Adj. A =  = 
 − b a   −c a 
I  d −b
A −1 =  
ad − bc  −c a
 −d b 1  d −b
  + K.  =0
 −c − a  ad − bc  −c a
 K = bc − ad.

1 2 x 1 −2 y  1 0 y + x
16.

AB = 0 1 0  0 1 0  = 0 1 0 
 
0 0 1 0 0 1 0 0 1 

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
20
MATRICES

1 0 0

Also AB = Iy = 0 1 0 

0 0 1
 x+y=0

17. (c)
Since, is the inverse of .
,

So,

18. (d)
Given System of equations are

and

Now,

Since, determinant is zero, then it has infinitely many solutions.

19. (c)
Given,

20. (c)
Given, …(i)
…(ii)
…(iii)

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
21
MATRICES

Then, this is system has the unique solution.

21. (c)
Here, , and are matrix of order and 1 respectively.
Let
Then,

is null matrix.
Which shows that is a zero matrix of order1.

22. (a)
adj

and

23. (b)
For unique solution,

or

24. (c)
If , then and may be equal to individually. It is not necessary in any
condition

25. (c)

…(i)
and

But is not satisfied the Eq (i).

26. (c)

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
22
MATRICES

Given system of equations is

and
The given system will have infinite solutions.

27. (a)
Since,
=

28. (a)
Given system of equations are

and
The given system of equations has infinite number of solutions, if any tow equations
will be same , the last two equations will be same, if

29. (b)
By using inverse of matrix, we know

and holds true


but not true

30. (a)
If is any square matrix, then
and
Since,

68 (a)
Given,
( Put )

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
23
MATRICES

31. (a)
Given,
( Put )

32. (d)

33. (d)
Given equation are
Since, it is consistent.

34. (a)
Since,

And
Hence, matrix is a skew-symmetric matrix

35. (b)

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
24
MATRICES

When

When

When

When

36. (a)
Given, 2
For non-trivial solution

Reg. & Corp. Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.)-324005
Website : www.resonance.ac.in | E-mail : contact@resonance.ac.in
Toll Free : 1800 258 5555 | CIN: U80302RJ2007PLC024029
25

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy