#Must a function be bijective in order to have an inverse function, or is injectivity enough
35 messages · Page 1 of 1 (latest)
- Do not ping the Moderators, unless someone is breaking the rules.
- Do not ping the Helper Moderators, unless there is a conflict between helpers.
- Do not ping other members randomly for help.
- Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
- Wait patiently for a helper to come along.
- If the Helper has answered your question, remember to thank them with the Mathematics Ranks bot and close the thread with:
+close
Feel free to nominate the person for helper of the week in #helper-nominations
If you're happy with the help you got here, and the server overall, you can contribute financially as well:
Technically speaking, an inverse function only exists for a bijective function. However, if a function is injective but not surjective, you can create a bijective function by restricting the range to the image of the domain.
Unable to parse the channel name
fuck you @potent kernel
I'm prepared to give an example.
oh ok
Let f(x) = e^x.
Now, if we define f as from the reals to the reals, it's only injective.
wait
ok
it's not surjective
because
f(x) can't equal 0.3534983498629693756935
for example
...no, it can.
Why do you think it can't?
surjective means
everything in y
is mapped to by an x
what x maps to 0.3534983498629693756935
Right, and f here is not surjective, but why do you think that value in particular is not mapped to?
because i just spammed numbers on my keyboard
...so?
+close
Please thank the helpers who assisted you by clicking the buttons below. You can thank each helper only once. Once you're done, click "Close Post" to close this thread.
Wait.
Thank you for your feedback! Techie Literate has been awarded 1
. They now have 837
. They have 1
daily left for today.