M1103

SOLVED PROBLEMS

SERIES I

1- Given the real matrices

1 3  2 0  4  1 2
A = , B =   and C=  0 1  .
 2 1  3  2 0  1 0
  
Calculate, if possible, AB, BA, A+B, BC, CB, AC, CA, t B , t C and t ( BC) .
---------------------------------------
2- Find the real numbers x, y, z and t in the following cases:
3x  y x  3y  1  2   1 4 
(a)   = .
 z  2t z  t  3  5   2 8 
4
x y   x  2 y 3  2 1 
(b) 2   -5  = .
 z t   z  2 t 1   0 5 
---------------------------------------
3- Calculate
 0  2 3 
  1 2 3 
(1+i 2-i 3)  2 1 i   i 1 0  .
 1 2 4  i 0 2 
  
---------------------------------------
4- Compute the nth power of the following matrices
1 0 1 0 1 1 0
A=  0 0 0  , B=  1 2  , C=  0 2 0 0  , D=diag a  a  and
 0 0 0 1
1 0 1  0 1  0 0 0 0
1 s
   
 
E=  cos  sin   .
  sin  cos  
---------------------------------------
5- Show that if A and B are two matrices, such that A is (np) and B is (pn) and if
AB=I n , then (BA) 2 B=B.
---------------------------------------
6- (a) Find two non-zero real matrices A and B, such that AB=0.
(b) Find three real matrices A, B and C, such that AB, C0 and AC=BC.
---------------------------------------
7- Show that if AM n (K), then A+t A is symmetric and A-t A is anti-symmetric.
Deduce that every real (resp. complex) matrix is the sum of two real (resp. complex)
matrices with one of them is symmetric and the other is anti-symmetric.
---------------------------------------
8- Let AM m, n ( ).
(a) Show that At A = 0  A= 0.
(b) Show that if BM p, m ( ), then
BAt A = 0  BA= 0.
---------------------------------------

Nasri Cheaito and Fida El Chami

1
9- Given the real matrices
A =  1 1  and B = 0 0 .
0 0  1
 1 
Compare (A+B) 2 and A 2 +2AB+B 2 .
---------------------------------------
10- Let A=  2 5  and let B=A-2I 2 . Calculate B n and deduce A n , where n .
 0 2
(Hint: Use the binomial formula).
---------------------------------------
 1 1 1
11- Let A=  0 1 1 and let B= A-I 3 . Calculate B n and deduce A n , where n .
 0 0 1
 
---------------------------------------
12- Let A =  a b  M (K).
 2
c d
1- Show that A 2 -(a+d)A+(ad-bc)I 2 = 0.
1  d b
2- Show that if ad-bc0, then A is invertible and A 1 =  .
ad  bc   c a 
---------------------------------------

13- Let
0 1 1 
 
A=  4  3 4 .
3  3 4 

1- Show that A 2 = I 3 ,
2- Deduce that A is invertible and compute A 1 .
3- Determiner (t A ) 1 .
---------------------------------------
14- Given the matrix
a  b c d 
 
c
A=  .
b a d
c d a b 
 
d c b a 
1- Calculate (t A )A.
2- Find the conditions under which A is invertible and calculate A 1 .
---------------------------------------
15- Find the conditions satisfied by a 1 , …, a n under which diag a1  a n  is invertible
and find its inverse.
---------------------------------------
16- Let AM m (K), BM n (K) and C be (mn) matrix over K. Show that if A and B are
invertible, then so is M=  A C  . Find M 1 .
 0 B
Application: Show that the matrix

Nasri Cheaito and Fida El Chami

2
 2 0 1 1 
 
0 3
M= 
2 4 
0 0 1 0 
0 0 0  2 

is invertible and find its inverse.
---------------------------------------
17- Let AM n (K). We say that A is nilpotent if there exists a natural number p, such that
A p =0. Show that if A is nilpotent, then I n -A is invertible and give its inverse.
---------------------------------------
18- Check if each of the following complex matrices is invertible or not and if yes, find its
inverse :
 1 i 0  1 0 0
 
A = 1 i 0 0  and B =  0 3 1  .
 2 0 0  4 2 1
   
---------------------------------------
19- Show that if A, BM n (K) and AB is invertible, then A and B are invertible.
---------------------------------------

Nasri Cheaito and Fida El Chami

3
 SOLUTION

 1 3   2 0  4  11  6  4 
1- AB=   = ,
 2 1   3  2 0   1 2  8 
BA is not defined, because the number of columns of B is not equal to the number of
rows of A,
A+B is not defined , because the number of rows of A is not equal to that of B,
 2 0  4   1 2    2 4 
BC=   0 1 =


 3 4 ,
 3  2 0 
 1 0  
8  4  4 
1 2  2 0  4   
     0 ,
CB= 0 1 
1 0 3  2 =3  2 
  0  
2 0 4 
 
AC is not defined, because the number of columns of A is not equal to the number of
rows of C,
 1 2   1 3   5 1 
CA=  0 1    = 2 1 ,
 1 0   2 1   1 3 
   
 2 3 
 
tB=  0  2 ,
 4 0 

t C =  1 0 1 
 2 1 0
 2 3
t ( BC) =   .
 4 4 
---------------------------------------
2- (a) We have
 3x  y x 3y  1  2  =  1 4    3x  y  3( x 3y)  2(3x  y) 5( x 3y)  =  1 4 
 4z  2t z  t  3 5   2 8   4z  2t  3(z  t )  2(4z  2t ) 5(z  t )   2 8 
        
6x 8y 11x 13y   1 4 
  = 
 7z  t 13z  t   2 8 
 6x-8y=1 , -11x+13y=4 , 7z+t=2 and –13z-t=8
 66x-88y=11 , -66x+78y=24 , 7z+t=2 and –13z-t+7z+t =8+2
 66x-88y=11 , -66x+78y+66x-88y =24+11 , 7z+t=2 and –6z =10
10 5  35 6 35 41
 6x-8y=1 , -10y =35 , z = = and t=2-7z=2- = =
6 3 3 3 3
 35 7 1 8y 1 28  27 9 5 41
 y= = and x= = = = and z= and t=
10 2 6 6 6 2 3 3
9 7 5 41
 x= , y= , z= and t= .
2 2 3 3
(b) We have
x y   x  2 y 3  2 1   2x 5( x  2) 2 y 5( y  3)  =  2 1 
2   -5  =   2z 5(z  2) 2t 5( t 1)   0 5 
 z t   z  2 t 1   0 5     

Nasri Cheaito and Fida El Chami

4
 3x 10 3y 15   2 1 
   = 
 3z 10) 3t 5)   0 5 

 -3x+10=2 , -3y-15=1 , -3z+10=0 and -3t-5=5
 -3x=-8 , -3y=16 , -3z=-10 and -3t=10
8 16 10 10
 x= , y= , z= and t= .
3 3 3 3
---------------------------------------
 0 2 3   1 2 3  1 2 3
     
3- (1+i 2-i 3)  2 1 i   i 1 0  = (1-2i 6-3i 16+5i)  i 1 0 
 1 2 4  i 0 2 i 0 2
     
= (-7+8i 8-7i 35+4i).
---------------------------------------
4- A n : We have
1 0 1 1 0 1  2 0 2
A 2 =  0 0 0   0 0 0  =  0 0 0  =2A
1 0 1 1 0 1  2 0 2
    
hence A 3 = 2A 2 = 4A, and so let’s show that
 2 n 1 0 2 n 1 
n n 1  
A =2 A =  0 0 0 .
 2 n 1 0 2 n 1 
 
We argue by induction on n. It is true for n=1, because
A 1 = A = 2 11 A .
Suppose that the property holds up to n-1 and let’s show it for n. We have
A n1 = 2 n  2 A2 n  2 A
by induction hypothesis, hence
 2 n 1 0 2 n 1 
n n1 n 2  n 1 
A =A A=2 (2A) = 2 A=  0 0 0 
 2 n 1 0 2 n 1 
 
and so the property is true for n, whence it is true, n * .
B n : We have
B 2 =  1 2   1 2  =  1 4  .
0 1 0 1 0 1
As 4=22 and 4=2 2 , then we calculate B 3 . We have
B 3 = BB 2 =  1 2   1 4  =  1 6 
0 1 0 1 0 1
hence let’s show that
B n =  1 2n  .
0 1 
We argue by induction on n. It is true for n=1, because
B 1 = B =  1 2  =  1 21 .
0 1 0 1 
Suppose that the property holds up to n-1 and let’s show it for n. We have
1 2(n 1) 
B n1 = 
0 1 
by induction hypothesis, hence
Nasri Cheaito and Fida El Chami
5
 1 2(n 1)   1 2(n 1)  2   1 2n 
B n = BB n1 =  1 2    =0 1 
1   0
=
 0 1  0 1   
and so the property is true for n, whence it is true, n * .
C n : We have
0 1 1 0 0 1 1 0  0 2 0 1
 0 0 2 0 0 =  0 4 0 0
C =0
2 2 0
0 0 0 1 0 0 0 1 0 0 0 0
0 0   0 0 0 0   0 0 0 0 
 0 0
0 1 1 0  0 2 0 1  0 4 0 0
 0 0  0 4 0 0 =  0 8 0 0
C = CC =  0
3 2 2
0 0 0 1 0 0 0 0 0 0 0 0
0 0 0   0 0 0 0   0 0 0 0 
 0
and
0 1 1 0  0 4 0 0  0 8 0 0
 0 0   0 8 0 0  =  0 16 0 0 
C = CC =  0 2
4 3
0 0 0 1  0 0 0 0 0 0 0 0
0 0 0 0   0 0 0 0   0 0 0 0 

hence let’s show that
 0 2 n 1 0 0 
 
n  n 
C = 0 2 0 0  , for all n3.

0 0 0 0
 0 0 0 0
We argue by induction on n. It is true for n=3, because
 3 1
0 4 0 0 0 2 0 0 
 
C 3 =  0 8 0 0  =  0 23 0 0  .
0 0 0 0  
 0 0 0 0 0 0 0 0
 
0 0 0 0
Suppose that the property holds up to n-1 and let’s show it for n. We have
 0 2n  2 0 0
 
n1  0 2 n 1 0 0 
C = 
0 0 0 0
0 0 0 
 0
by induction hypothesis, hence
 0 2n  2 0 0  n 1
 0 1 1 0   0 2 0 0 
  n 1 
C n = CC n1 =  0 2 0 0   0 2 0 0 =  0 2n 0 0
0 0 0 1  
0 0 0 0  0  0 0 0 0
  0 0 0
0 0 0 0   0 0 0 0
and so the property is true for n, whence it is true, n3.
D n : We shall show by induction on n that

D n =diag a1n  a sn . 
It is true for n=1, because
D 1 = D = diag a11  a1s . 
Suppose that the property holds up to n-1 and let’s show it for n. We have

Nasri Cheaito and Fida El Chami

6
  a n 1 0   0 
 1 
 0 a n2 1 0  0 
 
D n1 = diag a1n 1  a sn 1 =  

0  

   0 
 0 0  0 a sn 1

by induction hypothesis, hence
n 1 0   0   n 0  
 a1 0   0   a1   a1
0

0 a 0  0 
  0 a2 0  0   0 a n2 0  0
n 1
n1 
2
n
D = DD =  0    0  =  0  
   0    
  0     0
 0 0  0 a  
 s
 0 0  0 a sn 1  0 0  0 a sn 

= diag a1n  a sn 
and so the property is true for n, whence it is true, n1.
E n : We have
 cos  sin    cos  sin    cos 2  sin 2  2sin  cos  
E 2 =  =
 sin  cos    sin  cos     2sin  cos  cos  sin  
2 2

 cos 2 sin 2 
= 
 sin 2 cos 2 
hence let’s show that
 cos n sin n 
E n = .
 sin n cos n 
We argue by induction on n. It is true for n=1, because
 cos  sin    cos(1) sin(1) 
E1 = E =   =   .
 sin  cos    sin(1) cos(1) 
Suppose that the property holds up to n-1 and let’s show it for n. We have
 cos(n 1) sin(n 1) 
E n1 =  
 sin(n 1) cos(n 1) 
by induction hypothesis, hence
 cos  sin    cos(n 1) sin(n 1) 
E n = EE n1 =    
 sin  cos    sin(n 1) cos(n 1) 
cos  cos(n 1) sin sin(n 1) cos sin(n 1)  sin  cos(n 1) 
=  
 sin  cos(n 1)  cos sin(n 1) sin sin(n 1)  cos  cos(n 1) 
 cos[(n 1)  ] sin[( n 1)  ]   cos n sin n 
=   =  
 sin[( n 1)  ] cos[(n 1)  ]   sin n cos n 
and so the property is true for n, whence it is true, n * .
---------------------------------------
5- We have AB = I n , hence
(BA) 2 B = (BABA)B = B(AB)(AB) = BI n I n = B.
---------------------------------------
6- (a) Take A=  1 0  and B=  0 0  , then A0, B0 and AB=  1 0   0 0  =  0
 1 0 0 0 1 0 0
0  =0.
 0 0        0 
(b) Take A=  1 1  , B=  0 1  and C=  0 0  , then
0 0 0 0 1 0
Nasri Cheaito and Fida El Chami
7
 AC =  1 1   0 0  =  1 0  and BC=  0 1   0 0  =  1 0 
0 0 1 0 0 0 0 0 1 0 0 0
hence we have AB, C0 and AC = BC.
---------------------------------------
7- We have
 
t A  t = t A  t t = t A  A =A+ t A
A A
and

t At
A
 = t A  t t = t A  A =-(A- t A )
A
hence A+ t A is symmetric and A- t A is anti-symmetric.
Deduction: Let A be real matrix. As
A  tA A  tA
A= +
2 2
A  tA A  tA A  tA
and and are two real matrices, such that is symmetric and
2 2 2
A  tA
is anti-symmetric, because
2
A  tA
 
1 1
t At = t At = (A+ t A ) =
 A  2 2 2
 
A
 2 
and
A  tA
 
1 1
t At = t At (-(A- t A )) = -( )
 A  2 A 2 2

 2 
 
then A is the sum of two real matrices with one of them is symmetric and the other is
anti-symmetric.
A  tA A  tA A  tA
Similarly if A is a complex matrix, then as A= + and and
2 2 2
A  tA A  tA A  tA
are two complex matrices, such that is symmetric and is anti-
2 2 2
symmetric, we get that A is the sum of two complex matrices with one of them is
symmetric and the other is anti-symmetric.
---------------------------------------
8- (a) Put A=(a ij ), t A =(b ij ) and At A =(c ij ). We have c ij = 0, for all i,j, hence
c ii = 0, for all 1im.
As b ti = a it , for all 1tn, then
n n
c ii =  a it b ti =  a it2
t 1 t 1
n
and so  a it2 = 0, whence a it = 0, for all 1im and all 1tn. Therefore A= 0.
t 1
(b) We have
BAt A = 0  BAt A t B = 0  (BA)t ( BA) = 0  BA= 0.
---------------------------------------

Nasri Cheaito and Fida El Chami

8
9- We have A+B=  1 1  +  0 0  = 1 1 , hence
 0 0   1 1   1 1
(A+B) 2 = 1 1 1 1 =  2 2  .
 1 1  1 1  2 2 
On the other hand
A 2 =  1 1   1 1  =  1 1  , AB=  1 1   0 0  =  1 1 
0 0 0 0 0 0 0 0 1 1 0 0
and
2 0 0 0 0 0 0
B =   = 
1 1 1 1 1 1
hence
A 2 +2AB+B 2 =  1 1  +2  1 1  +  0 0  =  3 3 
 0 0  0 0  1 1  1 1
and so (A+B) 2  A 2 +2AB+B 2 .
---------------------------------------
10- We have
B=  2 5  -2  1 0  =  0 5 
 0 2  0 1  0 0
hence
B 2 =  0 5   0 5  =  0 0  = 0
0 0 0 0 0 0
and so arguing by induction on t, we show that B t = 0, for all t2. It is true for t=2.
Assume that it holds up to t-1 and let's prove it for t. If t=2, it is true and if t≠2, then t3,
and so t-12, whence B t 1 = 0, by induction hypothesis. This implies that B t =BB t 1 =0,
hence the property holds for t, and so it is true, for all t2.
Deduction: If n=1, we have A=B+2I 2 . Suppose that n≠1, then n2. As B(2I 2 ) =2B and
(2I 2 )B=2B, then B(2I 2 )=(2I 2 )B, and so using the binomial binomial formula, we get
n n
A n = (B+2I 2 ) n =  C nt B t (2I 2 ) n  t =  2 n  t C nt B t
t 0 t 0
n
= 2 n I 2 +2 n 1 nB+  2 n  t C nt B t = 2 n  1 0  +2 n 1 n  0 5
t 2 0 1  0
 0 
 n n 1 
=  2 5n  2n  , for all n2.
 0 2 
Notice that this formula holds also for n=0 and n=1, hence
 n n 1 
A n =  2 5n  2n  , for all n .
 0 2 
---------------------------------------
11- We have
 1 1 1  1 0 0   0 1 1 
B=  0 1 1 -  0 1 0  =  0 0 1 
 0 0 1  0 0 1   0 0 0 
     
hence
0 1 1 0 1 1 0 0 1
B 2 = 0 0 1 0 0 1 = 0 0 0
0 0 0 0 0 0 0 0 0
    
and

Nasri Cheaito and Fida El Chami

9
 0 1 1 0 0 1 0 0 0
B 3 = BB 2 =  0 0 1   0 0 0  =  0 0 0  = 0
0 0 0 0 0 0 0 0 0
    
and so arguing by induction on t, we show that B t = 0, for all t3. It is true for t=3.
Assume that it holds up to t-1 and let's prove it for t. If t=3, it is true and if t≠3, then t4,
and so t-13, whence B t 1 = 0, by induction hypothesis. This implies that B t =BB t 1 =0,
hence the property holds for t, and so it is true, for all t3.
Deduction: If n=1, we have A=B+I 3 . Suppose that n≠1, then n2. As BI 3 = I 3 B, then
using the binomial binomial formula, we get
n n n (n  1) 2 n t t
A n = (B+I 3 ) n =  C nt B t (I 3 ) n  t =  C nt B t = I 3 +nB+ B +  Cn B
t 0 t 0 2 t 3
 n (n  1)   n (n  1) 
1 n n   1 n 
 1 0 0   0 1 1  n (n  1)  0 0 1   2   2 
=  0 1 0  +n  0 0 1  + 0 0 0 = 0 1
0 0 0 0 0 =0 1
n n 
0 0 1 0 0 0 2
       1   0 0 1 
   
   
for all n3.
Notice that this formula holds also for n=0, n=1 and n=2, hence
 n (n  1) 
1 n 
 2 
A n = 0 1 n  , for all n .
0 0 1 
 
 
---------------------------------------
12- 1- We have
 2   2 
A 2 =  a b   a b  =  a  bc ab  bd2  =  a  bc ab  bd2 
 c d   c d   ca  dc cb  d   ac  cd bc  d 
(a  d)a (a  d)b   a 2  da ab  db   a 2  ad ab  bd 
(a+d)A=  = =
 (a  d)c (a  d)d   ac  dc ad  d 2   ac  cd ad  d 2 
and
(ad-bc)I 2 =(ad-bc)  1 0  =  ad  bc 0 
 0 1   0 ad  bc 
hence
 2   2 
A 2 -(a+d)A+(ad-bc)I 2 =  a  bc ab  bd2  -  a  ad ab  bd2  +  ad  bc 0 
0 ad  bc 
 ac  cd bc  d   ac  cd ad  d  
 a 2  bc  (a 2  ad )  ad  bc ab  bd  (ab  bd)  0   0 0 
= =  =0.
 ac  cd  (ac  cd )  0 bc  d 2  (ad  d 2 )  ad  bc   0 0 

2- We have A 2 -(a+d)A+(ad-bc)I 2 =A[A-(a+d)I 2 ]+(ad-bc)I 2 , hence
A[A-(a+d)I 2 ]+(ad-bc)I 2 =0 and so A[A-(a+d)I 2 ] = -(ad-bc)I 2 .
As ad-bc0, then
 1 
A [ A  (a  d ) I 2 ]  = I 2
 ad  bc 
and so A is invertible and

Nasri Cheaito and Fida El Chami

10
 1 1  d b
A 1 = [ A  (a  d ) I 2 ] =  .
ad  bc ad  bc   c a 
---------------------------------------

13- 1- We have
0 1 1  0 1 1  1 0 0
    
2
A = 4  3 4  4  3 4  =  0 1 0 = I 3 .
3  3  
 4   3  3 4   0 0 1 

2- As A 2 = I 3 , then A is invertible and A 1 = A.

 0 4 3 
 
3- We have (t A ) 1 = t 1 = t A =  1  3  3  .
A  1 4 
 4
---------------------------------------
14- Given the matrix
a  b  c  d 
 
 b a d c 
A=  .
c d a b 
 
d c  b a 
1- We have
 a b c d  a  b  c  d 
 b a d c   b a d  c


(t A )A=   c 

 
 d a b  c  d a b
 d  c  
a  d c  b 
 b
 a 
 a 2  b2  c2  d 2 0 0 0 
 2 2 2 2

= 0 a  b  c  d 0 0 
 0 0 a  b  c2  d 2
2 2
0 
 2
 0 0 0 a 2  b2 2
c d 
= ( a 2  b 2  c 2  d 2 )I 4 .
2- If one of a, b, c and d is non-zero, then a 2  b 2  c 2  d 2 ≠0, and so A is invertible
and its inverse is
 a b c d 
 b a  d c 
A =1 1
t =
1  
2 2 2 2 A 2 2 2 2 c d a b .
a b c d a b c d
 d  c b a 

If a, b, c and d are all zero, then A=0, and so A is not invertible.
Therefore A is invertible if and only if one of a, b, c and d is non-zero.
---------------------------------------
15- If one of a 1 , …, a n is zero, then A has a row equals to zero, precisely if a i =0, then the
ith row of A is zero, and so A is not invertible. Suppose that a 1 , …, a n are all non-zero.
Assume that A is invertible. Put A 1 = (b ij ) and AA 1 =(c ij ). As A 1 is (nn), then
n
c ij =  a it b ti = a i b ij , for all i,j{1,…,n}.
t 1

Nasri Cheaito and Fida El Chami

11
 We have c ij =0, for all i≠j and a i ≠0, hence
b ij =0, for all i≠j.
But c ii =1, for all 1in, hence
b ii = 1/ a i , for all 1in
and so as Adiag 1 / a1  1 / a n  = I n , then
A 1 = diag 1 / a1  1 / a n  .
Therefore A is invertible if and only if a 1 , …, a n are all non-zero.
---------------------------------------
16- Suppose that M is invertible, then M 1 is (m+n)(m+n), and so we can put
M 1 =  A' C' 
 D' B' 
with A’ is mm, B’ is nn, C’ is mn and D’ is nm.
We have
 Im 0 
MM 1 =  A C   A' C'  =  AA'CD' AC'CB'  and MM 1 = I m n =  
 0 B   D' B'   BD' BB' 
 0 I n 
hence
AA’+CD’= I m , AC’+CB’=0, BD’=0 and BB’= I n .
As B is invertible and BD’=0, then D’= I n D’=B 1 BD’=0, and so
AA’ = I m , AC’+CB’=0, D’=0 and BB’= I n .
This implies that AC’= -CB’, and so C’= -A 1 CB 1 , whence
A’= A 1 , B’= B 1 , D’=0 and C’= -A 1 CB 1 .
 1 1 1  
AA 1 0  =  I m 0  =I
As M  A  A CB  
  0 BB 1   0 I n  m n , then M is invertible and
=
 0 B 1   
 1 1 1 
M 1 =  A  A CB 1
 .
 0 B 
2 0  1 0  1 1 
Application: We have M=  A C  , with A=   , B=   and C=  .
 0 B   0  3   0  2  2 4 
As A and B are diagonal matrices whose diagonal entries are all non-zero, then A and B
are invertible, by 15 and
1 / 2 0  1  1 0 
A 1 =   and B =  .
 0  1 / 3   0  1 /2 
and so M is invertible and
 1 1 1 
M 1 =  A  A CB  .
 0 B 1 
We have
1 1  1 0  1 / 2 0   1 1/ 2    1/ 2  1/ 4 
-A 1 CB 1 = -A 1    = -   = 
 2 4   0  1 / 2   0  1 / 3   2  2   2 / 3  2 / 3
hence
1 / 2 0  1/ 2  1/ 4 
 
1  0  1 / 3 2 / 3  2 / 3 .
M =
 0 0 1 0 
 0  1 / 2 
 0 0

Nasri Cheaito and Fida El Chami

12
 ---------------------------------------
17- We have that I n A=AI n , hence
I n -A p = (I n -A)( I n +A+,,,+A p1 )
and so as A p =0, then (I n -A)( I n +A+,,,+A p1 ) = I n , whence I n -A is invertible and its
inverse is I +A+,,,+A p1 .
n
---------------------------------------
18- As A has a column equals to zero, namely the third, then A is not invertible.
Suppose that B is invertible. As B is a (33) matrix, then so is B 1 . Let
a b c
B = e f g
1 
 
x y z
then
1 0 0  a b c   a b c 
BB 1 =  0 3 1   e f g  =  3e  x 3f  y 3g  z  .
 4 2 1    
   x y z   4a  2e  x 4b  2f  y 4c  2g  z 
1 0 0
But BB 1 =I 3 =  0 1 0  , hence
0 0 1
 
a=1, b=0, c=0, 3e+x=0, 3f+y=1, 3g+z=0
and
4a+2e+x=0, 4b+2f+y=0 and 4c+2g+z=1.
We have a=1, 3e+x=0 and 4a+2e+x=0, hence we get x=-3e and as 4a+2e+x=0, then
4+2e-3e=0, whence e=4, and so
a=1, e=4 and x=-12.
On the other hand we have b=0, 3f+y=1 and 4b+2f+y=0, hence we get 3f+y=1 and
2f+y=0. It follows that 3f+y-(2f+y) =1, whence f=1, and so
y = -2f = -2. Thus
b=0, f=1 and y = -2.
Similarly, we have c=0, 3g+z=0, and 4c+2g+z=1, hence 3g+z=0 and 2g+z=1. This
implies that 3g+z-(2g+z) = -1, hence g = -1, and so z = -3g = 3. Thus
c=0, g = -1 and z=3.
 1 0 0   1 0 0 
  1  
As B  4 1 1  = I 3 , then B is invertible and B =  4 1 1  .
 12  2 3   12  2 3 
   
---------------------------------------
19- As AB is invetible, then let C be its inverse. We have
(AB)C = I n and C(AB) = I n
hence A(BC) = I n and (CA)B = I n , and so
A is invertible and its inverse is BC
and
B is invertible and its inverse is CA.
---------------------------------------

Nasri Cheaito and Fida El Chami

13
 M1103

SOLVED PROBLEMS

SERIES II

1- Show that each of the following matrices is in row echelon form:

 1 0 0 1 1 
 1 1 2 3 1  
 0 1 2 0  0 0 2 0 1  0 0 2 1 2
 
A= 0 0 0 1 , B= 
0 0 0 0 3
and C=  0 0 0 3 0  .
0 0 0 0  0 0 0 0 0
     0 0 0 0 0 
 0 0 0 0 0
---------------------------------------
2- Show that each of the following matrices is not in row echelon form:
 1 0 0 1 1 
 0 0 2 3 1  
 0 1 2 0     0 0 2 1 2
A=  0 0 0 1  , B=  0 1 2 0 1
0 0 0 0 3
and C=  0 0 0 3 0  .
0 1 0 0  0 0 0 0 0
     0 0 0 1 0 
 0 0 0 0 0
Find a row echelon form and a reduced row echelon form of each of them.
---------------------------------------
3- Find following the values of the real parameter m, a row echelon form of the real matrix
A in the following cases:
1 1 0 0 0 m 2 0 0
 1 m  1 1 1 0 m 4 1 1 .
(i) A=   (ii) A= 
2 2 1 1 0 2m 4 1 1 
 m m  2 0 m 0  m m  2 1 m
   
---------------------------------------
4- Given the matrices

 1 i 0   1 2 1
 
A=  2 1 2i 1  and B=  2 3 1 .
 2 i 3i   4 2 1
   
Using the method of row echelon form, check if each of them is invertible or not and if
yes find its inverse.
---------------------------------------
5- Using the method of row echelon form, find the values of m, for which the real matrix
A is invertible and those for which A is not invertible and if A is invertible, then find
A 1 , in the following cases:
 m 2  m 0 1
(i) A =  13  , (ii) A=  1 m 1 .
  m 1 1
 
---------------------------------------

Nasri Cheaito and Fida El Chami

14
 SOLUTION

1- For A : We have that A0 and the number of non-zero rows of A is 2 and they are the
first two. For each 1t2, let j t denote the column of the leading entry of the tth row of
A, then j 1 =2 and j 2 =4, and so as j 1 j 2 , then A is in row echelon form.
For B : We have that B0 and the number of non-zero rows of B is 3 and they are the
first three. For each 1t3, let j t denote the column of the leading entry of the tth row of
B, then j 1 =1, j 2 =3 and j 3 =5, and so as j 1 j 2 j 3 , then B is in row echelon form.

For C : We have that C0 and the number of non-zero rows of C is 3 and they are the
first three. For each 1t3, let j t denote the column of the leading entry of the tth row of
C, then j 1 =1, j 2 =3 and j 3 =4, and so as j 1 j 2 j 3 , then C is in row echelon form.
---------------------------------------
2- For A : We have that A0 and the number of non-zero rows of A is 3 and they are the
first three. For each 1t3, let j t denote the column of the leading entry of the tth row of
A, then j 1 =2, j 2 =5 and j 3 =2, and so as j 1 j 3 is false, then A is not in row echelon
form.
We have
0 1 2 0  0 1 2 0 0 1 2 0
 
0 0 0 1   0 0 0 1  R 2  R 3   0 0  2 0  which is a row
0 1 0 0
  R 3  R 3  R1  0 0  2 0  0 0 0 1
 
echelon form of A.
For B : We have that B0 and the number of non-zero rows of B is 3 and they are the
first three. For each 1t3, let j t denote the column of the leading entry of the tth row of
B, then j 1 =3, j 2 =2 and j 3 =5, and so as j 1 j 2 is false, then B is not in row echelon
form.
We have
 0 0 2 3 1  R1  R 2  0 1 2 0 1 
0 1 2 0 1   0 0 2 3 1  which is a row echelon form of B.
 0 0 0 0 3  0 0 0 0 3
 0 0 0 0 0  0 0 0 0 0
   
For C : We have that C0 and the number of non-zero rows of C is 4 and they are the
first four. For each 1t4, let j t denote the column of the leading entry of the tth row of
C, then j 1 =1, j 2 =3, j 3 =4 and j 4 =4, and so as j 3 j 4 is false, then C is not in row
echelon form.
We have
 1 0 0 11  1 0 0 1 1 
    
 0 0 2 12  0 0 2 1 2
 0 0 0 30  0 0 0 3 0  which is a row echelon form of C.
 0 0 0 10  R 4  3R 4  R 3  0 0 0 0 0 
 0 0 0 00   0 0 0 0 0
 
---------------------------------------
3- (i) We have

Nasri Cheaito and Fida El Chami

15
 1 1 0 0 0 1 1 0 0 0
 1 m 1 1 1 0  R 2  R 2  R1   0 m 1 1 0  R 2  R 4 
2 2 1 1 0  R 3  R 3  2R 1 0 0 1 1 0
m m  2  0 2 0 m 0
 0 m 0  R  R  mR
4 4 1  
1 1 0 0 0 1 1 0 0 0
0 0 2 0 0
2 0 m 0  m 
0 0 1 1 0 0 0 1 1 0
0  2 
 m 1 1 0  R 4  2R 4  mR 2  0 0 2 2  m 0  R 4  R 4  2R 3
1 1 0 0 0
0 2 0 m 0
0 0 1 1 0 .
 
0 0 0 m 2 0 
Put
1 1 0 0 0
0 2 0 m 0
T=  0 0 1 1 0  and =121(-m ).
2
 
0 0 0 m 2 0 
We have
=0  m=0.
If m0, then 0, and so T becomes a row echelon form of A.
1 1 0 0 0
 
If m=0, then T=  0 2 0 0 0  which is a row echelon form of A.
0 0 1 1 0
0 0 0 0 0
 
Therefore T is a row echelon form of A.
(ii) We have
m 2 0 0 m 2 0 0
m 4 1 1  R 2  R 2  R1   0 2 1 1 
 2m 4 1 1  R 3  R 3  2R 1  0 0 1 1
 m m2 m  R  R  R 0 m  R 4  2R 4  mR 2
 1
4 4 1  m 1
m 2 0 0 m 2 0 0 
0 2 1 1 0 2 1 1 .
0 0 1 1 0 0 1 1 
0 0 2m m  R 4  R 4  (2  m)R 3  0
 0 2m 2 
 0
Put
m 2 0 0 
 1 1  and =m21(2m-2).
T=  0 2
0 0 1 1 
0 0 0 2m 2 

We have =4m(m-1), hence
=0  m=0 or m=1.
If m0 and m1, then 0, and so T becomes a row echelon form of A.
If m=0, then
0 2 0 0 
0 2 1 1 
T=  0 0 1 1  .
 
 0 0 0 2 
We have

Nasri Cheaito and Fida El Chami

16
 0 2 0 0  0 2 0 0 
0 2 1 1 R  R R   0 0 1 1  
0  2 2 1 0 0 1 

0 1 1
 
1 R
 3  R 3  R 2
0 0 0 2  0 0 0 2 
0 2 0 0  0 2 0 0 
0 0 1 1    0 0 1 1 
 , which is a row echelon form of A.
0 0 0 0  0 0 0 2
  R 3  R 4  
 0 0 0 2  0 0 0 0 
If m=1, then
1 2 0 0
 1
T=  0 2 1
0 0 1 1
0 0 
 0 0
which is a row echelon form of A.
0 2 0 0 
0 0 1 1 
Therefore T is a row echelon form of A if m0 and if m=0, then  0 0 0 2  is a
 
0 0 0 0 
row echelon form of A.
Notice that T is not a row echelon form of A, when m=0.
---------------------------------------
4- For A: We have
 1 i 0  1 i 0   1 i 0 
     
 2 1 2i 1  R 2  R 2  2R1   0 1 1   0 1 1 which is a row
 2 i 3i  R 3  R 3  2R1  0 3i 3i  R 3  R 3  3iR 2  0 0 0 
     
echelon form of A.
As A is a square matrix of order 3 and the number of non-zero rows of the obtained row
echelon form of A is different from 3, then A is not invertible.
For B: We have
1 2 1  1 2 1 
 1 2 1   
 2 3 1 R  R  2R   0 1 1    0 1 1  , which is a
 4 2 1 2 2 1
  R 3  R 3  4R1  0  6 3  R 3  R 3  6R 2  0 0 3 
 
row echelon form of B.
As B is a square matrix of order 3 and the number of non-zero rows of the obtained row
echelon form of B is 3, then B is invertible.
B 1 : We have
1 2 
 1 2 1  1 
 2 3 1 R  R  2R   0 1 1  
 4 2 1 2 2 1
  R 3  R 3  4R 1  0  6  3  R 3  R 3  6R 2
 
1 2 1   1 2 1 R 1  R 1  R 3
  0 1 1 R  R  R 
 0  1  1  R   R 
0 0
2 2
 R 3  (1 / 3)R 3  0 0 1 2 2 3
 3   
 1 2 0  R 1  R 1  2R 2 1 0 0
 0 1 0  0 1 0
0 0 1 0 0 1
   
hence to get B 1 we apply the above operations on I 3 , we get

Nasri Cheaito and Fida El Chami

17
 1 0 0  1 0 0
 0 1 0  R  R  2R    2 1 0  
0 0 1 2 2 1  
  3
R  R 3  4 R 1   4 0 1 R 3  R 3  6R 2
 1 0 0  1 0 0  R1  R1  R 3
   
  2 1 0  R 2  R 2   2  1
 
0  R2  R2  R3 
 8  6 1  R 3  (1 / 3)R 3  8 / 3  2 1 / 3 
 5/3 2  1 / 3  R 1  R 1  2R 2   1/ 3 0 1 / 3 
 
 2/3 1  1/ 3    2/3 1  1/ 3 
   
 8/3  2 1/ 3   8/3  2 1/ 3 
hence
  1/ 3 0 1 / 3 
1

B =  2/3 1  1/ 3 
 
 8/3  2 1/ 3 
2nd method: We have
 1 2 1  1 0 0 1 2 1  1 0 0
 2 3 1  0 1 0 R  
 R 2  2R 1   0  1  1   2 1 0  
 4 2 1  0 0 1 2  0  6  3   4 0 1  R  R  6R
  R3  R 3  4R 1   3 3 2
1 2 1  1 0 0
 
 0  1  1  2 1 0  R 2  R 2 
0 0 3  8  6 1  R 3  (1 / 3)R 3
1 21 1 0 0  R1  R1  R 3
 
 0 1 1  2 1 0  R 2  R 2  R3 
0 0 1  8 / 3  2 1 / 3 
1 2 0   5/3 2  1 / 3  R 1  R 1  2R 2  1 0 0   1/ 3 0 1 / 3 
 
0 1 0   2/3 1  1/ 3   0 1 0   2 / 3 1  1/ 3 
   
0 0 1 8/3 2 1/ 3  0 0 1  8/ 3  2 1/ 3 
hence
  1/ 3 0 1 / 3 

B 1 =   2 / 3 1  1/ 3 
 
 8/3  2 1/ 3 
---------------------------------------
5- (i) We have
 m 2  R1  R 2   1 3    1 3 
 1 3     .
   m 2  R 2  R 2  mR1  0 2  3m 
Put
 1 3 
T=   and =(-1)(2+3m).
 0 2  3m 
We have
2
=0  m= .
3

Nasri Cheaito and Fida El Chami

18
 2
If m , then 0, and so T becomes a row echelon form of A, and so as A is a
3
square matrix of order 2 and the number of non-zero rows of T is 2, then A is
invertible.
2
If m= , then
3
 1 3 
T=  .
 0 0
As T is a row echelon form of A and the number of non-zero rows of T is different
from 2, then A is not invertible.
2 2
Therefore A is invertible if m and it is not invertible if m= . Let’s find
3 3
A 1 . We have
 m 2  1 0 R1  R 2   1 3  0 1  
 1 3  0 1   
   m 2  1 0 R
 2  R 2  mR 1
1 3  0 1 
 1 3  0 1  R1   R1    R  R1  3R 2 
  1  1 m  1
 0 2  3m  1 m  R 2  2  3m R 2  0 1  
 2  3m 2  3m 
 3 3m   3 2 
1 0  1  1 0  
 2  3m 
2  3m   2  3m 2  3m 
 0 1  1 m   0 1  1 m 

 2  3m 2  3m   2  3m 2  3m 
hence
 3 2 
 
1  2  3m 2  3m 
A = .
 1 m 
 2  3m 2  3m 
 
Remark: Using 12 of series I, we get
 3 2 
 
1 3  2  1 3  2   2  3m 2  3m 
A 1 =  =  = .
 2  3m  1 m  2  3m  1 m   1 m 
 2  3m 2  3m 
 
(ii) We have
 m 0 1 R1  R 2  1 m 1
 1 m 1   m 0 1 R 2  R 2  mR1 
 m 1 1  m 1 1
    R 3  R 3  mR1
1 m 1  m  0  1 m 1 
 2  2 
 0  m 2 1 m    0  m 1 m  .
 0 0 1 m 
 0 1 m 1 m  R 3  m 2 R 3  (1 m 2 )R 2  
Put
1 m 1 
T=  0  m 2 1 m  and =1(-m 2 )(1-m).
 0 0 1 m 
 
We have

Nasri Cheaito and Fida El Chami

19
 =0  m=0 or m=1.
If m0 and m1, then 0, and so T becomes a row echelon form of A, and so as A is
a square matrix of order 3 and the number of non-zero rows of T is 3, then A is
invertible.
If m=1, then
1 1 1
 
T=  0 1 0  .
0 0 0
 
As T is a row echelon form of A and the number of non-zero rows of T is different
from 3, then A is not invertible.
 0 0 1
If m=0, then A=  1 0 1 .
 0 1 1
 
We have
 0 0 1 R1  R 2  1 0 1  1 0 1
 1 0 1   0 0 1 R 2  R 3   0 1 1 which is a row echelon form of A.
 0 1 1  0 1 1  0 0 1
     
As the number of non-zero rows of this row echelon form of A is equal to the order of
A, then A is invertible.
It follows that A is invertible if m1 and it is not invertible if m=1.
2nd method: We have
 m 0 1 R1  R 2  1 m 1 1 m

1 

 1 m 1   m 0 1 R 2  R 2  mR1   0  m 2 1 m  
 m 1 1  m 1 1  
    R 3  R 3  mR1  0 1 m 1 m  R 3  R 3  R 2
2

1 m 1  1 m 1  1 m 1 
  
2
 0  m 1 m  R 2  R 3   0 1 0   0 1 0  .
 

0 1 0
 0  m 2 1 m  R 3  R 3  m 2 R 2  0 0 1m 
Put
1 m 1 
T=  0 1 0  and =11(1-m).
0 0 1m 

We have
=0  m=1.
If m1, then 0, and so T becomes a row echelon form of A, and so as A is a square
matrix of order 3 and the number of non-zero rows of T is 3, then A is invertible.
If m=1, then
1 1 1
T=  0 1 0  .
0 0 0
 
As T is a row echelon form of A and the number of non-zero rows of T is different
from 3, then A is not invertible.
It follows that A is invertible if m1 and it is not invertible if m=1.
1
Let’s find A . We have
 m 0 1  1 0 0 R1  R 2  1 m 1  0 1 0 
 1 m 1  0 1 0   m 0 1  1 0 0  R 2  R 2  mR1 
 m 1 1  0 0 1  m 1 1  0 0 1
    R 3  R 3  mR1

Nasri Cheaito and Fida El Chami

20
 
1 m 1  0 1 0
 0  m 2 1 m  1 m 0 
 R  R  R
 0 1 m 2 1 m  0  m 1  3 3 2

1 m 1  0 1 0 
 2
 0  m 1  m  1  m 0 R 2  R3 
0 1 0  1 0 1 

1  0 0 
 m 1 1
0 1 0  1 0 1 
  2
0
  m 2 1  m  1  m 0  R 3  R 3  m R 2
1 m 1  0 1 0 

0 1 0  1 0 1  
  1
0 0 1  m  1  m 2  m m 2  R 3  R3
 1 m
 
 
1 m 1  0 1 0  R1  R1  R 3
0 1 0  1 0 1  
 
  m m2 
 0 0 1  1  m 
 1 m 1 m 
 2  1 m 
1 m 0  1  m 1  m  1 0 0  1 
 1  m 1  m  R 1  R 1  mR 2  1 m 1 m 
0 1 0  1 0 1   0 1 0  1 0 1 
  
  m m2  m m2 
 0 0 1  1  m 


0 0 1  1  m
1 m 1 m 
  1 m 1  m 
hence
 1 m 
 1 
 1 m 1 m 
1
A = 1 0 1 .
  m m2 
1  m 
 1  m 1  m 
---------------------------------------

Nasri Cheaito and Fida El Chami

21
 M1103

SOLVED PROBLEMS

SERIES III

1- Let  =  12 2 3 4 5 6  and  =
6 4 1 
1 2 3 4 5 6  .
 3 5 1 3 6 2 4 5 
Calculate  2 ,  3 ,  2 ,  3 , o,  1 and  1 and find their signatures.
---------------------------------------
2- Find the positive integers i and j so that the permutation
 =  12 2 3 4 5 6 7 8 9
i 7 4 9 j 5 6 
 3
is even (resp. odd).
---------------------------------------
3- Show without expansion that
5 6 20 34 35 62
a) 15 5 40 is a multiple of 100; b) 3 3 6 = 0;
40 2 60 4 5 2
a ab a 2 b ab b 2
c) b bc b 2 + c bc c 2 = 0, where a, b and c are real numbers.
c ca c 2 a ca a 2
---------------------------------------
4- Calculate the following determinants:
2 1  3 4
1 2 3 1 1 6 7
a) 0 1 2i b) .
i 1 0 0 5 1 2 3
3 1 4 2
---------------------------------------
5- Show without expansion that if a, b and c are real numbers, then
a bc 2a 2a
2b bca 2b = (a+b+c) 3 .
2c 2c ca b
---------------------------------------
6- Calculate the following determinants:
x a   a
a x a  a
a) D n =  a  .
  a
a a  a x
ab 1 0   0
ab a  b 1 0  0
0 ab 
b) D n =  0 0 .
  1
0 0  0 ab a  b
(Hint: Show that D n = (a+b)D n1 -abD n2 ).

Nasri Cheaito and Fida El Chami

22
 2 1 0   0
1 2 1 0  0
0 1 
c) D n =  0 0
  1
0 0  0 1 2
(Hint: use b)).
---------------------------------------
7- Compute the following determinants
1 a 1 1 1 b c a 1 d
a) 1 1  b 1 1 ; b) b c 1 a d ;
1 1 1 c 1 b 1 c a d
1 1 1 1 d b c a d 1

n2 (n 1) 2 (n  2) 2 1 a a2 a3
2 3
c) (n 1) 2 (n  2) 2 (n  3) 2 ; d) 1 b b 2 b3 .
1 c c c
(n  2) 2 (n  3) 2 (n  4) 2
1 d d 2 d3
---------------------------------------
8- Find the values of x, for which the following matrices are invertible:
1  x  1 2 2 
 1 1 2   
   0 x 1 1 
A=  x  1 x 1  and B= .
 6   1  1 1  x 0 
 4 4  x  1

 1 1  x 
---------------------------------------
9- Show that if AM n (K), then A =  n A , for all K, and deduce that if A is an
anti-symmetric real matrix of odd order, then A =0.
---------------------------------------
10- Let AM n ( ). Show that
(i) If A=A 1 , then A = 1.
(ii) If t A = A 1 , then A = 1.
---------------------------------------
11- Show that the matrix
1 1 0
 
A = 0 2 1
2 1 3
 
is invertible and find its inverse by using the classical adjoint of A.
---------------------------------------
12- Calculate following the values of the real parameter m, the rank of the matrix A in the
following cases:
2 m 1 m 1 1 1 
 m 1 0 1 0  

(i) A= m 1 2 ,   
(ii) A= 1 1 m 1 1 , (iii) A=  1 m 1 1  .
 1 2 m  1 1 m 2m 1  1 1 m 1
     1 1 1 m
 
------------------------------------

Nasri Cheaito and Fida El Chami

23
 SOLUTION

1- Recall that if
=  1(1) (22)  n 1 n   1 2  n 1 n 
  (n 1) (n )  and =  (1) (2)  (n 1) (n ) 
then
  =  (1(1)) (2(2))  n 1 n 
  ((n 1)) ((n ))  .
Thus
 2 =  12 2 3 4 5 6  and  = (-1) 11011 =(-1) 4 =+1.

 3 1 5 6 4 2

 3 = 1 2 3 4 5 6  and  =(-1) 00000 = (-1) 0 =+1.


 2 3 4 5 6
1 3

 2 =  1 2 3 4 5 6  and  =(-1) 41300 = (-1) 8 =+1.


5 2 6 1 3 4 2

 3 =  14 2 3 4 5 6  and  =(-1) 31220 = (-1) 8 =+1.

6 1 3 
 2 5 3

  =  1 2 3 4 5 6  and  =(-1) 40101 = (-1) 6 =+1.

 
5 1 3 2 6 4
 1 =  12 2 3 4 5 6  and 
  1 = (-1)
11011
=(-1) 4 =+1.
 3 1 5 6 4 
 1 =  13 2 3 4 5 6  and  =(-1) 21111 = (-1) 6 =+1.
  1
 2 4 5 6 1
---------------------------------------
2- We have {i,j}={7,9}, hence
(i=7 and j=9) or (i=9 and j=7).

Suppose that i=7 and j=9, then

 =  12 2 3 4 5 6 7 8 9

 3 4 7 1 9 8 5 6
hence   = (-1) 11130320 =(-1) 11 =-1.
Suppose that i=9 and j=7, then
 =  12 2 3 4 5 6 7 8 9
4 9 1 7 8 5 6 
 3
hence   = (-1) 11150220 =(-1) 12 =+1.
It follows that  is even if i=9 and j=7 and it is odd if i=7 and j=9.
---------------------------------------
5 6 20 1 6 1 1 6 1
3- a) 15 5 40 =205 3 5 2 = 100 3 5 2 , which is a multiple of 100;
40 2 60 8 2 3 8 2 3
b) Applying the operations C 2 C 2 - C 1 and C 3 C 3 - 2C 1 , we get
34 35 62 34 1  6 34 1 1
3 3 6 = 3 0 0 = -6 3 0 0 = -60 = 0, since the last determinant has
4 5 2 4 1 6 4 1 1
two equal columns.

Nasri Cheaito and Fida El Chami

24
 c 2  c3
a ab a 2 b ab b 2 1b a 1a b 1b a 1b a
c) b bc b 2 + c bc c 2 =abc 1 c b +abc 1 b c =abc 1 c b - abc 1 c b =0.
c ca c 2 a ca a 2 1a c 1c a 1a c 1a c

---------------------------------------
1 2 3
4- a) 0 1 2i = (-1) 31 (i+1) 2 3 = (i+1)(4i-3) = 4i 2 -3i+4i-3 = -7+i.
i 1 0 0  1 2i


2 1  3 4 2 1  3 4
1 1 6 7 R 2  R 2  R1
b) = 3 0 3 11
5 1 2 3 R 3  R 3  R1
7 0 1 7
3 1  4 2 R 4  R 4  R1
5 0 7 6
3 3 11 R1  R1  3R 2
= (-1) 12 (-1) 7 1 7
5 7 6 R 3  R 3  7R 2

24 0 32 24 32
= =(-1) 22 (-1)
7 1 7  44  43
 44 0  43
= -[24(-43)-32(-44)] = -376.
---------------------------------------
a bc 2a 2a R1  R1  R 2  R 3 a  b  c a  b  c a  b  c
5- 2b bca 2b = 2b bca 2b
2c 2c ca b 2c 2c ca b
1 1 1
= (a+b+c) 2b b  c  a 2b R 2  R 2  2bR1
2c 2c c  a  b R 3  R 3  2cR 1
1 1 1
= (a+b+c) 0  b  c  a 0 = (a+b+c)(-b-c-a)(-c-a-b) = (a+b+c)(a+b+c)(a+b+c)
0 0 ca b
= (a+b+c) 3 , since the last determinant is upper triangular.
---------------------------------------
6- - a) We have
C1  C1  C 2   C n
x  (n 1)a a   a
x a   a x  (n 1)a x a  a
a x a  a
Dn=  a  =  a 
  a   a
a a  a x x  (n 1)a a  a x
1 a   a
1 x a  a R 2  R 2  R1
= [x+(n-1)a]  a  R  R R
3 3 1
  a 
1 a  a x R n  R n  R1

Nasri Cheaito and Fida El Chami

25
 1 a   a
0 x a 0  0
= [x+(n-1)a]  0  = [x+(n-1)a] 1  ( x  a )(x  a )  ( x  a )
  0   
( n 1) times
0 0  0 x a
= [x+(n-1)a](x-a) n1 , since the last determinant is upper triangular.
b) We have
a  b ab 0   0 
1 a  b ab 0  0
0 1 
Dn=  0 0
  ab
0 0  0 1 a b
a  b ab 0   0
1 a  b ab 0  0
0 1   (of order n 1)
= (a+b)  0 0
  ab
0 0  0 1 ab

1 ab 0    0
0 a  b ab 0   0
0 1 ab ab 0  0  (of order n 1)
-ab  0 1 
  0 0
   ab
0 0 0  0 1 ab
a  b ab 0   0
1 a  b ab 0  0
0 1   (of order n  2)
= (a+b)D n1 -ab  0 0
  ab
0 0  0 1 ab
= (a+b)D n1 -abD n2
We have
D 1 = a  b =a+b and D 2 = a  b ab 2 2 2
1 a  b =(a+b) -ab=a +b +ab.
Suppose that ab, then
a 2 b2 a 3  b3
D 1 =a+b= and D 2 = a 2 +b 2 +ab = .
a b a b
Let’s show that in this case
a n 1  b n 1
Dn = .
a b
We argue by induction on n. It is true for n=1. Suppose that the formula holds up to
(n-1) and let’s prove it for n. We have
 a n bn   n 1 n 1 
D n = (a+b)D n1 -abD n2 = (a+b)   -ab  a  b 
 a b   a b 
   

Nasri Cheaito and Fida El Chami

26
 a n 1  ab n  ba n  b n 1  a n b  ab n a n 1  b n 1
= =
a b a b
hence the formula is true for n, and so it is true, n1.
Suppose that a=b, then
D 1 =a+b=2a and D 2 = a 2 +b 2 +ab =3a 2 .
Let’s show that in this case
D n =(n+1)a n .
We argue by induction on n. It is true for n=1. Suppose that the formula holds up to
(n-1) and let’s show it for n. We have
D n = (a+b)D n1 -abD n2 = 2aD n1 -a 2 D n2 = 2a(na n1 )-a 2 [(n-1)a n2 ]
= 2na n -(n-1)a n = [2n-(n-1)]a n = (n+1)a n
hence the formula is true for n, and so it is true, n1.
c) Using b), and taking a=1 and b=1, we get D n = (n+1)a n = n+1.
---------------------------------------
7- a) We have
a 0 0 d 
1 a 1 1 1 R1  R1  R 4
1 1 b 1 1 R2  R2  R4 = 0 b 0  d
1 1 1 c 1 R3  R3  R4 0 0 c  d
1 1 1 1 d
1 1 1 1 d
b 0 d  0 b 0
11
= (-1) a 0 c  d +(-1) 1 4 (-d) 0 0 c
1 1 1 d 1 1 1

c d
= a[b -d 0 c ]-db 0 c
1 1 d 1 1 1 1
= a[b(c+cd+d)-d(-c)]+dbc
= abc+abcd+abd+acd+bcd
= abc+abd+acd+bcd+abcd.
c1  c1  c 2  c 3  c 4
1 a  b  c  d c a 1 d
b c a 1 d d R 2  R 2  R1
b) b c  1 a d = 1 a  b  c  d c 1 a
1 a  b  c  d c a d R 3  R 3  R1
b 1 c a d 1 a  b  c  d c a 1  d R 4  R 4  R1
b c a 1 d
 
1 a  b  c  d c a 1 d 1 1 0 1 0
= 0 1 1 0 = (1+a+b+c+d) 0  1 0 = (1+a+b+c+d)
0 1 1 1 1
0 0 1 0
0 0 1 1
= -(1+a+b+c+d).
n2 (n 1) 2 (n  2) 2 n2 (n 1) 2 (n  2) 2
2 2 2
c) (n 1) (n  2) (n  3) R 2  R 2  R1 = 2n 1 2n  3 2n  5
2 2 2 R 3  R 3  R1 2(2n  2) 2(2n  4) 2(2n  6)
(n  2) (n  3) (n  4)

Nasri Cheaito and Fida El Chami

27
 c 2  c 2  c1 c 3  c 3  c1
n 2
(n 1) 2 (n  2) 2 n 2 2n  1 4n  4
=2 = 2 2n  1 2 4
2n 1 2n  3 2n  5 2n  2 2 4
2n  2 2n  4 2n  6

c3  c3  c 2 
2
=4 n 2n  1 2n  2 =4 n
2
2n  1 1
2n  1 2 2 2n  1 2 0
2n  2 2 2 2n  2 2 0

= (-1) 13 4 22nn12 2

2 = 4[2(2n+1)-2(2n+2)] = 4(-2) = -8.
d) We have

1a a a 2 3
1 a a2 a3
2 3 R R R 2 2 3 3
1b b b 2 2 1 .= 0 b  a b  a b  a
1 c c 2 c3 R 3  R 3  R1 0 c  a c 2  a 2 c3  a 3
1 d d 2 d 3 R 4  R 4  R1 0 d  a d 2  a 2 d 3  a 3

b  a b 2  a 2 b3  a 3 b  a (b  a )(b  a ) (b  a )(b 2  a 2  ab )
= c  a c 2  a 2 c 3  a 3 = c  a (c  a )(c  a ) (c  a )(c 2  a 2  ac)
d  a d 2  a 2 d3  a 3 d  a (d  a )(d  a ) (d  a )(d 2  a 2  ad )

1 b  a b 2  a 2  ab
= (b-a)(c-a)(d-a) 1 c  a c 2  a 2  ac
1 d  a d 2  a 2  ad
and
1 b  a b 2  a 2  ab 1 b  a b 2  a 2  ab
1 c  a c 2  a 2  ac R 2  R 2  R 1 = 0 c  b c 2  b 2  ac  ab
1 d  a d 2  a 2  ad R 3  R 3  R 1 0 d  b d 2  b 2  ad  ab

1 ba b 2  a 2  ab 1 b  a b 2  a 2  ab
= 0 c  b (c  b)(c  b)  a (c  b) = 0 c  b (c  b)(c  b  a )
0 d  b (d  b)(d  b)  a (d  b) 0 d  b (d  b)(d  b  a )

1 b  a b 2  a 2  ab
= (c-b)(d-b) 0 1 cba
0 1 d  b  a R3  R3  R2

1 b  a b 2  a 2  ab
= (c-b)(d-b) 0 1 c  b  a = (c-b)(d-b)11(d-c) = (c-b)(d-b)(d-c)
0 0 dc
hence
1 a a2 a3
1 b b2 b 3 = (b-a)(c-a)(d-a)(c-b)(d-b)(d-c) = (a-b)(a-c)(a-d)(b-c)(b-d)(c-d).
1 c c2 c3
1 d d2 d3
---------------------------------------
8- We have
Nasri Cheaito and Fida El Chami
28
 c1  c1  c 2  c 3 
1 1 2 0 1 2
1 2
A = x 1 x 1 = 0 x 1 = (6+x) = (6+x)(-1-2x)
x 1
6 4 4x 6x 4 4x

hence A is invertible if and only if x≠-6 and x≠-(1/2).

As
c3  c3  c 4
1 x 1 2  2
1 x 1 2 2
0  x 1 1
B = = 0 x 1 1
1 1 1 x 0
1 1 1 x 0
1 1 1  x R 4  R 4  R3
0 0 x x
1 x 1 0  2
1 x 1 0
 x 0 1
0  = -x 2 1  x 0
0
= = -x 0 x
1 1 1 x 0 1 1 x
1  1 1  x
0 0 0 x 
= -x 2 (1-x) 2
then B is invertible if and only if x≠0 and x≠1.
---------------------------------------
9- Put A=(a ij ), then
a11 a12  a1n a11 a12  a1n
a 21 a 22  a 2n a a  a 2n
A = = n 21 22 = n A
     
a n1 a n 2  a nn a n1 a n 2  a nn
because from each column there is one  that comes out, and so as there are n columns,
then we obtain the above result.
2nd method: Put A=(b ij ). Then b ij =a ij , for all i,j, and so
A =    b1(1) b 2(2) .....b n(n )
S n
=    (a1(1) )(a 2(2) ).....(a n(n ) )
Sn

=  n (    a1(1) a 2(2) .....a n(n ) )

S n

= n A .
We have A is anti-symmetric, hence t A = -A, and so t A =  A . But
 A = (-1) n A and t A = A
hence A =(-1) n A . As n is odd, then (-1) n =-1, and so A =- A . It follows that
2 A =0, whence A =0.
---------------------------------------
10- (i) We have
1
A = A 1 =
A
2
hence A =1, and so A = 1.

Nasri Cheaito and Fida El Chami

29
 (ii) We have
1
A = t A and t A = A 1 =
A
1 2
hence A = , and so A =1, whence A = 1.
A
---------------------------------------
11- We have

1 1 0 1 1 0
A=0 2 1 = 0 2 1 = 2 1 = 6-3=3
2 1 3 R 3  R 3  2R 1 0 3 3 3 3

hence A ≠0, and so A is invertible.

 M11 M 21 M 31 
We have adj(A)=  M12 M 22 M 32  , where
M 
 13 M 23 M 33 
M 11 = (-1) 11 2 1 = 6-1= 5, M 12 = (-1) 12 0 1 = 2, M 13 = (-1) 13 0 2 = -4,
1 3 2 3 2 1
1 0 1 1
M 21 = (-1) 21 = 3, M 22 = (-1) 22 1 0 = 3, M 23 = (-1) 23 = -3,
1 3 2 3 2 1
1 0 1 1
M 31 = (-1) 31 = -1, M 32 = (-1) 32 1 0 = -1, and M 33 = (-1) 33 = 2,
2 1 0 1 0 2
hence
 5 3 1 
 
adj(A) =  2 3 1 
 4 3 2 

and so
 5 3 1   5 / 3 1  1/ 3 
1 1 1   
A = adj(A) =  2 3 1  =  2 / 3 1  1/ 3 .
3 
2    4 / 3  1 2 / 3 
A
 4  3 
---------------------------------------
12-(i) We have
2 m 1 R1  R1  R 2  R 3 m  3 m  3 m  3
A=m 1 2 = m 1 2
1 2 m 1 2 m

1 1 1 1 1 1
= (m+3) m 1 2 R 2  R 2  mR 1 = (m+3) 0 1  m 2  m
1 2 m R 3  R 3  R1 0 1 m 1

= (m+3) 1  m 2  m = (m+3)[(1-m)(m-1)-(2-m)] = (m+3)(-m 2 +2m-1-2+m)

1 m 1
= (m+3)(-m 2 +3m-3).

Nasri Cheaito and Fida El Chami

30
 As the discriminant of -m 2 +3m-3 is  = -3<0, then -m 2 +3m-30, m , and so if
m-3, then A 0, whence rank(A)=3.
If m=-3, then
 2 3 1 
 
A=   3 1 2 .
 1 2 3 
 
We have
 2 3 1  2  3 1 
   
 3 1 2  R 2  2R 2  3R 1   0  7 7  
 1 2 3  R 3  2R 3  R 1 0 7 7  R3  R3  R2
   
2  3 1
 
 0  7 7  , which is a row echelon form of A and the number of its non-zero rows is
0 0 0
 
2, hence rank(A)=2.
Therefore rank(A)=3 if m-3 and rank(A)=2 if m=-3.
(ii) We have
 m 1 0 1 0  R1  R 2  1 1 m 1 1 
 1 1 m 1 1   m 1 0 1 0  R 2  R 2  mR1 
 1 1 m 2m 1   1 1 m 2m 1 
    R 3  R 3  R1
1 1 m 1 1 
 2 
 0 1 m  m 1 m  m  .
0 0 0 2m 1 0 

Put
1 1 m 1 1 
 2 
T=  0 1 m  m 1 m  m  and =1(1-m)(2m-1).
0 0 0 2m 1 0 
 
1
If m1 and m , then T becomes a row echelon form of A and the number of its
2
non-zero rows is 3, hence rank(A)=3.
1 1 1 1 1 
 
If m=1, then T=  0 0 1 0 1  which is a row echelon form of A
0 0 0 1 0 
 
and the number of its non-zero rows is 3, hence rank(A)=3.
1
If m= , then
2
1 1 1/ 2 1 1 
 
T=  0 1/ 2 1/ 4 1/ 2 1/ 2 
0 0 0 
 0 0
which is a row echelon form of A and the number of its non-zero rows is 2, hence
rank(A)=2.
1 1
It follows that rank(A)=3 if m and rank(A)=2 if m= .
2 2
nd
2 method: Consider the minor

Nasri Cheaito and Fida El Chami

31
 1 1 0
= 1 1 1 .
1 2m 1
We have
1 1 0 1 1 0
= 1 1 1 =1 1 1 = (-1) 32 (2m-1) 11 10
1 2m 1 R 3  R 3  R 2 0 2m 1 0 
= -(2m-1)(11-10) = -(2m-1).
1
If m , then  becomes a non-zero minor of A of order 3, and so rank(A)3. But
2
rank(A) number of rows of A, hence rank(A)3, and so rank(A)=3.
1
If m= , then
2
1/ 2 1 0 1 0 
A=  1 1 1/ 2 1 1  .
 1 1 1/ 2 1 1 
 
We have
1/ 2 1 0 1 0  1/ 2 1 0 1 0
 1 1 1/ 2 1 1  R 2  R 2  2R1  0 1 1/ 2 1 1 


 1 1 1/ 2 1 1   
  R 3  R 3  2R1  0 1 1/ 2 1 1  R 3  R 3  R 2
1/ 2 1 0 1 0
 
 0 1 1/ 2 1 1  which is a row echelon form of A and the number of its non-
0 0 0 0 0
 
zero rows is 2, and so rank(A)=2. Therefore
1 1
rank(A)=3 if m and rank(A)=2 if m= .
2 2
(iii) We have
c1  c1  c 2  c 3  c 4
m 1 1 1 m3 1 1 1
R  R 2  R1
1 m 1 1 = m3 m 1 1 2
1 1 m 1 m  3 1 m 1 R 3  R 3  R1
1 1 1 m m  3 1 1 m R 4  R 4  R1

m3 1 1 1
= 0 m  1 0 0 = (m+3)(m-1)(m-1)(m-1)
0 0 m 1 0
0 0 0 m 1
hence if m≠-3 and m≠1, then A 0, and so rank(A)=4.
 3 1 1 1 
 
1 3
If m= -3, then A=   , and so we have
1 1
1 1 3 1 
 
 1 1 1 3 
 3 1 1 1 
 
 1 3 1 1  R 2  3R 2  R 1 
 1 1 3 1  R 3  3R 3  R 1
  R  3R  R
 1 1 1 3  4 4 1

Nasri Cheaito and Fida El Chami

32
 3 1 1 1 
 
 0 8 4 4  
 0 4 8 4  R 3  2R 3  R 2
  R  2R  R
 0 4 4 8  4 4 2

 3 1 1 1   3 1 1 1
   
 0  8 4 4    0 8 4 4
 0 , which is a row
0  12 12   0 0  12 12 
 
 0 0 12  12  R 4  R 4  R 3  0 0 0 0


echelon form of A with three non-zero rows only, hence rank(A)=3.

 1 1 1 1
 
If m=1, then A= 1 1 1 1 , and so we have
1111
 1 1 1 1
 
1 1 1 1 1 1 1 1
1 1 1 1 R 2  R 2  R 1   0 0 0 0 
1 1 1 1 R  R  R  0 0 0 0  , which is a row echelon form of A with one
1 1 1 1 3 3 1  
  R 4  R 4  R1  0 0 0 0 
non-zero row only, hence rank(A)=1.
Therefore
rank(A)= 4 if m-3 and m1, rank(A)=3 if m= -3 and rank(A)=1 if m=1.
---------------------------------------

Nasri Cheaito and Fida El Chami

33
 M1103

SOLVED PROBLEMS

SERIES IV

1- Given the real system:

 2 y  z  1
(S) :  y  z  1 .
 x  z  4
a) Write (S) in the form AX=B.
b) Find the inverse of A by the method of row echelon form.
c) Deduce the solutions of (S).
---------------------------------------
2- Show that the following system is a Cramer’s system and find its solution:
 x  y  z  0
(S) : x  2 y  3z  7 .
2x  3y  z  2
---------------------------------------
3- Given the real system:
 x  y  (2m  1)z  1

(S) :  mx  y  z  1 .

 x  my  5 z  3( m  1)
Find the values of m, for which the system (S) is a Cramer’s system, then solve it.
---------------------------------------
4- Discuss following the values of the real parameter m, the real system
mx  2 y  6z  0
(S) :  2x  y  3z  0 .
 x  y  5z  0
---------------------------------------
5- Given the real system
 x  2 y  3z  a
(S) : x  8y  2z  b .
2x  6 y  z  c
Find the relations satisfied by a, b and c, so that the system is consistent and then give
the solutions.
---------------------------------------
6- Solve and discuss each of the following real systems:
3x  4 y  2z  m  x  2 y  3z  2

(S 1 ) :  x  y  mz  2 ; (S 2 ) :  x  3y  2z  5 ;

 2 x  3y  z  1 2x  y  mz  1
 mx  y  mz  2  m  (2m  1) x  my  (m  1)z  m  1
 
(S 3 ) :  x  y  z 1 ; (S 4 ) :  (m  2) x  (m  1) y  (m  2)z  m .

 mx  2 y  2z  m 
(2m  1) x  (m  1) y  (2m  1)z  m
---------------------------------------
7- Let a be a complex number, such that a 3 -a+1 = 0 and let b = a 2 +a+2. Find a non-zero
real polynomial f(x), such that f(b)=0.
---------------------------------------

Nasri Cheaito and Fida El Chami

34
 SOLUTION

1- a) Let
0 2 1  1 x
   1  and X=  y 
A=  0  1 1  , B=
1 0   4  
 1    z
then system (S) is written AX=B.
b) We have
 0 2  1  1 0 0  R1  R 3  1 0 1  0 0 1
   
 0 1 1  0 1 0  0 1 1  0 1 0 
1 0 1  0 0 1  0 2  1  1 0 0  R 3  R 3  2R 2
 
1 0 1  0 0 1  R1  R1  R 3 1 0 0  1  2 1
   
 0  1 1  0 1 0  R 2  R 2  R 3   0  1 0   1  1 0  R 2  R 2 
0 0 1 1 2 0  0 0 1  1 2 0 
   
1 0 0  1  2 1
 
0 1 0  1 1 0
 0 0 1  1 2 0 
 
hence
 1  2 1
1  
A = 1 1 0 .
 1 2 0
 
c) As AX=B, then the solution is
 1  2 1  1  1
 
1
X=A B =  1 1 0  1  =  2 .
 1 2 0   4   3 
 
---------------------------------------
2- The matrix of the system is
1 1 1 
 
A=  1  2 3 .
2 3 1 

We have

1 1 1 1 1 1
3 4
A = 1 2 3 R 2  R 2  R1 = 0  3 4 = = -9-4 = -13
R  R  2 R 1 3
2 3 1 3 3 1 0 1 3

x
hence A ≠0, and so the system is a Cramer’s system. The solution is X=  y  , where
 
z
 y 
x= x , y= and z= z , with = A and
  

Nasri Cheaito and Fida El Chami

35
 c 2  c 2  c3
0 1 1 0 0 1 
x= 7 2 3 =7 1 3 = (-1) 1 3 (-1) 7 1 = -(28-2) = -26
2 4 1 2 4
2 3 1

c 3  c 3  c1
1 0 1 1 0 0
y= 1 7 3 = 1 7 4 = (-1) 11 1 7 1 = 21-8 = 13
2 2 1 2 2 3 2 4

and
c2  c 2  c1
1 1 0 1 0 0
3 7
z = 1 2 7 = 1  3 7 = (-1) 11 1 = -6-7 = -13
2 3 2 2 1 2 1 2

Therefore
 26 13  13
x= = 2, y = = -1 and z = =1
 13  13  13
 2 
 
and so the solution is X=   1  .
 1 
 
nd
2 method for solving the system : The augmented matrix of the system is
1 1 1  0
 
A = 1  2 3  7
2 3 1  2 

We have
1 1 1  0 1 1 1  0
   
1  2 3  7  R 2  R 2  R1   0  3 4  7 
2 3 
1  2  R 3  R 3  2R 1  0 1 
3  2  R 3  3R 3  R 2

1 1 1  0   1 1  1  0  R1  R1  R 3
   
0  3 4  7  0  3 4  7  R 2  R 2  4R 3 
0 0 13  13  R 3  (1 / 13)R 3  0 0 1  1 

1 1 0  1   1 1 0  1  R1  R1  R 2
  
0  3 0  3  R 2  (1 /  3)R 2   0 1 0   1  
0 0 1  1   
 0 0 1  1 
1 0 0  2   2 
   
 0 1 0   1  , hence x = 2, y = -1 and z = 1, and so the solution is X=   1  .
0 0 1  1   1
   
---------------------------------------
3- The matrix of the system is
 1 1 2m  1
A=  m 1 1  .
 1 m 5 
 
We have

Nasri Cheaito and Fida El Chami

36
 1 1 2m  1 1 1 2m  1
A= m 1 1 R 2  R 2  mR 1 = 0 1  m 1  2m 2  m
1 m 5 R 3  R 3  R1 0 m  1  4  2m R 3  R 3  R 2
1 1 2m  1
= 0 1  m 1  2m 2  m = (1-m)(-2m 2 -m-3) = (m-1)(2m 2 +m+3).
0 0  2m 2  m  3
As the discriminant of 2m 2 +m+3 is = -230, then 2m 2 +m+3≠0, for all m , and so
A = 0  m-1 = 0  m=1.
Therefore the system is a Cramer’s system if and only if m≠1. Thus if m≠1, then the
x  y 
solution of the system is X =  y  , where x= x , y= and z= z , with = A and
    
z
1 1 2m  1 R 1  R 1  R 2 0 0 2m  2 
x= 1 1 1 = 1 1 1
3(m  1) m  5 3(m  1) m  5

= (-1) 1 3 (2m-2) 1 1 = (2m-2)(m-3m-3) = (2m-2)(-2m-3),

3(m  1) m

1 1 2m  1 1 1 2m  1
y = m 1 1 R 2  R 2  mR 1 = 0 1  m  2m 2  m  1
1 3(m  1)  5 R 3  R 3  R1 0 3m  2  4  2m

2
= (-1) 11 1 1  m  2m  m  1 = (1-m)(-4-2m)-(3m+2)(-2m 2 +m+1)
3m  2  4  2m
= (m-1)(2m+4)-(3m+2)(1-m)(1+2m) = (m-1)[2m+4+(3m+2)(2m+1)]
= (m-1)(2m+4+6m 2 +5m+2) = = (m-1)(6m 2 +7m+6)
and
1 1 1 1 1 1
z = m 1 1 R 2  R 2  mR 1 = m  1 0 0 
1 m 3(m  1) 1 m 3(m  1)

= (-1) 21 (m-1) 1 1 = -(m-1)(3m+3-m) = -(m-1)(2m+3)

m 3(m  1)
Therefore
(2m  2)(2m  3) 2(2m  3)  4m  6
x= = = ,
(m  1)(2m  m  3) 2m  m  3 2m 2  m  3
2 2

(m  1)(6m 2  7m  6) 6m 2  7 m  6
y= = ,
(m  1)(2m 2  m  3) 2m 2  m  3
 (m  1)(2m  3)  (2m  3)  2m  3
and z = = =
(m  1)(2m  m  3) 2m  m  3 2m 2  m  3
2 2

and so the solution is

 (4m  6) /( 2m 2  m  3)  4m  6
   
1  
X=  (6m  7m  6) /( 2m  m  3)  =
2 2
6 m 2
 7 m  6 .
  2m 2  m  3   2m  3 

 (2m  3) /( 2m  m  3) 
2
 
 

Nasri Cheaito and Fida El Chami

37
 Remark: As the calculation of  x ,  y and  z takes a lot of time, so please don’t
make this calculation. Also if asked in the exam, the student should not compute
 x ,  y and  z . Thus this exercise should be written as follows:
The matrix of the system is
 1 1 2m  1
A=  m 1 1  .
 1 m 5 
 
We have
1 1 2m  1 1 1 2m  1
A=m 1 1 R 2  R 2  mR 1 = 0 1  m 1  2m 2  m
1 m 5 R 3  R 3  R1 0 m  1  4  2m R 3  R 3  R 2
1 1 2m  1
0 1  m 1  2m 2  m = 1(1-m)(-2m 2 -m-3) = (m-1)(2m 2 +m+3).
0 0  2m 2  m  3
As the discriminant of 2m 2 +m+3 is = -230, then 2m 2 +m+3≠0, for all m , and so
A = 0  m-1 = 0  m=1.
Therefore the system is a Cramer’s system if and only if m≠1. Thus if m≠1, then the
x  y 
solution of the system is X =  y  , where x= x , y= and z= z , with = A and
    
z
1 1 2m  1 1 1 2m  1 1 1 1
x= 1 1 1 , y = m 1 1 and  z = m 1 1 .
3(m  1) m  5 1 3(m  1)  5 1 m 3( m  1)
---------------------------------------
4- The matrix of the system is
m 2 6 
 
A=  2 1 3  .
 1 1 5 
 
We have

m 2 6 R 1  R 1  2 R 3 m  2 0 16
A = 2 1 3 R 2  R 2  R 3 = 1 0 8 = (-1) 3 2 1 m  2 16
1 8
1 1 5 1 1 5

= -[8(m-2)-16] = -(8m-32)
hence
A = 0  -(8m-32) = 0  8m = 32  m = 32/8 = 4.
If m≠4, then A ≠0, and so the system is a Cramer’s system, whence it has a unique
0
solution. As  0  is a solution of this sytem then it is the unique solution.
0
 
If m=4, then the system becomes
4x  2 y  6z  0
(S) :  2x  y  3z  0 .
 x  y  5z  0

Nasri Cheaito and Fida El Chami

38
 The augmented matrix of the system is
 4 2 6  0
 
A =  2 1 3  0
 1 1  5  0
 
We have
 4 2 6  0  4 2 6  0
   
 2 1 3  0  R 2  2R 2  R 1   0 0 0  0  R 2  R 3 
 1 1  5  0  R 3  4R 3  R 1  0 2  26  0 
 4 2 6  0
 
 0 2  26  0  , hence the system is consistent. Here x and y are principal variables
0 0 0 0
 
and z is secondary, so we need to calculate x and y in terms of z. As the system becomes
4x  2 y  6z  0
 2 y  26z  0

then
y = 26z/2 = 13z and x = -(2y+6z)/4 = -(26z+6z)/4 = -32z/4 = -8z
  8z 
 
and so the solutions of the system are the column matrices X=  13z  , with z arbitrary
 z 
 
in .
---------------------------------------
5- The augmented matrix of the system is
 1 2 3  a 
 
A =  1 8 2  b .
 2  6 1  c 
 
We have
 1 2 3  a  1 2 3  a 
   
 1 8 2  b  R 2  R 2  R1   0 10 5  b a  
 2  6 1  
 c  R 3  R 3  2R1  0 10 
5  c  2a  R 3  R 3  R 2

 1 2 3  a 
 
 0 10 5  ba 
0 0 0  c  a  b 

hence the system has solutions if and only if c-b-a=0.
As the system becomes
 x  2 y  a  3z
 10 y  b  a  5z

then
y = (b-a-5z)/-10 = (a-b+5z)/10 and x = a+3z-(a-b+5z)/5 = (4a+b+10z)/5
 (4a  b  10z) / 5 
and so the solutions are the column matrices X=  (a  b  5z) / 10  , with z arbitrary
 
 z 
in .

Nasri Cheaito and Fida El Chami

39
  1 2 3 
 
2 method: The matrix of the system is A=  1 8
nd
2  . Let’s find the rank of A.
 2  6 1 
 
We have
 1 2 3   1 2 3 
   
 1 8 2  R 2  R 2  R1   0 10 5  
 2  6 1  R 3  R 3  2R1  0 10 5  R  R  R
    3 3 2

1 2  3 
  1 2
 0  10 5  , hence rank(A)=2. Consider the minor = = -8-2 = -10. As  is
0 0  1 8
 0 
a non-zero minor of A of order 2 and rank(A)=2, then  is a principal determinant of
the system. The characteristic determinants of the system (there is only one) are
1 2 a
 1 = 1 8 b .
2 6 c
The system has solutions if and only if  1 =0. We have

1 2 a
= (-1) 11 1 10 b  a
1 2 a
 1 = 1 8 b R 2  R 2  R1 = 10 c  2a
0 10 b a
2 6 c R 3  R 3  2R 1
0 10 c  2a
= -10(b-a)+10(c-2a) = 10(-b+a+c-2a) = 10(c-b-a)
hence the system has solutions if and only if c-b-a=0.
x 
The solutions of the system are the column matrices X =  y  , where x= x and
  
z
y
y= , with

a  3z 2
x= = -8(a+3z)-2(b-2z) = -8a-2b-20z
b  2z  8
and
 y = 1 a  3z = b-2z-(a+3z) = b-a-5z
1 b  2z
and so
x = (-8a-2b-20z)/-10 = (4a+b-10z)/10 and y = (b-a-5z)/-10 = (a-b+5z)/10
 (4a  b  10z) / 5 
whence the solutions are the column matrices X=  (a  b  5z) / 10  , with z arbitrary
 
 z 
in .
---------------------------------------
6- Sol vi ngS1 : The matrix of the system is
3 4 2 

A=  1 1 m  .
 2 3 1 
 
We have

Nasri Cheaito and Fida El Chami

40
 
3 4 2 R 1  R 1  3R 2 0 1 2  3m 1 2  3m
A= 1 1 m = 11 m = = (-1) 21 1
1  1  2m
2 3  1 R 3  R 3  2R 2 0 1  1  2 m

= -[-1-2m-2+3m] = -(m-3)
hence
A = 0  m-3 = 0  m=3
and so we have two cases:
case 1: m3. We have A 0, hence the system is a Cramer’s system, and so it has a
x  y 
unique solution =  y  with x= x , y= and z= z , where = A and
    
z
m 4 2 3 m 2 3 4 m
 x = 2 1 m ,  y = 1 2 m and  z = 1 1 2 .
1 3 1 2 1 1 2 3 1
case 2: m=3. The augmented matrix of the system is
 3 4 2  3
 
A =  1 1 3  2 .
2 3 1  1
 
We have
 3 4 2  3 3 4 2  3 
   
 1 1 3  2  R 2  3R 2  R 1   0  1 7  3 


 2 3  1  1  R 3  3R 3  2R 1  0 1  7   3  R 3  R 3  R 2
 3 4 2  3
 
 0  1 7  3  , hence the system is consistent. Here x and y are principal variables and
0 0 00
 
z is secondary. As
3x  4 y  2z  3
  y  7z  3

then
y = -3+7z and x = (3-4y-2z)/3 = (3+12-28z-2z)/3 = (15-30z)/3 = 5-10z
 5  10z 
 
and so the solutions of the system are the column matrices X=   3  7z  , with z
 z 
 
arbitrary in .
Sol vi ngS 2 : The matrix of the system is
1  2 3 
 
A=  1 3 2 .
2 1 m 
 

Nasri Cheaito and Fida El Chami

41
We have

1 2 3 1 2 3
A= 1 3  2 R 2  R 2  R1 = 0 5  5 = (-1) 11 1 5  5
3 m6
2 1 m R 3  R 3  2R 1 0 3 m6

= 5(m-6)+15 = 5m-15.
hence
A = 0  5m-15 = 0  m=3
and so we have two cases:
case 1: m3. We have A 0, hence the system becomes a Cramer’s system, and so it
x  y 
has a unique solution =  y  with x= x , y= and z= z , where = A and
    
z
2 2 3 1 2 3 1 2 2
x= 5 3 2 , y= 1 5 2 and  z = 1 3 5 .
1 1 m 2 1 m 2 1 1
case 2: m=3. The augmented matrix of the system is
1  2 3  2
 
A = 1 3  2  5 .
2 1 3  1 

We have
1  2 3  2 1  2 3  2 
   
 1 3  2  5  R 2  R 2  R1   0 5  5  3  
2 1
 3  1  R 3  R 3  2R 1  0 3  3   3  R 3  5R 3  3R 2

1  2 3  2 
 
0 5 5  3  , hence the system is impossible.
0 0 0   24 
 
Sol vi ngS 3 : The matrix of the system is
m 1 m
A=  1 1 1  .
m 2 2 
 
We have
m 1 m m 1 m
A= 1 1 1 = 1 1 1 = (-1) 31 (m-2) 1 m = (m-2)(1-m)
m 2 2 R 3  2R 2 m  2 0 0  1 1

hence
A = 0  (m-2)(1-m) = 0  m=2 or m=1
and so we have three cases:

Nasri Cheaito and Fida El Chami

42
case 1: m1 and m2. We have A 0, hence the system becomes a Cramer’s system,
x  y 
and so it has a unique solution =  y  with x= x , y= and z= z , where = A
    
z
and
2m 1 m m 2m m m 1 2m
 x = 1 1 1 ,  y = 1 1 1 and  z = 1 1 1 .
m 2 2 m m 2 m 2 m
case 2: m=1. The augmented matrix of the system is
1 1 1  1
A = 1 1 1  1 .
1 2 2  1
 
We have
1 1 1  1 1 1 1  1
1 1 1  1 R  R  R   0 0 0  0  R  R 
1 2 2  1 2 2 1   2 3
  R 3  R 3  R1  0 1 1  0 
1 1 1  1
 0 1 1  0  , hence the system is consistent. In this case x and y are principal variables
 0 0 0  0
 
and z is secondary, and so as the system becomes
x  y  z  1
 yz 0

then
y = -z and x = 1-y-z = 1
 1 
 
and so the solutions of the system are the column matrices X=   z  , with z arbitrary
 z 
 
in .
case 3: m=2. The augmented matrix of the system is
 2 1 2  0
A =1 1 1  1 .
 2 2 2  2
 
We have
 2 1 2  0  2 1 2  0 x
 1 1 1  1  R  2R  R   0 1 0  2  , hence the system has solutions X=  y 
 2 2 2  2 2 2 1 0 0 0  0  
  R 3  R 3  R1   z
with x and y are principal variables and z is secondary. As the system becomes
2x  y  2z  0
 y2

then
y = 2 and x = (-y-2z)/2 = (-2-2z)/2 = -1-z
1 z
and so the solutions of the system are the column matrices X=  2  , with z arbitrary
 z 
 
in .
Sol vi ngS 4 : The matrix of the system is

Nasri Cheaito and Fida El Chami

43
  2m 1  m m 1 

A=  m  2 m 1 m  2  .
 2m 1 m 1 2m 1
 
We have
C1  C1  C 3 
A = 2m 1  m m 1 = m  m m 1 = (-1) 11 m m 1 m  2
m  2 m 1 m  2 0 m 1 m  2 m 1 2m 1
2m 1 m 1 2m 1 0 m 1 2m 1
= m[(m-1)(2m-1)-(m-1)(m-2)] = m(m-1)[2m-1-m+2] = m(m-1)(m+1)
hence
A = 0  m(m-1)(m+1) = 0  m=0 or m=1 or m = -1
and so we have four cases:
case 1: m0, m-1 and m1. We have A 0, hence the system becomes a Cramer’s
x  y 
system, and so it has a unique solution =  y  with x= x , y= and z= z , where
    
z
= A and
m 1  m m 1 2m 1 m 1 m 1 2m 1  m m 1
 x = m m 1 m  2 ,  y = m  2 m m  2 and  z = m  2 m 1 m .
m m 1 2m 1 2m 1 m 2m 1 2m 1 m 1 m
case 2: m=0. The augmented matrix of the system is
 1 0 1  1 
 
A =   2 1  2  0 .
 1 1 1  0 
 
We have
 1 0 1  1  1 0 1  1 
   
  2  1  2  0  R 2  R 2  2R 1   0  1 0   2  
  1  1  1  0  R 3  R 3  R1 0 1 0  1  R3  R3  R2
   
1 0 1  1 
 
 0  1 0   2  , hence the system is impossible.
0 0 0  1 
 
case 3: m=-1. The augmented matrix of the system is
 1 1 0   2 

A =   3  2  3  1 .
  3  2  3  1
 
We have
 1 1 0   2   1 1 0  2 
  
  3  2  3   1  R 2  R 2  3R 1   0  5  3  5  
  3  2  3   1  R 3  R 3  3R 1  0  5  3  5  R3  R3  R2
   
 1 1 0  2 
 
 0  5  3  5  , hence the system is consistent. As the system becomes
 0 0  0 
 0

Nasri Cheaito and Fida El Chami

44
   x  y  2
 5y  3z  5

then
y = (5+3z)/-5 = -1-(3/5)z and x = 2+y = 1-(3/5)z
 1  (3 / 5)z 
 
and so the solutions of the system are the column matrices X=   1  (3 / 5)z  , with z
 z 
 
arbitrary in .
case 4: m=1. The augmented matrix of the system is
 3 1 2  0
 
A =  1 0 1  1 .
 1 1  1 
 0
We have
 3 1 2  0  3 1 2  0
   
 1 0 1  1  R 2  3R 2  R1   0 1 1  3  
 1 
1  1  R 3  3R 3  R1  0 1 
1  3 R 3  R 3 R 2
 0
 3 1 2  0
 
 0 1 1  3  , hence the system is impossible.
0 0  6 
 0
---------------------------------------
7- We have a 3 =a-1, hence
ab = a 3 +a 2 +2a = a-1+a 2 +2a = a 2 +3a-1
and
a 2 b = a 3 +3a 2 -a = a-1+3a 2 -a = 3a 2 -1
and so we have
(2-b)+a+a 2 =0 , -1+(3-b)a+a 2 =0 and –1+(3-b)a 2 =0.
Consider the system
(2-b)x 1 +x 2 +x 3 =0, -x 1 +(3-b)x 2 +x 3 =0, -x 1 +(3-b)x 3 =0.
 1 
 
We have  a  is a non-zero solution of this system, hence the determinant of the
 a2 
 
matrix of this system is zero, and so
2b 1 1
1 3 b 1 =0.
1 0 3 b
But
C 3  C 3  ( 3  b ) C1
2  b 1 1  (3  b)(2  b)
2b 1 1 = 1 3  b 1  (3  b)
1 3  b 1
1 0 3  b 1 0 0

2  b 1 7  5b  b 2
= 1 3  b  2  b
1 0 0 

Nasri Cheaito and Fida El Chami

45
 2
= (-1) 31 (-1)  1 7  5b  b
3 b  2 b
= -[-2+b-(3-b)(7-5b+b 2 )]
= 23+21b+8b 2 -b 3
hence 23+21b+8b 2 -b 3 =0, and so letting
f(x) = 23+21x+8x 2 -x 3
we get that f(x) is a non-zero real polynomial, such that f(b)=0.
---------------------------------------

Nasri Cheaito and Fida El Chami

46
 M1103

SOLVED PROBLEMS

SERIES V

1- Let S be a non-empty set and V be a K-vector space. Let E=V S be the set of all
mappings of S to V. We define on E an addition and a scalar multiplication by:
if f,gE, then
f+g : S 
 V is defined by (f+g)(x) = f(x)+g(x), xS
and if K and fE, then
f : S 
 V is defined by (f)(x) = f(x), xS.
Show that E is a K-vector space under these addition and scalar multiplication, such that
0 E is the zero mapping of S to V, i.e
0E : S  V is defined by 0 E (x) = 0 V , xS.
---------------------------------------
2- Prove that if K' is a subfield of K, then every K-vector space E is a K'-vector space under
the same addition and scalar multiplication of E.
---------------------------------------
3- Let E = 2 . Show that E is not a vector space over under the following addition and
scalar multiplication :
(i) (a,b)+(c,d) = (a , b+d) and (a,b) = (a , b).
(ii) (a,b)+(c,d) = (a+c , b+d) and (a,b) = (a , 0).
(iii) (a,b)+(c,d) = (a+c , b+d) and (a,b) = ( 2 a , b).
(iv) (a,b)+(c,d) = (a+c+1 , b+d) and (a,b) = (a , b).
---------------------------------------
4- Show that W is a subspace of M n (K) over K in the following cases:
(i) W= the set of matrices of M n (K) of trace zero.
(ii) W = the set of symmetric matrices of M n (K).
(iii) W = the set of antisymmetric matrices of M n (K).
(iv) W = the set of upper triangular matrices of M n (K).
(v) W = the set of lower triangular matrices of M n (K).
(vi) W = the set of diagonale matrices of M n (K).
---------------------------------------
3
5- Say if W is or is not a subspace of over in the following cases:
3
(i) W = {(a,b,c) ; a-3b+3c = 0}.
3
(ii) W = {(a,b,c) ; a 2 -c 2 =0 }.
3
(iii) W = {(a,b,c) ; a+b+1= 0 and a+3c=0}.
3
(iv) W = {(a,b,c) ; a+2b-5c = 0 and c0}.
3
(v) W = {(a,b,c) ; a 2 +b 2 +c 2 1}.
---------------------------------------
6- Let I=[0,1] and E= I . Is W a subspace of E over in the following cases?
(i) W = {fE ; f(x) = f(1-x), xI }.
(ii) W = {fE ; f is differentiable and f(1)= f  (0)+1}.

Nasri Cheaito and Fida El Chami

46
 (iii) W = {fE ; f is differentiable at 0 and f  (0)f(0)}.
(iv) W = {fE ; f(1)=0}.
(v) W = {fE ; f(x)0, xI }.
---------------------------------------
7- Show that if F and F’ are two subspaces of a K-vector space E, then FF’ is a subspace
of E over K if and only if one of them is contained into the other.
---------------------------------------
8- Let K n [x] denotes the set of polynomials f(x) of the form
f(x)=a +a x+…+a x n
0 1 n
where a 0 ,a 1 ,…, a n K. Show that K n [x] is a subspace of K[x] over K.
---------------------------------------
9- Let S(n) (resp. A(n)) be the set of symmetric (resp. anti-symmetric) matrices of M n ( ).
Show that M n ( ) = S(n)A(n).
---------------------------------------
10- Let E and F be two K-vector spaces and let
U = {(x,0 F ) ; xE} and V = {(0 E ,x) ; xF}.
Show that U and V are K-subspaces of EF and that EF=UV.
---------------------------------------
11- Let E= and let
F = {fE ; f is constant on } and G = {fE ; f(0)=0}.
a) Show that F and G are two subspaces of E over .
b) Show that if uE, then the mapping g defined on by g(x)=u(x)-u(0), is an element
of G, and deduce that E=FG.
---------------------------------------
12- Given the real matrices A=  1 0  , B=  1 1  and C=  0 1 . Can the real matrix  a 0 
0 0 0 0  0 1 0 a 
be an element of Vect(A, B, C)?
---------------------------------------
13- Find the values of the real number a, so that the vector u=(1,-2,a) of 3 is a linear
combination over of the elements x=(1,1,1) and y=(1,2,3). Give in this case two reals
 and , such that u=x+y.
---------------------------------------
14- Let
U =  ac db  M 2 ( ) ; b  c  3d  0

  
and
V =  ac db  M 2 ( ) ; a+c = 0 and b  3d  .
  
1- Show that U and V are two subspaces of M 2 ( ) over .
2- Find a system of generators of U, V, U+V and UV.
3- Let W=U+V. Is W = UV ? Justify your answer.
---------------------------------------
15- Which of the following sets are system of generators of 3 ?
(i) {(1,1,1), (1,2,3)}; (ii) {(1,1,0), (1,0,1), (0,1,1)}.
--------------------------------------

Nasri Cheaito and Fida El Chami

47
 SOLUTION

1- We need to verify the eight properties of definition 2 :

(1) + associative: Let f,g,hE. xS, We have
[(f+g)+h](x) = (f+g)(x)+h(x) = [f(x)+g(x)]+h(x)
and
[f+(g+h)](x) = f(x)+(g+h)(x) = f(x)+[g(x)+h(x)].
Since f(x),g(x),h(x)V, [f(x)+g(x)]+h(x) = f(x)+[g(x)+h(x)], hence
[(f+g)+h](x) = [(f+g)+h](x), xS
and so (f+g)+h = (f+g)+h, whence + is associative.
(2) + commutative: Let f,gE. xS, we have
(f+g)(x) = f(x)+g(x) = g(x)+f(x) = (g+f)(x)
hence f+g = g+f, and so + is commutative.
(3) + has a neutral element: Let 0 E : S 
 V be the mapping defined by 0 E (x)=0 V
and let fE. xS, we have
(f+0 E )(x) = f(x)+ 0 E (x) = f(x)+ 0 V = f(x)
and
(0 E +f)(x) = 0 E (x)+f(x) = 0 V +f(x) = f(x)
hence f+0 E = 0 E +f = f, and so 0 E is neutral for +.
(4) Every element f of E is invertible for +: Let g : S 
 V be the mapping defined by
g(x)=-(f(x)). xS, we have
(f+g)(x) = f(x)+g(x) = f(x)+(-f(x)) = 0 V = 0 E (x)
and
(g+f)(x) = g(x)+f(x) = -(f(x))+f(x) = 0 V = 0 E (x)
hence f+g = g+f = 0 E , and so f is in(a+b)f = af+bf, for all a,bK and all fE:vertible
for + and its inverse is g.
(5) xS, we have
[(a+b)f](x) = (a+b)(f(x)) = a(f(x))+b(f(x)) = (af)(x)+(bf)(x) = [af+bf](x)
hence (a+b)f = af+bf.
(6) a(f+g) = af+ag, for all aK and all f,gE: xS, we have
[a(f+g)](x)=a[(f+g)(x)]=a[f(x)+g(x)]=a(f(x))+a(g(x))=(af)(x)+(ag)(x)=[af+ag](x)
hence a(f+g) = af+ag.
(7) (ab)f = a(bf), for all a,bK and all fE: xS, we have
[(ab)f](x) = (ab)(f(x)) = a(b(f(x)) = a[(bf)(x)] = [a(bf))](x)
hence (ab)f = a(bf).
(8) 1K f  f , all f  E : xS, we have
(1 K f)(x) = 1 K (f(x)) = f(x)
hence 1 K f=f.
Therefore E is a vector space over K.
---------------------------------------
2- Recall that K' is a subfield of K if and only if
1 K K' , (x-y)K' and xy-1K', xK' and yK'-{0 K }.
The laws defined on E are f : EE   E and g : K’E   E, where f(x,y)=x+y and
g(,x)=x.
Since f is the addition of E, E is an abelian additive group. Let a,bK’ and x,yE. As
a,bK, then
Nasri Cheaito and Fida El Chami
48
 (i) (a+b)x = ax+bx
(ii) a(x+y) = ax+ay
(iii) a(bx) = (ab)x
(iv) 1 K ' x =1 K x = x (since 1 K ' =1 K )
hence E is a K'-vector space.
---------------------------------------
3- (i) Assume that E is a vector space over , then
(1,1)+(1,1) = 2(1,1)
But (1,1)+(1,1) = (1,1+1) and 2(1,1) = (2,2), hence (1,2)=(2,2), which is impossible.
Therefore E is not a vector space over .
(ii) Assume that E is a vector space over , then
(1,1)+(1,1) = 2(1,1)
But (1,1)+(1,1) = (1+1 , 1+1) and 2(1,1) = (21 , 0) = (2,0), hence (2,2)=(2,0), which
is impossible. Therefore E is not a vector space over .
(iii) Assume that E is a vector space over , then
(1,1)+(1,1) = 2(1,1)
But (1,1)+(1,1) = (1+1,1+1) and 2(1,1) = (2 2 1 , 21) = (4,2), hence (2,2)=(4,2),
which is mpossible. Therefore E is not a vector space over .
(iv) Assume that E is a vector space over , then
(1,1)+(1,1) = 2(1,1)
But (1,1)+(1,1) = (1+1+1,1+1) = (3,2) and 2(1,1) = (2,2), hence (3,2)=(2,2), which is
mpossible. Therefore E is not a vector space over .
---------------------------------------
4- (i) We have tr(0)=0, hence 0W, and so W. Let X,YW and aK, then tr(X)=0
and tr(Y)=0, hence
tr(X+Y)=tr(X)+tr(Y)=0+0=0
and
tr(aX)=atr(X)=a0=0
and so X+YW and aXW, whence W is a subspace of M n (K).
(ii) We have t 0 = 0, hence 0W, and so W. Let X,YW and aK, then t X = X and
t Y = Y, hence
t ( X  Y) = t X + t Y = X+Y and t aX =at X =aX
and so X+YW and aXW, whence W is a subspace of M n (K).
(iii) We have t 0 =0= -0, hence 0W, and so W. Let X,YW and aK, then t X = -X
and t Y = -Y, hence
t (XY) = t X + t Y = -X+(-Y)= -(X+Y) and t aX =at X =a(-X) = -(aX)
and so X+YW and aXW, whence W is a subspace of M n (K).
(iv) Set 0 =(b ij ). As b ij = 0, ij, then 0W, and so W. Let X,YW and aK. Set
X =(x ij ), Y=(y ij ), X+Y=(c ij ) and aX=(d ij ), then
x ij = 0 and y ij = 0, ij
hence ij, we have
c ij = x ij + y ij =0+0=0 and d ij = ax ij = a0 =0
and so X+YW and aXW, whence W is a subspace of M n (K).
(v) Set 0 =(b ij ). As b ij = 0, ij, then 0W, and so W. Let X,YW and aK. Set

Nasri Cheaito and Fida El Chami

49
 X =(x ij ), Y=(y ij ), X+Y=(c ij ) and aX=(d ij ), then
x ij = 0 and y ij = 0, ij
hence ij, we have
c ij = x ij + y ij =0+0=0 and d ij = ax ij = a0 =0
and so X+YW and aXW, whence W is a subspace of M n (K).
(vi) Set 0=(b ij ). As b ij = 0, ij, then 0W, and so W. Let X,YW and aK. Set
X =(x ij ), Y=(y ij ), X+Y=(c ij ) and aX=(d ij ), then
x ij = 0 and y ij = 0, ij
hence ij, we have
c ij = x ij + y ij =0+0=0 and d ij = ax ij = a0 =0
and so X+YW and aXW, whence W is a subspace of M n (K).
---------------------------------------
5- (i) we have 0-30+30=0, hence (0,0,0)W, and so
W.
Let x=(a,b,c)W and x’=(a’,b’,c’)W and K, then
x+x’ = (a+a’ , b+b’ , c+c’) and x = (a , b , c).
But a-3b+3c = 0 and a’-3b’+3c’ = 0, hence
(a+a’)-3(b+b’)+3(c+c’) = a-3b+3c+ a’-3b’+3c’ = 0+0 = 0
and
a-3b+3(c) = (a-3b+3c) = 0 = 0
3
and so x+x’W and xW, whence W is a subspace of over .
3
(ii) Assume that W is a subspace of over , then as (1,0,1)W, and (1,0,-1)W,
we obtain that (1,0,1)+(1,0,-1)W, hence (2,0,0)W, and so (2) 2 -(0) 2 = 0, which
3
impossible. Therefore W is not a subspace of over .
3
(iii) Assume that W is a subspace of over , then as (0,0,0)W, and so 0+0+1=0,
3
impossible. Therefore W is not a subspace of over .
3
(iv) Assume that W is a subspace of over , then as (5,0,1)W, then we get that
-(5,0,1)W, and so (-5,0,-1)W, which gives that -10, impossible. Therefore W is
3
not a subspace of over .
3
(v) Assume that W is a subspace of over , then as (1,0,0)W, then 2(1,0,0)W,
and so (2,0,0)W, whence (2) 2 +(0) 2 +(0) 2 1, which impossible. Therefore W is not
3
a subspace of over .
---------------------------------------
6- (i) We have 0 E (x)=0=0 E (1-x), xI, hence 0 E W, and so
W.
Let f,gW and  , then f(x)=f(1-x) and g(x)=g(1-x), xI, hence
(f+g)(x) = f(x)+g(x) = f(1-x)+g(1-x) = (f+g)(1-x), xI
and
(f)(x) = (f(x)) = (f(1-x)) = (f)(1-x), xI
and so f+gW and fW, whence W is a subspace of E over .
(ii) Assume that W is a subspace of E over , then 0 E W, and so 0 E (1) = 0E (0)+1,
Whence 0 = 0+1, which is impossible. Therefore W is not a subspace of E over .

Nasri Cheaito and Fida El Chami

50
 (iii) Suppose that W is a subspace of E over . Consider the mapping f of I to
defined by f(x) = -x. As f is differentiable at 0 and f  (0) = -1 and f(0) = 0, then
fW. Put g = -f, then gW, and so g  (0)g(0), whence 10, which is impossible.
Therefore W is not a subspace of E over .
(iv) We have 0 E (1)=0, hence 0 E W, and so
W.
Let f,gW and  , then f(1)=0 and g(1)=0, hence
(f+g)(1) = f(1)+g(1) = 0+0 = 0
and
(f)(1) = (f(1)) = 0 = 0
and so f+gW and fW, whence W is a subspace of E over .
(v) Assume that W is a subspace of E over , then 0 E W, hence 0 E (1)0, which is
impossible, for 0 E (1)=0. Therefore W is not a subspace of E over .
---------------------------------------
7- N.C: Suppose that none of F and F’ is contained into the other, then FF’ and F’F, and
so
x, such that xF’ and xF
and
y, such that yF and yF’.
Put z = x+y, then zF or zF’. If zF, then z-yF, and so xF, which is impossible.
Therefore zF’, and so as xF’, we get z-xF’, whence yF’, a contradiction. Thus
S.C: If FF’, then FF’= F’, and so FF’ is a subspace of E. Also if F’F, then
FF’= F, and so FF’ is a subspace of E.
---------------------------------------
8- We have 0= 0+0x+…+0x n , hence 0K n [x], and so K n [x]. Let f(x),g(x)K n [x] and
K. Then
n
a 0 ,a 1 ,…, a n K, such that f(x)=a 0 +a 1 x+…+a n x
and
n
b 0 ,b 1 ,…, b n K, such that g(x)=b 0 +b 1 x+…+b n x .
We have
f(x)+g(x)=(a 0 + b 0 )+(a +b )x+…+(a +b )x n
1 1 n n
and
f(x)=(a 0 )+(a 1 )x+…+(a n )x n
hence f(x)+g(x)K n [x] and f(x)K n [x], and so K n [x] is a subspace of K[x] over K.
---------------------------------------
9- Let XM n ( ). We have

= t X  t =  t X  t t  = t X  X =
1 1 1 X t X
t Xt
 X  2 X 2 X 2 2
 
 2 
and
 Xt X 
t Xt
  2
1
X
1
2
 1

= t X  t  = t X t t X  = t X  X = 



 X  2  2 
 2 
hence

Nasri Cheaito and Fida El Chami

51
 X t X X t X
S(n) and A(n).
2 2
X t X X t X
As + = X, then XS(n)+A(n) and so
2 2
M n ( )=S(n)+A(n).
Let XS(n)A(n), then XS(n) and XA(n), and so t X = X and t X = -X. It follows
that X=-X, hence 2X=0. Put X=(a ij ), then 2a ij = 0, i and j, and so a ij =0, i and j,
whence X=0. Therefore S(n)A(n)={0}, and so M n ( )=S(n)A(n).
---------------------------------------
10- U subspace: We have 0 E E, hence (0 E ,0 F )U, and so U. Let x,yU and K,
then a,bE, such that
x=(a,0 F ) and y=(b,0 F ).
As x+y=(a+b , 0 F ) and x=(a , 0 F ) and a+bE and aE, then
x+yU and xU
hence U is a subspace of EF over K.
V subspace: We have 0 F F, hence (0 E ,0 F )V, and so V. Let x,yV and K,
then a,bF, such that
x=(0 E ,a) and y=(0 E ,b).
As x+y=(0 E , a+b) and x=(0 E , a) and a+bF and aF, then
x+yV and xV
hence V is a subspace of EF over K.
Let xEF, then there exist aE and bF, such that x=(a,b). We have
x=(a,0 F )+(0 E ,b)
hence xU+V, because (a,0 F )U and (0 E ,b)V, and so
EF=U+V.
Let xUV, then xU and xV, hence there exist aE and bF, such that
x=(a,0 F ) and x=(0 E ,b)
We have (a,0 F )=(0 E ,b), hence a=0 E , and so x=(0 E , 0 F ). Therefore UV={0}, and so
EF= UV.
---------------------------------------
11- Let E= and let
F = {fE ; f is constant on } and G = {fE ; f(0)=0}.
a) F subspace of E: We have 0 E (x)=0, for all x , hence 0 E W, and so
W.
Let f,gW and  , then
a,b , such that f(x)=a and g(x)=b, for all x .
As for all x , we have
(f+g)(x) = f(x)+g(x) = a+b
and
(f)(x) = (f(x)) = a
then f+gW and fW, and so W is a subspace of E over .
G subspace of E: We have 0 E (0)=0, hence 0 E W, and so
W.
Let f,gW and  , then f(0)=0 and g(0)=0, hence
(f+g)(0) = f(0)+g(0) = 0+0 = 0

Nasri Cheaito and Fida El Chami

52
 and
(f)(0) = (f(0)) = 0 = 0
and so f+gW and fW, whence W is a subspace of E over .
b) As g(0) = u(0)-u(0) = 0, then gG.
Let uE. We have u(x) = u(0)+u(x)-u(0), so that if f and g sre the functions defined
on by f(x) = u(0) and g(x)=u(x)-u(0), then fF and gG. But u = f+g, because
u(x) = f(x)+g(x) = (f+g)(x), for all x , hence
E = F+G.
Let uFG, then uF and uG, and so a , such that u(x)=a, for all x . But
u(0) = 0, since uG, hence a=0, and so u(x)=0, for all x , whence u=0 E .
Therefore FG={0 E }, and so E=FG.
---------------------------------------
12- We have that  a 0  Vect(A, B, C) if ,, , such that
0 a 
 a 0  = A+B+C.
0 a 
 

We have
 a 0  = A+B+C   a 0  =   1 0  +  1 1  +  0 1
0 a  0 a  0 0 0 0  0 1
        
     
  a 0  = 
 0 a   0  
 a = +, + = 0 and  = a
  = a,  = -a and  = a- = 2a.
Therefore as
2a  1 0  -a  1 1  +a  0 1 = a 0
0 0   0 0   0 1 0
 a 
then  a0  Vect(A, B, C).
0 a 
---------------------------------------
13- We have u = (1,-2,a) is a linear combination over of the elements x = (1,1,1) and
y = (1,2,3), so that there exist b,c , such that u=bx+cy. But
u=bx+cy  (1,-2,a) = b(1,1,1)+c(1,2,3)
 (1,-2,a) = (b+c, b+2c, b+3c)
 b+c = 1 , b+2c = -2 and b+3c = a
 (b+2c)-(b+c) = -3, b+c = 1 and a = b+3c
 c = -3, b = 1-c = 1+3 = 4 and a = b+3c = 4-9 = -5
hence u is a linear combination of x and y over if and only if a = -5.
For  = 4 and  = -3, we have u = x+y.
---------------------------------------
14- 1- U subspace: We have  0 0  U, for 0-0+30=0, hence U. Let x=  a b  U
 c d
 0 0  
and x’=  ac'' db''  U and  , then
 
b-c+3d=0 and b’-c’+3d’=0.
We have x+x’=  ac  a ' b  b'  and x=  a b  and as
  c d 
 c' d  d ' 
  
(b+b’)-(c+c’)+3(d+d’) = b-c+3d+b’-c’+3d’ = 0+0 = 0

Nasri Cheaito and Fida El Chami

53
 and
b-c+3d = (b-c+3d) = 0 = 0
then x+x’U and xU, hence U is a subspace of M 2 ( ) over .
2nd method: We have
x=  ac db  U  b-c+3d=0  b = c-3d
 

 x =  a c  3d  =  a0 0  +  0 c  +  0  3d 
 c d   0   c 0  0 d 

 x = a  10 0  +c  0 1  +d  0  3 
 0  1 0   0 1 

so that as  10 0  ,  0 1  and  0  3  are elements of U, then

 0  1 0 0 1 

U = Vect(  10 0  ,  0 1  ,  0  3  )
 0  1 0  0 1 
and hence U is a subspace of M 2 ( ) over .
V subspace: We have that  0 0  V, for 0+0=0 and 0=3×0, hence V. Let

 0 0
x=  ac db  V and x’=  ac'' db''  V and  , then
   
a+c=0, b=3d, a’+c’=0 and b’=3d’.
We have x+x’=  c  c' d  db''  and x=  
a  a ' b  a b  and as

   c d 

(a+a’)+(c+c’) = a+c+a’+c’ = 0+0 = 0 and b+b’=3d+3d’=3(d+d’)
and
a+c = (a+c) = 0 = 0 and b=(3d)=3(d)
then x+x’V and xV, and so V is a subspace of M 2 ( ) over .
2nd method: We have
x=  ac db  V  a+c=0 and b=3d  c=-a and b=3d
 
 a 3d   a 0   0 3d   1 0   0 3
 x=  =  +0 d  = a  +d  
  a d    a 0     1 0  0 1
 1 0  0 3
so that as   and  0 1  are elements of V, then
  1 0   
 1 0   0 3
V = Vect(  ,  )
  1 0  0 1
and hence V is a subspace of M 2 ( ) over .

2- As U = Vect(  10 0  ,  0 1  ,  0  3  ) and V = Vect(  1 0  ,  0 3  ), then

 0  1 0  0 1    1 0  0 1
1  ,  0  3  is a system of generators of U over
 1 0  ,  0
  0   0 1 
 0 0   1

and
 1 0   0 3 
  1 0  ,  0 1  is a system of generators of V over .
   
By 5.4.5, we have that

Nasri Cheaito and Fida El Chami

54
  1 0  ,  0 1  ,  0  3  ,  1 0  ,  0 3 
 0 0   1 0       
     0 1    1 0   0 1 
is a system of generators of U+V over .
System of generators of UV: We have
x=  ac db  UV  xU and xV a+c=0, b=3d and b-c+3d=0
 
 b = 3d, c = b+3d = 6d and a = -c = -6d
  6d 3d    6 3
x=   = d 
 6d d   6 1
hence
  6 3 
  is a system of generators of UV.
 6 1 
3- No, W is not equal to UV, because if W = UV, then UV={0}, which is
  6 3
impossible, since   UV.
 6 1
---------------------------------------
15- (i) Let x=(,,) be an element of 3 . We shall see if we can find a and b in , such
that x=a(1,1,1)+b(1,2,3). We have
x=a(1,1,1)+b(1,2,3)  (,,)=(a+b, a+2b, a+3b)
 a+b=, a+2b= and a+3b=
 b = a+2b-(a+b) = -, a = -b = 2- and  = a+3b
  = 2-+3(-)
  = 2-.
For =1 and =1 and =2, we have ≠2-, hence if x=(1,1,2), then we cannot find
a,b in , such that x=a(1,1,1)+b(1,2,3), and so {(1,1,1), (1,2,3)} is not a system of
3
generators of over .
(ii) Let x=(,,) be an element of 3 . We shall see if we can find a, b and c in , such
that x=a(1,1,0)+b(1,0,1)+c(0,1,1). We have
x=a(1,1,0)+b(1,0,1)+c(0,1,1)  (,,) = (a+b, a+c, b+c)
 a+b=, a+c= and b+c=
 + = 2a+b+c, + = a+c+2b and +=a+b+2c
 + = 2a+, + = +2b and +=+2c
 a=(+-)/2, b=(-+)/2 and c=(-++)/2
Therefore as for a=(+-)/2, b=(-+)/2 and c=(-++)/2, we have
a(1,1,0)+b(1,0,1)+c(0,1,1)=x
then a,b,c , such that x= a(1,1,0)+b(1,0,1)+c(0,1,1), and so
3
{(1,1,0), (1,0,1), (0,1,1)} is a system of generators of over .
---------------------------------------

Nasri Cheaito and Fida El Chami

55
 M1103

SOLVED PROBLEMS

SERIES VI

1- Say if the following elements of the real space E are linearly independent or linearly
dependent over in the following cases:
3
(i) u = (2,1,4), v = (1,-3,2), w=(3,-2,6) and z=(3,3,3) and E = .
(ii) u = (2,1,4) and v = (3,3,3) and E = 3 .
 2 2 0  4 2 1 8 2 1
(iii) u =  , v =   and w =   and E=M 2,3 ( ).
 3 5 1  1 1 1  5 11 3 
---------------------------------------
2- Precise if the family (x 1 , x 2 , x 3 , x 4 ) is free over or not, where
x 1 = (1, -1, 3), x 2 = (2, 1, 4), x 3 = (1, 2, 1) and x 4 = (3, 1, 2).
---------------------------------------
3- In the following cases find a basis of the subspace W=Vect(x 1 , x 2 , x 3 ) and
complete it to a basis of E:
3
(i) x 1 = (2,1,4), x 2 = (1,-3,2) and x 3 = (3,-2,6) and E= .
5 1  0 0
 , x 2 =  0 0  , x 3 = 1 6  and E=M 2 ( ).
(ii) x 1 =  1 1
 1 1     
---------------------------------------
4- Let u=(0,1,1), v=(1,0,1) and w=(1,1,0) be three elements of 3 .
3
1- Show that {u, v, w} is a basis of over .
2- Find the components of the element x = (1,1,1) relative to this basis.
---------------------------------------
3 3
5- (i) Find a subset of which is free over but is not a system of generators of .
3
(ii) Find a system of generators of which is not free over .
---------------------------------------
6- Find the values of the real number m, under which the subset
S={(1, 0, 0), (0, m, -1), (0, 1, m)}
3
of is free over .
---------------------------------------
7- Find following the values of the real  the rank of S=(u,v,w) , where
u=(,1,1), v=(1,,1) and w=(1,1,).
---------------------------------------
3 1   1 5 
8- Let A =  1 2  , B =   and C =  .
 2 1  2 2   4 0 
(a) Show that A, B and C are linearly independent over .
(b) Find a basis of the subspace of M 2 ( ) generated by A, B and C.
---------------------------------------
3 3
9- Let U = {(a,b,c) ; 3a+2b+c=0} and V={(a,b,c) ; a+5b-7c=0}.
3
1- Show that U and V are subspaces of and find bases and dimensions of U and V.
3
2- Determine UV and deduce the dimension of U+V. Deduce that U+V= .

Nasri Cheaito and Fida El Chami

56
 ---------------------------------------
10- Let U = {(a, 3b, a+2b) ; a,b } and V={(c, c+2d, c-d) ; c,d }.
1- Show that U and V are subspaces of 3 and give a basis of U and a basis of V.
2- Find the dimension of U+V and deduce the dimension and a basis of UV.
---------------------------------------
11- Let U =Vect(u 1 ,u 2 ,u 3 ) and V=Vect(v 1 ,v 2 ), where
u 1 = (1,-1,0,2), u 2 = (2,1,3,1), u 3 = (4,5,9,-1), v 1 = (3,2,2,-2) and v 2 = (3,-4,4,2).
Compute a bases of U, V and U+V and deduce the dimension of UV.
---------------------------------------
12- Let U = {f(x)=ax 3 +bx 2 +cx+d 3 [x] ; a=c and d=-2b } and
3 2
V = {f(x)=ax +bx +cx+d 3 [x] ; c=d}.
1- Show that U and V are two subspaces of 3 [x] over .
2- Find a bases of U, V, U+V and UV and find their dimensions. Is 3 [x]=U+V?
---------------------------------------

13- Let U=  a a  ; a,c
 and V=  a  a  ; a,d .
   
  c 0    a d  
1- Show that U and V are two subspaces of M 2 ( ) over .
2- Compute the dimensions of U, V, U+V and UV. Is U+V a direct sum?
---------------------------------------
2 2
14- Find a basis of over and calculate dim ( ).
---------------------------------------
2 2 4 2 3 4
15- Let E= 4 [x], f 1 =x+x , f 2 =1+x+x +x and f 3 =2-x+2x -3x +2x .
1- Find a basis B of F=Vect(f 1 , f 2 , f 3 ) over .
2- Complete B to a basis of E and deduce a supplement of F in E.
---------------------------------------
16- Let E be a finite dimensional K-vector space of dimension n1 and let F be a subspace
of E of dimension n-1. Show that if xE-F, then E=FVect(x).
---------------------------------------
17- Show that W={(x,y,z) 3 ; x-iy+2iz=0} is a subspace of 3 over and find a basis
of it over and a basis over .
---------------------------------------
18- Given the real matrix
 1 1 2 1 0
 
A=   1 0 0 2 1  .
 1 2 4 4 1
 2 3 1 0 1
Find a non-zero minor of A of order r = rank(A) and deduce a basis of the row space of
A and a basis of the column space of A.
---------------------------------------

Nasri Cheaito and Fida El Chami

57
 SOLUTION

1- (i) Let a,b,c,d , then

au+bv+cw+dz = 0  (2a+b+3c+3d, a-3b-2c+3d, 4a+2b+6c+3d) = (0,0,0,0)
2 1 3 3  0
 2a  b  3c  3d  0
  
  a  3b  2c  3d  0   1  3  2 3  0  R 2  2R 2  R 1

4a  2b  6c  3d  0 4 2 6 3  0  R 3  R 3  2R 1

2 1 3  0 
 3 2a  b  3c  3d  0
 0  7 7 3  0  R 2  2R 2  R 1    7b  7c  3d  0
0 0 0  3  0  R 3  R 3  2R 1   3d  0

 d0 
 d0
   7 b  7c  0   b  c
2a  b  3c  0 
a  (b  3c) / 2  2c / 2  c
For c = 1, a = -1, b = -1 and d = 0, we have a, b, c and d are not all of them zero and
au+bv+cw+dz = 0, hence u, v, w, z are linearly dependent over .
3
2nd method: As dim ( ) = 3, then u, v, w, z are linearly dependent over , by
6.3.2.
(ii) Let a,b,c , then
au+bv = 0  a(2,1,4)+b(3,3,3)=(0,0,0)  (2a+3b, a+3b, 4a+3b) = (0,0,0)
 2a+3b=0, a+3b=0 and 4a+3b=0  2a+3b-(a+3b)=0 and a+3b=0
 a=0 and a+3b=0  a=0 and 3b=0  a=0 and b=0
hence u, v are linearly independent over .
2nd method: We have u = 2e 1 +e 2 +4e 3 and v = 3e 1 +3e 2 +3e 3 , hence consider the
matrix
A=  2 1 4  .
 3 3 3
We have
 2 1 4   2 1 4  , which is a row echelon form of A, hence
 3 3 3  R  2R  3R  
  2 2 1 0 3  6 
rank(A) = 2, and so u, v are linearly independent over , by 6.4.3.1(i).
(iii) Let a,b,c , then
 2  2 0   4 2 1  8  2 1   0 0 0 
au+bv+cw = 0  a   +b   +c  = 
 3 5 1   1 1 1  5 11 3   0 0 0 
  2a  4b  8c  2a  2b  2c b  c  =  0 0 0 
 3a  b  5c 5a  b  11c a  b  3c   0 0 0 
 2a+4b+8c = 0, -2a+2b-2c = 0, b+c = 0,
3a-b+5c = 0, 5a+b+11c = 0 and a+b+3c = 0
 b = -c, a = -b-3c = -2c, 2a+4b+8c = -4c-4c+8c = 0,
-2a+2b-2c = 4c-2c-2c = 0, 3a-b+5c = -6c+c+5c = 0 and
5a+b+11c = -10c-c+11c = 0
 a = -2c and b = -c
For c = -1, we get a = 2 and b = 1, and so a, b and c are not all of them zero and
au+bv+cw = 0, hence u, v, w are linearly dependent over .
2nd method: We have that
u = 2E 11 -2E 12 +3E 21 +5E 22 +E 23 ,
v = 4E 11 +2E 12 +E 13 -E 21 +E 22 +E 23

Nasri Cheaito and Fida El Chami

58
 and
w = 8E 11 -2E 12 +E 13 +5E 21 +11E 22 +3E 23
hence consider the matrix
 2  2 0 3 5 1
 
A=  4 2 1  1 1 1  .
 8  2 1 5 11 3 
 
We have
 2  2 0 3 5 1
 
 4 2 1  1 1 1 R 2  R 2  2R 1 
 8  2 1 5 11 3  R 3  R 3  4R 1
 
2  2 0 3 5 1  2  2 0 3 5 1 
   
0 6 1  7  9 1    0 6 1  7  9  1  , which
0 6 1  7  9 1  R3  R3  R2 0 0 0 0 0 
   0
is a row echelon form of A, hence rank(A)≠3, and so u, v, w are linearly dependent
over , by 6.4.3.1(ii).
---------------------------------------
3
2- As dim ( ) = 3, then x 1 , x 2 , x 3 , x 4 are linearly dependent over , by 6.3.2,
and so the family (x 1 , x 2 , x 3 , x 4 ) is not free over .
nd
2 method: Let a,b,c,d , then
ax 1 , +bx 2 +cx 3 +dx 4 = 0  (a+2b+c+3d, -a+b+2c+d, 3a+4b+c+2d) = (0,0,0,0)
 a  2b  c  3d  0  1 2 1 3  0
 
   a  b  2c  d  0    1 1 2 1  0  R 2  R 2  R 1
3a  4b  c  2d  0 3 4 1 2  0 R 3  R 3  3R 1
 
1 2 1 3  0  1 2 1 3  0
  
 0 3 3 4  0   0 3 3 4  0
 0  2  2  7  0  R  3R  2R  0 0 0  13  0 
  3 3 2  
a  2b  c  3d  0
  d0 
 d0
  3b  3c  4d  0   3b  3c  0   b  c

  13d  0 a  2b  c  0 
a  2b  c  2c  c  c
For c = 1, a = 1, b = -1 and d = 0, we have a, b, c and d are not all of them zero and
au+bv+cw+dz = 0, hence the family (x 1 , x 2 , x 3 , x 4 ) is not free over .
---------------------------------------
3- (i) As x 1 =2e 1 +e 2 +4e 3 , x 2 =e 1 -3e 2 +2e 3 and x 3 =3e 1 -2e 2 +6e 3 , then consider the
matrix
 2 1 4
 
A=  1  3 2  .
 3  2 6
 
We have
 2 1 4 2 1 4 2 1 4
     
 1  3 2  R 2  2R 2  R 1   0  7 0  0  7 0  . which
 3  2 6  R 3  2R 3  3R 1  0  7 0  R 3  R 3  R 2  0 0 0

is a row echelon form of A, hence
{(2,1,4),(0,-7,0)} is a basis of W over .

Nasri Cheaito and Fida El Chami

59
 by 6.4.3(i), and so dim (W)=2.
Consider the matrix
2 1 4
 
B=  0  7 0 .
0 0 1
 
3
We have B is a matrix in row echelon form, hence rank(B)=3=dim ( ), and so
{(2,1,4),(0,-7,0),(0,0,1)}
is a basis of 3 over , completing the obtained basis of W, by 6.4.3(iv).
(ii) We have x 1 = 5E 11 +E 12 +E 21 -E 22 , x 2 = 0 and x 3 = E 11 +E 12 +E 21 +6E 22 , hence
consider the matrix
5 1 1 1 
 
A=  0 0 0 0  .
1 1 1 6 
 
We have
5 1 1 1  5 1 1 1  5 1 1 1 
     
 0 0 0 0  R 2  R 3   1 1 1 6  R 2  R 2  5R 1   0  4  4 11  ,
1 1 1 6  0 0 0 0  0 0 0 
     0
which is a row echelon form of A, hence
 5 1   0  4 
 1 1  ,   4 11  is a basis of W over
   
by 6.4.3(i), and so dim (W)=2.
Consider the matrix
5 1 1  1
 
B=  0  4 4 .11
0 0 1  0
0 0 
 0  1
We have B is a matrix in row echelon form, hence rank(B)=4=dim (M 2 ( )), and
so
 5 1   0  4   0 0   0 0 
 1 1  ,   4 11  ,  1 0  ,  0 1 
       
is a basis of M 2 ( ) over , completing the obtained basis of W, by 6.4.3(iv).
---------------------------------------
4- 1- As u = e 2 +4e 3 , v = e 1 +e 3 and w = e 1 +e 2 , then consider the matrix
0 1 1
A=  1 0 1  .
1 1 0
 
We have
 0 1 1  R1  R 2 1 0 1 1 0 1 
1 0 1  0 1 1   0 1 1  
1 1 0 1 1 0  1 
    R 3  R 3  R1  0 1  R3  R3  R2
1 0 1 
 0 1 1  , which is a row echelon form of A, hence rank(A)=3, and so
 0 0  2 
 

Nasri Cheaito and Fida El Chami

60
 {u, v, w} is a basis of 3 over , by 6.4.3(iv).
2- Components of x: Let a, b and c be the components of x relative to this basis, then
x = au+bv+cw.
But
x = au+bv+cw  (1,1,1) = (b+c, a+c, a+b)  b+c = 1 , a+c = 1 and a+b = 1
 a+b+2c = 2, a+2b+c = 2 and 2a+b+c = 2
 1+2c = 2, 1+2b = 2 and 2a+1 = 2
 2c = 1, 2b = 1 and 2a = 1
 c = 1/2, b = 1/2 and a = 1/2.
Therefore the components of u are 1/2, 1/2 and 1/2.
---------------------------------------
3
5- (i) {(1,0,0)} is a free subset over but is not a system of generators of , because:
As (1,0,0)≠(0,0,0), then (1,0,0) is linearly independent over , and so
{(1,0,0)} is a free subset over .
3
If {(1,0,0)} is a system of generators of of over , then it becomes a basis of of
3 3
over , and so dim ( ) = 1, which is impossible. Therefore {(1,0,0)} is not
3
a system of generators of of over .
3
(ii) As {(1,0,0), (0,1,0), (0,0,1)} is a system of generators of of over , then
3
S={(1,0,0), (0,1,0), (0,0,1), (1,1,2)} is a system of generators of of over .
3
We have dim ( ) = 3, hence (1,0,0), (0,1,0), (0,0,1), (1,1,2) are linearly
dependent over , by 6.3.2, and so S is not free over .
---------------------------------------
6- As (1, 0, 0) = e 1 , (0, m, 1) = me 2 -e 3 and (0, 1, m) = e 2 +me 3 , then consider the
matrix
1 0 0 
A=  0 m 1  .
0 1 m
 
We have
1 0 0 
A = 0 m 1 = m 1 = m 2 -1
0 1 m 1 m

hence
A = 0  m 2 -1= 0  m = -1 or m=1.
Therefore the elements of S are linearly independent over if and only if m≠-1 and
m≠1, and so S is free over if and only if m≠-1 and m≠1.
---------------------------------------
7- As u = e 1 +e 2 +e 3 , v = e 1 +e 2 +e 3 and w = e 1 +e 2 +e 3 , then consider the matrix
 1 1 
A=  1  1  .
 1 1 
 
We have
c1  c1  c 2  c 3
2 1 1 2 1 1
A =  1 1 =   2  1 R 2  R 2  R1 = 0   1 0
1  1   2 1  R 3  R 3  R1 0 0  1
1 1 

Nasri Cheaito and Fida El Chami

61
 = (+2)(-1)(-1)
hence
A = 0  (+2)(-1)(-1) = 0  +2 = 0 or -1 = 0   = -2 or  = 1..
If ≠-2 and ≠1, then rank(A) = 3, and so rank(S) = 3.
If  = -2, then
 2 1 1 
 
A=  1  2 1 .
 1 1  2 

We have
 2 1 1   2 1 1 
   
 1 2 1  R 2  2R 2  R 1   0  3 3  
 1 1 2  R 3  2R 3  R 1  0 3 3  R3  R3  R2
   
 2 1 1
 
 0  3 3  , which is a row echelon form of A, hence rank(A) = 2, and so
 0 0 0 

rank(S) = 2.
 1 1 1
If  = 1, then A= 1 1 1 . We have
 1 1 1
 
 1 1 1 1 1 1
1 1 1 R  R  R   0 0 0  , which is a row echelon form of A, hence
 1 1 1 2 2 1  
  R 3  R 3  R1  0 0 0 
rank(A) = 1, and so rank(S) = 1.
Therefore rank(S) = 3 if ≠-2 and ≠1, rank(S) = 2 if  = -2 and rank(S) = 1 if  = 1.
---------------------------------------
8- (a) As A=E 11 +2E 12 +2E 21 +E 22 , B=3E 11 -E 12 +2E 21 +2E 22 and C=E 11 -5E 12 -4E 21 ,
then consider the matrix
1 2 2 1
 
D=  3  1 2 2 .
1  5  4 0
 
We have
1 2 2 1 1 2 2 1 
   
 3  1 2 2  R 2  R 2  3R 1   0  7  4  1 
 R R R 0  7  6 1  R  R  R

 1  5  4 0  3 3 1   3 3 2
1 2 2 1 
 
 0  7  4  1  , which is a row echelon form of D, hence rank(D) = 3, and so A,
0 0  2 0 
B and C are linearly independent over .
(b) As A, B and C are linearly independent over , then {A, B, C} is a basis of the
subspace of M 2 ( ) generated by A, B and C.
---------------------------------------
9- 1- U subspace: We have
x=(a,b,c)U  3a+2b+c = 0  c = -3a-2b  x = (a, b, -3a-2b)
 x = (a,0,-3a)+(0,b,-2b) = a(1,0,-3)+b(0,1,-2)
so that as (1,0,-3) and (0,1,-2) are elements of U, then

Nasri Cheaito and Fida El Chami

62
 U = Vect((1,0,-3), (0,1,-2))
3
and so U is a subspace of over .
Basis and dimension of U: Consider the matrix
A=  1 0  3  .
 0 1  2
As A is a matrix in row echelon form, then
{(1,0,-3), (0,1,-2)} is a basis of U over .
It follows that dim (U)=2.
V subspace: We have
x=(a,b,c)V  a+5b-7c = 0  a = -5b+7c  x=(-5b+7c,b,c)
 x = (-5b,b,0)+(7c,0,c) = b(-5,1,0)+c(7,0,1)
so that as (-5,1,0) and (7,0,1) are elements of V, then
V = Vect((-5,1,0), (7,0,1))
3
and so V is a subspace of over .
Basis and dimension of V: Consider the matrix
  5 1 0
B=  .
 7 0 1
We have
  5 1 0    5 1 0  , which is a row echelon form of B,
   
 7 0 1  R 2  5R 2  7R1  0 7 5 
hence
{(-5,1,0), (0,7,5)} is a basis of V over .
It follows that dim (V)=2.
2- UV: We have
x=(a,b,c)UV xU and xV  3a+2b+c = 0 and a+5b-7c = 0
hence
UV={x=(a,b,c) 3 ; 3a+2b+c=0 and a+5b-7c = 0}.
Let’s find a basis of UV over . We have
1 5  7  0
x=(a,b,c)UV a+5b-7c = 0 and 3a+2b+c=0   
 3 2 1  0  R 2  R 2  3R1
1 5  7  0
    -13b+22c = 0 and a+5b-7c = 0
 0  13 22  0 
 b = (22/13)c and a = -5b+7c = (-19/13)c
 x = ((-19/13)c, (22/13)c, c) = c(-19/13, 22/13, 1)
so that as (-19/13, 22/13, 1) is an element of UV, then
{(-19/13, 22/13, 1)} is a system of generators of UV over .
Since (-19/13, 22/13, 1) is linearly independent over , we get that
{(-19/13, 22/13, 1)} is a basis of UV over .
It follows that dim (UV) = 1, hence
dim (U+V) = dim (U)+dim (V)-dim (UV) = 2+2-1 = 3.
3 3
As dim (U+V) =dim ( ), then U+V= .
---------------------------------------
10- 1- U subspace: We have
xU  a,b , such that x = (a, 3b, a+2b) = (a,0,a)+(0,b,2b) = a(1,0,1)+b(0,1,2)
so that as (1,0,1) and (0,1,2) are elements of U, then
Nasri Cheaito and Fida El Chami
63
 U = Vect((1,0,1), (0,1,2))
3
and so U is a subspace of over .
Basis and dimension of U: Consider the matrix
A=  1 0 1  .
0 1 2
As A is a matrix in row echelon form, then
{(1,0,1), (0,1,2)} is a basis of U over .
It follows that dim (U)=2.
V subspace: We have
xU  c,d , such that x = (c, c+2d, c-d) = (c,c,c)+(0,2d,-d) = c(1,1,1)+d(0,2,-1)
so that as (1,1,1) and (0,2,-1) are elements of V, then
V = Vect((1,1,1), (0,2,-1))
3
and so V is a subspace of over .
Basis and dimension of V: Consider the matrix
1 1 1 
B=  .
 0 2 1 
As B is a matrix in row echelon form, then {(1,1,1), (0,2,-1)} is a basis of V over .
We deduce that dim (V)=2.
2- We have that {(1,0,1), (0,1,2)} is a system of generators of U and {(1,1,1), (0,2,-1)} is
a system of generators of V, hence
{(1,0,1), (0,1,2)}{(1,1,1), (0,2,-1)} is a system of generators of UV over .
Consider the matrix
1 0 1 
0 1 2 
C=  1 1 1  .
 
 0 2 1 
We have
1 0 1  1 0 1 
0 1 2   0 1 2  
1 1 1  0 1 0 
  R 3  R 3  R1   R3  R3  R2
 0 2 1   0 2  1  R 4  R 4  2R 2
1 0 1  1 0 1 
0 1 2 
   0 1 2 
  , which is a row echelon form of C, hence
 0 0  2  0 0  2 
 0 0  5  R 4  2R 4  5R 3  0 0 0 
{(1,0,1), (0,1,2), (0,0,-2)} is a basis of U+V over
and so
dim (U+V)=3.
We have
dim (UV) = dim (U)+ dim (V)- dim (U+V) = 2+2-3 = 1.
Basis of UV: Let xUV, then xU and xV, and so
a,b , such that x = (a, 3b, a+2b) and c,d , such that x = (c, c+2d, c-d).
Therefore
xUV  (a, 3b, a+2b) = (c, c+2d, c-d)  a=c, 3b=c+2d and a+2b=c-d
 3b=c+2d and c+2b=c-d  3b=c+2d and 2b = -d  b = -d/2 and 3b=c+2d
 -3d/2=c+2d  c = (-3d/2)-2d = -7d/2  x = (-7d/2, -3d/2, -9d/2)
 x = d(-7/2, -3/2, -9/2).

Nasri Cheaito and Fida El Chami

64
 As
(-7/2, -3/2, -9/2) = (c, c+2d, c-d), with c = -7/2 and d=1
and
(-7/2, -3/2, -9/2) = (a, 3b, a+2b), with a = -7/2 and b = -1/2
then (-7/2, -3/2, -9/2)UV, and so
UV=Vect((-7/2, -3/2, -9/2)).
We have (-7/2, -3/2, -9/2) is linearly independent over , hence
{(-7/2, -3/2, -9/2)} is a basis of UV over .
---------------------------------------
11- Basis of U: Consider the matrix
 1 1 0 2 
 
A=  2 1 3 1  .
 4 5 9 1 
 
We have
1 1 0 2   1 1 0 2 
   
 2 1 3 1  R 2  R 2  2R 1   0 3 3  3  
 4 5 9  1  R 3  R 3  4R1  0 9 9  9  R 3  R 3  3R 2
   
1 1 0 2 
 
 0 3 3  3  , which is a row echelon form of A, hence
0 0 0 0 
 
{(1,-1,0,2), (0,3,3,-3)} is a basis of U over .
Basis of V: Consider the matrix
3 2 2  2 
B=  
 3  4 4 2 
We have
3 2 2  2    3 2 2  2  , which is a row echelon form of B,
   
 3  4 4 2  R 2  R 2  R1  0  6 2 4 
hence
{(3,2,2,-2), (0,-6,2,4)} is a basis of V over .
Basis of U+V: As
{(1,-1,0,2), (0,3,3,-3)} is a system of generators of U over
and
{(3,2,2,-2), (0,-6,2,4)} is a system of generators of V over
then
{(1,-1,0,2),(0,3,3,-3)}{(3,2,2,-2),(0,-6,2,4)} is a system of generators of U+V over .
Consider the matrix
 1 1 0 2 
 
 0 3 3 3 
C=  .
3 2 2 2 
 
0  6 2 4 
We have
 1 1 0 2   1 1 0 2 
   
0 3 3  3   0 3 3  3  
 3 2 2  2  R 3  R 3  3R1  0 6 2  8  R 3  R 3  2R 2
    R  R  2R
0  6 2 4  0  6 2 4  4 4 2

Nasri Cheaito and Fida El Chami

65
 11 0 2   1 1 0 2 
   
0 3 3 3   0 3 3 3 
0 0 4 2   0 0  4  2  , which is a row echelon
   
0 0 8  2  R 4  R 4  2R 3  0 0 0  6 
form of C, hence
{(1,-1,0,2), (0,3,3,-3), (0,0,-4,-2), (0,0,0,-6)}} is a basis of U+V over .
Dimension of UV: We have that
dim (U) = 2, dim (V) = 2 and dim (U+V) = 4
hence
dim (UV) = dim (U)+ dim (V)- dim (U+V) = 2+2-4 = 0.
---------------------------------------
12- 1- U subspace: We have
f(x) = ax 3 +bx 2 +cx+dU  a=c and d=-2b  f(x) = cx 3 +bx 2 +cx-2b
 f(x) = c(x 3 +x)+b(x 2 -2)
so that as x 3 +x and x 2 -2 are elements of U, then
U = Vect(x 3 +x, x 2 -2)
and so U is a subspace of 3 [x] over .
V subspace: We have
f(x) = ax 3 +bx 2 +cx+dU  c=d  f(x) = ax 3 +bx 2 +dx-d = ax 3 +bx 2 +d(x-1)
so that as x 3 , x 2 and x-1 are elements of V, then
V= Vect(x 3 , x 2 , x-1)
and so V is a subspace of 3 [x] over .
2- Basis of U: Consider the matrix
 0 1 0 1
A=  .
  2 0 1 0
We have
 0 1 0 1  R1  R 2    2 0 1 0 
    , which is a row echelon form of A, hence
  2 0 1 0  0 1 0 1
{-2+x 2 , x+x 3 } is a basis of U over .
Basis of V: Consider the matrix
 0 0 0 1
 
B=  0 0 1 0  .
 1 1 0 0 
 
We have
 0 0 0 1  R1  R 3   1 1 0 0 
   
 0 0 1 0    0 0 1 0  , which is a row echelon form of B, hence
 1 1 0 0   0 0 0 1 
 
{-1+x, x 2 , x 3 } is a basis of V over .
Basis of U+V: As
{-2+x 2 , x+x 3 } is a system of generators of U over
and
{-1+x, x 2 , x 3 } is a system of generators of V over
then

Nasri Cheaito and Fida El Chami

66
 {-2+x 2 , x+x 3 }{-1+x, x 2 , x 3 } is a system of generators of UV over .
Consider the matrix
  2 0 1 0
 
 0 1 0 1
C=   1 1 0 0  .
 0 0 1 0
 0 0 0 1
 
We have
  2 0 1 0   2 0 1 0
   
 0 1 0 1  0 1 0 1
  1 1 0 0  R 3  2R 3  R1   0 2  1 0  R 3  R 3  2R 2 
 0 0 1 0  0 0 1 0
 0 0 0 1  0 0 0 1
   
 2 0 1 0   2 0 1 0 
   
 0 1 0 1   0 1 0 1 
 0 0 1  2    0 0 1  2  
 0 0 1 0  R 4  R 4  R 3  0 0 0  2 
 0 0 0   
 1   0 0 0 1  R 5  2R 5  R 4
 2 0 1 0 
 
 0 1 0 1 
 0 0  1  2  , which is a row echelon form of C, hence
 0 0 0 2 
 
 0 0 0 0 
{-2+x 2 , x+x 3 , -x 2 -2x 3 , -2x 3 } is a basis of U+V over .
3 2
Basis of UV: Let f(x) = ax +bx +cx+d. We have
f(x)UV  f(x)U and f(x)V  a=c, d=-2b and c=d  a=-2b, d=-2b and c=-2b
 f(x) = -2bx 3 +bx 2 -2bx-2b = b(-2x 3 +x 2 -2x-2)
so that as -2x 3 +x 2 -2x-2UV, then
{-2x 3 +x 2 -2x-2} is a system of generators of UV over .
3 2
As -2x +x -2x-2 is linearly independent over , then
{-2x 3 +x 2 -2x-2} is a basis of UV over .
We have that
dim (U) = 2, dim (V) = 3, dim (U+V) = 4 and dim (UV) = 1.
As dim (U+V) = dim ( 3 [x]) , then 3 [x]=U+V.
---------------------------------------
13- 1- U subspace: We have
xU  a,c , such that x =  a a  =  a a  +  0 0  = a  1 1  +c  0 0 
 c 0 0 0  c 0 0 0 1 0
so that as  1 1  and  0 0  are elements of U, then
0 0 1 0
U = Vect(  1 1  ,  0 0  )
0 0 1 0
and so U is a subspace of M 2 ( ) over .
V subspace: We have

Nasri Cheaito and Fida El Chami

67
 a  a  a  a  0 0 1  1   0 0 
xV  a,d , such that x =  =   +0 d = a  +d  
a d  a 0    1 0   0 1 
1  1 
 and  0 1  are elements of V, then
so that as  0 0
 1 0   
1  1   0 0 
V = Vect(  ,  )
1 0   0 1 
and so V is a subspace of M 2 ( ) over .
2- Dimension of U: We have that U = Vect(  1 1  ,  0 0  ) and as  1 1  = E 11 +E 12
0 0 1 0 0 0
and  0 0  = E 21 , then consider the matrix
1 0
A=  1 1 0 0  .
 0 0 1 0
As A is a matrix in row echelon form, then {  1 1  ,  0 0  } is a basis of U over ,
0 0 1 0
and so
dim (U) = 2.
1  1   0 0  ) and 1  1 
Dimension of V: We have V=Vect(  , 0 1   =E 11 -E 12 +E 21
1 0    1 0 
and  0 0  = E 22 , then consider the matrix
0 1
1 1 1 0
B=  .
0 0 0 1
1  1   0 0 
As B is a matrix in row echelon form, then {  ,   } is a basis of V over
1 0   0 1 
, and so
dim (V) = 2.
1  1   0 0 
Dimension of U+V: As U=Vect(  1 1  ,  0 0  ) and V=Vect(  ,   ), then
0 0 1 0 1 0   0 1 
1  1   0 0 
U+V=Vect(  1 1  ,  0 0  ,  ,   ).
 0 0   1 0  1 0   0 1 
Consider the matrix
1 1 0 0
0 0 1 0
C=  .
1 1 1 0
0 0 0 1
We have
1 1 0 0 1 1 0 0 1 1 0 0
0 0 1 0   0 0 1 0  R  R3  0  2 1 0
    2   , which is
 1  1 1 0  R 3  R 3  R1  0  2 1 0   0 0 1 0 
0 0 0 1 0 0 0 1 0 0 0 1
  0  2   0 0   0 0 
a row echelon form of C, hence  1 1  ,  ,  ,   is a basis of U+V
 0 0   1 0   1 0   0 1 
over , and so

Nasri Cheaito and Fida El Chami

68
 dim (U+V) = 4.
Dimension of UV: We have
dim (UV) = dim (U)+dim (V)-dim (U+V) = 2+2-4 = 0.
As dim (UV) = 0, then UV = {0}, and so U+V is a direct sum.
---------------------------------------
2
14- Let x , then a,b,c,d , such that x=(a+ib , c+id). We have
x=(a,0)+(ib,0)+(0,c)+(0,id)=a(1,0)+b(i,0)+c(0,1)+d(0,i)
hence
{(1,0),(i,0),(0,1),(0,i)} is a system of generators of E over .

Let a,b,c,d , then

a(1,0)+b(i,0)+c(0,1)+d(0,i)=(0,0)  (a+ib,c+id)=(0,0)  a+ib=0 and c+id=0
 a=b=0 and c=d=0
hence (1,0),(i,0),(0,1),(0,i) are linearly independent over , and so
2
{(1,0),(i,0),(0,1),(0,i)} is a basis of over .
2
We deduce that dim ( )=4.
---------------------------------------
15- 1- Consider the matrix
0 1 1 0 0
A=  1 1 1 0 1  .
 2  1 2  3 2
 
We have
 0 1 1 0 0  R1  R 2  1 1 1 0 1
1 1 1 0 1   0 1 1 0 0  
   2 1 2  3
 2  1 2  3 2  2  R 3  R 3  2R1
1 1 1 0 1 1 1 1 0 1
0 1 1 0 0   0 1 1 0 0  , which is a row echelon
  
 0  3 0  3 0  R 3  R 3  3R 2  0 0 3  3 0 
form of C, hence
B={1+x+x 2 +x 4 , x+ x 2 , 3x 2 -3x 3 } is a basis of F over .
2- Consider the matrix
1 1 1 0 1
0 1 1 0 0
 
C=  0 0 3  3 0  .
 0 0 0 1 0 
0 0 0 0 1
As C is a matrix in row echelon form, then rank(C)=5= dim (E), and so

{1+x+x 2 +x 4 , x+ x 2 , 3x 2 -3x 3 , x 3 , x 4 } is a basis of E over

completing B.
Supplement of F: Let F' = Vect(x 3 , x 4 ). As x 3 , x 4 are linearly independent over ,
3 4
then {x , x } is a basis of F' over , and so
dim (F') = 2.
We have F=Vect(1+x+x 2 +x 4 , x+ x 2 , 3x 2 -3x 3 ), hence
F+F'=Vect(1+x+x 2 +x 4 , x+ x 2 , 3x 2 -3x 3 , x 3 , x 4 ) = E.

Nasri Cheaito and Fida El Chami

69
 It follows that dim (F+F') = dim (E) = 5, and so
dim (FF') = dim (F)+dim (F')-dim (F+F') = 3+2-5 = 0.
Therefore FF' = {0}, and so E=FF', whence F' is a supplement of F in E.
---------------------------------------
16- Let F' = Vect(x). As xE-F and 0 E F, then x≠ 0 E , and so x is linearly independent
over K, whence
{x} is a basis of F' over K.
Let yFF', then yF and yF', and so aK, such that y = ax. If a≠ 0 K , then a is
invertible in K, and so x=a 1 y, whence xF, which is impossible. Therefore a= 0 K , and
so y= 0 E , whence
FF'={ 0 E }.
As dim K (F') = 1, then
dim K (F+F') = dim K (F)+dim K (F')-dim K (FF') = n-1+1-0 = n = dim K (E)
and so E=F+F'. Therefore E=FF'=FVect(x).
---------------------------------------
17- W subspace: We have
u=(x,y,z)W  x-iy+2iz=0  x = iy-2iz  u = (iy-2iz, y, z) = (iy, y, 0)+(-2iz, 0, z)
 u = y(i, 1, 0)+w(-2i, 0, 1)
so that as (i, 1, 0) and (-2i, 0, 1) are elements of W, then
W=Vect((i, 1, 0), (-2i, 0, 1))
and so W is a subspace of 3 over .
Basis of W over : Consider the matrix
 i 1 0
A=  .
  2i 0 1 
We have
 i 1 0   i 1 0  , which is a row echelon form of A, hence
  R  R  2R 0 2 1
  2i 0 1  2 2 1  
{(i, 1, 0), (0, 2, 1)} is a basis of W over .
Basis of W over : Let uW. As {(i, 1, 0), (0, 2, 1)} is a basis of W over , then
x,y , such that u = x(i, 1, 0)+y(0, 2, 1).
We have x,y , hence a,b,c,d , such that x = a+ib and y = c+id, and so
u = (a+ib)(i, 1, 0)+(c+id)(0, 2, 1) = a(i, 1, 0)+b(-1, i, 0)+c(0, 2, 1)+d(0, 2i, i)
and as (i, 1, 0), (-1, i, 0), (0, 2, 1) and (0, 2i, i) are element of W, we get that
{(i, 1, 0), (-1, i, 0), (0, 2, 1), (0, 2i, i)} is a system of generators of W over .
Let a,b,c,d , then
a(i, 1, 0)+b(-1, i, 0)+c(0, 2, 1)+d(0, 2i, i) = (0,0,0)  (ai-b, a+ib+2c+2id, c+id)=(0,0,0)
 ai-b = 0 and c+id = 0
 a = b = 0 and c = d = 0
and so (i, 1, 0), (-1, i, 0), (0, 2, 1), (0, 2i, i) are linearly independent over , whence
{(i, 1, 0), (-1, i, 0), (0, 2, 1), (0, 2i, i)} is a basis of W over .
---------------------------------------
18- First let's compute the rank of A. We have
 1 1 2 1 0 1 1 2 1 0
  R  R  R  0 1 2 3 1 
  1 0 0 2 1  2 2 1
  R R R
 1 2 4 4 1  3R  R 3  R 1 
0 1 2 3 1
 3 3 2
 2 3 1 0 1  R 4  R 4  2R1  0 1  3  2 1  R 4  R 4  R 2

Nasri Cheaito and Fida El Chami

70
1 1 2 1 0 1 1 2 1 0
0 1 2 3 1   0 1 2 3 1
0 0 0 0 0 R3  R 4 0 0 5 5 0  , which is a row echelon form of A,
0 0  5  5 0   
 0 0 0 0 0 
hence
rank(A) = 3.
Consider
1 0 0
= 1 2 4 .
2 3 1
We have
1 0 0 
 = 1 2 4 = (-1) 11 (-1) 2 4 = -(2-12) = 10
2 3 1 3 1

hence  is a non-zero minor of A of order r=rank(A). As the entries of  are chosen from
the last three rows of A, then
{(-1, 0, 0, 2, 1), (1, 2, 4, 4, 1), (2, 3, 1, 0, 1)} is a basis of the row space of A.
Also as the entries of  are chosen from the first three columns of A, then
 1   1   2 
  1   0   0 
 ,  ,   is a basis of the column space of A.
2 4
 1   3   1 
 2     
---------------------------------------

Nasri Cheaito and Fida El Chami

71
 M1103

SOLVED PROBLEMS

SERIES VII

1- Study the linearity of the mappings in the following cases:

(i) f : 2

 2
, defined by f(x,y) = (2x+5y , 3x-2y),
(ii) f : 2
 2
, defined by f(x,y) = (0 , y ),

(iii) f :  2 , defined by f(x,y) = (x+y , x-y+1),

2

(iv) f :   , defined by f(x) = x 3 ,

(v)  : E 
 2 , defined by (f) = 01 f (x )dx , where E is the real space of
continuous mappings of [0,1] to .
---------------------------------------
2- Show that the mapping f : 
 , defined by f(z) = z is -linear and that it is not
-linear.
---------------------------------------
3- Let f : 3

 be an -linear mapping, such that
f(1,1,1) = 1, f(0,1,1) = 2 and f(1,1,0) = 3.
Calculate f(a,b,c), where (a,b,c) 3 .
---------------------------------------
4- Let A=  1 1 M 2 ( ) and f : M 2 ( )   M 2 ( ) be defined by f(X) = XA-AX.
 0 1
(a) Show that f is -linear.
(b) Find Ker(f) and Im(f).
---------------------------------------
5- Let E and F be two K-vector spaces and f : E   F a K-linear mapping.
1- Show that if x 1 ,...,x n E and f(x 1 ),...,f(x n ) are linearly independent over K, then so
are x 1 ,...,x n .
2- Let H be a subspace of E of finite dimension over K.
(i) Show that the mapping g : H   F, defined by g(x)=f(x), xH is K-linear
and Im(g) = f(H).
(ii) Deduce that f(H) is a subspace of F and dim K (f(H))≤dim K (H).
(iii) Show that if f is injective, then dim K (f(H)) = dim K (H).
---------------------------------------
6- Let
F=  a b  ; a,b,c .

 c a  
1- Show that F is a subspace of M 2 ( ). Compute a basis of F and find its dimension.
2- Show that the mapping f : F   F defined by f  ac ba  =  b a c b a c  is an
   
endomorphism of F.
3- Compute a basis of Ker(f) and a basis of Im(f).
---------------------------------------

Nasri Cheaito and Fida El Chami

72
7- Answer by true or false and justify the following:
(a) A -linear mapping f : 4
 2
cannot be injective.
(b) An -linear mapping f : 3

 2
can be surjective.
(c) If f : 4

 2
is -linear, then Ker(f) cannot be isomorphic to .
---------------------------------------
8- Let u=(1,0,1), v=(0,-1,1) and w=(2,-1,1).
3
1- show that (u, v, w) is a basis of over .
2- Determine the linear mapping f : 3   3 , satisfying
f(u) = e 1 , f(v) = e 2 and f(w) = e 3
where {e 1 , e 2 , e 3 } is the canonical basis of 3 .
3- Is f injective?
4- Compute rank(f) and find a basis of Ker(f).
---------------------------------------
9- Let f : 4

 4
be the mapping defined by
f(x,y,z,t) = (2x-3y+2z-t , 3x-y+4z , 2x+y-t , 3x+2y+4z-3t).
and let
u 1 = (2,3,2,3), u 2 = (-3,-1,1,2), u 3 = (2,4,0,4) and u 4 = (-1,0,-1,-3).
(i) Show that f(x,y,z,t) = xu 1 +yu 2 +zu 3 +tu 4 .
(ii) Prove that f is -linear and find a basis of Im(f) over .
(iii) Calculate dim (Ker(f)).
---------------------------------------
10- Let  : 3 [x] 
 4 [x] be the mapping defined by
(f(x)) = f  (x)-xf(x).
1- Show that  is -linear.
2- Find a basis of Ker() and a basis of Im().
3- Calculate the rank of .
4- Is  injective ? surjective ?
---------------------------------------
11- Let E be a K-vector space. We call projector of E, every linear operator of E,
satisfying that p 2 = p, where p 2 = p  p. Let p be linear operator of E.
1- Show that xIm(p)  p(x) = x.
2- Prove that (x-p(x))Ker(p), xE.
3- Deduce that E = Im(p)Ker(p).
4- Show that p is injective if and only if p = id E .
---------------------------------------
12- Let E and F be two real vector spaces and let f : E   F be a mapping, satisfying
f(x+y)=f(x)+f(y) and f(x)=f(x), for all x,yE and all 0.
Show that f is -linear.
---------------------------------------
13- Show that if f is a linear operator of a finite dimensional K-vector space V, then
V = Im(f)Ker(f) if and only if Im(f)Ker(f)={0}.
Applications: Is V = Im(f)Ker(f) in each of the following cases ?
2
(i) V = and f is defined by f(x,y) = (y, y).

Nasri Cheaito and Fida El Chami

73
 3
(ii) V = and f is defined by f(x,y,z) = (2x-y, z, 0).
---------------------------------------
14- Let f be an endomorphism of n .
1- Show that
(i) f  f = 0  Im(f)Ker(f);
(ii) f  f = 0 and n = 2rank(f)  Im(f)=Ker(f).
2- If n is odd, can we find an endomorphism g of n , such that Im(g)=Ker(g) ?
---------------------------------------
15- Let f be an endomorphism of a K-vector space V.
1- Show that
(i) Im(f 2 )Im(f) and Ker(f)Ker(f 2 ).
(ii) V= Im(f)+Ker(f)  Im(f 2 ) = Im(f).
(iii) Im(f)Ker(f)={0}  Ker(f 2 ) = Ker(f).
2- Assume that V is finite dimensional over K and rank(f) = rank(f 2 ).
(i) Show that Im(f 2 ) = Im(f).
(ii) Deduce that V = Im(f)Ker(f).
---------------------------------------

Nasri Cheaito and Fida El Chami

74
 SOLUTION

1- (i) We have f(x,y)=(2x+5y , 3x-2y) =(2x,3x)+(5y,-3y)=x(2,3)+y(5,-3). Let

u 1 =(2,3) and u 2 =(5,-3)
then
f(x,y)=xu 1 +yu 2 .
Let (x,y),(x’,y’) 2 and  , then
f[(x,y)+(x’,y’)] = f(x+x’, y+y’) = (x+x’)u 1 +(y+y’)u 2
= xu 1 +yu 2 +x’u 1 +y’u 2 = (xu 1 +yu 2 )+x’u 1 +y’u 2
= f(x,y)+f(x’,y’)
hence f is -linear.
(ii) Suppose that f is -linear, then f(-(1,1)) = -f(1,1). But f(-(1,1)) = f(-1,-1) = (0,1)
and -f(1,1) = -(0,1) = (0,-1), hence (0,1) = (0, -1), and so 1 = -1, which is impossible.
Therefore f is not -linear.
(iii) Suppose that f is -linear, then f(0,0)) = (0,0). But f(0,0)=(0,1), hence (0,0)=(0,1),
and so 0 = 1, which is impossible. Therefore f is not -linear.
(iv) Suppose that f is -linear, then f(21) = 2f(1). But f(21) = f(2) = 8 and 2f(1) = 2,
hence 8 = 2, which is impossible. Therefore f is not -linear.
(v) Let f,gE and  , then
(f+g) = 0 1 (f  g)(x )dx = 1[f ( x )  g( x )]dx =  1 f (x )dx  1 g(x )dx
0 0 0
= (f)+(g)
hence f is -linear.
---------------------------------------
2- Let z,z’ and  , then
f(z+z’)= z  z' =  z + z ' = z + z ' = f(z)+f(z’)
hence f is -linear.
Assume that f is -linear, then f(i1) = if(1). But f(i1) = f(i) = -i and if(1) = i, hence
–i = i, which is impossible. Therefore f is not -linear.
---------------------------------------
3
3- Let {e 1 ,e 2 ,e 3 } be the canonical basis of , then
f(a,b,c)=f(ae 1 +be 2 +ce 3 ) = af(e 1 )+bf(e 2 )+cf(e 3 ).
We have
f(1,0,0)=f(e 1 ) , f(0,1,1) = f(e 2 )+f(e 3 ) and f(1,1,0) = f(e 1 )+f(e 2 )
hence f(e 1 ) = 1 , f(e 2 )+f(e 3 ) = 2 and f(e 1 )+f(e 2 ) = 3, and so
f(e 1 ) = 1 , f(e 2 ) =3- f(e 1 )=3-1=2 and f(e 3 ) =2-f(e 2 )=2-2=0
whence f(a,b,c)=a+2b.
---------------------------------------
4- (a) Let X,YM 2 ( ) and  , then
f(X+Y) = (X+Y)A-A(X+Y) = XA+YA-AX-AY = XA-AX+YA-AY
= (XA-AX)+YA-AY = f(X)+f(Y)
hence f is -linear.
(b) Ker(f): We have
X=  a b  Ker(f)  f(X) =  0 0    a b   1 1 -  1 1  a b  =  0 0 
c d 0 0  c d   0 1  0 1  c d   0 0 
  a a  b  -  a  c b  d  =  0 0 
c c  d  c d  0 0

Nasri Cheaito and Fida El Chami

75
  c a  d  0 0
 =    c = 0 and a = d
 0 c  0 0

 X=  d b  =  d 0  +  0 b  = d  1 0  +b  0 1 
0 d   0 d   0 0  0 1 0 0
   
so that as  1 0 and  0 1 
1 
are elements of Ker(f), then
0 0 0
Ker(f) = Vect(  1 0  ,  0 1  ).
0 1 0 0
Im(f) : We have
YIm(f)  X=  a b  M 2 ( ), such that Y= f(X) = XA-AX
c d
 a,b,c,d , such that Y=  a b   1 1 -  1 1  a b 
 c d   0 1  0 1  c d 
 c a  d
 Y=  a a  b  -  a  c b  d  =  
c c  d  c d   0 c 
  c 0 0 d   1 0  0 1 
 Y=  0 a  +   +  = a  0 0  +c 
0 1
 +d  
0 0  0 c  0 0     0 1 0 0 
 1 0 0 1 
so that as  0 1  ,   and   are elements of Im(f), because
0 0  0 1 0 0 
 0 1  = f(  1 0  ),  0  1  = f(  0 0  ) and   1 0  = f(  0 0  )
0 0 0 0 0 1 1 0
    0 0     0 1  
then
 1 0  0 1 
Im(f) = Vect(  0 1  ,  ,   ).
 0 0   0 1 0 0 
Remark: Concerning Im(f), we can write
YIm(f)  X=  a b  M 2 ( ), such that Y= f(X) = XA-AX
c d
 a,b,c,d , such that Y=  a b   1 1 -  1 1  a b 
 c d   0 1  0 1  c d 
 c a  d
 Y=  a a  b  -  a  c b  d  =  
c c  d  c d   0 c 
  c 0 0 a  d   1 0
 +(a-d)  0 0 
 Y=  0 1
 +0 0  = c
 0 c     0 1   
 1 0
and so as  0 1  and   are elements of Im(f), because
0 0  0 1
 0 1  = f(  1 0  ) and   1 0  = f(  0 0  )
0 0 0 0 1 0
     0 1  
then
 1 0
Im(f) = Vect(  0 1  ,   ).
 0 0   0 1
---------------------------------------
5- 1- Let a 1 ,...,a n K, then
a 1 x 1 +...+a n x n =0 E  f(a 1 x 1 +...+a n x n ) = f(0 E )

Nasri Cheaito and Fida El Chami

76
  a 1 f(x 1 )+...+a n f(x n ) = 0 F (because f is K-linear)
 a 1 =a 2 =…=a n =0 K (as f(x 1 ),...,f(x n ) are l.i over K)
hence x 1 ,...,x n are linearly independent over K.
2- (i) g K-linear: Let x,yH and K, then
g(x+y) = f(x+y) = f(x)+f(y) = g(x)+g(y)
and so g is K-linear.
Im(g) = f(H): We have
yf(H)  xH, such that y=f(x)  xH, such that y= g(x)  yIm(g)
hence Im(g) = f(H).
(ii) As f is K-linear, then f(H) is a subspace of F over K, by 7.2.1(ii).
We have Im(g) = f(H), hence
dim K (f(H)) = dim K (Im(g)) = dim K (H)-dim K (Ker(g))
and so dim K (f(H))≤dim K (H).
(iii) As f is injective, then so is g, because for every x,yH, we have
g(x) = g(y)  f(x) = f(y)  x = y.
Therefore dim K (H) = dim K (Im(g)) = dim K (f(H)), by 7.2.4.
---------------------------------------
6- 1- We have
xF  a,b,c , such that x =  a b  =  a 0  +  0 b  +  0 0 
 c a   0 a   0 0  c 0
 x = a  1 0  +b  0 1  +c  0 0 
0 1 0 0 1 0
so that as  1 0  ,  0 1  and  0 0  are elements of F, because
0 1 0 0 1 0
 1 0  =  a b  , with a=1 and b=c=0,  0 1  =  a b  , with a=c=0 and b=1,
0 1  c a  0 0  c a 
       
and
 0 0   a b 
 1 0  =  c a  , with a=b=0 and c=1
   
then
F= Vect(  1 0  ,  0 1  ,  0 0  )
0 1 0 0 1 0
and so F is a subspace of M 2 ( ).
Basis of F: Let a,b,c . We have
a  1 0  +b  0 1  +c  0 0  =  0 0    a b  =  0 0   a=0, b=0 and c=0
0 1 0 0 1 0 0 0  c a  0 0
hence  1 0  ,  0 1  ,  0 0  are linearly independent over , and so
0 1 0 0 1 0
 1 0  ,  0 1  ,  0 0  is a basis of F over .
 0 1   0 0   1 0 
     
We have dim (F)=3.
2- We have
f  a b  =  a b  c = a 0  +  0 b  c  =a  1 0  +(b+c)  0 1 
c a  b  c a   0 a   b  c 0   0 1  1 0
 
so that letting
M=  1 0  and N=  0 1
0 1  1
 0 

Nasri Cheaito and Fida El Chami

77
 we get
f  a b  = aM+(b+c)N, for all a,b,c .
c a
Let x,yF and  , then
a,b,c , such that x =  a b  and a',b',c' , such that y =  a ' b'  .
c a  c' a ' 
We have
f(x+y) = f  a  a ' b  b'  = (a+a')M+(b+b'+c+c')N
 c  c' a  a ' 
= [aM+(b+c)N]+a'M+(b'+c')N
= f(x)+f(y)
hence f is -linear, and so f is an endomorphism of F.
3- Basis of Ker(f): We have
x=  a b  Ker(f)  f(x)=  0 0    a b  c  =  0 0   a=0 and b+c=0
 c a   0 0   b  c a   0 0 
0  c   0 1 
 a=0 and b=-c  x=   = c 
c 0  1 0 
 0 1   0 1   0 0 
so that as   Ker(f), because f   =  , then
1 0  1 0  0 0
 0  1 
  is a system of generators of Ker(f) over .
 1 0 
 0 1 
As   is linearly independent over , then
1 0 
 0  1 
  is a basis of Ker(f) over .
 1 0 
Basis of Im(f): We have
xIm(f)    a b  F, such that x= f(  a b  ) =  a b  c  = aM+(b+c)N, with
 c a   c a   b  c a 
M=  1 0  and N=  0 1  . As M and N are elements of Im(f), because
0 1 1 0
 1 0  F and M = f(  1 0  ) and  0 1 / 2  F and N = f  0 1 / 2 
0 1 0 1 1 / 2 0  1 / 2 0 
       
then
{M,N} is a system of generators of Im(f) over .
Let , , then
   0 0
M+N =  0 0     =   =0 and =0
 0 0     0 0
and so M, N are linearly independent over , whence
{M,N} is a basis of Im(f) over .
---------------------------------------
4
7- (a) True, because if f is injective, then dim (Im(f)) = dim ( ) = 4. But Im(f) is a
2
subspace of , hence dim (Im(f))2, which is impossible.
2 2
(b) False, because if f is surjective, then Im(f) = , and so dim (Im(f))=dim ( ).

Nasri Cheaito and Fida El Chami

78
 2 3
But dim ( ) = 4, by 14 of chapter VI, and dim (Im(f))dim ( ), because
3
dim ( ) = dim (Im(f))+dim (Ker(f)), hence 43, which is impossible.
(c) True, because if Ker(f) cannot is isomorphic to , then dim (Ker(f))=dim ( )=1.
But
4
4 = dim ( ) = dim (Im(f))+dim (Ker(f))
2
hence dim (Im(f)) = 3. However Im(f) is a subspace of . Therefore
2
dim (Im(f))dim ( ), and so 32, which is impossible.
---------------------------------------
8- 1- As u = (1,0,1) = e 1 +e 3 , v = (0,-1,1) = -e 2 +e 3 and w = (2,-1,1) = 2e 1 -e 2 +e 3 , then
consider the matrix
 1 0 1
 
A=  0  1 1 .
 2  1 1
 
We have
 1 0 1 1 0 1  1 0 1 
     
 0  1 1  0 1 1
0 1 1   0 1 1
0 0  2  ,
 2  1 1 3R  R 3  2 R 1  R
 3  R 3  R 2  
3
which is a row echelon form of A, hence rank(A)=3= dim ( ), and so (u, v, w) is

a basis of 3 over .
2- We have
f(u) = f(e 1 )+f(e 3 ), f(v) = -f(e 2 )+f(e 3 ) and f(w) = 2f(e 1 )-f(e 2 )+f(e 3 )
hence
f(e 1 )+f(e 3 ) = e 1 , -f(e 2 )+f(e 3 ) = e 2 and 2f(e 1 )-f(e 2 )+f(e 3 ) = e 3 .
The augmented matrix of this system with unknowns f(e 1 ), f(e 2 ) and f(e 3 ) is
 1 0 1  e1 
 
 0  1 1  e2  .
2 1 1  e 
 3
We have
1 0 1  e1  1 0 1  e1 
   
0 1 1  e2    0  1 1  e2  
2 1 1  e3  R 3  R 3  2R1  0  1  1  e3  2e1  R 3  R 3  R 2

1 0 1  e1 
 
 0 1 1  e2  , hence the system becomes
 0 0  2  e  2e  e 
 3 1 2
f(e 1 )+f(e 3 ) = e 1 , -f(e 2 )+f(e 3 ) = e 2 and -2f(e 3 ) = -2e 1 -e 2 +e 3
and so
f(e 3 ) = e 1 +(1/2)e 2 -(1/2)e 3 , f(e 2 ) = f(e 3 )-e 2 = e 1 -(1/2)e 2 -(1/2)e 3
and
f(e 1 ) = e 1 -f(e 3 ) = -(1/2)e 2 +(1/2)e 3 .

Nasri Cheaito and Fida El Chami

79
 Therefore f is defined by
f(a, b, c) = af(e 1 )+bf(e 2 )+cf(e 3 )
= a(-(1/2)e 2 +(1/2)e 3 )+b(e 1 -(1/2)e 2 -(1/2)e 3 )+c(e 1 +(1/2)e 2 -(1/2)e 3 )
= (b+c)e 1 +[-(a/2)-(b/2)+(c/2)]e 2 +[(a/2)-(b/2)-(c/2)]e 3
= (b+c, (-a-b+c)/2, (a-b-c)/2).
3- We have f(u) = e 1 , f(v) = e 2 and f(w) = e 3 , hence e 1 , e 2 and e 3 are elements of
3 3
Im(f), and so as {e 1 , e 2 , e 3 } is a basis of and Im(f) is a subspace of over
3
, then Im(f) = , and so f is surjective. Therefore f is injective.
3
4- As f is surjective, then rank(f) = dim ( ) =3.
We have f is injective, hence Ker(f)={(0,0,0)}, and so B= is a basis of Ker(f).
---------------------------------------
9- (i) We have
f(x,y,z,t) = (x-y+2z-t , 2x-y+4z , y-t , 3x+2y+6z-4t)
= (x,2x,0,3x)+(-y,-y,y,2y)+(2z,4z,0,6z)+(-t,0,-t,-4t)
= x(1,2,0,3)+y(-1,-1,1,2)+z(2,4,0,6)+t(-1,0,-1,-4)
= xu 1 +yu 2 +zu 3 +tu 4 .
4
(ii) Let (x,y,z,t),(x’,y’,z’,t’) and  , then
f[(x,y,z,t)+(x’,y’,z’,t’)] = f(x+x’, y+y’, z+z’, t+t’)
= (x+x’)u 1 +(y+y’)u 2 +(z+z’)u 3 +(t+t’)u 4
= xu 1 +yu 2 +zu 3 +tu 4 +x’u 1 +y’u 2 +z’u 3 +t’u 4
= (xu 1 +yu 2 +zu 3 +tu 4 )+x’u 1 +y’u 2 +z’u 3 +t’u 4
= f(x,y,z,t)+f(x’,y’,z’,t’)
hence f is -linear.
Basis o f Im(f): We have Im(f) = Vect(f(e 1 ), f(e 2 ), f(e 3 ), f(e 4 )), by 7.2.3 and
f(e 1 ) = f(1,0,0,0) = u 1 , f(e 2 ) = f(0,1,0,0) = u 2 , f(e 3 ) = f(0,0,1,0) = u 3 and
f(e 4 ) = f(0,0,0,1) = u 4 , hence
Im(f) = Vect(u 1 , u 2 , u 3 , u 4 ).
u 1 = (2,3,2,3), u 2 = (-3,-1,1,2), u 3 = (2,4,0,4) and u 4 = (-1,0,-1,-3)
As u 1 = 2e 1 +3e 2 +2e 3 +3e 4 , u 2 = -3e 1 -e 2 +e 3 +2e 4 , u 3 = 2e 1 +4e 2 +4e 4 and
u 4 = -e 1 -e 3 -3e 4 , then consider the matrix
 1 2 0 3 
 1 1 1 2 
A=  .
 2 4 0 6 
 1 0 1 4 

We have
 1 2 0 3  1 2 0 3 
 1 1 1 2  R  R R 0 1 1 5 
  2 2 1  
R  R  2 R 0 0 0 0 R  R
 2 4 0 6  3 3 1  0 2 1 1  3 4
 1 0 1 4  R 4  R 4  R1  
1 2 0 3  1 2 0 3 
0 1 1 5    0 1 1 5 
0 2 1 1   0 0  3 11  , which is a row echelon
  R 3  R 3  2R 2  
0 0 0 0  0 0 0 0 

Nasri Cheaito and Fida El Chami

80
 form of A, hence
{(1,2,0,3), (0,1,1,5), (0,0,-3,-11)} is a basis of Im(f) over .
4
(iii) We have dim (Ker(f)) = dim ( )-dim (Im(f)) = 4-3 = 1.
---------------------------------------
10- 1- Let f(x),g(x) 3 [x] and  . Put
u(x) = f(x)+g(x).
We have
(f(x)+g(x)) = (u(x)) = u  (x)-xu(x) =  f  (x)+ g  (x)-x[f(x)+g(x)]
=  f  (x)-xf(x)+ g  (x)-xg(x) = [ f  (x)-xf(x)]+ g  (x)-xg(x)
= (f(x))+(g(x))
hence  is -linear.
2- Basis of Ker(): We have
f(x) = ax 3 +bx 2 +cx+dKer()  (f(x)) = 0  f  (x)-xf(x) = 0
 3ax 2 +2bx+c-x(ax 3 +bx 2 +cx+d) = 0
 -ax 4 -bx 3 +(3a-c)x 2 +(2b-d)x+c = 0
 -a = 0, -b = 0, 3a-c = 0, 2b-d = 0 and c = 0
 - = 0, b = 0, c = 0 and d = 2b = 0
 f(x) = 0
hence Ker() = {0}, and so B= is a basis of Ker() over .
2nd method: Let f(x)Ker(), then (f(x)) = 0, and so f  (x) = xf(x). If f(x)≠0, then
f  (x) ≠0, and so deg( f  (x)) = deg(xf(x)) = 1+deg(f(x), which is impossible, because
deg( f  (x)) = deg(f(x))-1. Therefore f(x)=0, and so Ker() = {0}, whence B= is a
basis of Ker() over .
Basis of Im(): As  is -linear, and {1, x, x 2 , x 3 } is a basis of 3 [x] over ,
then
Im() = Vect((1), (x), (x 2 ), (x 3 ))
by 7.2.3. But  is injective, hence dim (Im()) = dim ( 3 [x]) = 4, and so

{(1), (x), (x 2 ), (x 3 )}

is a basis of Im() over , by 6.3.4(ii). As
(1) = -x, (x) = 1-x 2 , (x 2 ) = 2x- x 3 and (x 3 ) = 3x 2 -x 4
then
{-x, 1-x 2 , 2x- x 3 , 3x 2 -x 4 } is a basis of Im() over .
3- We have rank() = dim (Im()) = 4.
4- We have  is injective, because Ker() = {0}.
As dim (Im())≠dim ( 4 [x]), then Im()≠ 4 [x], and so  is not surjective.
---------------------------------------
11- 1- Let xIm(p), then uE, such that x=p(u). We have
p(x) = p(p(u)) = p  p(u) = p 2 (u) = p(u) = x.
2- We have p(x-p(x)) = p(x)-p(p(x)) = p(x)-pf(x) = 0, hence (x-p(x))Ker(p).
3- Let xE. As x = p(x)+(x-p(x)), then xIm(p)+Ker(p), because p(x)Im(f) and
(x-p(x))Ker(f), and so
E = Im(p)+Ker(p).

Nasri Cheaito and Fida El Chami

81
 Let xIm(p)Ker(p), then xIm(p) and xKer(p), hence p(x)=x and p(x)=0, by 1),
and so x=0. It follows that Im(p)Ker(p)={0}, and so
E=Im(p)Ker(p).
4- N.C: Let xE. As p is injectif, then Ker(p)={0}, but (x-p(x))Ker(p), hence
x-p(x)=0, and so p(x)=x= id E (x), whence p = id E .
S.C: As id E is injective, then p is injective.
---------------------------------------
12- It is enough to show that f(x)=f(x), xE and 0. As -0, then
f(-x) = -f(x).
We have f(0 E )=0 E , because f(0 E )=f(00 E ) = 0f(0 E ) = 0 E , hence
f(-x)+f(x) = f(-x+x) = f(0 E ) = 0 E
and so f(x) = -f(-x) = -[-f(x)] = f(x), as required.
---------------------------------------
13- N.C: As V=Im(f)Ker(f), then Im(f)Ker(f)={0}.
S.C: By 6.5.2, we have
dim K (Im(f)+Ker(f)) = dim K (Im(f))+dim K (Ker(f))-dim K (Im(f)Ker(f))
= dim K (Im(f))+dim K (Ker(f)) = dim K (V).
As V is finite dimensional over K and Im(f)+Ker(f) is a subspace of V, then
V=Im(f)+Ker(f), but Im(f)Ker(f)={0}, hence V=Im(f)Ker(f).
Applications: (i) Let uIm(f)Ker(f), then uIm(f) and uKer(f), hence
(x,y)V, such that u=f(x,y) and f(u)=0.
We have f(x,y)=(y,y), hence u=(y,y) and so
f(u) = f(y,y) = (y,y) = u
but f(u)=0, hence u=0, and so Im(f)Ker(f)={0}. Thus V=Im(f)Ker(f).
(ii) Let uIm(f)Ker(f), then uIm(f) and uKer(f), hence
(x,y,z)V, such that u=f(x,y,z) and f(u)=0.
We have f(x,y,z)=(2x-y, z, 0), hence u=(2x-y, z, 0), and so
f(u) = f(2x-y, z, 0) = (2(2x-y)-z, 0, 0) = (4x-2y-z, 0, 0)
but f(u)=0, hence (4x-2y-z, 0, 0) = (0,0,0) and so 4x-2y-z=0. Take z=4 and y=0, then
x=1, and so u=(2,4,0). We have
f(1,0,4) = (2,4,0) = u and f(u) = f(2,4,0) = (0,0,0)
hence uIm(f)Ker(f) and so Im(f)Ker(f){0}, whence VIm(f)Ker(f).
---------------------------------------
14- 1- (i) ): Let yIm(f), then xE, such that y=f(x). As f  f = 0, then f  f(x)=0, and so
f(y)=0, whence yKer(f). Therefore Im(f)Ker(f).
): Let xE. As f(x)Im(f), then f(x)Ker(f), and so f(f(x)=0. Therefore
f  f(x)=0, for all xE, and so f  f = 0.
(ii) ): As f  f = 0, then Im(f)Ker(f), by (i). We have
2rank(f) = n = dim K (E) = rank(f)+dim K (Ker(f))
hence rank(f) = dim K (Ker(f)). But Ker(f) is finite dimensional over K and
Im(f)Ker(f), hence Im(f)=Ker(f), by 6.3.5(iii).
): As Im(f)=Ker(f), then Im(f)Ker(f), and so (i) yields that
f  f = 0.
We have rank(f) = dim K (Im(f)) = dim K (Ker(f)), hence
n = dim K (E) = rank(f)+dim K (Ker(f)) = 2rank(f).
2- No, because if g exists, then as Im(g)=Ker(g), we get that n = 2rank(g), which is
impossible, since n is odd.
---------------------------------------

Nasri Cheaito and Fida El Chami

82
15- 1- (i) We have
yIm(f 2 )  xE, such that y=f 2 (x) = f(f(x))  yIm(f)
hence
Im(f 2 )Im(f).
Let xKer(f), then f(x)=0, and so f 2 (x) = f(f(x)) = f(0) = 0, whence xKer(f 2 ),
and so
Ker(f)Ker(f 2 ).
(ii) ): Let yIm(f), then xV, such that y=f(x). As V= Im(f)+Ker(f), then
uIm(f) and vKer(f), such that x=u+v.
We have y=f(x)=f(u)+f(v)=f(u)+0=f(u) and as uIm(f), then zV, such that
u=f(z). This implies that y=f(f(z))=f 2 (z), hence yIm(f 2 ), and so
Im(f)Im(f 2 ). But Im(f 2 )Im(f), by (i), hence Im(f 2 )=Im(f).
): Let xV. As f(x)Im(f), then f(x)Im(f 2 ), and so
uV, such that f(x)=f 2 (u).
We have f(x-f(u)) = f(x)-f(f(u)) = f(x)-f 2 (u) = 0, hence x-f(u)Ker(f), and so as
f(u)Im(f) and x = f(u)+x-f(u), then xIm(f)+Ker(f), whence VIm(f)+Ker(f),
and so V=Im(f)+Ker(f).
(iii) ): Let xKer(f 2 ), then f(f(x))=0, and so f(x)Ker(f). But f(x)Im(f), hence
f(x)Im(f)Ker(f), and so f(x)=0, whence xKer(f). Therefore Ker(f 2 )Ker(f),
and so as Ker(f)Ker(f 2 ), by (i), then Ker(f 2 )=Ker(f).
): Let xIm(f)Ker(f), then xIm(f) and xKer(f), and so uV, such that
x=f(u). We have f(x)=0, hence f(f(u))=0, and so f 2 (u)=0, whence uKer(f 2 ).
But Ker(f 2 )=Ker(f), hence uKer(f), and so f(u)=0, whence x=0. Therefore
Im(f)Ker(f)={0}.
2- (i) As Im(f 2 )Im(f), by 1(i) and dim K (Im(f))=dim K (Im(f 2 )) and Im(f) is finite
dimensional over K, then Im(f 2 ) = Im(f).
(ii) As Im(f 2 ) = Im(f), by (i), then
V=Im(f)+Ker(f)
2
by 1(ii). We have Ker(f)Ker(f ), by 1(i) and
dim K (Ker(f 2 )) = dim K (V)-rank(f 2 ) = dim K (V)-rank(f) = dim K (Ker(f))
and so as Ker(f 2 ) is finite dimensional over K, then Ker(f 2 )=Ker(f), whence
Im(f)Ker(f)={0}
by 1(iii). Therefore V = Im(f)Ker(f).
---------------------------------------

Nasri Cheaito and Fida El Chami

83