“Inverse function”的意思、由来-开放百科全书

In mathematics, an inverse function (or anti-function^[1]) is a function that "reverses" another function: if the function {{mvar|f}} applied to an input {{mvar|x}} gives a result of {{mvar|y}}, then applying its inverse function {{mvar|g}} to {{mvar|y}} gives the result {{mvar|x}}, and vice versa, i.e., {{math|1=f(x) = y}} if and only if {{math|1=g(y) = x}}.^[2]^[3]

As an example, consider the real-valued function of a real variable given by {{math|1=f(x) = 5x − 7}}. Thinking of this as a step-by-step procedure (namely, take a number {{mvar|x}}, multiply it by 5, then subtract 7 from the result), to reverse this and get {{mvar|x}} back from some output value, say {{mvar|y}}, we should undo each step in reverse order. In this case that means that we should add 7 to {{mvar|y}} and then divide the result by 5. In functional notation this inverse function would be given by,

With {{math|1=y = 5x − 7}} we have that {{math|1=f(x) = y}} and {{math|1=g(y) = x}}.

Not all functions have inverse functions. In order for a function {{math|f: X → Y}} to have an inverse, it must have the property that for every {{mvar|y}} in {{mvar|Y}} there must be one, and only one {{mvar|x}} in {{mvar|X}} so that {{math|1=f(x) = y}}. This property ensures that a function {{math|g: Y → X}} will exist having the necessary relationship with {{mvar|f}}.

Definitions

Let {{mvar|f}} be a function whose domain is the set {{mvar|X}}, and whose image (range) is the set {{mvar|Y}}. Then {{mvar|f}} is invertible if there exists a function {{mvar|g}} with domain {{mvar|Y}} and image {{mvar|X}}, with the property:

If {{mvar|f}} is invertible, the function {{mvar|g}} is unique,^[1] which means that there is exactly one function {{mvar|g}} satisfying this property (no more, no less). That function {{mvar|g}} is then called the inverse of {{mvar|f}}, and is usually denoted as {{math|f⁻¹}}.

Stated otherwise, a function, considered as a binary relation, has an inverse if and only if the converse relation is a function on the range {{mvar|Y}}, in which case the converse relation is the inverse function.^[2]

Not all functions have an inverse. For a function to have an inverse, each element {{math|y ∈ Y}} must correspond to no more than one {{math|x ∈ X}}; a function {{mvar|f}} with this property is called one-to-one or an injection. If {{math|f⁻¹}} is to be a function on {{mvar|Y}}, then each element {{math|y ∈ Y}} must correspond to some {{math|x ∈ X}}. Functions with this property are called surjections. This property is satisfied by definition if {{mvar|Y}} is the image (range) of {{mvar|f}}, but may not hold in a more general context. To be invertible a function must be both an injection and a surjection. Such functions are called bijections. The inverse of an injection {{math| f: X → Y}} that is not a bijection, that is, a function that is not a surjection, is only a partial function on {{mvar|Y}}, which means that for some {{math|y ∈ Y}}, {{math|f⁻¹(y)}} is undefined. If a function {{mvar|f}} is invertible, then both it and its inverse function {{math|f⁻¹}} are bijections.

There is another convention used in the definition of functions. This can be referred to as the "set-theoretic" or "graph" definition using ordered pairs in which a codomain is never referred to.^[3] Under this convention all functions are surjections, and so, being a bijection simply means being an injection. Authors using this convention may use the phrasing that a function is invertible if and only if it is an injection.^[4] The two conventions need not cause confusion as long as it is remembered that in this alternate convention the codomain of a function is always taken to be the range of the function.

Example: Squaring and square root functions

The function {{math|f: ℝ → [0,∞)}} given by {{math|1=f(x) = x²}} is not injective since each possible result y (except 0) corresponds to two different starting points in {{mvar|X}} – one positive and one negative, and so this function is not invertible. With this type of function it is impossible to deduce an input from its output. Such a function is called non-injective or, in some applications, information-losing.{{citation needed|date=October 2016}}

If the domain of the function is restricted to the nonnegative reals, that is, the function is redefined to be {{math|f: [0, ∞) → [0, ∞)}} with the same rule as before, then the function is bijective and so, invertible.^[5] The inverse function here is called the (positive) square root function.

{{anchor|Compositional inverse}}Inverses and composition

If {{mvar|f}} is an invertible function with domain {{mvar|X}} and range {{mvar|Y}}, then

where {{math|id_X}} is the identity function on the set {{mvar|X}}; 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 {{math|f⁻¹}}. Repeatedly composing a function with itself is called iteration. If {{mvar|f}} is applied {{mvar|n}} times, starting with the value {{mvar|x}}, then this is written as {{math|fⁿ(x)}}; so {{math|f²(x) {{=}} f (f (x))}}, etc. Since {{math|f⁻¹(f (x)) {{=}} x}}, composing {{math|f⁻¹}} and {{math|fⁿ}} yields {{math|fⁿ⁻¹}}, "undoing" the effect of one application of {{mvar|f}}.

Note on notation

While the notation {{math|f⁻¹(x)}} might be misunderstood, {{math|(f(x))⁻¹}} certainly denotes the multiplicative inverse of {{math|f(x)}} and has nothing to do with the inverse function of {{mvar|f}}.

In keeping with the general notation, some English^[1] authors use expressions like {{math|sin⁻¹(x)}} to denote the inverse of the sine function applied to {{mvar|x}} (actually a partial inverse; see below)^[7] Other authors feel that this may be confused with the notation for the multiplicative inverse of {{math|sin (x)}}, which can be denoted as {{math|(sin (x))⁻¹}}. To avoid any confusion, an inverse trigonometric function is often indicated by the prefix "arc" (for Latin arcus).^[1]^[16]^[17] For instance, the inverse of the sine function is typically called the arcsine function, written as {{math|arcsin(x)}}.^[1]^[16]^[17] Similarly, the inverse of a hyperbolic function is indicated by the prefix "ar" (for Latin area).^[17] For instance, the inverse of the hyperbolic sine function is typically written as {{math|arsinh(x)}}.^[17] Other inverse special functions are sometimes prefixed with the prefix "inv" if the ambiguity of the {{math|f⁻¹}} notation should be avoided.^[1]^[17]

Properties

Since a function is a special type of binary relation, many of the properties of an inverse function correspond to properties of converse relations.

Uniqueness

If an inverse function exists for a given function {{mvar|f}}, then it is unique.^[8] This follows since the inverse function must be the converse relation which is completely determined by {{mvar|f}}.

Symmetry

There is a symmetry between a function and its inverse. Specifically, if {{mvar|f}} is an invertible function with domain {{mvar|X}} and range {{mvar|Y}}, then its inverse {{math|f⁻¹}} has domain {{mvar|Y}} and range {{mvar|X}}, and the inverse of {{math|f⁻¹}} is the original function {{mvar|f}}. In symbols, for functions {{math|f:X → Y}} and {{math|f⁻¹:Y → X}},^[8]

This statement is a consequence of the implication that for {{mvar|f}} to be invertible it must be bijective. The involutory nature of the inverse can be concisely expressed by^[9]

Notice that the order of {{mvar|g}} and {{mvar|f}} have been reversed; to undo {{mvar|f}} followed by {{mvar|g}}, we must first undo {{mvar|g}} and then undo {{mvar|f}}.

For example, let {{math|1= f(x) = 3x}} and let {{math|1= g(x) = x + 5}}. Then the composition {{math| g ∘ f}} is the function that first multiplies by three and then adds five,

Self-inverses

If {{mvar|X}} is a set, then the identity function on {{mvar|X}} is its own inverse:

More generally, a function {{math| f : X → X}} is equal to its own inverse if and only if the composition {{math| f ∘ f}} is equal to {{math|id_X}}. Such a function is called an involution.

Inverses in calculus

Single-variable calculus is primarily concerned with functions that map real numbers to real numbers. Such functions are often defined through formulas, such as:

A surjective function {{mvar|f}} from the real numbers to the real numbers possesses an inverse as long as it is one-to-one, i.e. as long as the graph of {{math|1=y = f(x)}} has, for each possible {{mvar|y}} value only one corresponding {{mvar|x}} value, and thus passes the horizontal line test.

Formula for the inverse

One approach to finding a formula for {{math|f⁻¹}}, if it exists, is to solve the equation {{math|1= y = f(x) }} for {{mvar|x}}.^[11] For example, if {{mvar|f}} is the function

Sometimes the inverse of a function cannot be expressed by a formula with a finite number of terms. For example, if {{mvar|f}} is the function

then {{mvar|f}} is a bijection, and therefore possesses an inverse function {{math|f⁻¹}}. The formula for this inverse has an infinite number of terms:

Graph of the inverse

This is identical to the equation {{math|1= y = f(x)}} that defines the graph of {{mvar|f}}, except that the roles of {{mvar|x}} and {{mvar|y}} have been reversed. Thus the graph of {{math|f⁻¹}} can be obtained from the graph of {{mvar|f}} by switching the positions of the {{mvar|x}} and {{mvar|y}} axes. This is equivalent to reflecting the graph across the line

Inverses and derivatives

A continuous function {{mvar|f}} 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

If the function {{mvar|f}} is differentiable on an interval {{mvar|I}} and {{math| f′(x) ≠ 0}} for each {{math|x ∈ I}}, then the inverse {{math|f⁻¹}} will be differentiable on {{math|f(I)}}.^[13] If {{math|1= y = f(x)}}, the derivative of the inverse is given by the inverse function theorem,

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 differentiable multivariable function {{math| f : Rⁿ → Rⁿ}} is invertible in a neighborhood of a point {{mvar|p}} as long as the Jacobian matrix of {{mvar|f}} at {{mvar|p}} is invertible. In this case, the Jacobian of {{math|f⁻¹}} at {{math|f(p)}} is the matrix inverse of the Jacobian of {{mvar|f}} at {{mvar|p}}.

Real-world examples

Generalizations

Partial inverses

Even if a function {{mvar|f}} is not one-to-one, it may be possible to define a partial inverse of {{mvar|f}} by restricting the domain. For example, the function

is not one-to-one, since {{math|1= x² = (−x)²}}. However, the function becomes one-to-one if we restrict to the domain {{math| x ≥ 0}}, in which case

(If we instead restrict to the domain {{math| x ≤ 0}}, then the inverse is the negative of the square root of {{mvar|y}}.) Alternatively, there is no need to restrict the domain if we are content with the inverse being a multivalued function:

Sometimes this multivalued inverse is called the full inverse of {{mvar|f}}, and the portions (such as {{sqrt|{{mvar|x}}}} and −{{sqrt|{{mvar|x}}}}) 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 {{mvar|y}} is called the principal value of {{math|f⁻¹(y)}}.

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).

These considerations are particularly important for defining the inverses of trigonometric functions. For example, the sine function is not one-to-one, since

for every real {{mvar|x}} (and more generally {{math|1= sin(x + 2{{pi}}n) = sin(x)}} for every integer {{mvar|n}}). However, the sine is one-to-one on the interval

Left and right inverses

If {{math|f: X → Y}}, a left inverse for {{mvar|f}} (or retraction of {{mvar|f}} ) is a function {{math| g: Y → X}} such that

Thus, {{mvar|g}} must equal the inverse of {{mvar|f}} on the image of {{mvar|f}}, but may take any values for elements of {{mvar|Y}} not in the image. A function {{mvar|f}} with a left inverse is necessarily injective. In classical mathematics, every injective function {{mvar|f}} with a nonempty domain necessarily has a left inverse; however, this may fail in constructive mathematics. For instance, a left inverse of the inclusion {{math|{0,1} → R}} of the two-element set in the reals violates indecomposability by giving a retraction of the real line to the set {{math|{0,1} }}.

A right inverse for {{mvar|f}} (or section of {{mvar|f}} ) is a function {{math| h: Y → X}} such that

Thus, {{math|h(y)}} may be any of the elements of {{mvar|X}} that map to {{mvar|y}} under {{mvar|f}}. A function {{mvar|f}} has a right inverse if and only if it is surjective (though constructing such an inverse in general requires the axiom of choice).

An inverse which is both a left and right inverse must be unique. However, if {{mvar|g}} is a left inverse for {{mvar|f}}, then {{mvar|g}} may or may not be a right inverse for {{mvar|f}}; and if {{mvar|g}} is a right inverse for {{mvar|f}}, then {{mvar|g}} is not necessarily a left inverse for {{mvar|f}}. For example, let {{math|f: R → {{closed-open|0, ∞}}}} denote the squaring map, such that {{math|1=f(x) = x²}} for all {{mvar|x}} in {{math|R}}, and let {{math|{{mvar|g}}: {{closed-open|0, ∞}} → R}} denote the square root map, such that {{math|g(x) {{=}} }}{{radic|{{mvar|x}}}} for all {{math|x ≥ 0}}. Then {{math|1=f(g(x)) = x}} for all {{mvar|x}} in {{closed-open|0, ∞}}; that is, {{mvar|g}} is a right inverse to {{mvar|f}}. However, {{mvar|g}} is not a left inverse to {{mvar|f}}, since, e.g., {{math|1=g(f(−1)) = 1 ≠ −1}}.

Preimages

If {{math|f: X → Y}} is any function (not necessarily invertible), the preimage (or inverse image) of an element {{math| y ∈ Y}} is the set of all elements of {{mvar|X}} that map to {{mvar|y}}:

The preimage of {{mvar|y}} can be thought of as the image of {{mvar|y}} under the (multivalued) full inverse of the function {{mvar|f}}.

Similarly, if {{mvar|S}} is any subset of {{mvar|Y}}, the preimage of {{mvar|S}} is the set of all elements of {{mvar|X}} that map to {{mvar|S}}:

For example, take a function {{math|f: R → R}}, where {{math|f: x ↦ x²}}. This function is not invertible for reasons discussed above. Yet preimages may be defined for subsets of the codomain:

The preimage of a single element {{math| y ∈ Y}} – a singleton set {{math|{y} }} – is sometimes called the fiber of {{mvar|y}}. When {{mvar|Y}} is the set of real numbers, it is common to refer to {{math|f⁻¹({y})}} as a level set.