CHAPTER 3 : MATRICES

 1 2 6 
  2 3 100
1. Symmetric Matrices eg 2 Given that A =  3 2 9  . Find A and A . Hence, find A .
a b   2 0 3 

c
  
Aij = Aji for all i and j  b d e   1 2 6   1 2 6   1 6  12 6 6   5 6 6 
  2       
 c e f  A =  3 2 9   3 2 9 =   3  6  18 10 9  =  9 10 9
 2 0 3   2 0 3   2  0  6 4  3   4 4  3 
      
eg. Determine the values of a, b and c so that matrix
 5 6 6   1 2 6   1 2 6 
 2b  1 a 2 b2       
 3 2
A = A A =  9 10 9   3 2 9  =  3 2 9 ( A3 = A)
 2a  1 bc  is a symmetric matrix.  4 4  3   2 0  3   2 0  3 
a
    
 b b  c 2c  1
  A
100 3 33
= (A ) A = (A) A = (A
33 3 11
) A = (A)11 A = (A3)4 = (A)4 = (A3) A = (A) A = A2
2
A12 = A21 : a = 2a – 1 
2
(a – 1) = 0   5 6 6 
a=1 100  
2
A13 = A31 : b = b  b(b – 1) = 0  b = 0 or 1  A =  9 10 9
 4 4  3 
A23 = A32 : bc = b + c  b=0 : 0=0+c  c=0  
b=1 : c=1+c  0 = 1 (inconsistent)
 Solution : a = 1, b = 0, c = 0  1 2 3 
 
eg3 The matrix A is given by A =  3 1 1  .
 0 1 2 
 
2. Equality of Two Matrices : If A = B, then Aij = Bij for all i and j 2
(a) Find the matrix B such that B = A – 10I, where I is the 3 x 3 identity matrix.
21
(b) Find (A + I)B, and hence find (A + I) B.
 5 6 18   1 2 6 
     1 2 3   1 2 3   7 1 5
eg 1 Matrices P and Q are given by P =  12 1 9  and Q =  4 1 3  respectively.  2     
 0 6 1  0 2 1 (a) A =  3 1 1  3 1 1  = 6 8 10 
     0 1 2   0 1 2   3 1
     5 
Find integers m and n such that P = mQ + nI, where I is the 3 x 3 identity matrix.
7 1 5 1 0 0   3 1 5
     
 5 6 18   1 2 6  1 0 0 2
B = A – 10I =  6 8 10  – 10  0 1 0   6 2 10 
=
     
 12 1 9  = m  4 1 3  + n 0 1 0  3 1 5  0 0 1  3 1 5 
 
 0 6 1  0 2 1 0 0 1 
      2 2 3   3 1 5  3 1 5
(1, 2) or (3, 2) : 6 = 2m or (1, 3) : 18 = 6m       Let A + I = P
(b) (A + I)B =  3 2 1   6 2 10 =  6 2 10   PB = B
(2, 3) : 9 = 3m or  0 1 1   3 1 5   3 1 5 
(2, 2) or (3, 3) : 1 = m + n or (1, 1) : –5 = –m + n      
 3 1 5
 m = 3 & n = –2 21 21 20 19 2  
 (A + I) B = P B = P B = P B = . . . = P B = PB = B =  6 2 10 
 3 1 5 
 

3-1
  A11 A12 A13 
  a
3. Determinant of a Matrix for A =  A21 A22 A23  b c
 
A  For A =  d e f :
 31 A32 A33   
(a) Minors g h i 

A11 A12 A13
A22 A23
Minor (1, 1) of A = M11 = A21 A22 A23 = = A22 A33 – A23 A32 Row 1 : Det (A) = a(ei – fh) – b(di – fg) + c(dh – eg)
A32 A33
A31 A32 A33 = (aei + bfg + cdh) – (afh + bdi + ceg)
A11 A12 A13 Row 2 : Det (A) = –d(bi – ch) + e(ai – cg) – f(ah – bg)
A21 A23
Minor (1, 2) of A = M12 = A21 A22 A23 = = A21 A33 – A23 A31
A31 A33 = (aei + bfg + cdh) – (afh + bdi + ceg)
A31 A32 A33
Row 3 : Det (A) = g(bf – ce) – h(af – cd) + i(ae – bd)
A11 A12 A13
A21 A22 = (aei + bfg + cdh) – (afh + bdi + ceg)
Minor (1, 3) of A = M13 = A21 A22 A23 = = A21 A32 – A22 A31 etc.
A31 A32
A31 A32 A33
Col 1 : Det (A) = a(ei – fh) – d(bi – ch) + g(bf – ce)
(b) Cofactors = (aei + bfg + cdh) – (afh + bdi + ceg)
i+j 
 Mij , for ( i  j ) is even
Cofactor (i, j) of A = Cij = (–1) x Mij =  Col 2 : Det (A) = –b(di – fg) + e(ai – cg) – h(af – cd)
  Mij , for ( i  j ) is odd

= (aei + bfg + cdh) – (afh + bdi + ceg)
(c) Determinant
Row 1 : Det (A) = A11 C11 + A12 C12 + A13 C13 Col 3 : Det (A) = c(dh – eg) – f(ah – bg) + i(ae – bd)
= A11 M11 – A12 M12 + A13 M13 = (aei + bfg + cdh) – (afh + bdi + ceg)
Row 2 : Det (A) = A21 C21 + A22 C22 + A23 C23
= –A21 M21 + A22 M22 – A23 M23

Row 3 : Det (A) = A31 C31 + A32 C32 + A33 C33

a b c a b c
= A31 M31 – A32 M32 + A33 M33 Alternative : d e f d e f Det = (aei + bfg + cdh) – (afh + bdi + ceg)
g h i g h i
Column 1 : Det (A) = A11 C11 + A21 C21 + A31 C31
= A11 M11 – A21 M21 + A31 M31

Column 2 : Det (A) = A12 C12 + A22 C22 + A23 C23

= –A12 M12 + A22 M22 – A23 M23 Note : Det (AB) = Det (A) x Det (B)
Column 3 : Det (A) = A13 C13 + A23 C23 + A33 C33
= A13 M13 – A23 M23 + A33 M33

3-2
  1 2 6 
   1 a bc  1 b ca 
eg 1 Find the determinant of  4 1 3  .    
 0 2 1 eg 4 The matrices M and N are given by M =  1 b ca  , N =  1 a bc  .
     
 1 c ab   3 3c 3ab 
Det = (–1)(1 – 6) – 2(4 – 0) + 6(8 – 0) = 45 or Show that det M = (a – b)(b – c)(c – a).
1 2 6 1 2 6 Deduce det N.
4 1 3 4 1 3 Det = [(–1) + 0 + 48] – [(–6) + 8 + 0] = 45 2 2 2 2 2 2
Det M = (1)(ab – ac ) – (1)(a b – bc ) + (1)(a c – b c)
0 2 1 0 2 1 2 2 2 2 2 2 2
= (ab – ac ) – (a b – a c) – (b c – bc ) = (b – c)[a(b + c) – a – bc]
= (b – c)[a(c – a) – b(c – a)] = (a – b)(b – c)(c – a)

eg 2 Determine the values of k such that the determinant of the matrix

 k 1 3 1 b ca   1 0 0   1 b ca   1 0 0   0 1 0   1 a bc 
             
 2k  1 3 2  is 0. N =1 a bc  =  0 1 0   1 a bc  =  0 1 0   1 0 0   1 b ca 
            
 0 k k   3 3c 3ab   0 0 3   1 c ab   0 0 3   0 0 1   1 c ab 
 1 0 0  0 1 0
   
Det = 0 : 0 – k[2k – (6k + 3)] + k[–3k – (2k + 1)] = 0  k(4k + 3) – k(5k + 1) = 0 Det N = Det  0 1 0  .Det  1 0 0  .Det M = (3)(–1).Det M = –3(a – b)(b – c)(c – a)
 0 0 3  0 0 1
 k(2 – k) = 0  k = 0 or 2    

Alternative
 2 1 3 2 2 2 2
Det N = (1)(3a b – 3bc ) – (1)(3ab – 3ac ) + (3)(b c – ac )
2 2
 
eg 3 Given that A =   3 2 3  . Find the values of  such that | A – I | = 0. 2 2 2 2 2 2
= (–3)(bc + ab + ac – a b – ac – b c) = (–3).Det M
 1 1 2  = –3(a – b)(b – c)(c – a)
 

 2 1 3  1 0 0  2   1 3 
      4. Diagonal Matrices (D)
A – I =   3 2 3  –   0 1 0  =   3 2 3 
 1 1 2   0 0 1  1 2     a 0 0 an 0 
     1
   0
D = 0 0 .
n
D =  0 b 0  Det (D) = a x b x c and

bn 
| A – I | = 0 : (–2 – )[(2 – )2 – 3] – (1)[(–6 + 3) – (–3)] + 3[(–3) – (–2 + )] = 0  
0 cn 
 0 0 c 
0

2 3 2
 (–2 – )( – 4 + 1) – (3 – 3) + 3(–1 – ) = 0   – 2 –  + 2 = 0
2 2 5. Identity Matrix (I)
  ( – 2) – ( – 2) = 0  ( – 2)( – 1) = 0
  = –1, 1 or 2  1 0 0
  n
I =  0 1 0  Det (I) = 1 , I = I , IA = A and BI = B
 0 0 1
 

3-3
 –1
6. Inverse of a Matrices A (A )  1 x 1
  2 –1
–1 1 –1 –1
eg 1 Matrix A is given by A =  1 1 0  and A = A . Determine the value of x.
Det (A )= and AA =I=A A  
Det( A )  1 0 0
 1 x 1  1 x 1  2  x 0 1 
Note : 1. Matrices with inverse are called invertible martices. 2      
A =  1 1 0   1 1 0  =  0 1  x 1 
    
1 
2. Matrices with (Det = 0) has no inverse, are called not invertible
matrices, also known as singular matrices.  1 0 0  1 0 0  1 x
 1 x 1  2  x 0 1   1 0 0
2 –1 2 –1      
Theorem 1 : If A and B are invertible matrices and AB = I,
A =A : AA = AA =I   1 1 0   0 1  x 1  =  0 1 0 
  
–1
then A = B and B = A.
–1
 1 0 0  1 x 1   0 0 1 
(1, 1) : (2 – x) – 0 + 1 = 1  x=2
Proof : AB = I and AB = I
–1 –1 –1 –1
A (AB) = A (I) (AB)B = (I)B
 1 1 2
IB = A–1 AI = B
–1
 
–1 –1 eg 2 A matrix P is given by P =  0 2 2  .
B =A A =B
 1 1 3 
 
2
Theorem 2 : If P and R are invertible matrices and PR = kI, (a) Find P – 6P + 11I.
–1 1 –1 1 2
then P = R and R = P. (b) Show that P(P – 6P + 11I) = 6I, where I is the 3 x 3 identity matrix,
k k –1
and deduce P .

PR = kI PR = kI
 1 1 2   1 1 2   1 5 10 
Proof : and 2     
–1 –1 –1 –1 (a) P =  0 2 2   0 2 2  =  2 6 10 
P (PR) = P (kI) (PR)R = (kI)R  1 1 3   1 1 3   4 4 9 
IR = kP–1 PI = kR
–1     
2
1 –1 1 –1  Q = P – 6P + 11I
R=P P=R
k k  1 5 10   1 1 2  1 0 0   4 1 2 
       
=  2 6 10  – 6  0 2 2  + 11  0 1 0  =  2 5 2 
7. Forming Matrix Equation  4 4 9   1 1 3   0 0 1   2 2 2 
       
a1x + b1y + c1z = d1  a1 b1 c1   x   d1   1 1 2   4 1 2   6 0 0
     2     
a2x + b2y + c2z = d2  a2 b2 c2   y  =  d 2  (b) P(P – 6P + 11I) =  0 2 2   2 5 2  =  0 6 0  = 6I
a3x + b3y + c3z = d3 a
 3 b3 c3   z   d 3   1 1 3   2 2 2   0 0
    6 

 4 1 2   3  61  31 
2
–1 1 2 1  
 P = (P – 6P + 11I) =  2 5 2  =   3  31 
8. Solving Matrix Equation (Using Inverse) 1 5
6 6    6 
 2 2 2   3
1 
1
 1
3 
AX = P → –1
A (AX) = A (P)
–1
→ IX = A–1P → X=A P
–1 3

3-4
  10 4 9  2 3 4
   
eg 3 Matrices M and N are given as M =  15 4 14  , N =  4 3 1  .  1 2 1   35 19 18 
   
 5 1 6   1 2 4 eg 5 The matrices A and B are given by A =  3 1 4  , B =  27 13 45  .
    0 1 2  3 12 5 
Find MN and deduce N .
–1    
2
Find the matrix A B and deduce the inverse of A.
 10 4 9  2 3 4   20  16  9 0 1   5 0 0 
        Hence, solve the system of linear equations,
MN =  15 4 14   4 3 1  =  30  16  14 5 1  =  0 5 0 
 5 1 6   1 2 4   10  4  6 0 5   0 0 5  x – 2y – z = –8, 3x – y – 4z = –15, y + 2z = 4.
      
MN = 5I : (MN)N–1 = (5I)N–1  MI = 5N–1  1 2 1   35 19 18   22
    
33 77 

 10 4 9  2 0.8 1.8  (a) AB =  3 1 4   27 13 45  =  66 22 11 
1     0 1 2   3 12 5   33 11 55 
–1 1
 N = M =  15 4 14  =  3 0.8 2.8      
5
6   1 0.2 1.2 
5
 5 1    1 2 1   22 33 77   121 0 0 
2      
 A B = A(AB) =  3 1 4   66 22 11  =  0 121 0 
1 0 0   0 1 2   33 11 55   0 0 121
      
eg 4 Matrix A is given by A =  1 1 0  .
 22 33 77    11  11
2 3 7 
 1 2 1    11 
  2
 A B = 121I 
–1
A =
1
AB =
1
 66 22 11  =  11  11
6 2 1 
2 –1
(a) Show that A = I, where I is the 3 x 3 identity matrix, and deduce A . 121 121    11 
 33 11 55    11
3 1 5 
11 11 
 1 4 3
 
(b) Find matrix B which satisfies BA =  0 2 1  .
(b) x – 2y – z = –8 –x + 2 y + z = 8  1 2 1  x   8 
 1 0 2     
  3x – y – 4z = –15 –3x + y + 4z = 15  3 1 4  y  =  15 
 0 1 2    4 
y + 2z = 4 0x + y + 2z = 4   z   
1 0 0 1 0 0  1  0  0 0 0   1 0 0 
2  
     
(a) A =  1 1 0  1 1 0  =  1  1  0 1 0  =  0 1 0  = I  x   8  x  22 33 77   8   x  3 
 1 2        
 1 
 1 2 1   1  2  1 0 1   0 0 1 
        –1
  1    
 
 
 y =  2
A y =  15  : A . A y =  66 22 11  .  15 
      121        1
1 0 0  z   4 z  33 11 55   4  z  
–1        
 A = A = 1 1 0 
1 2 1   x = –3 , y = 2 , z = 1

 1 4 3  1 4 3  1 0 0   8 10 3 
      
(b) BA =  0 2 1  : (BA)A =  0 2 1   1 1 0   BI =  3 4 1 
 1 0 2   1 0 2   1 2 1   1 4 2 
      
 8 10 3 
 
 B =  3 4 1 
 1 4 2 
 

3-5
9. Row Echelon Form (REF) & Reduced REF (RREF) 10. Elementary Row Operations (EROs)

A matrix is in row echelon form (REF) when it satisfies conditions below, (a) Interchange of Rows
– The first non-zero element in each row, is called the leading entry. a b c d e f
  R R  
– Elements below the leading entries need to be zero. A = d e f  1 2 a b c = B
   
– Each leading entry is in a column to the right of the leading entry in the g h i  g h i 
previous row.  

– Rows with all zero elements, if any, are below rows having a non-zero element.  0 1 0   a b c
 
d e f

 
– A matrix can have many REF, one of which is its reduced row echelon form.  1 0 0  d e f = a
 b c  Det (B) = (–1) . Det (A)
 0 0 1     
  g h i   g h i 
a b c a b c a b c a b c 0 b c 0 0 c a b c g h i
              R R  
eg.  0 d e , 0 d e, 0 0 e,  0 0 0, 0 0 0, 0 0 0 A = d e f  1 
3  d e f =C

0 0 f     
 0 0 0  0 0 0
 
 0 0 0
 
0 0 0
 
0 0 0

g
  
 h i  a
 b c 

 0 0 1   a b c
 
g h i

A matrix is in reduced row echelon form (RREF) when it satisfies conditions below,  
 0 1 0  d e f = d
 e f  Det (C) = (–1) . Det (A)
– The first non-zero element in each row, is called the leading entry needs to be 1.  1 0 0     
  g h i   a b c 
– Elements below and above the leading entries (1) need to be zero.
– Each leading entry (1) is in a column to the right of the leading entry in the Combined EROs
previous row.
a b c g h i
  R  R2  
– Rows with all zero elements, if any, are below rows having a leading entry (1). 1  
A = d e f  R2  R3 a b c = D (is equivalent to)
–    
A matrix has only one RREF because it is uniquely determined by the g h i  R3  R1 d e f 
dependence relations between its columns  

a b c d e f g h i
  R R   R R  
 1 0 0   1 0 0   1 0 0   1 0 0   0 1 0   0 0 1 A = d e f  1 2 a b c  1 
3 a b c = D
                 
eg.  0 1 0  ,  0 1 0  ,  0 0 1  ,  0 0 0  ,  0 0 0  ,  0 0 0  g h i  g h i  d e f 
 0 0 1  0 0 0   0 0 0   0 0 0   0 0 0   0 0 0    
           
 0 0 1   0 1 0   a b c
 
g h i

   
 0 1 0  1 0 0  d e f  = a b c   Det (D) = (–1) (–1) . Det (A)
 1 0 0   0 0 1     
    g h i   d e f 

3-6
 (b) Scaling of any Row/s

a b c  ka kb kc  a b c
  kR  R    
A = d e f   1 
1  d e f=E A = d e f
     
g h i   g h i  g h i 
  
 a b c 
 k 0 0   a b c
 
 ka kb kc 


kR1  nR2  xR3  R2 
    ka  nd  xg
         kb  ne  xh kc  nf  xi  = H
 0 1 0  d e f = d e f  Det (E) = (k) . Det (A)  
       g h i 
 0 0 1   g h i   g h i   

Combined EROs  1 0 0   a b c
 
 a b c 

 
k n x  d e f  =  ka  nd  xg kb  ne  xh kc  nf  xi 
a b c  ka kb kc   0 0 1     
  kR1  R1     g h i   g h i 

A = d e f    
 nd ne nf  = F
  nR2  R2  
g h i  i   Det (H) = (n) . Det (A)
  g h
a b c
 
 1 0 0   k 0 0   a b c
 
 ka kb kc 
 A = d e f
     
 0 n 0  0 1 0  d e f  =  nd ne nf   Det (F) = (n) (k) . Det (A) g h i 
 0 0 1   0 0 1      
    g h i   g h i 
 a b c 

kR1  nR2  xR3  R3 
 
         d e f =J
 
 ka  nd  xg kb  ne  xh kc  nf  xi 
(c) Simultaneous Operations of Rows 
a b c  1 0 0   a b c  a b c 
      
A = d e f 0 1 0 d e f = d e f 
 
g i   k n x    
 

 h   g h i   ka  nd  xg kb  ne  xh kc  nf  xi 
 ka  nd  xg kb  ne  xh kc  nf  xi 
kR1  nR2  xR3  R1  
= G
 Det (J) = (x) . Det (A)
          d e f
 
 g h i 
 

k n x   a b c
 
 ka  nd  xg kb  ne  xh kc  nf  xi 

 
0 1 0 d e f = d e f 
     
0 0 1  g h 
i  g h i 
 
 Det (G) = (k) . Det (A)

3-7
(d) Combined EROs
eg 1 A system of linear equations is given by,
a b c  ka  nd kb  ne kc  nf  7x + 16y – 10z = 9 , 5x + 11y – 8z = –6 , x + y = z.
  kR1  nR2  R1  
A = d e f       d e f 
Reduce the augmented matrix of the system of linear equations to
   
g h i   g h i  row-echelon form, and then solve it.
  

 g h i  7x + 16y – 10z = 9 x+y–z =0  1 1 1 0 

   
R1  R3 5x + 11y – 8z = –6 7x + 16y – 10z = 9  7 16 10 9
    d e f =K
  x+y =z 5x + 11y – 8z = –6  5 11 8 6 
 ka  nd kb  ne kc  nf   

 1 1 1 0   1 1 1 0
Combined EROs 7R1  R2  R2   2R2  3R3  R3  
  0 9 3 9          0 9 3 9 
5R1 – R3  R3  0 6 3  0 0 3 36 
a

b c
 kR  nR  R


g h i 
  6   REF
A = d e f    3 
1  2  d e f =K
Row 3 : 0x + 0y – 3z = –36  z = 12
  R3  R1  
g h i   ka  nd kb  ne kc  nf 
  Row 2 : 0x – 9y + 3z = –9  y= 5
 0 0 1   k n 0   a b c
 
 g h i 
 Row 1 : x+y–z=0  x= 7
   
 0 1 0  0 1 0  d e f = d
 e f 
 1 0 0   0 0 1     
    g h i   ka  nd kb  ne kc  nf 
eg 2 A system of linear equations is given by,
 Det (K) = (–1) (k) . Det (A)
2x + 3y + 4z = 1 , 3x – 2y – 2z = 3 , 4x + 4y + 3z = 5.
11. Forming Augmented Matrix (AM) Reduce the augmented matrix of the system of linear equations to
row-echelon form, and then solve it.
a1x + b1y + c1z = d1  a1 b1 c1 d1 
 
a2x + b2y + c2z = d2  a2 b2 c2 d 2  2x + 3y + 4z = 1 2 3 4 1
 
a3x + b3y + c3z = d3 a b c d  3x – 2y – 2z = 3  3 2 2 3
 3 3 3 3
4x + 4y + 3z = 5 4 4 3 5 

12. Solving System of Linear Equations (by Gaussian Elimination Method)
2 3 4 1 2 3 4 1
(i) Express system of linear equations into augmented matrix (AM) form. 3R1  2R2  R2   2R2  13R3  R3  
    0 13 16 3           0 13 16 3 
2R1 – R3  R3  0 0 33
0 2 5 3  33 REF
(ii) Using EROs, reduced the left AM into REF,
 
(a) entries (2, 1) and (3, 1) are zeroes, then
Row 3 : 0x + 0y – 33z = 33  z = –1
(b) entry (3, 2) is zero.
Row 2 : 0x + 13y + 16z = –3  y= 1
(iii) Rewrite the reduced AM into system of linear equations and solve them
in reverse order (Solve Row 3  Solve Row 2  Solve Row 1). Row 1 : 2x + 3y + 4z = 0  x= 1
Note : Gaussian–Jordan Elimination Method is to reduced the left AM into RREF.

3-8
13. Types of Solutions for System of Linear Equations
eg 2 A system of linear equations is given by
(i) Express system of linear equations into augmented matrix (AM) form.
2x + 3y = –6,
a b c p
  4x – y + 3z = 1,
(ii) Using EROs, reduced the left AM into REF,  0 d e q 2x – 4y + kz = 7, where k is a real constant.

0 0 k r  (a) Reduce the augmented matrix of the system of linear equations to
REF
row-echelon form.
Type 1 : (Unique Solution)  k ≠ 0 and r  . (b) State the value of k such that the system has infinitely many solutions,
and find the general form of the solutions.
Type 2 : (No Solution)  k = 0 and r ≠ 0.
 2 3 0 6  2 3 0 6 
  2R1  R2  R2  
Type 3 : (Infinite Many Solution)  k = 0 and r = 0. (a)  4 1 3 1     0 7 3 13 
 2 4 k  R1 – R3  R3  0 7 k 13 
To find its general solutions, let z = t, then solve for y and x in terms of t.  7   
2 3 0 6 
eg 1 A system of linear equations is given by R  R  R3  
2 3 
  0 7 3 13 
x + y + z = k, x – y + z = 0, 4x + 2y + z = 3, where  and k are real numbers. 0 0 k  3 0 

Show that the augmented matrix 1 1 1 k 
 
for the system may be reduced to  0 2 0 k 
 
 0 0   4 3  3k  (b) k = 3
Let y = t : (for all values of t)
Hence, determine the values of  and k so that the system of linear
7t  13
equations has R2 : 7y – 3z = –13  7(t) – 3z = –13  z=
3
(a) a unique solution, (b) no solution, 3t  6
R1 : 2x + 3y = –6  2x + 3(t) = –6  x=
(c) infinitely many solutions. and find its general solutions. 2

1 1 1 k 1 1 1 k 
  R2 – R1  R2   2t  6 14 t  3 9t  3 3t  13
 1 1 1 0            0 2 0 k  Note : Other forms, ( t , , ) ,( , ,t)
R3  4R1  R2  R3 3 9  14 7
   
 4 2  3  0 0  4 3  3k 

(a)  ≠ 4 and k  (b)  = 4 and k ≠ 1

(c)  = 4 and k = 1
1 1
x + y + z = 1 and 0x – 2y + 0z = –1  y= and x + z =
2 2
1
 General solutions : x = 1 – t , y = , z = t , for all values of t
2

3-9
eg 3 A system of linear equations is given by
eg 4 The variables x, y and z satisfy the system of linear equations
x + 2y + z = q , 2x + py + 4z = 3q , x + y + pz = q, where p and q are constants.
2
(a) Write the augmented matrix for the system above and reduce it to 2x + y + 2z = 1 , 4x + 2y + z = k , 8x + 4y + 7z = k , where k is a real constant.
row-echelon form. (a) Write a matrix equation for the system of linear equations.
(b) Determine the values of p and q such that the system has (b) Reduce the augmented matrix to row-echelon form, and show that the system
(i) a unique solution, (ii) no solution. of linear equations does not have a unique solution.

(c) Determine the values of p and q such that the system has infinitely many (c) Determine all the values of k for which the system of linear equations has
solutions. Using the value of q and the smaller value of p obtained, find infinitely many solutions, and find the solutions in the case when k is positive.
the solutions of the system. (d) Find the set of values of k for which the system of linear equations is inconsistent.
 1 2 1 q 1 2 1 q
  2R1  R2  R3    2 1 2  x   1 
(a)  2 p 4 3q        0 1 1 p 0      
    (a)  4 2 1   y  =  k 
R1 – R3  R2
 1 1 p q   0 4  p 2 q   8 4 7  z   k 2 
     
1 2 1 q
( 4  p )R  R  R3  
   2 3     0 1 1 p 0 2 1 2 1  2 1 2 1 

0 0 p 2  5 p  6 q   
(b)  4 2 1 k 
R2  2R1  R2 
  0 0 3 k  2 

8 4 7 k2  R3 – 4R1  R3  
 0 0 1 k  4 
2
Alternative  
 1 2 1 q 1 q 2 1 2 1 
  2R1  R2  R2 
2 1
 3R3  R2  R3  
(a)  2 p 4 3q        0 4  p 2 q      0 0 3 k 2 
  R1 – R3  R3    0 0 0 3k 2  k  10 
1 p 0  
 1 1 p q 0 1
Since row 3 has all zero entries, the system of linear equations does not have
1 2 1 q
( 4  p )R3  R2  R3  2
 a unique solution
           0 4 p  p  2 q 
R2 + pR3  R2 
0 0 p 2  5 p  6 q  2
(c) For system of linear equations has infinitely many solutions : 3k – k – 10 = 0
5
 (3k + 5)(k – 2) = 0  k = – or 2
3
(b) (i)
2
For unique solution : p – 5p + 6 ≠ 0  p ≠ 2, 3 and q   2 1 2 1
 
2 For k > 0 : k = 2   0 0 3 0   2x + y + 2z = 1 and –3z = 0
(ii) For no solution : p – 5p + 6 = 0 and q ≠ 0  p = 2, 3 and q ≠ 0  0 0 0 0
 
 x = t , y = 1 – 2t , z = 0 , for all values of t
2
(c) For infinitely many solutions : p – 5p + 6 = 0 and q = 0
2
p = 2, 3 and q = 0 (d) The system is inconsistent when 3k – k – 10 ≠ 0
p = 2, q = 0 : y – z = 0 and x + 2y + z = 0 5
Solution set : {k | k ≠ – , 2}
 z = t , y = t , x = –3t , for all values of t 3

3-10
14. Finding Inverse By EROs  3 2 1 
 
eg 2 The matrix A is given A =  1 1 1 .
(i) Experss in the form (A │I ).  2 0 1 

(ii) Using EROs, reduced the A into D, [i.e. (A │I )  (D │P )] By performing elementary row operations on the augmented matrix (A │I ),
–1
where I is the 3 x 3 identity matrix, find A .
- reduced all pairs [(2, 1) and (3, 1)] , [(1, 2) and (3, 2)] , [(1, 3) and (2, 3)]
Hence, solve the system of linear equations
into zeroes. May begin with any pair.
3x – 2y + z = 7 , 2x + z = 4 and x + y + z = 2
(iii) Using EROs, reduced the D into I. [i.e. (D │P)  (I│Q )]
–1  3 2 1 1 0 0 
(iv) The resulting matrix on the right is the inverse, A = Q.  
 1 1 1 0 1 0
 2 0 1 0 0 1
 
 5 0 2   1 2 0 1 0 1
 
eg 1 A matrix P is given by P =  0 2 1  . R  R  R1  
13   1 1 0 0 1 1
 1 4 2  R2 – R3  R2  
   2 0 1 0 0 1
By using elementary row operations, find the inverse of P.  1 0 0 1 2 3 
R  2R2  R1  
1    1 1 0 0 1 1
 5 0 2 1 0 0   5 0 2 1 0 0
 2 0 1 0 0 1
  R1  5R3  R3  
 0 2 1 0 1 0     0 2 1 0 1 0   
 1 4 2 0 0 1   0 20 12 1 0 5   1 0 0 1 2 3   1 2 3 
    R  R  R2   –1  
21   0 1 0 1 1 2   A =  1 1 2 
 5 0 2 1 0 0  R3 –2R1  R3    2 4 5 
10R2  R3  R3  
 0 0 1 2 4 5   
  0 2 1 0 1 0 
 0 0 2 1 10 5 
   3 2 1   x   7 
3x – 2y + z = 7 –3x + 2y – z = –7     
 5 0 0 0 10 5  2x + z = 4 x+ y+z= 2  1 1 1  y  =  2 
2R2  R3  R2  
 2  
   0 4 0 1 12 5  x+y+z=2 2x + 0y + z = 4  0 1   z   4 
R1 – R3  R1  
 0 0 2 1 10 5 
1  1   x  7   x  7   1 2 3   7   1
R  ( 5)  R1  1 0 0 0 2  0 2      
1      1      
R2  4  R2  0 1 0 1 3 1.25   P
–1
=  1 3 1.25   A y =  2    y = A  2 =  1 1 2   2  =  1 
R3  2  R3  0 0 1 0.5 5 2.5   0.5 5 2.5  z  4    4  2 4 5   4   2
        z       
 x = 1 , y = –1 , z = 2

3-11