Prove:

 
1.  The  composition  of  two  surjective  functions  is  surjective.  
2.  The  composition  of  two  injective  functions  is  injective.  
 
Proofs  
1.  Suppose  f:  A→B  and  g:  B→C  are  surjective  (onto).  
To  prove  that  gοf:  A→C  is  surjective,  we  need  to  prove  that  ∀c∈C  ∃  a∈A  such  that  
(gοf)(a)  =  c.  
Let  c  be  any  element  of  C.      
Since  g:  B→C  is  surjective,  ∃b∈B  such  that  g(b)  =  c.  
Since  f:  A→B  is  surjective,  ∃a∈A  such  that  f(a)  =  b.  
 
So,  (gοf)(a)  =  g(f(a))  =  g(b)  =  c.  
This  completes  the  proof.  
 
2.  Suppose  f:  A→B  and  g:  B→C  are  injective  (1-­‐to-­‐1).  
To  prove  that  gοf:  A→C  is  injective,  we  need  to  prove  that  if  (gοf)(x)  =  (gοf)(y)  then  
x  =  y.  
 
Suppose  (gοf)(x)  =  (gοf)(y)  =  c∈C.  
 
This  means  that  g(f(x))  =  g(f(y)).  
Let  f(x)  =  a,  f(y)  =  b,  so  g(a)  =  g(b).  
Since  g:  B→C  is  injective  and  g(a)  =  g(b),    we  know  that  a  =  b.  
This  means  that  f(x)  =  f  (y).  
Since  f:  A→B  is  injective  and  f(x)  =  f  (y),  we  know  that  x  =    y.  
 
We  have  shown  that  if  (gοf)(x)  =  (gοf)(y)  then  x  =  y.  
This  completes  the  proof.