Find if functions f, g, g(f) are injective, surjective, invertible and find inverse functions if they exist.
Determine the function f(g).
These are functions:
Welcome to Math Help Forum!
First, it's often a good idea to put some numbers in, and see what comes out. I assume that - which you don't tell me, but we need to know. In other words, we can put real numbers in (the domain) and get ordered triples of real numbers out (the range). For example:Now a function is injective (one-to-one) whenever . In other words, you can't have two different elements in the domain mapped onto the same element in the range.
So the first question you need to answer is: can you put two different real numbers into and get the same ordered triple out? If the answer is no, then is injective.
The next question is: is surjective? It's surjective if the codomain (the things that actually come out of ) is the whole of the range; in other words, can we find a real number to put in to that will produce any ordered triple we like, as output?
Well can you? Can you, for instance, find an that will produce as output?
Is invertible? In other words, for a given output is there one and only one input? If is injective, then the answer is yes.
Finally, takes the output of , and feeds it through . Try a number and see what happens:Now try it with :
OK, over to you. See what you can come up with.
Thanks for help.
Yes, I forgot to mention: and
The explanation was useful.
Just, I`m not sure how to prove that functions are surjective, etc., without putting an example, like the one you mentioned (0,0,0), putting just variable that represents any real number.
I can do it when dimension of domain and range is 1, .