A function and its inverse undo each other — quick review
Think of a coat check.
Two functions f and g are inverses of each other exactly when g(f(x)) = x for every x in the domain of f, and f(g(x)) = x for every x in the domain of g. Then g = f⁻¹, the domain of g is the range of f, the range of g is the domain of f, and the point (a, b) is on the graph of f exactly when (b, a) is on the graph of g. The two graphs are mirror images across the line y = x.
Write the domain beside each function, including any cut. The domains decide the last step of the check.
Build f(g(x)): copy the rule of f, and wherever f has x, write the whole rule of g in parentheses.
Tidy up. Squaring undoes a square root, cubing undoes a cube root, and opposite steps such as + 3 and − 3 cancel. The result must be exactly x, with nothing left over.
Build g(f(x)) the same way, with the whole rule of f inside g, and tidy up.
If a square root of a square appears, such as , write it as |x| first. Then use the domain to decide whether |x| is x or −x.
If both orders give x, the two functions are inverses. Say where each result holds: f(g(x)) = x on the domain of g, and g(f(x)) = x on the domain of f.
Check with a number. Pick an allowed input a, compute b = f(a), and confirm that g(b) = a. The points (a, b) and (b, a) are mirror images across y = x.
Let f(x) = + 3 on the restricted domain x ≥ 0, and let g(x) = . Show that g is the inverse function of f by checking both orders, and name a pair of mirrored points.
f(g(x)) = x for every x ≥ 3
g(f(x)) = x for every x ≥ 0
So g = f⁻¹ on these domains. The point (2, 7) on f mirrors to (7, 2) on g.
Checking one order only, or dropping the domain. With f(x) = on all real numbers and g(x) = , the order f(g(x)) = ( = x works, yet g(f(−3)) = = 3, not −3. Always work both orders, write as |x|, and write the domain beside each result.
Write each function with its domain beside it.
Compute f(g(x)) by putting the whole rule of g, in parentheses, where f has x. Tidy up.
Compute g(f(x)) by putting the whole rule of f, in parentheses, where g has x. Tidy up.
Replace any square root of a square, , with |something|, and use the domain to remove the bars.
If both orders give exactly x, state that they are inverses and on which inputs each result holds.
Confirm with one number and its mirrored point: f(a) = b should come with g(b) = a.
inverse function
The function that undoes another function. If f turns 3 into 7, then the inverse, written , turns 7 back into 3.
one-to-one function
A function in which every output comes from only one input. No two inputs share an output, so no horizontal line meets its graph twice.
restricted domain
A domain made smaller on purpose. You keep only part of the inputs, such as x ≥ 0, so that the function becomes one-to-one and can have an inverse.
square root function
The function f(x) = , or a shifted or stretched copy of it. It accepts only inputs that keep the inside 0 or more. Its graph is half of a sideways parabola.
cube root function
The function f(x) = , or a shifted or stretched copy of it. It asks what number, used as a factor three times, gives x. It accepts every real number, negatives included.