If g and f o g are onto(Surjective), is f onto(Surjective)?

  • Thread starter Thread starter LittleTexan
  • Start date Start date
AI Thread Summary
If both functions g and f o g are onto (surjective), then f must also be onto. The reasoning is that since g maps all elements from set A to set B, and f o g maps all elements from set A to set C, every element in C must be accounted for by f. If f were not onto, then f o g could not cover all elements in C, contradicting the assumption that f o g is surjective. Thus, the conclusion is that f is indeed onto.
LittleTexan
Messages
7
Reaction score
0
Hello Members

I am having a little bit of a problem solving this proof for my Discreet math course.

If g and f o g are onto(Surjective), is f onto(Surjective)? Need to prove. I believe that f has to be Onto.

so I have g: A -> B
f: B -> C

Well I understand that a function is onto(Surjective) when it maps to all images. So for g all the elements in A map(hit) element in B.

So f o g: A -> C where every element of C must be map to. I believe that since C is the Image of f that this means that f must be onto(Surjective).

Can someone give me advise on how to prove this? Or even just some advise in general on proofs.

TIA
 
Physics news on Phys.org
The image of fg is a subset of the image of f. If f is not surjective then fg cannot possibly be surjective.
 
Back
Top