Inverse Functions
Learning goals
- Require both compositions to be the identity
- Prove the inverse unique from associativity
- Tie invertibility to being one-to-one onto the range
- Swap the ordered pairs, which the horizontal line test measures
- Trade domain for range between the two functions
- Restrict a domain knowing the choice is not unique
An inverse must undo f from both sides
Give the idea its definition. A function is an inverse of when composing the two in either order returns the identity:
Read both halves. The first, for every in the domain of , says undoes : feed through and brings it back. The second, for every in the domain of , says undoes the same way. Reversing has to work in both directions, and we insist on both because one alone can hold while the other fails. The example that shows this is the heart of the lesson.
Worked example 1 One side is not enough
Let with domain all real numbers, and let with domain . Test both compositions.
Start with . For any ,
so is the identity on the domain of . Stop here and you would call the inverse of . Now test the other order:
This equals when , but for it gives , not . For instance . So is not the identity on the domain of ; it collapses every negative input to its positive twin. The function undoes from one side only. Squaring throws away the sign, and no square root can restore a sign that is already gone. A one-sided inverse is not an inverse, which is exactly why the definition demands both compositions.
Check your understanding
For on all real numbers and on , a student checks that and concludes . Why is the conclusion wrong?
An inverse must satisfy both and . Here only the second holds.
For this is , so fails to undo on the negative inputs. A one-sided inverse is not an inverse.
When both sides do hold, the verification is a short two-part check, and skipping either part is the most common way to get an inverse wrong.
Worked example 2 A two-sided verification
Show that is the inverse of , both on all real numbers.
Check first, substituting into :
Now check , substituting into :
Both compositions return for every real number, and both functions have all of as their domain, so . Each line undid the other: the first cancelled “times two then plus one” by “minus one then over two,” and the second ran that cancellation in the opposite order.
There is only one inverse
Because the definition is two-sided, a function cannot have two different inverses. This is the payoff of the previous lesson’s hardest theorem, associativity, and it is what earns us the right to write “the” inverse and give it a name.
The inverse is unique#
Suppose and are both inverses of . Write for the domain of and for its range, so sends to while and send back to . Being inverses means and , and likewise and .
Now run a single chain and justify each step:
The first equality composes with the identity on , its own domain, which changes nothing. The second replaces by , equal to it because is an inverse of . The third is the associative law from the previous lesson, and it is the one place the whole argument rests on it. The fourth uses , and the last drops the identity on . So : any two inverses of are the same function.
Because there is at most one, we may speak of the inverse of and give it the name . Notice that associativity is not a decoration here. Without it the middle step would fail, and the phrase “the inverse” would not even be well defined.
That name carries a warning you first met at the end of the previous lesson. The superscript in marks the inverse for composition, and it never means the reciprocal . For the inverse is , while the reciprocal is a completely different function. Keep for undoing and for dividing.
Which functions can be inverted
Not every function has an inverse; Worked Example 1 already met one that does not. The question is which do, and the answer is the cleanest statement in the chapter, provided we say one thing about the codomain out loud and then never forget it.
Throughout the rest of this lesson, take a function’s codomain to be its range, the set of values it actually outputs. A function is one-to-one when different inputs always give different outputs, equivalently when forces . With the codomain fixed as the range, invertibility and one-to-oneness are the same condition.
With codomain taken as the range, is invertible exactly when it is one-to-one#
Take with domain and codomain its range , so every element of equals for at least one .
Suppose first that is one-to-one. Each is for at least one , because is the range, and for at most one , because is one-to-one, so for exactly one. Define to be that unique . Then for every we get , since is the one input that sends to , so . Likewise, for every we get , since was chosen as an input that sends to , so . Both sides hold, so is a two-sided inverse.
Conversely, suppose has an inverse . If , apply to both sides. Because ,
so equal outputs force equal inputs and is one-to-one. That settles both directions.
The codomain hypothesis is not decoration, and dropping it is the classic way this statement turns false. If the codomain is left larger than the range, some declared output is never actually produced, and no can satisfy there. That is because is always a genuine output of , and it can never equal a value that misses. With a larger codomain the correct condition is that be both one-to-one and onto, that is a bijection. Taking the codomain to be the range is exactly what makes “onto” automatic, and that leaves one-to-one as the only thing to check. Whenever this lesson says “invertible” it means “one-to-one, as a map onto its range.”
Worked example 3 Finding an inverse, then proving it
Find the inverse of on all real numbers, and verify it on both sides.
First, the function is one-to-one: if then , and
forces , because the second factor is positive except at . So an inverse exists. To find it, write and solve for :
Renaming the input, the candidate is . Verify both orders:
Both give across all of , so is confirmed. Solving for produced a candidate; the two-sided check is what turned the candidate into a proof.
Worked example 4 Inverting a linear-fractional rule
Find the inverse of on , and state the domain of the inverse.
Write and solve for . Clear the denominator, then gather every term containing on one side:
Now factor out of the left side and divide:
So . The move that carries any linear-fractional rule is exactly this one, collect the terms, factor, then divide. For the domain, the inputs of are the values actually produces, and never outputs , since forces , which is impossible. So excludes , matching the denominator of the formula .
Check your understanding
Taking each function's codomain to be its range, which one has an inverse?
With the codomain taken as the range, a function has an inverse exactly when it is one-to-one, so test each rule for a repeated output.
The first, second, and fourth rules send and to the same output, so they are not one-to-one. Only never repeats an output, so only it has an inverse.
The question Chapter one asked
The first lesson of this chapter, Relations and Functions, opened with a claim that can now be cashed in. It said that whether a set of points is a function depends on which variable you feed in. It added: the horizontal line test is nothing but the vertical line test asked about the other variable, and swapping the two variables reflects the whole picture across . It promised that this swap is exactly what forming an inverse would mean. Here is that promise paid.
A function is, underneath, its set of input-output pairs . Swapping the two coordinates of every pair produces a new set of points,
the inverse relation: the same pairings read backward, output first. That swapped relation is a function of its first coordinate exactly when no two of its pairs share that first coordinate. That in turn means no two pairs of share the same second coordinate, which means no two inputs of produce the same output. That last phrase is one-to-one, and on a graph it is the horizontal line test applied to . So the swapped relation is a function precisely when is one-to-one, and only then is there an inverse function .
This is the chapter closing on itself. Being a function was never a property of a curve; it was a property of a curve together with a choice of input. Inverting is the act of changing that choice, feeding in what used to come out. The vertical line test on the swapped picture is the horizontal line test on the original. So the two questions, “can be undone” and “does pass the horizontal line test”, were the same question in two costumes all along.
Restricting the domain is a real choice
Worked Example 1 showed that on all real numbers has no inverse, because it fails the horizontal line test: . The standard repair is to shrink the domain until the rule becomes one-to-one. It is worth being honest about what that move is. You are not fixing ; by the equality test of the Function Notation lesson, a rule together with a smaller domain is a different function. Restricting the domain replaces the function that had no inverse with a neighbouring one that does.
Worked example 5 Two honest restrictions of
The rule becomes one-to-one on the inputs , and also on the inputs . Find the inverse in each case.
On the domain , the outputs are all the , and the input that produced a given is the nonnegative square root:
Check the awkward side: , which holds because .
On the domain , the same outputs now arrive from negative inputs, so the inverse is the negative root:
Check: , using for .
Both restrictions are legitimate, and they give different inverses, and . So there is no such thing as the restriction that makes invertible; there is a choice, and the choice is part of the answer. This is the same honesty the transformations and composition lessons practised when they refused to call a non-unique decomposition “the” decomposition.
Domain and range trade places
The pair-swap picture makes one more fact plain, and it is worth stating as a small theorem. When you reverse every pair into , the first and second coordinates switch roles. So the inputs of are the outputs of , and the outputs of are the inputs of .
and #
By the definition of the inverse, carries an output of back to the input it came from, so its allowed inputs are exactly the values actually produces. That set is the range of , giving .
For the other equation, returns inputs of , and it returns every one of them, since each is handed back from by the relation . So the outputs of are precisely , giving .
This is the structural version of a fact the earlier lessons kept circling: the domain is genuine data. Inverting does not merely flip a formula; it swaps the two sets a function lives between. In the example just above, on has range , and its inverse has domain and range , the two sets traded exactly as the theorem says.
Reading the inverse off the graph
The coordinate swap has a picture. A point lies on the graph of exactly when , and that is exactly when lies on the graph of . So the graph of is the set of points as runs over the graph of . The map that sends every point to is reflection in the line : it fixes that line and exchanges the horizontal and vertical directions. Therefore the graph of is the mirror image of the graph of across . That is not by decree but because inverting is swapping coordinates, and swapping coordinates is that reflection.
Reflection across also preserves a graph’s direction, and this is worth pinning down because it is easy to assume without proof. If is increasing, so is . To see it, take two values in the range of and pull them back through , writing and , so and . If held, the increasing would give , that is , contradicting ; so , which says . A rising graph reflects to a rising graph, and by the same argument a falling one reflects to a falling one.
That mirror is a reliable way to picture an inverse, and it is also where a tempting falsehood creeps in, the kind this chapter has spent six lessons hunting. It is often said that the graphs of and can meet only on the line . That is false. The reflection carries the two graphs into each other, so their set of common points is symmetric across . But a set can be symmetric across a line without lying on it. The extreme case is a function that is its own inverse: satisfies , so the graph of and the graph of are the very same curve. The two graphs therefore meet at every one of its points, including , which is nowhere near . A non-degenerate example makes the point without that coincidence.
Worked example 6 Where meets its inverse
The function on all real numbers is one-to-one, and its inverse is , the negative of the real cube root. Find every point the two graphs share.
A shared point is an with , so set the two rules equal:
Cube both sides to clear the root, writing as :
The solutions are and , that is and . Read off the meeting points: at the graphs meet at , which lies on ; at they meet at ; and at they meet at . Check the last two on both graphs: and , so sits on each; and with , so does too. Two of the three meeting points, and , are not on . The claim that intersections can happen only on that line is simply wrong.
There is a true statement nearby, and keeping it apart from the false one is the whole discipline of this chapter. If , then is a fixed point: the point lies on , and since as well, it lies on both graphs. So every fixed point is a common point sitting on the line . That is the one direction that holds. Its converse, that every common point is such a fixed point, is the claim Worked Example 6 just refuted. For a strictly increasing the two directions do coincide, and then every intersection really does land on , which is why the false version sounds right. But increasing is a hypothesis, not a general truth, and is decreasing, so it is free to break the pattern.
Check your understanding
Which statement about the graphs of a one-to-one function and its inverse is correct?
The graphs are reflections of each other across , but that does not confine their crossings to that line.
so lies on both graphs and is nowhere near . What is always true is the other direction: any point with lies on both graphs, on the line .