QED
Functions · step 4 of 13

Inverse functions

f has an inverse function exactly when it is bijective, and then f⁻¹ undoes it: f⁻¹(f(x)) = x and f(f⁻¹(y)) = y. Finding f⁻¹ means solving y = f(x) for x, and the domain and codomain swap in the process. When f is not injective you can often restrict the domain to make it so — which is exactly how √ and arcsin are defined.

Unlimited questions · marked criterion by criterion · no card needed

Method: how to approach it

The order below is what examiners expect to see, and each step carries its own marks.

  1. Confirm bijectivity firstNo inverse exists otherwise. If f is not injective, restrict the domain and say so explicitly.
  2. Set y = f(x) and solve for xRearrange to express x in terms of y. Every step must be reversible.
  3. Swap the rolesWrite f⁻¹(y) = your expression. The domain of f⁻¹ is the codomain (image) of f and vice versa.
  4. Verify both compositionsCheck f⁻¹(f(x)) = x and f(f⁻¹(y)) = y. One direction alone only proves a one-sided inverse.

Worked example

Find the inverse of f : [0,∞) → [0,∞), f(x) = x² + 1 — first fixing its codomain.

  1. On [0,∞) the function is injective (x² is increasing there), and its image is [1, ∞), so take the codomain to be [1,∞).
  2. Set y = x² + 1, so x² = y − 1.
  3. On the domain x ≥ 0 we take the positive root: x = √(y − 1).
  4. Check: f⁻¹(f(x)) = √(x² + 1 − 1) = √(x²) = x for x ≥ 0 ✓.

Answer. f⁻¹ : [1,∞) → [0,∞), f⁻¹(y) = √(y − 1).

Where marks get dropped

These are the specific errors that cost credit on inverse functions questions — QED's rubric penalises each of them separately.

Practise this until it is automatic

Unlimited fresh questions

QED generates new inverse functions problems on demand at warm-up, exam and challenge level, so you can drill this one skill until it stops costing you marks.

Marked like an examiner

Every answer is scored against a point-by-point rubric with partial credit, so you see exactly which step of the method broke down — not just a tick or a cross.

Answer in real notation

A one-tap symbol palette, a visual equation editor and a truth-table builder — or photograph your handwritten working and QED converts it to LaTeX.

Saved to your library

Every question you generate is kept and re-takeable as a timed exam, and your Functions mastery is tracked so you know when this is exam-ready.

Inverse functions — frequently asked questions

Why must f be bijective?

Injectivity ensures each output has at most one origin (so f⁻¹ is single-valued), and surjectivity ensures each element of the codomain has at least one (so f⁻¹ is total).

What is a left inverse?

A g with g∘f = id, which exists exactly when f is injective. A right inverse satisfies f∘g = id and exists when f is surjective. A two-sided inverse needs both.

How does the graph relate?

The graph of f⁻¹ is the reflection of the graph of f in the line y = x, which is why a horizontal-line test on f is a vertical-line test on f⁻¹.

The rest of Functions

Injective, surjective, bijective, composition, inverse. Each subtopic below has its own method, worked example and mark-losing traps.

Ready to make inverse functions exam-proof?

Generate your first questions free — no card, no setup, no personal data stored. Practise until the method is second nature.

Start practising free →