« MATHS 1A

1
BABY BULLET-Q «

3.MATRICES
(2 X 2) + (1 X 4) + (2 X 7) = 22 Marks

@IMP FORMULAS, KEY CONCEPTS?

1) BASIC TERMINOLOGY
1.1) MATRIX: An ordered rectangular array of elements is called a matrix.
ª1 0 0º
ª1 º ª1 2º
Ex 1: A = [1 2 3]1x3; Ex 2: A « 2 » 2´1; Ex 3: «¬3 4»¼ 2´2; Ex 4: «« 0 1 0 »»
¬ ¼ 3´3
«¬ 0 0 1 »¼

Note: A matrix having m rows and n columns is said to be of order m ´ n

- Q
1.2) Equality of matrices: Matrices A,B are said to be equal, written as A=B if

T
(i) A, B are of same order (ii) the corresponding elements in A,B are equal

Ex: «
ª1 2º
¬3 4»¼
ª1 2º ª1 2º ª1 3º ª1 2
«¬3 4»¼ but «¬3 4»¼ z «¬2 4»¼ z «¬3 4
L E 5º
6»¼

2) TYPES OF MATRICES-I
L
U
2.1) Null matrix or zero matrix: If each element of a matrix is zero then it is called a null matrix.

Ex: O «
ª0 0 º
»
¬0 0 ¼
B
Y
2.2) Square matrix: A matrix in which the number of rows is equal to number of columns, is

B
called a square matrix.A square matrix of order n´n is also called a square matrix of order n.

A
ª 2 5 0º
ª1 2º
Ex: «3 4» is a square matrix of order 2= «1 2 4» is a square matrix of order 3

B
¬ ¼ «¬0 8 7»¼

2.3) Principal diagonal: If A is a square matrix then the diagonal in A, from the first element of
first row to the last element of the last row is called the principal diagonal of A.
2.4) Trace of a matrix: If A is a square matrix then the sum of the elements in the principal
diagonal of A is called trace of A and it is denoted by Tr(A)
ª1 2 3 º
« »
Ex: If A « 4 5 7 » then Tr(A) 1  ( 5)  10 6
«¬ 6 8 10 »¼
2.5) Diagonal matrix: If each non-diagonal element of a square matrix is zero then the matrix is
called a diagonal matrix. i.e., a matrix A = [aij]nxn where aij = 0 for i ¹ j is called a diagonal
matrix and it is denoted by diag (a11 a22 .... ann)

ª1 0 0 º ª5 0 0 º
ª1 0 º « 0 3 0 » , diag(5,0,1) «0 0 0 »
Ex: diag(1, 2) « » , diag(1,3, 2) « » « »
¬0 2¼ «¬ 0 0 2 »¼ «¬0 0 1 »¼
« MATHS 1A
2
BABY BULLET-Q «
@IMP FORMULAS, KEY CONCEPTS?
MULTIPLICATION OF MATRICES
1) Multiplication of Matrices: Two Matrices A and B are said to be conformable for
multiplication in that order written as AB if the number of columns of A is equal to the number
of rows of B.
Row - by - Column multiplication: To find the product AB, the elements in the row(s) of the
first matrix A should be multiplied by the corresponding elements in the column(s) of the second
matrix B.
If the order of A is mxn and order of B is nxp, then the order of the product matrix AB is mxp.
ª7 8 º
ª 1( 7 )  2 (9 )  3(1 1) 1(8 )  2 (1 0 )  3(1 2 ) º

Q
ª1 3º «9 ª 58 64 º
1 0 »»
2
Ex: «

-
¬4 5 6 »¼ 2 x 3 « « 4 ( 7 )  5 (9 )  6 (1 1)
¬ 4 (8 )  5 (1 0 )  6 (1 2 ) »¼ «1 3 9
¬ 1 5 4 »¼ 2 x 2
«¬1 1 1 2 »¼ 3 x 2

2) Special properties of Multiplication of Matrices unlike Multiplication of Reals: T

1) Matrix multiplication is not commutative i.e., ingeneral AB ¹ BA.
But, we can find matrices A, B such that AB = BA.
L E
L
Note:If AB is defined then BA may not always be defined. Even if AB and BA both are

U
defined (even when A,B are square matrices of same order) then AB and BA may not be

B
equal.
Rem 1: If AB = BA then A,B are said to be commutative.

Y
Rem 2: If AB = -BA then A,B are said to be anticommutative.

B
Rem 3: If A & I are square matrices of same order, I being a unit matrix then AI = IA = A.

A
Hence this unit matrix is called Identity matrix under multiplication.

2)

Ex: ª1 0º ª0 0º
«¬2 0»¼ «¬3 4»¼
B
If AB = O then either A or B need not be equal to O
ª0 0º . Thus zero divisors (matrix) exist in 'matrix Algebra'.
«¬0 0»¼

3) If AB= AC, A¹O, then B need not be equal to C, i.e., cancellation laws do not hold true.
ª1 2º ª2 2º ª1 2º ª0 0º
«¬1 2»¼ «¬1 1 ¼» «¬1 2»¼ «¬2 2¼»

Note: Cancellation laws hold true, if A is a non-singular matrix.

ª1 0 º ª0 1 º ª0 1 º
4) Let AB = B then A need not be the unit matrix I. Ex: « »« » «0 0 »
¬0 0 ¼ ¬0 0 ¼ ¬ ¼
5) If AB = O then BA need not be equal to O.
ª1 0 º ª0 0 º ª1 0 º ª 0 0 º ª0 0º ª 0 0 º ª1 0 º ª0 0º
Ex: A « » , B «1 1 » Ÿ AB «1 0 » «1 1 » « 0 0 » , BA «1 1 » «1 0 » « 2 0 » z O
¬1 0 ¼ ¬ ¼ ¬ ¼¬ ¼ ¬ ¼ ¬ ¼¬ ¼ ¬ ¼
« MATHS 1A
3
BABY BULLET-Q «

@IMP FORMULAS, KEY CONCEPTS?

TRANSPOSE, DETERMINANT, ADJOINT & INVERSE OF A MATRIX
1) TRANSPOSE OF A MATRIX: The matrix obtained by interchanging the rows and columns of
a given matrix is called the Transpose of the given matrix. Transpose of A is denoted by AT or A'
ª1 2º
«4 5» ª1 4 7 º ª1 2 º ª1 3º
Ex 1: If A « » then A T « 2 5 8 » Ex 2: If A « » Ÿ A’ « »
«¬ 7 8 »¼ ¬ ¼ 2u3 ¬3 4 ¼ 2u2 ¬ 2 4 ¼ 2u2
3u2
1) SYMMETRIC MATRIX: A square matrix A is said to be a symmetric matrix if AT=A.
ª1 2 0º ªa h gº
ª1 2 º « » «h b f » AP 23
Ex: A « » B «2 3 1» C « »
¬ 2 3 ¼ «¬ 0 1 4 »¼ «¬ g f c »¼

2) SKEW-SYMMETRIC MATRIX:
A square matrix A is said to be a skew-symmetric matrix if AT= -A.
- Q
T
E
ª 0 1 2 º
ª0 1º « 1 0 4 »
Ex: A «1 0 » , B « »

L
¬ ¼ «¬ 2 4 0 »¼

L
3) DETERMINANT OF A MATRIX

U
If A ªa bº then determinant of A is denoted by det A or |A| or a b
«¬c d »¼ c d

Ex:
3 4
1 2
3(2)  (1)(4) 6  4 2 B
Y
B
ªa 1 a2 a3 º
If A «b1 b2 b 3 » then its determinant |A| is given as follows:
«
¬ c1 c2 c3 ¼
»
A
a1
b1 b 2
a2 a3
b3
Bb
a1 2
c2
b3
c3
b b b b2
 a 2 1 3  a3 1
c1 c3 c1 c 2
c1 c 2 c3
a1 (b 2 c3  c 2 b3 )  a 2 (b1c3  c1b3 )  a 3 (b1c 2  c1b 2 )
Def: If |A| = 0 then A is said to be a singular matrix and
if |A| ¹ 0 then A is said to be a non-singular matrix.

4) MINOR OF AN ELEMENT: If aij is an element which is in the ith row and jth column of
a square matrix A, then the determinant of the matrix obtained by deleting the ith row and jth
column of A is called minor of aij and it is denoted by Mij.

ª a11 a12 a13 º a 22 a 23

Ex: If A «a a 23 »» then M11= Minor of a11 a 22a 33  a 32a 23
« 21 a 22 a 32 a 33
«¬ a 31 a 32 a 33 »¼
a 21 a 23
M12 = Minor of a12 a 21a 33  a 31a 23 and so on.
a 31 a 33
« MATHS 1A
4
BABY BULLET-Q «
5) COFACTOR OF AN ELEMENT: If aij is an element which is in the ith row and jth column
of a square matrix A, then the product of (-1)i+j and the minor of aij is called cofactor of aij and
it is denoted by Aij.

ª a11 a12 a13 º

«a a a 23
Ex: If A « 21 a 22 a 23 »» then A11 (1)11 M11 1 22 a 22a 33  a 32a 23
a 32 a 33
«¬ a 31 a 32 a 33 »¼
a a
A12 = Cofactor of a12 (1)1 2 M11 1 21 23 (a 21a 33  a 31a 23 ) and so on.
a 31 a 33

6) ADJOINT OF A MATRIX: The transpose of the matrix obtained by replacing the elements

- Q
of a square matrix A by the corresponding cofactors is called the adjoint matrix of A.

The adjoint of the matrix A is denoted by Adj A or adj A.

T
If A ªa bº then Adj A ª d  b º
«¬c d »¼ « c a »
L E
L
¬ ¼

U
ª a 11 a 12 a 13 º ª A11 A 21 A 31 º
Ex: If A «a 21 a 22 a 23 » then Adj A «A12 A 22 A 32 »
«a
¬ 31 a 32 a 33 »¼
B «A
¬ 13 A 23 A 33 »¼

Y
7) INVERSE OF A MATRIX: A square matrix A is said to be an invertible matrix if there exists

B
a square matrix B such that AB = BA = I and the matrix B is called inverse of A.

A
1
• If A is a nonsingular matrix then A 1 (Adj A)

B
det A

+ Inverse of a 2 ´ 2 non-singular matrix:

ªa b º
Let A « c d » Þ Determinant of A = ad – bc ¹ 0
¬ ¼

ªd c º ª d c º
Þ Minor matrix of A « b a » Þ Cofactor matrix of A « b a »
¬ ¼ ¬ ¼

ª d bº 1 ª d bº
Þ Adjoint matrix of A « » Þ Inverse matrix of A if ad – bc ¹ 0
¬ c a ¼ ad  bc «¬c a »¼

1 ª 7  3º
Ex: If A ª2 3º then, A 1 1ª 7  3º ª 7 3 º
«¬5 7 »¼ 14  15 «¬ 5 2 ¼» «¬ 5 2 ¼» «¬ 5  2»¼
« MATHS 1A
5
BABY BULLET-Q «

@IMP FORMULAS, KEY CONCEPTS?

PROPERTIES OF DETERMINANTS
1) Result 1: If A is a square matrix, then det A = det AT . Thus |A| = |AT|
ª3 4 º 3 4
Example: A «1 2 » Ÿ| A | 1 2 3(2)  1(4) 2
¬ ¼

ª3 1º 3 1
AT T
« 4 2 » Ÿ| A | 4 2 3(2)  4(1) 2 \ |A| = |AT|
¬ ¼

2) Result 2: The sign of the determinant of a square matrix changes if any two rows
(or columns) in the matrix are interchanged.

Example:
1 2
(1 u 4)  (3 u 2) 2 and
3 4
-
(3 u 2)  (1 u 4) Q 2

T
3 4 1 2

E
3) Result 3: If any two rows (or columns) of a square matrix are identical, the value of the
determinant of the matrix is zero.
1
4 1 7
2 3
L L
U
Example: =0. Because elements in R1 and R3 are proportional
2 4 6
4) Result 4:
B
If all the elements of a row (or column) of a square matrix are multiplied by a
number k then the value of the determinant of the matrix obtained is k times

Y
the determinant of the given matrix. (For a 3 x 3 matrix A, |kA| = k3|A|)
a b c
B ka kb kc ka kb kc ka kb kc
Example: If d e f
A p then d e f kp, ld le lj (kl )p, ld le lj (klm)p

B
g h i g h i g h i mg mh mi

a b c ka kb kc a kb c a b c
Also k d e f d e f d ke f d e f etc.,
g h i g h i g kh i kg kh ki

ªa b c º ª ka kb kcº ka kb kc a b c
+ k «d e f » «kd ke kf » & kd ke kf k3 d e f
¬«g h i »¼ ¬«kg kh ki »¼ kg kh ki g h i

5) Result 5: If each element in a row (or column) of a square matrix is the sum of the two
numbers, then its determinant can be expressed as the sum of the determinants of
two square matrices.

a1 b1  x c1 a1 b1 c1 a1 x c1
Example: a2 b2  y c2 a2 b2 c2  a 2 y c2
a3 b3  z c3 a3 b3 c3 a3 z c3
« MATHS 1A
6
BABY BULLET-Q «
6) Result 6: If the elements of a row (or column) of a square matrix are added with k times
the corresponding elements of another row (or column), then the value of the determinant of
the matrix obtained is same as the value of determinant of the given matrix.

x1 y1 z1 x 1  ky1 y1 z1
Example: x 2 y2 z2 x 2  ky 2 y2 z2
x3 y3 z3 x 3  ky 3 y3 z3
+ The value of the determinant of a matrix do not change with the operations like
R1+R2, R1-R2, R1+kR2, R1+R2+R3 or C1+C2, C1-C2, C1+kC2, C1+C2+C3
7) Result 7: If the elements of a row/column of a square matrix are proportional to some other row
i.e.,k times the elements of another row/column, then the determinant of the matrix is zero.

a1 kb1 b1 a1 b1 b1

Q
Example: a 2 kb 2 b2 k a2 b2 b2 0

-
a3 kb 3 b3 a3 b3 b3
8)
T
Result 8: If the elements of a square matrix are polynomials in x and two rows (or columns)

E
are identical when x=a, then (x-a) is a factor of the determinant of the matrix.

L
9) Result 9:The determinant of triangular matrix is the product of the diagonal elements of the

a1 a 2 a3 a1 0 0
L
U
matrix 0 b 2 b3 a2 b2 0 a 1b 2 c 3
0 0 c3 a3 b3 c3

B
10) Result 10:If A and B are two square matrices of same type, then det (AB)=det A.det B.

Y
Notation: While evaluating determinants, we use the following notation.

B
(i) R1® kR1 means that the elements of R1 are multiplied by k.

A
(ii) R 1 ® R 1 +kR 2 means that the elements of R 1 are added with k times the

B
corresponding elements of R2.
Remark:The sum of the products of the elements of any row (or column) of a square matrix with
the cofactors of the corresponding elements of another row (or column) of the matrix is zero.

+ The following observations are helpful to avoid the confusion between the matrix
representation and determinant representation.
(i) Elements of matrix are enclosed between square brackets while elements of determinants
are enclosed between vertical lines.
(ii) Matrix is an array of numbers but determinant of a matrix is a real value.
(iii) In matrices we deal with square and rectangular matrices, but in determinants we deal
with the determinants of square matrices only.
(iv) Distinction should be made clearly especially w.r.to scalar multiplication property.(Result 4)
(v) The process of matrix multiplication is unique but the process of determinant
multiplication can be done in several ways.
« MATHS 1A
7
BABY BULLET-Q «

@IMP FORMULAS, KEY CONCEPTS?

RANK OF A MATRIX
1) Sub Matrix: The matrix obtained by deleting some rows or columns or both of a given matrix is
called a sub matrix of the given matrix.
2) Minor: The determinant of a square submatrix of a given matrix is called minor. If the order of
the square submatrix is r then the minor is called r-rowed minor or minor of order r.
3) Rank of a Matrix: A positive integer r is said to be the rank of a non-zero matrix A, denoted by
rank(A) or * (A) if
(i) there is atleast one non-zero minor of order r
(ii) the minor of order (r+1) should be zero
- Q
T
Thus the rank of a matrix is the order of any highest order non-zero minor of the matrix.
Rem-1 : The Rank of a zero matrix is defined as zero.
Rem-2 : Rank exists for a rectangular matrix also.
L E
L
Hint 1: In order to find the rank of a matrix, we have to search for a non-zero minor in the descending order.
Hint 2: Let A be a non-zero matrix of order 3x3 then if
U
(i) A is non-singular Þ Rank (A)=3
B
Y
(ii) A is singular and atleast one of its 2´2 submatrix is non singular Þ rank(A)=2

B
(iii) A is a singular and every 2´2 submatrix is also singular Þ rank (A)=1

I.
A
Find the rank of each of the following matrices

B
ª 1 4 -1º
ª1 0 º « »
(ii) ª1 0 -4 º (iii) ª«
1 0º
(i) « » » (iv) « 2 3 0 »
« 2 -1 3 »
¬0 1 ¼ ¬ ¼ ¬0 0 ¼ «¬ 0 1 2 »¼
1 0
Sol: (i ) Consider = 1(1) – 0 =1 ¹ 0 \ Rank(A) = 2
0 1

1 4
(ii) Consider a 2 ´ 2 minor 3  8 11 z 0 \ Rank(A) = 2
2 3

1 0
(iii) Consider = 1(0) – 0 = 0. Also, a 1 ´ 1 minor is |1| = 1 ¹ 0 \ Rank(A) = 1
0 0

ª 1 4 -1º
(iv) A « 2 3 0 » Þ det A= 1(6 – 0) – 4(4 – 0) – 1(2 – 0) = 6 – 16 – 2 = –12 ¹ 0
« »
«¬ 0 1 2 »¼
Here, det A ¹ 0 and order of A is 3 ´ 3. \ Rank (A) = 3
« MATHS 1A
8
BABY BULLET-Q «
@IMP FORMULAS, KEY CONCEPTS?
CONSISTENT AND INCONSISTENT SYSTEM OF EQUATIONS
In this section, we study the existence and nature of solutions of a Homogenous system and
non-Homogeneous system of linear equations in 3 variables.
A system of linear equations is said to be
(i) consistent, if it has a solution
(ii) inconsistent, if it has no solution.
Consider the following system of equations in 3 variables
a1x + b1y + c1z = d1
a2x + b2y + c2z = d2 ........(1)
a3x + b3y + c3z = d3

Q
The corresponding matrix equation is AX = D, where

A
ª a1 b1 c1 º
«a »
« 2 b 2 c 2 » is the coefficient matrix
T-
«¬ a 3 b3 c3 »¼
ªx º ª d1 º
L E
L
« y » is the variable matrix
X « » D «« d 2 »» is the constant matrix

U
«¬ z »¼ «¬ d3 »¼
ª a1
«
Also, the matrix written as [A D] «a 2 B
b1 d1 º c1
b 2 c 2 d 2 »» is called the augmented matrix

Y
«¬ a 3 b3 c3 d3 »¼

B
If D is a zero matrix then the system given by (1), is said to be a Homogeneous system
If D is a non-zero matrix then the system given by (1), is said to be a non-Homogeneous system.
1)
A
Homogeneous system: Consider the following homogeneous system
a1x + b1y + c1z = 0
a2x + b2y + c2z = 0 B
a3x + b3y + c3z = 0
The equivalent matrix equation is AX = O where

ª a1 b1 c1 º ªx º ª0º
A «a b2 c 2 »» , X «y» , O «0»
« 2 « » « »
«¬ a 3 b3 c3 »¼ «¬ z »¼ «¬ 0 »¼
It is clear that x = 0, y = 0, z = 0 is always a solution and this is known as the trivial solution of the
homogeneous system. Thus, a homogeneous system is always consistent.
But for some Homogeneous systems, there may exist some non-trivial (infinitely many) solutions
also. Thus we are interested to find, whether a given system of Homogeneous equations possess
non-trivial solution or not. For this we use the following theorem.
Theorem: The system of equations in 3 variables AX = O has
(i) the trivial solution only if rank(A) = 3
(ii) a non-trivial solution (infinite number of solutions) if rank(A) ¹ 3
« MATHS 1A
9
BABY BULLET-Q «
@IMP FORMULAS, KEY CONCEPTS?
3(G) CRAMER'S RULE, MATRIX INVERSION METHOD
& GAUSS JORDAN METHOD
1) A given system of equations can be solved by some matrix methods viz.,
(1) Cramer’s rule (2) Matrix inversion method (3) Gauss-Jordan method..

1.1) Cramer’s Rule: Let the given system of equations be written in the matrix equation form as
AX = B. Let A be non-singular and
a1 b1 c1 d1 b1 c1 a1 d1 c1 a1 b1 d1
| A| ' a 2 b 2 c 2 , '1 d 2 b2 c2 , '2 a 2 d 2 c 2 , '3 a 2 b2 d 2
a 3 b3 c3 d 3 b3 c3 a 3 b3 c3 a 3 b3 d 3
'1
Then the solution of the system is given by x ,y
'2
,z
'3
- Q
T
' ' '
1.2) Matrix inversion method: Let the given system of equations be written in the matrix equation

L E
form as AX = D and if A is non-singular then the solution of system is given by X = A–1D.
If |A| = 0, then the system may be consistent, but the above 2 methods fail to arrive any

L
solution, then Gauss Jordon method paves the way, in such situations.

U
1.3) Gauss Jordan method: Working Procedure:
STEP 1: Write Augmented matrix of the given system.

ª a1
«a 2
b1 c1 d1 º
d2 »
B
Y
[ AB] b2 c2
« »
¬a 3 b3 c3 d3 ¼

B
STEP 2:Apply appropriate elementary row transformations on the augmented matrix to reduce it

ª1 0 0 Dº A
« B
into the form «0 1 0 E»
»
¬0 0 1 J ¼
Then the solution is given by x = a, y = b, z = g.
STEP 3: The elementary transformations on the agumented matrix [AB] ultimately reduces it into
any one of the following forms. Hence the solution can be determined accordingly.

ª1 0 0 Dº
(i) «0 1 0 E» The solution is x = a, y = b,. z = g
« »
¬0 0 1 J ¼
ª1 0 0 Dº
(ii) «0 1 k E» Here, the system has 'infinitely many solutions'.
« »
¬0 0 0 0¼
ª1 0 0 Dº
(iii) «0 1 0 E» Here, the system has 'no solution'.
« »
¬0 0 0 J ¼
« MATHS 1A
10
BABY BULLET-Q «

1. By using Cramer's rule solve 2x – y + 3z =8, –x+2y+z =4, 3x+y–4z =0

Sol: Given equations can be written as AX = D, where

ª 2 1 3 º ªxº ª8 º
A « 1 2 1 » , X « y» , D «4»
« » « » « »
«¬ 3 1 4 »¼ «¬ z »¼ «¬ 0 »¼

2 1 3
Now, ' det A 1 2 1 = 2(–8 – 1) + 1(4 – 3) +3 (–1 – 6) = –18 + 1 –21 = –38
3 1 4

1

Q
8 3
'1 4
0
2
1
1
4 -
= 2(–8 – 1)+1(–16 – 0) + 3(4 – 0) = –72 – 16 +12 = –76

T
2 8 3
L E
L
'2 1 4 1
= 2(–16 – 0) –8 (4 – 3) + 3(–0 – 12) = –32 – 8 +36 = –76

U
3 0 4

B
2 1 8
'3 1 2 4
= 2(0 – 4) +1 (0 – 12) + 8(–1 – 6) = – 8 –12 – 56 = –76

Y
3 1 0

? By Carmer ’s rule x B
'1  76 '2 76 '3 76

A
2; y 2; z 2
'  38 ' 38 ' 38

B
? The solution is x = 2, y = 2, z = 2
« MATHS 1A
11
BABY BULLET-Q «
2 By using Matrix inversion method, solve x–y+3z=5, 4x+2y–z=0, –x+3y+z=5 .
Sol: Matrix equation of the given system of equations is AX=D, where

ª 1 1 3 º ªx º ª5º
« 4 2 1» ; X «y» , D «0»
A « » « » « » \ The solution of AX=D is X=A–1D
¬« 1 3 1 »¼ ¬« z ¼» ¬« 5 ¼»

First we find A–1

1 1 3
|A| 4 2 1 1(2  3)  1(4  1)  3(12  2) = 1(5)+1(3)+3(14) =5+3+42=50¹0
1 3 1

Q
The co-factor matrix of A is

ª 2 1 4 1 4 2 º
T-
E
«   »
« 3 1 1 1 1 3 »

L
« 1 ª (2  3) (4  1) (12  2) º ª 5 3 14 º
3 1 3 1 1 » « (1  9)
« » (3  1) »» «10 4 2»

L
  « (1  3) « »
« 3 1 1 1 1 3 »
« » ¬« (1  6) (1  12) (2  4) »¼ ¬« 5 13 6 »¼
«  1 3

1 3

1 1 »
U
B
« 2 1 4 1 4 2 »¼
¬

Y
ª 5 10 5 º
« 3 4 13 »

B
Ÿ Adj A « »
«¬14 2 6 »¼

A
B
ª 5 10 5 º
1 «
3 4 13 »»
1 1
?A (AdjA) «
det A 50
«¬14 2 6 »¼

ª 5 10 5º ª 5 º ª 25  0  25 º ª 0 º ª0º
1 «
3 4 13 »» «« 0 »»
1 «
15  0  65»»
1 1 « » «1 »
Now, X A D « « 50
50 50 50 « » « »
«¬14 2 6 »¼ «¬ 5 »¼ «¬ 70  0  30 »¼ «¬100 »¼ «¬ 2 »¼

ªx º ª0º
?X «y» «1 »
« » « »
«¬ z »¼ «¬ 2 »¼
« MATHS 1A
12
BABY BULLET-Q «
3. Solve the equations x+y+z=9, 2x+5y+7z=52, 2x+y-z=0, by Gauss-Jordan method

Sol : The matrix equation corresponding to the given system of equations be AX = D,

ª1 1 1 9 º
« 2 5 7 52»
The augmented matrix is [AD] = « »
«¬ 2 1 1 0 »¼

ª1 1 1 9 º
« 0 3 5 34 » (' R o R  2R
[AD]= « » 2 2 1
«¬ 0 4 8 52 »¼ R 3 o R 3  R 2 )

ª1 1 1 9 º

Q
« 0 3 5 34 »

-
« »
«¬ 0 1 2 13 »¼ (' R 3 o (1 / 4)R 3 )

T
ª1 1 1 9 º
« 0 1 2 13 » (' R )
L E
L
= « » 32
¬« 0 3 5 34 ¼»

U
ª1 1 1 9 º
«0 1 2 13 » B
Y
« »
«¬0 0 1 5»¼ ('R3 o R3  3R 2 )

B
A
ª1 1 0 4 º (' R1 o R1  R 3 )

B
«0 1 0 3 » R o R  2R )
« » 2 2 3
¬«0 0 1 5¼»

ª1 0 0 1º (' R1 o R1  R 2
[AD] «« 0 1 0 3»»
¬« 0 0 1 5»¼ R 3 o (1)R 3

\ from the last augumented matrix, we get x = 1, y = 3, z = 5

« MATHS 1A
13
BABY BULLET-Q «
4. Solve the equations x + y + z = 1, 2x + 2y + 3z = 6, x + 4y + 9z = 3, by Gauss-Jordan
method

Sol: Augumented Matrix of the given system of equations is

ª1 1 1 1 º
[AD] «« 2 2 3 6 »»
«¬ 1 4 9 3»¼

ª1 1 1 1º
 «« 0 0 1 4 »»
«¬ 0 3 8 2 »¼

ª1
 «« 0
1 0  3 º
4 »» - Q
T
0 1
«¬ 0  3 0 »¼

E
3 0

ª1
 «« 0
1
0
0 3 º
1 4 »»
L L
«¬ 0 1 0  10 »¼
U
ª1 0 0 7 º
B
 «« 0 1 0  10 »»
Y
«¬ 0 0 1 4 »¼
B
A
Thus [AD] is reduced to Form I of Gauss Jordan Solution.

B
Hence there exists a Unique solution.
? From (I), the solution is x = 7, y = –10, z = 4.
« MATHS 1A
14
BABY BULLET-Q «

5. Solve the equations x – 3y – 8z = –10, 3x + y – 4z = 0, 2x + 5y + 6z = 13, by

Gauss-Jordan method
ª1 3  8  10 º
Sol: The augmented matrix is [AD] = « 3 1  4 0 »»
«
«¬ 2 5 6 13 »¼

ª1 3 8 10 º
 «« 0 10 20 30 »» R 2 o R 2  3R1
«¬ 0 11 22 33 »¼ R 3 o R 3  2R1

ª1 3 8 10 º
 «« 0 1 2 3 »» R 2 1 / 10
- Q
T
«¬ 0 1 2 3 »¼ R 3 1 / 11

ª1 3 8 10 º
L E
 ««0 1 2 3 »»
¬«0 0 0 0 »¼ R 3 o R 3  R 2 L
U
ª1 1 0 2 º R1 o R1  4R 2
 «« 0 1 2 3 »»
B
Y
............(I)

B
«¬ 0 0 0 0 »¼

A
Thus [AD] is reduced to Form II with all zeroes in the third row.

B
Thus Rank (A) = 2; Rank[AD] = 2 < 3 (No. of Unknowns)

\The System is Consistent with Infinite number of solutions.

From (I) we have x + y = 2 .....(i) , y + 2z = 3 ....(ii)

Let z = k, kÎR (ii) Þ y = 3 – 2z = 3 – 2k;

(i) Þ x = 2 – y = 2 – (3 – 2k) = 2 – 3 + 2k = 2k –1

?The solutions x = –1 + 2k, y = 3 – 2k, z = k , kÎR

« MATHS 1A
15
BABY BULLET-Q «

BULLET MASTER'S

MATH BEATS!
Matrices Þ Inter Students' Most Favourite Chapter
Matrices Þ Most Scoring Chapter in Maths-1A (2 + 2 + 4 + 7 + 7 = 22 Marks)
MATRIX FORM OF IPE - 2022 TOPPERS (STAR COLLEGE)
Name / Subject Eng Skt 1A 1B Phy Chem Total
Rahamathunnisa ª 96 99 75 75 60 60 465 º
« »
S.Srinija « 96 99 75 75 60 60 465 »
T.Theerdhasri « 96 99 75 73 60 60 465 »
« »
V.Durga Sushma « 95 99 75 75 60 60 464 »
T.Rajasri « 94
«
99 75 75 60
-
60
Q 463 »
»

T
M.S.Reshma Sai ¬ 96 99 75 75 60 58 463 ¼ 6 ´ 7

L E
L
BULLET MASTER'S

MATH BEATS!
U
PECULIAR PROPERTIES of Matrix Multiplication
In Real Numbers
B In Matrices

Y
1) ab = ba (2 ´ 3 = 3 ´ 2) 1) AB ¹ BA (Generally); Rarely AB = BA

B
2) ab = 0 Þ a = 0 (or) b = 0 2) AB = O need not imply A = O (or) B = O

A
Ex: 2x = 0 Þ x = 0 ª1 0 º ª0 0 º ª0 0 º
Ex: «2 0» «3 4» «¬0 0¼»
¬ ¼¬ ¼

Ex: 2 x
B
3) ab = ac, a ¹ 0 Þ b = c
2yŸ x y
3) AB = AC, A ¹ O Þ B need not = C
ª1 2º ª2 2º ª1 2º ª0 0º
Ex: «1 2» «1 1 » «¬1 2»¼ «¬2 2¼»
¬ ¼¬ ¼
4) ab = b then a = 1, b ¹ 0 4) AB = B then A need not be the unit matrix I.
Ex: 2x=2 Þ x=1 ª1 0 º ª 0 1 º ª0 1 º
Ex: «0 0 » « 0 0 » « 0 0 »
¬ ¼¬ ¼ ¬ ¼
"³ò`ŒëxH÷ Matrix Multiplication HùOK³O `Í_¨Qê<Í H›x„²‹¬°ëOk...... HùOK³O Hê^ΰ ƒìQê....