Thread Closed

One-to-One Functions

 
Share Thread
Feb8-05, 04:23 PM   #1
 

One-to-One Functions


Hi, if anyone could help me with the following question, that'd be great. Thanks in advance =)

Show that the composition of two one-to-one functions, f and g, is one-to-one.

Thank you,

RW Techs
PhysOrg.com science news on PhysOrg.com

>> New language discovery reveals linguistic insights
>> US official: Solar plane to help ground energy use (Update)
>> Four microphones, computer algorithm enough to produce 3-D model of simple, convex room
Feb8-05, 06:54 PM   #2
 
Hmm, I find it hard to believe you have thought about the question, it is very easy.

The composition of the functions is f(g(x)). We know for each x there exists a unique u such that g(x) = u. So f(g(x)) is one to one iff f(u) is one to one, which it is, by assumption.

Transform this in to symbolic logic and you have a proof good enough for an analysis class in which you prove things that are already obviously true.
Feb8-05, 07:28 PM   #3
 
Recognitions:
Homework Helper Homework Help
Science Advisor Science Advisor
start with the definition of one one. i.e. h is one one if whenever x and y are different, thenm also h(x) and h(y) are different......
Feb8-05, 07:54 PM   #4
 

One-to-One Functions


Quote by Crosson
Hmm, I find it hard to believe you have thought about the question, it is very easy.

The composition of the functions is f(g(x)). We know for each x there exists a unique u such that g(x) = u. So f(g(x)) is one to one iff f(u) is one to one, which it is, by assumption.

Transform this in to symbolic logic and you have a proof good enough for an analysis class in which you prove things that are already obviously true.

It appears to me that your proof relies on nothing more than the fact that g is a function. g(x) could be any function, and the "proof" still "works".
Feb9-05, 03:44 AM   #5
 
Recognitions:
Homework Helper Homework Help
Science Advisor Science Advisor
"We know for each x there exists a unique u such that g(x) = u"

That won't work for each function.

Equivalent, but maybe easier to see:
You are given that:
[tex]f(x)=f(y) \Rightarrow x=y[/tex]
and
[tex]g(u)=g(v) \Rightarrow u=v[/tex]
for all x,y in the domain of f and u,v in the domain of g.
You need to show that:

[tex]f(g(u))=f(g(v)) \Rightarrow u=v[/tex]

for all u,v in the domain of g.
Feb9-05, 06:24 AM   #6
 
Recognitions:
Homework Helper Homework Help
Science Advisor Science Advisor
I think crankfan was pointing out that that answer wasn't very clear in its proof. I for one can't stand the "there is a unique" part of it. If you should be of the desire to quantify "there is unique" in logical symbols as pressed by that answer, then you're on hiding to nothing.

Your proof using the f(x)=f(y) => x=y is much clearer.
Feb9-05, 08:00 AM   #7
 
Maybe I was quibbling. I think it's the quantification that I didn't like.

An ordinary function has a unique u in the range associated
with each each x in the domain.

But yes, Galileo's proof is much cleaner.
Feb9-05, 09:42 AM   #8
 
Recognitions:
Homework Helper Homework Help
Science Advisor Science Advisor
Quote by Galileo
"We know for each x there exists a unique u such that g(x) = u"

That won't work for each function.
Whoopsie, that should be the other way around anyway:
For each u in the range of g there is an unique x, such that g(x)=u.
Thread Closed

Similar discussions for: One-to-One Functions
Thread Forum Replies
[SOLVED] sum/integral/zeta functions/ Gamma functions Calculus 3
Functions and Realtions : Operation on Functions [Please Answer NOW. I need it today] Precalculus Mathematics Homework 2
Moment Generating Functions and Probability Density Functions Set Theory, Logic, Probability, Statistics 4
Greatest Integer Functions and odd, even functions Calculus & Beyond Homework 6
Trigonometric Functions..simplify sin squared functions Precalculus Mathematics Homework 2