Fact-checked by Grok 2 weeks ago

Inverse function

In , an inverse function is a that "reverses" or "undoes" the action of another , such that composing the two functions in either order yields the on their respective . If f is a with A and B, and g is its with B and A, then f(g(x)) = x for all x in B, and g(f(x)) = x for all x in A. The is typically denoted by f^{-1}, and for f to have an , it must be bijective, meaning both injective () and surjective (onto). The concept of inverse functions is fundamental in various branches of mathematics, including , , and , as it formalizes the idea of solving equations and reversing transformations. For example, the e^x and the natural logarithm \ln x are inverses of each other, where \ln(e^x) = x for all real x and e^{\ln x} = x for x > 0. Graphically, the of f^{-1} is the reflection of the graph of f across the line y = x, preserving the functional relationship but swapping inputs and outputs. Not all functions possess inverses; non-bijective functions, such as constant functions or those that fail the horizontal line test, do not. In , inverse functions enable the study of and integrals of non-elementary functions, with the derivative formula \frac{d}{dx} [f^{-1}(x)] = \frac{1}{f'(f^{-1}(x))} providing a tool for . functions also underpin applications in fields like physics (e.g., inverse problems in imaging and ) and (e.g., ), where reversible mappings are essential.

Definitions and Notation

Inverses via Composition

In mathematics, the concept of an inverse function is fundamentally defined through the property of composition with the identity function. Specifically, for functions f: A \to B and g: B \to A, the function g is said to be an inverse of f if the compositions satisfy f \circ g = \mathrm{id}_B and g \circ f = \mathrm{id}_A, where \mathrm{id}_B denotes the identity function on B (mapping each element to itself) and \mathrm{id}_A is the identity on A. This means that applying f followed by g returns every element in B to itself, and applying g followed by f returns every element in A to itself. This two-sided inverse condition distinguishes it from one-sided inverses. A left inverse g satisfies only g \circ f = \mathrm{id}_A, which holds if and only if f is injective (one-to-one), ensuring that distinct elements in A map to distinct elements in B. Conversely, a right inverse g satisfies only f \circ g = \mathrm{id}_B, which holds if and only if f is surjective (onto), ensuring every element in B is reached by some element in A. A two-sided inverse exists precisely when f is bijective, combining both injectivity and surjectivity, guaranteeing a unique inverse that fully reverses the mapping. Bijectivity is thus a prerequisite for the existence of such inverses, where injectivity prevents "collapsing" of inputs and surjectivity ensures complete coverage of the . Without bijectivity, no can have a two-sided inverse under this compositional definition, though partial or one-sided inverses may still apply in restricted contexts.

Standard Notation

The standard notation for the inverse of a f is f^{-1}, where the superscript -1 specifically indicates functional inversion rather than reciprocation or . This notation is read aloud as "f " and applies to the as a whole, such that f^{-1}(x) denotes the value that, when composed with f, returns the . The raised -1 is an integral part of the symbol and not an exponent in the usual sense. A key implication of this notation is the interchange of and between f and f^{-1}: the of f^{-1} consists of all values in the of f, while the of f^{-1} matches the of f. This swapping ensures that f^{-1} reverses the mapping defined by f. Alternatively, the inverse may be denoted by assigning a separate function name, such as g = f^{-1}, or through explicit functional names for well-known cases, like arcsin for the sine. Care must be taken to distinguish f^{-1}(x) from the reciprocal $1/f(x), as the former undoes the action of f while the latter performs pointwise division; this superficial similarity in notation often leads to confusion, particularly among introductory students. The inverse notation f^{-1} originated with John Frederick William Herschel in 1813, initially for , and was later generalized. In the , inverse functions were typically described verbally or through specific examples rather than uniform symbols, but by the early , this evolved into the modern standardized notation amid broader advancements in .

Basic Examples

Quadratic and Radical Functions

Quadratic functions provide a fundamental example for understanding inverses, particularly the need for domain restrictions to ensure bijectivity in the real numbers. Consider the function f(x) = x^2. Over all real numbers, this function is not one-to-one, as distinct inputs like x = 1 and x = -1 produce the same output f(1) = f(-1) = 1, violating injectivity and preventing the existence of an inverse function. To remedy this, the domain is restricted to x \geq 0, where f(x) = x^2 maps bijectively onto [0, \infty), allowing for a well-defined inverse f^{-1}(x) = \sqrt{x} defined for x \geq 0. This restriction transforms the parabola into a monotonically increasing branch, ensuring the function is both injective and surjective over the specified sets. The process of deriving the inverse algebraically highlights the role of principal branches in selecting single-valued outputs. Starting with y = x^2, solving for x yields x = \pm \sqrt{y}, reflecting the two possible real solutions for most positive y. However, to maintain a (single output per input), the non-negative principal is chosen: x = \sqrt{y}, or equivalently, f^{-1}(y) = \sqrt{y}. This choice aligns with the restricted domain of the original , producing a as the inverse, which is itself and onto over [0, \infty). Verification that these are indeed inverses proceeds through composition, confirming they undo each other on their respective domains. For the forward composition, f(f^{-1}(x)) = f(\sqrt{x}) = (\sqrt{x})^2 = x holds for all x \geq 0. For the reverse, f^{-1}(f(x)) = \sqrt{x^2} = |x|, which simplifies to x under the restriction x \geq 0. Thus, both compositions yield the on the appropriate domains, establishing the inverse relationship. Graphically, the inverse manifests as a reflection of the original function's across the line y = x. The right half of the parabola y = x^2 (for x \geq [0](/page/0)) reflects to form the y = \sqrt{x}, a concave-down branch starting at the and increasing through the first , visually confirming the inherent to functions.

Exponential and Logarithmic Functions

The f(x) = e^x, where e \approx 2.71828 is the base of the natural logarithm, is a classic example of a function with an inverse. Its inverse is the natural logarithm f^{-1}(x) = \ln(x), defined for x > 0. To verify, the f(f^{-1}(x)) = e^{\ln(x)} = x holds for x > 0, and f^{-1}(f(x)) = \ln(e^x) = x holds for all real x. This relationship extends to exponential functions with arbitrary base a > 0, a \neq 1, given by f(x) = a^x. The inverse is the logarithm f^{-1}(x) = \log_a(x) for x > 0. The change of base formula expresses \log_a(x) in terms of the natural logarithm: \log_a(x) = \frac{\ln(x)}{\ln(a)}. The a^x is defined for all real x with (0, \infty), ensuring surjectivity onto the positive , which becomes the of \log_a(x). Conversely, \log_a(x) has (0, \infty) and all real numbers, matching the domain of a^x. These restrictions arise because the logarithm is undefined for non-positive arguments. Logarithms play a key role in solving equations, such as $2^x = y where y > 0, yielding x = \log_2(y). Logarithms were introduced in the early by in 1614, whose work provided a geometric leading to functions proportional to modern natural logarithms (inverses of exponentials), with Henry Briggs refining them into common logarithms (base 10) by 1624.

Computing Inverses

Algebraic Derivation

To derive an explicit formula for the inverse f^{-1} of a given f, begin by setting y = f(x). This expresses the output of f in terms of its input. Next, apply algebraic operations to solve for x in terms of y, isolating the variable x on one side of the . Once solved, interchange the roles of x and y by replacing y with x and vice versa, yielding the formula for f^{-1}(x). This process assumes f is invertible and produces a function that undoes the original . Consider the f(x) = 2x + 3. Start with y = 2x + 3. Subtract 3 from both sides to get y - 3 = 2x, then divide by 2: x = \frac{y - 3}{2}. Replacing y with x gives f^{-1}(x) = \frac{x - 3}{2}. The of f^{-1} is all real numbers, matching the range of f, while the range of f^{-1} is all real numbers, aligning with the of f. This confirms the inverse's validity over the appropriate domains. This algebraic method applies primarily to invertible algebraic functions, such as polynomials or rational expressions, where solving yields a unique expression. However, for functions involving even or other operations that introduce multiple solutions, the may produce multiple branches, requiring selection of the principal branch to define a single-valued . To ensure accuracy, isolate the dependent variable systematically during solving, avoiding extraneous steps that could complicate the expression. After , verify the s and s explicitly, as the inverse's domain is the original function's range, and adjust for any restrictions arising from the solving process. A common pitfall is proceeding with the derivation without first confirming the function's bijectivity—being both injective (one-to-one) and surjective (onto its range)—which is necessary for the existence of an inverse; failure to check this can lead to invalid or incomplete results.

Graphical Representation

The graphical representation of an inverse function provides an intuitive way to visualize its relationship to the original . The graph of the inverse function f^{-1} is obtained by reflecting the graph of f over the line y = x. This arises because if (a, b) lies on the of f, where b = f(a), then (b, a) lies on the of f^{-1}, effectively swapping the roles of the input and output. To construct the graph of f^{-1}, select key points on the graph of f and swap their coordinates to plot corresponding points for the inverse; connecting these points yields the reflected curve. This point-swapping method directly illustrates the symmetry, and for more complex graphs, the entire plot can be reflected across y = x using geometric transformation. For instance, consider f(x) = x^3; its graph passes through points like (1, 1) and (-1, -1), and since swapping coordinates yields the same points, the graph of f^{-1}(x) = x^{1/3} coincides with that of f, demonstrating perfect symmetry over y = x. Visually, the reflection highlights the swap between the and : the horizontal extent of f's (its ) becomes the vertical extent of f^{-1}'s (its ), and . To ensure an inverse exists and its represents a function, apply the horizontal line test to f's : no horizontal line should intersect it more than once, confirming injectivity. The verifies that f's defines a . The of f becomes the of f^{-1}, and for the to exist as a , f must be injective over its , which is confirmed by the horizontal line test: no horizontal line intersects the more than once. Practical tools facilitate this visualization. Graphing software such as or TI-84 calculators allows users to plot f and its inverse simultaneously, overlaying the line y = x to observe the clearly. An accessible involves tracing f's graph on translucent paper and folding along y = x to superimpose the inverse, revealing the symmetric alignment.

Core Properties

Existence and Uniqueness

A function f: A \to B between sets A and B possesses a two-sided inverse function if and only if it is bijective, meaning it is both injective () and surjective (onto). This fundamental theorem establishes the precise conditions for invertibility in and function analysis. The inverse f^{-1}: B \to A satisfies f \circ f^{-1} = \mathrm{id}_B and f^{-1} \circ f = \mathrm{id}_A, where \mathrm{id} denotes the . To see that the existence of an inverse implies bijectivity, suppose g: B \to A is an of f. For injectivity, if f(a) = f(b) for a, b \in A, then applying g yields g(f(a)) = g(f(b)), so a = b. For surjectivity, every b \in B satisfies b = f(g(b)), ensuring b is in the image of f. Conversely, if f is bijective, an inverse can be constructed explicitly: for each b \in B, surjectivity guarantees at least one a \in A with f(a) = b, and injectivity ensures this a is unique; define g(b) = a. Then f \circ g = \mathrm{id}_B by construction, and g \circ f = \mathrm{id}_A follows from injectivity. The inverse, when it exists, is unique. If g: B \to A and h: B \to A both serve as inverses for f, then g = g \circ \mathrm{id}_B = g \circ (f \circ h) = (g \circ f) \circ h = \mathrm{id}_A \circ h = h. Functions failing bijectivity lack an inverse. For non-injectivity, consider f(x) = x^2 from \mathbb{R} to \mathbb{R}; here f(1) = f(-1) = 1, so it is not and admits no inverse over the reals. For non-surjectivity, the f(x) = e^x from \mathbb{R} to \mathbb{R} maps to (0, \infty), missing all non-positive reals, and thus has no inverse on this codomain despite being injective.

Graphical Symmetry

The graphs of a function f and its inverse f^{-1} exhibit symmetry with respect to the line y = x. Specifically, reflecting the graph of f over the line y = x yields the graph of f^{-1}. This reflection property arises because the inverse relation swaps the roles of the input and output values. If a point (a, b) lies on the graph of f, meaning f(a) = b, then the point (b, a) lies on the graph of f^{-1}, since f^{-1}(b) = a. This interchange of coordinates ensures that the graphs are mirror images across y = x. As a consequence, f is strictly increasing if and only if f^{-1} is strictly increasing, and similarly for strictly decreasing functions; the monotonicity is preserved under inversion. For strictly increasing functions, the concavity of the graphs reverses: if f is concave up in a certain interval, then f^{-1} is concave down in the corresponding interval, and vice versa. For strictly decreasing functions, the concavity sign is preserved, due to the geometric effect of the reflection swapping the axes. Graphical tests provide visual checks for properties essential to invertibility. The horizontal line test assesses injectivity: a function f is if no horizontal line intersects its more than once. For surjectivity, the ensures the represents a , but full surjectivity requires that the covers the intended , observable as every relevant horizontal line intersecting the at least once. These tests, when applied to the reflected of the inverse, confirm the . Certain symmetry types in functions influence their inverses. Odd functions, which satisfy f(-x) = -f(x) and exhibit rotational symmetry about the origin, have inverses that are also odd, provided the inverse exists; this preserves the origin symmetry under reflection over y = x. In contrast, even functions, satisfying f(-x) = f(x) with reflection symmetry over the y-axis, are generally not one-to-one over symmetric domains and thus require restriction to be invertible. A classic illustration of these symmetries is the hyperbola defined by xy = 1, which consists of the graphs of f(x) = 1/x (for x > 0) and its inverse f^{-1}(x) = 1/x (for y > 0), forming symmetric branches across y = x. This self-inverse relation highlights the reflection property, with the curve's monotonicity (decreasing) and concavity (downward for x > 0) preserved in the mirrored branch.

Derivative Formulas

If y = f^{-1}(x), then the derivative is given by (f^{-1})'(x) = \frac{1}{f'(f^{-1}(x))}, provided f'(f^{-1}(x)) \neq 0. This formula arises from implicit differentiation. Starting with the equation x = f(y), where y = f^{-1}(x), differentiate both sides with respect to x: $1 = f'(y) \cdot \frac{dy}{dx}. Solving for \frac{dy}{dx} yields \frac{dy}{dx} = \frac{1}{f'(y)}, and substituting y = f^{-1}(x) gives the result. For example, consider f(x) = e^x, so f^{-1}(x) = \ln x and f'(x) = e^x. Then, (\ln x)' = \frac{1}{e^{\ln x}} = \frac{1}{x}, which matches the known of the natural logarithm. Higher-order derivatives can be obtained by further . For the second derivative, let g(x) = f^{-1}(x), so g'(x) = \frac{1}{f'(g(x))}. Differentiating using the (or equivalently, the chain rule on the reciprocal) gives g''(x) = -\frac{f''(g(x)) \cdot g'(x)}{[f'(g(x))]^2} = -\frac{f''(g(x))}{[f'(g(x))]^3}, since g'(x) = \frac{1}{f'(g(x))}. This expression involves the second derivative of the original function f. These formulas enable approximations of inverse functions using linearization. Near a point x_0 where f'(f^{-1}(x_0)) \neq 0, the linear approximation is f^{-1}(x) \approx f^{-1}(x_0) + \frac{x - x_0}{f'(f^{-1}(x_0))}, providing a first-order estimate for solving equations or numerical computations.

Special Cases

Self-Inverse Functions

A self-inverse function, also known as , is a function f: A \to A such that f \circ f equals the on A, meaning f(f(x)) = x for every x in the domain A. Equivalently, f serves as its own inverse, so f^{-1} = f. Such functions must be bijective, as the existence of an (even if it coincides with the original ) requires both injectivity and surjectivity. The on any set X is a trivial example of a self- . Common examples include the f(x) = -x over the real numbers, since f(f(x)) = -(-x) = x. Another is the reciprocal f(x) = 1/x for x \neq 0, as f(f(x)) = 1/(1/x) = x. Reflections like f(x) = a - x for some constant a also satisfy the condition, with f(f(x)) = a - (a - x) = x. Geometrically, the of a self-inverse is symmetric with respect to the line y = x, reflecting the fact that the roles of input and output are interchangeable. Fixed points, where f(x) = x, represent intersections of the with the line y = x. In applications, self-inverse functions model reflections in , where applying the twice returns to the original position. In cryptography, they enable simple schemes where the same operation decodes the message, as the function is its own . Within permutation groups, involutions correspond to elements of order dividing 2, consisting solely of fixed points and 2-cycles.

Periodic and Multivalued Inverses

Periodic functions, such as the , are not injective over the entire real line because they repeat values periodically with period $2\pi. For instance, \sin(x) = \sin(x + 2k\pi) for any k, violating the requirement for a standard inverse . To define an inverse, the must be restricted to an where the function is bijective, such as [- \pi/2, \pi/2] for the sine function. Without domain restriction, the inverse of a periodic function like sine is multivalued. The general inverse relation for \sin^{-1}(y) consists of all x such that \sin(x) = y, given by x = \arcsin(y) + 2k\pi or x = \pi - \arcsin(y) + 2k\pi for any integer k, where \arcsin(y) denotes a principal value. This set captures the infinite solutions arising from the periodicity and symmetry of the sine wave. To obtain a single-valued function, a principal branch is selected by convention. For the arcsine function, the principal branch is defined with domain [-1, 1] and range [- \pi/2, \pi/2], ensuring the output angle lies in the interval where sine is bijective and covers all possible values from -1 to 1 exactly once. Similarly, for the inverse cosine, the principal branch has domain [-1, 1] and range [0, \pi]. In the , the multivalued nature of these inverses is more pronounced, often requiring Riemann surfaces to represent all branches continuously, though typically focuses on the principal branch for practical computations.

Generalizations

Partial Inverses

A partial inverse of a function f: D \to R is defined on a subset of the codomain R such that f becomes bijective onto its image after restricting the domain of f to an appropriate subset where it is injective. This approach enables the existence of an inverse when f is not one-to-one over its full domain. To construct a partial inverse, select a maximal subset D' \subseteq D on which f is injective, ensuring f: D' \to f(D') is bijective; the partial inverse f^{-1} is then the unique function satisfying f(f^{-1}(y)) = y for y \in f(D') and f^{-1}(f(x)) = x for x \in D'. For example, the function f(x) = x^2 over \mathbb{R} is not injective, but restricting to D' = [0, \infty) yields the bijective map to [0, \infty), with partial inverse \sqrt{y} on [0, \infty). Partial inverses generalize full inverses by allowing the inverse to be non-total, defined solely on the image of the restricted domain rather than the entire codomain. A classic illustration is the arctangent function \arctan: \mathbb{R} \to (-\pi/2, \pi/2), which acts as the partial inverse of \tan restricted to (-\pi/2, \pi/2), where \tan is bijective onto \mathbb{R}. Key properties of partial inverses include uniqueness within the specified branch or domain restriction, as the restricted function's bijectivity guarantees a unique inverse on that subset. Additionally, composing f with its partial inverse f^{-1} produces the identity function on f(D') (a partial identity), and f^{-1} \circ f yields the identity on D', preserving the inverse relationship locally. These partial inverses relate to multivalued inverses by selecting a single injective branch to ensure single-valuedness.

Left and Right Inverses

In the context of functions between sets, a left inverse of a function f: A \to B is a function g: B \to A satisfying g \circ f = \mathrm{id}_A, on A. The existence of such a g implies that f is , as f(x_1) = f(x_2) would yield x_1 = g(f(x_1)) = g(f(x_2)) = x_2. Conversely, every admits at least one left inverse, constructed by setting g(y) = x for y in of f where f(x) = y (choosing one such x if multiple preimages exist, though injectivity ensures uniqueness), and arbitrarily mapping elements outside to elements of A. A right inverse of f: A \to B is a function h: B \to A such that f \circ h = \mathrm{id}_B. This condition implies that f is surjective, since every y \in B satisfies y = f(h(y)). Every has at least one right inverse, often requiring the to select preimages for each element in B. If a function possesses both a left inverse g and a right inverse h, then g = h, and this common function serves as the two-sided , with f being bijective. Consider the surjective but non-injective function f: \mathbb{Z} \to \mathbb{N} \cup \{0\} defined by f(n) = |n|. A right inverse exists, for example, h(k) = k for all k \geq 0, satisfying f(h(k)) = |k| = k = \mathrm{id}_{\mathbb{N} \cup \{0\}}(k), though other choices like h(k) = -k for k > 0 also work. No left inverse exists, as f fails injectivity (f(1) = f(-1) = 1). In contrast, the injective but non-surjective inclusion f: \mathbb{N} \to \mathbb{Z} given by f(n) = n admits left inverses, such as g(z) = z if z \geq 0 and g(z) = 0 otherwise, but no right inverse, since negative integers lack preimages. Left inverses, when they exist, are unique if and only if f is also surjective (making f bijective and the inverse two-sided). Otherwise, they differ on the complement of the of f. Similarly, right inverses are unique if and only if f is injective. These notions extend naturally to abstract settings like monoids, where a left inverse of an element a satisfies b a = e for the e, implying cancellativity, and to categories, where left and right inverses of morphisms correspond to split epimorphisms and monomorphisms, respectively, while two-sided inverses define isomorphisms.