Composite Function Homework: Proving One-to-One & Onto

nikie1o2
Messages
7
Reaction score
0

Homework Statement


let A,B,C be sets, and let f : A--> B and g : B--> C be functions. The composite function denoted by g o f is a function from A to C defined as follows:



Homework Equations



g o f(x)=g(f(x)) for every x in A.

Prove that if g o f is one-to one, then f is one-to one
Prove that is g o f is onto, then g is onto

The Attempt at a Solution


I really don't know how to approach this problem. I didnt things similar with binary structures determining if they are an isomorphism by not familiar with composite functions
 
Physics news on Phys.org
I think I know how to approach it...check me if I'm right though

check if its one-to-one and onto

if it is one-to-one that implies if f(a)=f(b) then a=b
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top