2.2.9 · D5Functions

Question bank — Inverse functions — finding f⁻¹(x), horizontal line test

1,324 words6 min readBack to topic

This page is a rapid-fire drill of the ideas behind inverses — no heavy algebra, just the traps your brain naturally falls into. Each line is a question ::: answer reveal. Cover the right side, commit to an answer out loud, then check. If you get one wrong, follow the wikilink and re-read.

Parent: Inverse functions (Hinglish version).


True or false — justify

The claim is true.
False. is the reverse machine, defined by ; the reciprocal instead satisfies . Different operations entirely — see Function Composition.
Every function has an inverse.
False. Only one-to-one functions do. If two inputs share an output (like ), the reverse machine cannot decide which input to return.
If passes the vertical line test it must have an inverse.
False. The vertical line test only confirms is a function. Invertibility needs the horizontal line test (each output used at most once).
The graph of is the reflection of across the line .
True. A point on means , so lies on ; swapping coordinates is exactly reflection over .
has no inverse, and nothing can be done about it.
False on the second half. On all of it fails the horizontal line test, but restricting the domain to makes it one-to-one, giving .
If is one-to-one on its domain, then is also one-to-one.
True. The reflection over preserves the "at most one hit per horizontal line" property (horizontal and vertical lines swap under reflection), so the inverse is itself invertible — its inverse is .
The domain of equals the domain of .
False. The domain of equals the range of ; input and output roles swap. See Domain and Range.
Every strictly increasing function is one-to-one.
True. If forces , then unequal inputs always give unequal outputs, so no horizontal line is hit twice.
A function that has an inverse must be a bijection between its domain and range.
True. It must be one-to-one (injective) so the reverse is unambiguous, and onto its range (surjective onto that range) so every output has a source — that's a bijection.
and are inverses of each other on their natural domains.
True. for all real and for ; this is the classic pair in Exponential and Logarithmic Functions.

Spot the error

" inverts to for all real ."
The algebra is right but the domain is missing. Since outputs only , the inverse's domain is ; so only for .
" inverts to ."
The gives two outputs for one input, so it is not a function at all. The real fix is to restrict 's domain first, then take a single branch.
"Swap and in : I get ."
That's not swapping, that's negating a constant. Swapping means writing , then solving to get .
"For the inverse keeps the restriction ."
The restriction moves. The original range excludes (horizontal asymptote), so the inverse's domain excludes : .
"I found with , so is the inverse of ."
Not yet — you must also check . A one-sided identity can hold on a restricted set without being the full two-sided inverse.
" has an inverse, so ."
is outside the restricted range where was made one-to-one, so . Inverse trig only rewinds inputs inside the restricted domain — see Trigonometric Functions.
"To invert I take ."
That is the reciprocal, giving under multiplication, not under composition. The true inverse is .

Why questions

Why does the horizontal line test detect invertibility, rather than the vertical line test?
A horizontal line collects all inputs that share the output ; two intersections mean two inputs map to one output, breaking one-to-one and making reversal ambiguous.
Why do we bother restricting the domain instead of just accepting ?
Because a function must return exactly one output per input. Restricting removes the duplicate branch so the reverse machine gives a single, unambiguous answer.
Why is the swap method () legitimate and not just a trick?
If lies on then lies on ; swapping the letters in the equation literally exchanges the input and output roles, so solving the swapped equation is solving .
Why must the domain and range trade places for ?
The inverse takes outputs of as its inputs and returns the original inputs, so whatever set produced (its range) becomes what consumes (its domain), and vice versa.
Why does verifying with composition catch algebra slips that just "reversing steps" might miss?
Composition tests the definition directly — must collapse to exactly . Any sign error or dropped term leaves a residue that won't simplify to , exposing the mistake.
Why is a strictly monotonic function guaranteed invertible on its domain?
Strict monotonicity means the output never repeats a value as the input moves, so every horizontal line meets the graph at most once — the exact condition for one-to-one.

Edge cases

Does the constant function have an inverse?
No. Every input maps to , so infinitely many inputs share one output — the line hits the graph everywhere, failing the horizontal line test completely.
Is (the identity) its own inverse?
Yes. It sends every input to itself, so reversing does nothing; trivially, and its reflection over is itself.
Can a function equal its own inverse without being the identity?
Yes — such functions are called self-inverse (involutions). Example: satisfies , yet it is not the identity.
What happens to at an -value that was excluded from 's range, like for ?
It is undefined there. The excluded output of becomes an excluded input of , showing up as a denominator zero in .
Is invertible without any domain restriction?
Yes. Cube root is defined and strictly increasing on all of , so it passes the horizontal line test everywhere; both and have domain and range .
If is only defined on a single point, say domain with , does it have an inverse?
Yes, a trivial one: has domain with . One-to-one is satisfied vacuously since there's only one input.
Recall Quick self-test

Statement: "Passing the vertical line test guarantees an inverse." ::: False — that only guarantees is a function; you need the horizontal line test for invertibility. Statement: " and are the same." ::: False — the first undoes by composition, the second is a reciprocal under multiplication. Statement: "Domain of = range of ." ::: True — input/output roles swap, so 's domain becomes 's range.