Why One-to-One and Onto Matter — Cheat sheet

Choose “Save as PDF” in the print dialog.
On this page

Key method

If f:A→Bf:A\to B is bijective, then f−1:B→Af^{-1}:B\to A satisfies

f−1(f(x))=x,f^{-1}(f(x))=x, f(f−1(y))=y.f(f^{-1}(y))=y.

Surjectivity guarantees existence of the reverse assignment; injectivity guarantees uniqueness.

Example

The function f:[0,∞)→[0,∞)f:[0,\infty)\to[0,\infty), f(x)=x2f(x)=x^2, is bijective. Its inverse is x\sqrt x. If its domain expands to all real numbers, uniqueness is lost. If its codomain expands to all real numbers, some targets have no preimage.

Avoid this mistake

An inverse is not a reciprocal: f−1(x)f^{-1}(x) usually differs from 1/f(x)1/f(x).