Inverse function
Template:Short description Template:Distinguish Template:Use dmy dates
Template:Functions In mathematics, the inverse function of a function Template:Mvar (also called the inverse of Template:Mvar) is a function that undoes the operation of Template:Mvar. The inverse of Template:Mvar exists if and only if Template:Mvar is bijective, and if it exists, is denoted by <math>f^{-1} .</math>
For a function <math>f\colon X\to Y</math>, its inverse <math>f^{-1}\colon Y\to X</math> admits an explicit description: it sends each element <math>y\in Y</math> to the unique element <math>x\in X</math> such that Template:Math.
As an example, consider the real-valued function of a real variable given by Template:Math. One can think of Template:Mvar as the function which multiplies its input by 5 then subtracts 7 from the result. To undo this, one adds 7 to the input, then divides the result by 5. Therefore, the inverse of Template:Mvar is the function <math>f^{-1}\colon \R\to\R</math> defined by <math>f^{-1}(y) = \frac{y+7}{5} .</math>
DefinitionsEdit
Let Template:Mvar be a function whose domain is the set Template:Mvar, and whose codomain is the set Template:Mvar. Then Template:Mvar is invertible if there exists a function Template:Mvar from Template:Mvar to Template:Mvar such that <math>g(f(x))=x</math> for all <math>x\in X</math> and <math>f(g(y))=y</math> for all <math>y\in Y</math>.<ref name=":2">{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>
If Template:Mvar is invertible, then there is exactly one function Template:Mvar satisfying this property. The function Template:Mvar is called the inverse of Template:Mvar, and is usually denoted as Template:Math, a notation introduced by John Frederick William Herschel in 1813.<ref name="Herschel_1813"/><ref name="Herschel_1820"/><ref name="Peirce_1852"/><ref name="Peano_1903"/><ref name="Cajori_1929"/><ref group="nb" name="NB2"/>
The function Template:Mvar is invertible if and only if it is bijective. This is because the condition <math>g(f(x))=x</math> for all <math>x\in X</math> implies that Template:Mvar is injective, and the condition <math>f(g(y))=y</math> for all <math>y\in Y</math> implies that Template:Mvar is surjective.
The inverse function Template:Math to Template:Mvar can be explicitly described as the function
- <math>f^{-1}(y)=(\text{the unique element }x\in X\text{ such that }f(x)=y)</math>.
Template:AnchorInverses and compositionEdit
Recall that if Template:Mvar is an invertible function with domain Template:Mvar and codomain Template:Mvar, then
- <math> f^{-1}\left(f(x)\right) = x</math>, for every <math>x \in X</math> and <math> f\left(f^{-1}(y)\right) = y</math> for every <math>y \in Y </math>.
Using the composition of functions, this statement can be rewritten to the following equations between functions:
- <math> f^{-1} \circ f = \operatorname{id}_X</math> and <math>f \circ f^{-1} = \operatorname{id}_Y, </math>
where Template:Math is the identity function on the set Template:Mvar; that is, the function that leaves its argument unchanged. In category theory, this statement is used as the definition of an inverse morphism.
Considering function composition helps to understand the notation Template:Math. Repeatedly composing a function Template:Math with itself is called iteration. If Template:Mvar is applied Template:Mvar times, starting with the value Template:Mvar, then this is written as Template:Math; so Template:Math, etc. Since Template:Math, composing Template:Math and Template:Math yields Template:Math, "undoing" the effect of one application of Template:Mvar.
NotationEdit
While the notation Template:Math might be misunderstood,<ref name=":2" /> Template:Math certainly denotes the multiplicative inverse of Template:Math and has nothing to do with the inverse function of Template:Mvar.<ref name="Cajori_1929"/> The notation <math>f^{\langle -1\rangle}</math> might be used for the inverse function to avoid ambiguity with the multiplicative inverse.<ref>Helmut Sieber und Leopold Huber: Mathematische Begriffe und Formeln für Sekundarstufe I und II der Gymnasien. Ernst Klett Verlag.</ref>
In keeping with the general notation, some English authors use expressions like Template:Math to denote the inverse of the sine function applied to Template:Mvar (actually a partial inverse; see below).<ref>Template:Harvnb</ref><ref name="Cajori_1929"/> Other authors feel that this may be confused with the notation for the multiplicative inverse of Template:Math, which can be denoted as Template:Math.<ref name="Cajori_1929"/> To avoid any confusion, an inverse trigonometric function is often indicated by the prefix "arc" (for Latin {{#invoke:Lang|lang}}).<ref name="Korn_2000"/><ref name="Atlas_2009"/> For instance, the inverse of the sine function is typically called the arcsine function, written as Template:Math.<ref name="Korn_2000"/><ref name="Atlas_2009"/> Similarly, the inverse of a hyperbolic function is indicated by the prefix "ar" (for Latin {{#invoke:Lang|lang}}).<ref name="Atlas_2009"/> For instance, the inverse of the hyperbolic sine function is typically written as Template:Math.<ref name="Atlas_2009"/> The expressions like Template:Math can still be useful to distinguish the multivalued inverse from the partial inverse: <math>\sin^{-1}(x) = \{(-1)^n \arcsin(x) + \pi n : n \in \mathbb Z\}</math>. Other inverse special functions are sometimes prefixed with the prefix "inv", if the ambiguity of the Template:Math notation should be avoided.<ref name="Hall_1909"/><ref name="Atlas_2009"/>
ExamplesEdit
Squaring and square root functionsEdit
The function Template:Math given by Template:Math is not injective because <math>(-x)^2=x^2</math> for all <math>x\in\R</math>. Therefore, Template:Mvar is not invertible.
If the domain of the function is restricted to the nonnegative reals, that is, we take the function <math>f\colon [0,\infty)\to [0,\infty);\ x\mapsto x^2</math> with the same rule as before, then the function is bijective and so, invertible.<ref>Template:Harvnb</ref> The inverse function here is called the (positive) square root function and is denoted by <math>x\mapsto\sqrt x</math>.
Standard inverse functionsEdit
The following table shows several standard functions and their inverses:
Function Template:Math | Inverse Template:Math | Notes |
---|---|---|
Template:Math | Template:Math | |
Template:Math | Template:Math | |
Template:Math | Template:Sfrac | Template:Math |
Template:Sfrac (i.e. Template:Math) | Template:Sfrac (i.e. Template:Math) | Template:Math |
Template:Math | <math>\sqrt[p]y</math> (i.e. Template:Math) | integer Template:Math; Template:Math if Template:Math is even |
Template:Math | Template:Math | Template:Math and Template:Math and Template:Math |
Template:Math | Template:Math | Template:Math and Template:Math |
trigonometric functions | inverse trigonometric functions | various restrictions (see table below) |
hyperbolic functions | inverse hyperbolic functions | various restrictions |
Formula for the inverseEdit
Many functions given by algebraic formulas possess a formula for their inverse. This is because the inverse <math>f^{-1} </math> of an invertible function <math>f\colon\R\to\R</math> has an explicit description as
- <math>f^{-1}(y)=(\text{the unique element }x\in \R\text{ such that }f(x)=y)</math>.
This allows one to easily determine inverses of many functions that are given by algebraic formulas. For example, if Template:Mvar is the function
- <math>f(x) = (2x + 8)^3 </math>
then to determine <math>f^{-1}(y) </math> for a real number Template:Mvar, one must find the unique real number Template:Mvar such that Template:Math. This equation can be solved:
- <math>\begin{align}
y & = (2x+8)^3 \\ \sqrt[3]{y} & = 2x + 8 \\
\sqrt[3]{y} - 8 & = 2x \\ \dfrac{\sqrt[3]{y} - 8}{2} & = x . \end{align}</math>
Thus the inverse function Template:Math is given by the formula
- <math>f^{-1}(y) = \frac{\sqrt[3]{y} - 8} 2.</math>
Sometimes, the inverse of a function cannot be expressed by a closed-form formula. For example, if Template:Mvar is the function
- <math>f(x) = x - \sin x ,</math>
then Template:Mvar is a bijection, and therefore possesses an inverse function Template:Math. The formula for this inverse has an expression as an infinite sum:
- <math> f^{-1}(y) =
\sum_{n=1}^\infty
\frac{y^{n/3}}{n!} \lim_{ \theta \to 0} \left( \frac{\mathrm{d}^{\,n-1}}{\mathrm{d} \theta^{\,n-1}} \left( \frac \theta { \sqrt[3]{ \theta - \sin( \theta )} } \right)^n
\right). </math>
PropertiesEdit
Since a function is a special type of binary relation, many of the properties of an inverse function correspond to properties of converse relations.
UniquenessEdit
If an inverse function exists for a given function Template:Mvar, then it is unique.<ref name="Wolf72">Template:Harvnb</ref> This follows since the inverse function must be the converse relation, which is completely determined by Template:Mvar.
SymmetryEdit
There is a symmetry between a function and its inverse. Specifically, if Template:Mvar is an invertible function with domain Template:Mvar and codomain Template:Mvar, then its inverse Template:Math has domain Template:Mvar and image Template:Mvar, and the inverse of Template:Math is the original function Template:Mvar. In symbols, for functions Template:Math and Template:Math,<ref name=Wolf72 />
- <math>f^{-1}\circ f = \operatorname{id}_X </math> and <math> f \circ f^{-1} = \operatorname{id}_Y.</math>
This statement is a consequence of the implication that for Template:Mvar to be invertible it must be bijective. The involutory nature of the inverse can be concisely expressed by<ref>Template:Harvnb</ref>
- <math>\left(f^{-1}\right)^{-1} = f.</math>
The inverse of a composition of functions is given by<ref>Template:Harvnb</ref>
- <math>(g \circ f)^{-1} = f^{-1} \circ g^{-1}.</math>
Notice that the order of Template:Mvar and Template:Mvar have been reversed; to undo Template:Mvar followed by Template:Mvar, we must first undo Template:Mvar, and then undo Template:Mvar.
For example, let Template:Math and let Template:Math. Then the composition Template:Math is the function that first multiplies by three and then adds five,
- <math>(g \circ f)(x) = 3x + 5.</math>
To reverse this process, we must first subtract five, and then divide by three,
- <math>(g \circ f)^{-1}(x) = \tfrac13(x - 5).</math>
This is the composition Template:Math.
Self-inversesEdit
If Template:Mvar is a set, then the identity function on Template:Mvar is its own inverse:
- <math>{\operatorname{id}_X}^{-1} = \operatorname{id}_X.</math>
More generally, a function Template:Math is equal to its own inverse, if and only if the composition Template:Math is equal to Template:Math. Such a function is called an involution.
Graph of the inverseEdit
If Template:Mvar is invertible, then the graph of the function
- <math>y = f^{-1}(x)</math>
is the same as the graph of the equation
- <math>x = f(y) .</math>
This is identical to the equation Template:Math that defines the graph of Template:Mvar, except that the roles of Template:Mvar and Template:Mvar have been reversed. Thus the graph of Template:Math can be obtained from the graph of Template:Mvar by switching the positions of the Template:Mvar and Template:Mvar axes. This is equivalent to reflecting the graph across the line Template:Math.<ref>Template:Harvnb</ref><ref name=":2" />
Inverses and derivativesEdit
By the inverse function theorem, a continuous function of a single variable <math>f\colon A\to\mathbb{R}</math> (where <math>A\subseteq\mathbb{R}</math>) is invertible on its range (image) if and only if it is either strictly increasing or decreasing (with no local maxima or minima). For example, the function
- <math>f(x) = x^3 + x</math>
is invertible, since the derivative Template:Math is always positive.
If the function Template:Mvar is differentiable on an interval Template:Mvar and Template:Math for each Template:Math, then the inverse Template:Math is differentiable on Template:Math.<ref>Template:Harvnb</ref> If Template:Math, the derivative of the inverse is given by the inverse function theorem,
- <math>\left(f^{-1}\right)^\prime (y) = \frac{1}{f'\left(x \right)}. </math>
Using Leibniz's notation the formula above can be written as
- <math>\frac{dx}{dy} = \frac{1}{dy / dx}. </math>
This result follows from the chain rule (see the article on inverse functions and differentiation).
The inverse function theorem can be generalized to functions of several variables. Specifically, a continuously differentiable multivariable function Template:Math is invertible in a neighborhood of a point Template:Mvar as long as the Jacobian matrix of Template:Mvar at Template:Mvar is invertible. In this case, the Jacobian of Template:Math at Template:Math is the matrix inverse of the Jacobian of Template:Mvar at Template:Mvar.
Real-world examplesEdit
- Let Template:Mvar be the function that converts a temperature in degrees Celsius to a temperature in degrees Fahrenheit, <math display="block"> F = f(C) = \tfrac95 C + 32 ;</math> then its inverse function converts degrees Fahrenheit to degrees Celsius, <math display="block"> C = f^{-1}(F) = \tfrac59 (F - 32) ,</math><ref name=":1">{{#invoke:citation/CS1|citation
|CitationClass=web }}</ref> since <math display="block"> \begin{align} f^{-1} (f(C)) = {} & f^{-1}\left( \tfrac95 C + 32 \right) = \tfrac59 \left( (\tfrac95 C + 32 ) - 32 \right) = C, \\ & \text{for every value of } C, \text{ and } \\[6pt] f\left(f^{-1}(F)\right) = {} & f\left(\tfrac59 (F - 32)\right) = \tfrac95 \left(\tfrac59 (F - 32)\right) + 32 = F, \\ & \text{for every value of } F. \end{align} </math>
- Suppose Template:Mvar assigns each child in a family its birth year. An inverse function would output which child was born in a given year. However, if the family has children born in the same year (for instance, twins or triplets, etc.) then the output cannot be known when the input is the common birth year. As well, if a year is given in which no child was born then a child cannot be named. But if each child was born in a separate year, and if we restrict attention to the three years in which a child was born, then we do have an inverse function. For example, <math display="block">\begin{align}
f(\text{Allan})&=2005 , \quad & f(\text{Brad})&=2007 , \quad & f(\text{Cary})&=2001 \\ f^{-1}(2005)&=\text{Allan} , \quad & f^{-1}(2007)&=\text{Brad} , \quad & f^{-1}(2001)&=\text{Cary}
\end{align} </math>
- Let Template:Mvar be the function that leads to an Template:Mvar percentage rise of some quantity, and Template:Mvar be the function producing an Template:Mvar percentage fall. Applied to $100 with Template:Mvar = 10%, we find that applying the first function followed by the second does not restore the original value of $100, demonstrating the fact that, despite appearances, these two functions are not inverses of each other.
- The formula to calculate the pH of a solution is Template:Math. In many cases we need to find the concentration of acid from a pH measurement. The inverse function Template:Math is used.
GeneralizationsEdit
Partial inversesEdit
Even if a function Template:Mvar is not one-to-one, it may be possible to define a partial inverse of Template:Mvar by restricting the domain. For example, the function
- <math>f(x) = x^2</math>
is not one-to-one, since Template:Math. However, the function becomes one-to-one if we restrict to the domain Template:Math, in which case
- <math>f^{-1}(y) = \sqrt{y} . </math>
(If we instead restrict to the domain Template:Math, then the inverse is the negative of the square root of Template:Mvar.)
Full inversesEdit
Alternatively, there is no need to restrict the domain if we are content with the inverse being a multivalued function:
- <math>f^{-1}(y) = \pm\sqrt{y} . </math>
Sometimes, this multivalued inverse is called the full inverse of Template:Mvar, and the portions (such as Template:Sqrt and −Template:Sqrt) are called branches. The most important branch of a multivalued function (e.g. the positive square root) is called the principal branch, and its value at Template:Mvar is called the principal value of Template:Math.
For a continuous function on the real line, one branch is required between each pair of local extrema. For example, the inverse of a cubic function with a local maximum and a local minimum has three branches (see the adjacent picture).
Trigonometric inversesEdit
The above considerations are particularly important for defining the inverses of trigonometric functions. For example, the sine function is not one-to-one, since
- <math>\sin(x + 2\pi) = \sin(x)</math>
for every real Template:Mvar (and more generally Template:Math for every integer Template:Mvar). However, the sine is one-to-one on the interval Template:Closed-closed, and the corresponding partial inverse is called the arcsine. This is considered the principal branch of the inverse sine, so the principal value of the inverse sine is always between −Template:Sfrac and Template:Sfrac. The following table describes the principal branch of each inverse trigonometric function:<ref>Template:Harvnb</ref>
function | Range of usual principal value |
---|---|
arcsin | Template:Math |
arccos | Template:Math |
arctan | Template:Math |
arccot | Template:Math |
arcsec | Template:Math |
arccsc | Template:Math |
Left and right inversesEdit
Function composition on the left and on the right need not coincide. In general, the conditions
- "There exists Template:Mvar such that Template:Math" and
- "There exists Template:Mvar such that Template:Math"
imply different properties of Template:Mvar. For example, let Template:Math denote the squaring map, such that Template:Math for all Template:Mvar in Template:Math, and let Template:Math denote the square root map, such that Template:MathTemplate:Radic for all Template:Math. Then Template:Math for all Template:Mvar in Template:Closed-open; that is, Template:Mvar is a right inverse to Template:Mvar. However, Template:Mvar is not a left inverse to Template:Mvar, since, e.g., Template:Math.
Left inversesEdit
If Template:Math, a left inverse for Template:Mvar (or retraction of Template:Mvar ) is a function Template:Math such that composing Template:Mvar with Template:Mvar from the left gives the identity function<ref>Template:Cite book</ref> <math display="block">g \circ f = \operatorname{id}_X\text{.}</math> That is, the function Template:Mvar satisfies the rule
- If Template:Math, then Template:Math.
The function Template:Mvar must equal the inverse of Template:Mvar on the image of Template:Mvar, but may take any values for elements of Template:Mvar not in the image.
A function Template:Mvar with nonempty domain is injective if and only if it has a left inverse.<ref>Template:Cite book</ref> An elementary proof runs as follows:
- If Template:Mvar is the left inverse of Template:Mvar, and Template:Math, then Template:Math.
If nonempty Template:Math is injective, construct a left inverse Template:Math as follows: for all Template:Math, if Template:Mvar is in the image of Template:Mvar, then there exists Template:Math such that Template:Math. Let Template:Math; this definition is unique because Template:Mvar is injective. Otherwise, let Template:Math be an arbitrary element of Template:Mvar.
For all Template:Math, Template:Math is in the image of Template:Mvar. By construction, Template:Math, the condition for a left inverse.
In classical mathematics, every injective function Template:Mvar with a nonempty domain necessarily has a left inverse; however, this may fail in constructive mathematics. For instance, a left inverse of the inclusion Template:Math of the two-element set in the reals violates indecomposability by giving a retraction of the real line to the set Template:Math.<ref>Template:Cite journal</ref>
Right inversesEdit
A right inverse for Template:Mvar (or section of Template:Mvar ) is a function Template:Math such that
- <math>f \circ h = \operatorname{id}_Y . </math>
That is, the function Template:Mvar satisfies the rule
- If <math>\displaystyle h(y) = x</math>, then <math>\displaystyle f(x) = y .</math>
Thus, Template:Math may be any of the elements of Template:Mvar that map to Template:Mvar under Template:Mvar.
A function Template:Mvar has a right inverse if and only if it is surjective (though constructing such an inverse in general requires the axiom of choice).
- If Template:Mvar is the right inverse of Template:Mvar, then Template:Mvar is surjective. For all <math>y \in Y</math>, there is <math>x = h(y)</math> such that <math>f(x) = f(h(y)) = y</math>.
- If Template:Mvar is surjective, Template:Mvar has a right inverse Template:Mvar, which can be constructed as follows: for all <math>y \in Y</math>, there is at least one <math>x \in X</math> such that <math>f(x) = y</math> (because Template:Mvar is surjective), so we choose one to be the value of Template:Math.<ref>Template:Cite book</ref>
Two-sided inversesEdit
An inverse that is both a left and right inverse (a two-sided inverse), if it exists, must be unique. In fact, if a function has a left inverse and a right inverse, they are both the same two-sided inverse, so it can be called the inverse.
- If <math>g</math> is a left inverse and <math>h</math> a right inverse of <math>f</math>, for all <math>y \in Y</math>, <math>g(y) = g(f(h(y)) = h(y)</math>.
A function has a two-sided inverse if and only if it is bijective.
- A bijective function Template:Mvar is injective, so it has a left inverse (if Template:Mvar is the empty function, <math>f \colon \varnothing \to \varnothing</math> is its own left inverse). Template:Mvar is surjective, so it has a right inverse. By the above, the left and right inverse are the same.
- If Template:Mvar has a two-sided inverse Template:Mvar, then Template:Mvar is a left inverse and right inverse of Template:Mvar, so Template:Mvar is injective and surjective.
PreimagesEdit
If Template:Math is any function (not necessarily invertible), the preimage (or inverse image) of an element Template:Math is defined to be the set of all elements of Template:Mvar that map to Template:Mvar:
- <math>f^{-1}(y) = \left\{ x\in X : f(x) = y \right\} . </math>
The preimage of Template:Mvar can be thought of as the image of Template:Mvar under the (multivalued) full inverse of the function Template:Mvar.
The notion can be generalized to subsets of the range. Specifically, if Template:Mvar is any subset of Template:Mvar, the preimage of Template:Mvar, denoted by <math>f^{-1}(S) </math>, is the set of all elements of Template:Mvar that map to Template:Mvar:
- <math>f^{-1}(S) = \left\{ x\in X : f(x) \in S \right\} . </math>
For example, take the function Template:Math. This function is not invertible as it is not bijective, but preimages may be defined for subsets of the codomain, e.g.
- <math>f^{-1}(\left\{1,4,9,16\right\}) = \left\{-4,-3,-2,-1,1,2,3,4\right\}</math>.
The original notion and its generalization are related by the identity <math>f^{-1}(y) = f^{-1}(\{y\}),</math> The preimage of a single element Template:Math – a singleton set Template:Math – is sometimes called the fiber of Template:Mvar. When Template:Mvar is the set of real numbers, it is common to refer to Template:Math as a level set.
See alsoEdit
- Lagrange inversion theorem, gives the Taylor series expansion of the inverse function of an analytic function
- Integral of inverse functions
- Inverse Fourier transform
- Reversible computing
NotesEdit
ReferencesEdit
BibliographyEdit
- Template:Cite book
- Template:Cite book
- Template:Cite book
- Template:Cite book
- Template:Cite book
- Template:Cite book
- Template:Cite book