Paper 4, Section I, E
What does it mean to say that a function has an inverse? Show that a function has an inverse if and only if it is a bijection.
Let and be functions from a set to itself. Which of the following are always true, and which can be false? Give proofs or counterexamples as appropriate.
(i) If and are bijections then is a bijection.
(ii) If is a bijection then and are bijections.
Typos? Please submit corrections to this page on GitHub.