Suppose g:A→B and f:B→C are functions.
a. Show that if f∘g is onto, then f must also be onto.
Answer. Assume that f∘g is onto. Let c∈C . Since f∘g is onto, there is a∈A such that c=(f∘g)(a) by the definition of onto function. By the definition of function composition, c=f(g(a)) . Let b=g(a) . This b belongs to B and is such that c=f(b). Therefore, for every c∈C , there is b∈B such that c=f(b) . By the definition of onto function, f is onto.
b. Show that if f∘g is one-to-one, then g must also be one-to-one.
Answer. Let a1,a2∈A such that g(a1)=g(a2) . Then
(f∘g)(a1)=f(g(a1))=f(g(a2))=(f∘g)(a2). Since f∘g is one-to-one, a1=a2 . Therefore, for all a1,a2∈A such that g(a1)=g(a2) , a1=a2 . By the definition of one-to-one function, g is one-to-one.
c. Show that if f∘g is a bijection, then g is onto if and only if f is one-to-one.
Answer. Assume that f∘g is a bijection.
Assume that g is onto. Let b1,b2∈B such that f(b1)=f(b2) . Since g is onto, by the definition of onto function, there are a1,a2∈A such that b1=g(a1) and b2=g(a2) . We have
(f∘g)(a1)=f(g(a1))=f(b1)
=f(b2)=f(g(a2))=(f∘g)(a2). Since f∘g is a bijection, it is one-to-one, hence a1=a2 , and
b1=g(a1)=g(a2)=b2.- Therefore, for all b1,b2∈B such that f(b1)=f(b2) , b1=b2 . By the definition of one-to-one function, f is one-to-one.
- Assume that f is one-to-one. Let b∈B . Since f∘g is a bijection, it is onto, hence there is a∈A such that f(b)=(f∘g)(a)=f(g(a)) . Since f is one-to-one, b=g(a) . Therefore, for every b∈B , there is a∈A such that b=g(a) . By the definition of onto function, g is onto.
Comments