You are Here: Home >< Maths

# proving composite function is injective if all it's constituent parts are injective watch

1. I have so far

I claim that the composition of injective functions is injective. Recall that injective means that .
Let f(g(x))=f(g(y)) then using the definition of injective g(x)=g(y) and again using the definition of injective x=y therefore the composition of injective functions is injective.

Ignore everything below
But i'm not sure how to do like the general kind of proof.

Like i know intuitively it is and i've tested a few but i'm not really sure how to prove it...

I could do contraposition tho

so

P:=The composition of injective functions is injective
Q:=An injective function
~Q:=Non-injective function

i dunno

direct proof?
so if fog is injective then f and g are injective where f,g are in the set of ????

I need some help
2. (Original post by will'o'wisp2)
I have so far

I claim that the composition of injective functions is injective. Recall that injective means that .
Let f(g(x))=f(g(y)) then using the definition of injective g(x)=g(y) and again using the definition of injective x=y therefore the composition of injective functions is injective.

Ignore everything below
But i'm not sure how to do like the general kind of proof.

Like i know intuitively it is and i've tested a few but i'm not really sure how to prove it...

I could do contraposition tho

so

P:=The composition of injective functions is injective
Q:=An injective function
~Q:=Non-injective function

i dunno

direct proof?
so if fog is injective then f and g are injective where f,g are in the set of ????

I need some help
Yeah your proof is fine, I would just make the reasoning a bit more clear. You have g(x)=g(y) because f is injective and then you have x=y because g is injective.
3. (Original post by B_9710)
Yeah your proof is fine, I would just make the reasoning a bit more clear. You have g(x)=g(y) because f is injective and then you have x=y because g is injective.
ok thanks
4. (Original post by will'o'wisp2)
ok thanks
I assume you'll also want to prove that composition of surjective functions is surjective.
Also remember that you can extend these results to any finite number of compositions of injective/surjective functions.
5. (Original post by B_9710)
I assume you'll also want to prove that composition of surjective functions is surjective.
Also remember that you can extend these results to any finite number of compositions of injective/surjective functions.
woah there, hol up the master of prediction xD

i can do an infinite regress with injective function but i'm not sure about surjective tho because the definition is slightly different but let me write up a rough answer of my injecive part and i'll take a look at the next one
6. (Original post by B_9710)
I assume you'll also want to prove that composition of surjective functions is surjective.
Also remember that you can extend these results to any finite number of compositions of injective/surjective functions.
so then

I claim that the composition of surjective functions is surjective. Recall that to be surjective means that then
on second thought the stuff below don't work

I've tried a few examples and it seem that let's say f(x)=x and g(x)=x+1 if we do f(g(x))=x+1 then g(f(x))=x+1 , it seems that the "bigger" of the 2 surjecive functions always seems to be the surjective one, so it seems to me in this case for example f(g(x))=g(x) and g(f(x))=g(x) which is surjective hence the composite of both is surjective but i'm not really sure where else to go with this.
7. (Original post by will'o'wisp2)
so then

I claim that the composition of surjective functions is surjective. Recall that to be surjective means that then
on second thought the stuff below don't work

I've tried a few examples and it seem that let's say f(x)=x and g(x)=x+1 if we do f(g(x))=x+1 then g(f(x))=x+1 , it seems that the "bigger" of the 2 surjecive functions always seems to be the surjective one, so it seems to me in this case for example f(g(x))=g(x) and g(f(x))=g(x) which is surjective hence the composite of both is surjective but i'm not really sure where else to go with this.
I'm not sure what you're saying here.
If you have and that are both surjective, we want to show that is surjective.
So basically we want to show that for all z in C there exists an x in A such that .
8. (Original post by B_9710)
I'm not sure what you're saying here.
If you have and that are both surjective, we want to show that is surjective.
So basically we want to show that for all z in C there exists an x in A such that .
i think i'll leave it there for today and come back tomorrow xD
9. (Original post by B_9710)
I'm not sure what you're saying here.
If you have and that are both surjective, we want to show that is surjective.
So basically we want to show that for all z in C there exists an x in A such that .
I have returned lol.

So i handed my questions in and i think for my answer. I put.

I think that works? That was the main argument anyway. I think i'll be ok, thanks a bunch for you help as always

### Related university courses

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: November 11, 2017
Today on TSR

### Top unis in Clearing

Tons of places at all these high-ranking unis

Poll
Useful resources

### Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

### How to use LaTex

Writing equations the easy way

### Study habits of A* students

Top tips from students who have already aced their exams