Tag Archives: invertible

Ways to prove a bijection

You have a function and want to prove it is a bijection. What can you do? By the book A bijection is defined as a function which is both one-to-one and onto. So prove that is one-to-one, and prove that … Continue reading

Posted in logic, proof | Tagged , , , , , , , , | 6 Comments

One-sided inverses, surjections, and injections

Several commenters correctly answered the question from my previous post: if we have a function and such that for every , then is not necessarily invertible. Here are a few counterexamples: Commenter Buddha Buck came up with probably the simplest … Continue reading

Posted in logic | Tagged , , , , , , | 1 Comment

Test your intuition: bijections

Suppose we have sets and and a function (that is, ’s domain is and its codomain is ). Suppose there is another function such that for every . Is necessarily a bijection? That is, does necessarily match up each element … Continue reading

Posted in logic | Tagged , , , | 12 Comments