Real Analysis/Inverse Functions
In this chapter, we will be formalizing the definition and the intuitive behaviors of an inverse function. In earlier mathematics, you may have been taught a cursory amount on the subject, such as their reflection on the Template:Math line or a list of functions and their inverses. You may have been taught the inverse trigonometric functions as a hand-wavy method to get an angle from the lengths of an imaginary triangle. You may have understood that the nth root is the inverse of an nth power. Here, we will formalize it—give it meaning and thus give it intrigue. Yet, many theorems related to inverse functions will not be immediately useful or understandable unless other concepts have been constructed beforehand. Thus, sections of this chapter may contain notices for any concepts needed beforehand.
Construction
The construction of the inverse function can be done in two methods. The first method is to simply define the inverse function outright. We will not define it in that manner in this wikibook. Instead, we will define it as a consequence of a new operation. We will define inverse functions in this manner because it assumes less concepts and gives us a new operator to work with (It will be used in a very important concept in this chapter). This section of this chapter will express how we will follow the second method in order to define it.
Inverse OperatorThe definition of an inverse is a straightforward modification to a function; simply reverse the ordering of each number in every ordered pair. But can you imagine if this definition is too simple? For example, would this definition work for Template:Math? Given that Template:Math, the inversion will have the situation where there exists two ordered pairs such that Template:Math, which breaks the definition of a function. Given that this issue may arise when dealing with inverse functions, we can begin to craft a workaround to that problem immediately. Although the inverse of the function Template:Math is not a function, we have only defined the definition of inverting a function. We have not defined an inverse function. To prevent issues like Template:Math, we will define an inverse function. However, we will not define an inverse function separately, but as a theorem. Why? so inverse functions become a resulting property of the inverse operator instead of being a separate class. Mathematics is built on principals that simple rules implies more complex ones. Shall we begin? |
Inverse Function TheoremTemplate:TextBox Template:TextBox With this theorem, we can build our definition of an inverse function off the back of our initial definition of the inverse operator. However, did you notice that we slipped in another definition? We have this extra definition in place because this will allow us to sidestep a potential definition conflict. What counts as a one-one function? Surprisingly, not all the functions you imagine when you imagine functions count. The identity function Template:Math is one-one, but not the square function Template:Math. Your favorite trigonometric functions Template:Math are not one-one functions. However, this piecewise function
is one-one. Now that we cleared ourselves from the need to find examples, let us prove this theorem. |
Proof
The proof naturally follows from the definition, if set up correctly.
| Assert that Template:Math is a function and suppose any two pairs Template:Math |
| Suppose that Template:Math This implies that Template:Math |
| This means that the inverse function Template:Math will have Template:Math |
| Our assertion that Template:Math is a function must mean Template:Math |
| Template:Math and Template:Math is simply the negated definition for one-one. |
We also declared that the corollary, the biconditionality of the previous theorem, is true as well; let's prove that too.
| Assert that Template:Math is a one-one function. |
| Suppose two pairs Template:Math from the inverted function Template:Math |
| This implies that the function Template:Math has the pairs Template:Math |
| Our assertion that Template:Math is one-one must mean Template:Math |
| The same input Template:Math from the inverted function Template:Math gives the same output, i.e. Template:Math, is simply the definition of a function. |
Notation
There is a small list of naming conventions associated with inverse functions that are designed to make things less confusing. Typical ordered pair names, such as Template:Math or Template:Math should be used to reflect the inverse function's nature of reversing ordered pairs. For example, Template:Math or Template:Math complements the naming convention of Template:Math and Template:Math respectively.
Theorems
The curious aspect of inverse functions is its ability to create new definitions of known functions and theorems by, in a sense, reversing known functions and theorems. We will first start with proving very simple consequences from the theorem defining inverse functions, then we will move to a curious proof relating to algebra, then we will advance into calculus by proving differentiation properties.
Basic Properties
If it was not obvious, there one seemingly necessary property that ought be easily derived from the definition.
| Involution Law | Template:Math |
|---|---|
| Template:Math |
Proof
The proof relies on an application of function and inverse function definitions.
| Template:Math | Template:Math |
|---|---|
| The function Template:Math maps Template:Math | The function Template:Math maps Template:Math |
| The inverse function Template:Math maps Template:Math | The inverse function Template:Math maps Template:Math |
The results of this proof seems to justify its notation; simply "cancel" out inverses of functions if the functions are composed on each other as if it was multiplication of a variable Template:Math and its inverse Template:Math It also proves our intuitive notion that we ought have a way to undo mathematical operations.
Algebra
Now that we have proven the intuitive understanding that the inverse function is the opposite of the function, we can work on the second part necessary to justify algebra, which is that of algebraic reversibility. Algebraic reversibility is the mathematical concept closely related to "if and only if"—the ability to apply an operation that can be reversed by applying the opposite operation. We will prove this concept now.
Proof
This proof will rely only on applying the definition of an inverse function.
| Given that , we can use a variable x such that . This will simplify communication tremendously. | |
| Given the definition of an inverse function, we can state that the variable x can map to the value at f-1 of x, which is a as defined by (why a? Use the Involution Law from the section just earler. | |
| Because f(b) = f(a) and that we are working with a function f, we can claim that b can also map to the value at f-1 of x. | |
| Combined together, the relationship becomes clear. |
|
Continuity
We will begin by proving that an inverse function is continuous if the original function is continuous. Why are we proving this as opposed to discontinuous functions? Well, on the chapter on limits, we discussed that discontinuity is the not special case. If it is not the special case, it usually has fewer properties to work with and does not need further expansion. THus, we will focus on continuity preservation. As a notice, this theorem requires proving some parts and combining it together. This will mean that the theorem itself will be very long. The theorem itself is written below.
Note that from the inverse function definition we have already proved that all inverse functions Template:Math are one-one. From there, you might be a little daunted at the process you would have to undergo. However, this is a textbook so we will be your guide.
First, we will need to prove a separate theorem that will be instrumental in piecing the proof together. This theorem is below.
To prove this, we will use the intermediate value theorem.

| Increasing | Decreasing | |
|---|---|---|
| Choose two values a, b, and c such that Template:Math and that | Template:Math | Template:Math |
| Suppose | Template:Math | Template:Math |
| Then using the intermediate value theorem between Template:Math and Template:Math, you get another point that equals Template:Math for a one-one function. Contradiction | ||
| Suppose | Template:Math | Template:Math |
| Also a contradiction using the same reasoning for the interval between Template:Math and Template:Math for the point Template:Math. | ||
| Template:Math must go in between. | ||
From this theorem, we will use it to prove our initial theorem regarding continuity. As usual, we will focus on increasing in our proof, as we can emulate decreasing functions by negating the given function. The proof is an epsilon-delta proof.
| A refresher on the definition of continuity and its associated epsilon-delta meaning | |
| We first break down the absolute value notation of the epsilon-delta definition and apply some substitutions using our established naming conventions (In fact, we swap the inverse for the normal and the normal into the inverse). | |
| Given the epsilon inequality on the right side, we know that in between minus and plus ε must be the following value. | Template:Math |
| Given that the function Template:Math is continuous and one-one, we can apply the theorem we just proved to imply that | Template:Math |
| Let's suppose that | Template:Math |
| This relationship can then be verified [The proof is up to you] | Template:Math and Template:Math |
| Let's suppose that, given a range, that some variable x exists between them. | Template:Math |
| We'll apply the relationship written above | Template:Math |
| Given that the increasing function Template:Math implies that Template:Math is increasing, | Template:Math |
| This shows that given a delta, you can imply an epsilon out of it. |
"The Reciprocal Definition" Property
This following definition that the concept of the inverse function provides is for a derivative definition, in which the derivative of the inverse is known.
Template:TextBox Template:TextBox
As always, this theorem works if you reverse whether the inverse function is inside or outside. We will not be discussing a proof for now. Why? The proof requires both continuity - something we haven't even verified to exist for inverses yet - and differentiation - something we also haven't verified to work for inverse functions. However, we will discuss the intuition behind this property, which we will show below if this property is not intuitive.
| Template:Math | Template:Math | |
|---|---|---|
| Given the inverse function relationship | Template:Math | Template:Math |
| Derivative of x | Template:Math | Template:Math |
| Template:Math | Template:Math | |
Differentiation
Earlier on in the section on inverse functions, we have readily declared that the formula for calculating the derivative of an inverse function, in relationship to the derivative of the original function, as Template:Math. However, it contained a caveat that Template:Math The proof should be readily inferred from the formula itself (Hint: Substitute Template:Math). We shown in that section that this can be derived from an application of Chain Rule with an appendix that it actually isn't a proof. We stated that it isn't because we have not worked out whether differentiation works for inverse functions. Well, since we proved that continuity works if the original function is continuous, we now need to check if differentiation also works (since differentiation requires continuity).
Exercises
- Prove that all periodic functions will not have an inverse function.
- Prove that all non-restricted even functions Template:Math will not have an inverse function.
