Question #94845
Suppose g : A → B and f : B → C are functions.
a. Show that if f ◦g is onto, then f must also be onto.
b. Show that if f ◦g is one-to-one, then g must also be 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.
1
Expert's answer
2019-09-19T12:24:40-0400

Suppose g:ABg : A\to B and f:BCf : B\to C  are functions.

a. Show that if fgf\circ g  is onto, then ff  must also be onto.

Answer. Assume that fgf\circ g  is onto. Let cCc\in C . Since fgf\circ g  is onto, there is aAa\in A  such that c=(fg)(a)c = (f\circ g)(a)  by the definition of onto function. By the definition of function composition, c=f(g(a))c = f(g(a)) . Let b=g(a)b = g(a) . This bb  belongs to BB  and is such that c=f(b)c = f(b). Therefore, for every cCc\in C , there is bBb\in B  such that c=f(b)c = f(b) . By the definition of onto function, ff  is onto.

b. Show that if fgf\circ g  is one-to-one, then gg  must also be one-to-one.

Answer. Let a1,a2Aa_1, a_2\in A  such that g(a1)=g(a2)g(a_1) = g(a_2) . Then

(fg)(a1)=f(g(a1))=f(g(a2))=(fg)(a2).(f\circ g)(a_1) = f(g(a_1)) = f(g(a_2))= (f\circ g)(a_2).

 Since fgf\circ g  is one-to-one, a1=a2a_1=a_2 . Therefore, for all a1,a2Aa_1, a_2\in A  such that g(a1)=g(a2)g(a_1) = g(a_2) , a1=a2a_1=a_2 . By the definition of one-to-one function, gg  is one-to-one.

c. Show that if fgf\circ g  is a bijection, then gg  is onto if and only if ff  is one-to-one.

Answer. Assume that fgf\circ g  is a bijection.

Assume that gg  is onto. Let b1,b2Bb_1, b_2\in B  such that f(b1)=f(b2)f(b_1) = f(b_2) . Since gg  is onto, by the definition of onto function, there are a1,a2Aa_1, a_2\in A  such that b1=g(a1)b_1 = g(a_1)  and b2=g(a2)b_2 = g(a_2) . We have

(fg)(a1)=f(g(a1))=f(b1)(f\circ g)(a_1) = f(g(a_1)) = f(b_1)

=f(b2)=f(g(a2))=(fg)(a2).= f(b_2) = f(g(a_2)) = (f\circ g)(a_2).

 Since fgf\circ g  is a bijection, it is one-to-one, hence a1=a2a_1=a_2 , and

b1=g(a1)=g(a2)=b2.b_1 = g(a_1) = g(a_2) = b_2.
  •  Therefore, for all b1,b2Bb_1, b_2\in B  such that f(b1)=f(b2)f(b_1) = f(b_2) , b1=b2b_1=b_2 . By the definition of one-to-one function, ff  is one-to-one.
  • Assume that ff  is one-to-one. Let bBb\in B . Since fgf\circ g  is a bijection, it is onto, hence there is aAa\in A  such that f(b)=(fg)(a)=f(g(a))f(b) = (f\circ g)(a) = f(g(a)) . Since ff  is one-to-one, b=g(a)b = g(a) . Therefore, for every bBb\in B , there is aAa\in A  such that b=g(a)b = g(a) . By the definition of onto function, gg  is onto.

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!
LATEST TUTORIALS
APPROVED BY CLIENTS