# Properties of Functions

## Contents

## Standard functions

There are a number of standard functions that occur frequently:

- For every set X, there is a unique function, called the
**empty function**from the empty set to X. The graph of an empty function is the empty set. The existence of the empty function is a convention that is needed for the coherency of the theory and for avoiding exceptions concerning the empty set in many statements. - For every set X and every singleton set {
*s*}, there is a unique function from X to {*s*}, which maps every element of X to s. This is a surjection (see below) unless X is the empty set. - Given a function the
*canonical surjection*of f onto its image is the function from X to*f*(*X*) that maps x to*f*(*x*). - For every subset A of a set X, the inclusion map of A into X is the injective (see below) function that maps every element of A to itself.
- The identity function on a set X, often denoted by id
_{X}, is the inclusion of X into itself.

## Function composition

Given two functions and such that the domain of g is the codomain of f, their *composition* is the function defined by

That is, the value of is obtained by first applying *f* to *x* to obtain *y* = *f*(*x*) and then applying *g* to the result y to obtain *g*(*y*) = *g*(*f*(*x*)). In the notation the function that is applied first is always written on the right.

The composition is an operation on functions that is defined only if the codomain of the first function is the domain of the second one. Even when both and satisfy these conditions, the composition is not necessarily commutative, that is, the functions and need not be equal, but may deliver different values for the same argument. For example, let *f*(*x*) = *x*^{2} and *g*(*x*) = *x* + 1, then and agree just for

The function composition is associative in the sense that, if one of and is defined, then the other is also defined, and they are equal. Thus, one writes

The identity functions and are respectively a right identity and a left identity for functions from X to Y. That is, if f is a function with domain X, and codomain Y, one has

## Image and preimage

Let The *image* under f of an element x of the domain X is *f*(*x*). If *A* is any subset of *X*, then the *image* of A under f, denoted *f*(*A*), is the subset of the codomain *Y* consisting of all images of elements of A, that is,

The *image* of *f* is the image of the whole domain, that is, *f*(*X*). It is also called the range of f, although the term *range* may also refer to the codomain.

On the other hand, the *inverse image* or *preimage* under f of an element y of the codomain Y is the set of all elements of the domain *X* whose images under f equal y. In symbols, the preimage of y is denoted by and is given by the equation

Likewise, the preimage of a subset *B* of the codomain *Y* is the set of the preimages of the elements of *B*, that is, it is the subset of the domain *X* consisting of all elements of *X* whose images belong to *B*. It is denoted by and is given by the equation

For example, the preimage of under the square function is the set .

By definition of a function, the image of an element *x* of the domain is always a single element of the codomain. However, the preimage of an element y of the codomain may be empty or contain any number of elements. For example, if f is the function from the integers to themselves that maps every integer to 0, then .

If is a function, *A* and *B* are subsets of *X*, and *C* and *D* are subsets of *Y*, then one has the following properties:

The preimage by f of an element y of the codomain is sometimes called, in some contexts, the fiber of *y* under *f*.

If a function f has an inverse (see below), this inverse is denoted In this case may denote either the image by or the preimage by f of C. This is not a problem, as these sets are equal. The notation and may be ambiguous in the case of sets that contain some subsets as elements, such as In this case, some care may be needed, for example, by using square brackets for images and preimages of subsets and ordinary parentheses for images and preimages of elements.

## Injective, surjective and bijective functions

Let be a function.

The function f is *injective* (or *one-to-one*, or is an *injection*) if *f*(*a*) ≠ *f*(*b*) for any two different elements *a* and *b* of X. Equivalently, f is injective if and only if, for any the preimage contains at most one element. An empty function is always injective. If X is not the empty set, then f is injective if and only if there exists a function such that that is, if f has a left inverse. *Proof*: If f is injective, for defining g, one chooses an element in X (which exists as X is supposed to be nonempty), and one defines g by if and if Conversely, if and then and thus

The function f is *surjective* (or *onto*, or is a *surjection*) if its range equals its codomain , that is, if, for each element of the codomain, there exists some element of the domain such that (in other words, the preimage of every is nonempty). If, as usual in modern mathematics, the axiom of choice is assumed, then f is surjective if and only if there exists a function such that that is, if f has a right inverse. The axiom of choice is needed, because, if f is surjective, one defines g by where is an *arbitrarily chosen* element of

The function f is *bijective* (or is a *bijection* or a *one-to-one correspondence*) if it is both injective and surjective. That is, f is bijective if, for any the preimage contains exactly one element. The function f is bijective if and only if it admits an inverse function, that is, a function such that and (Contrarily to the case of surjections, this does not require the axiom of choice; the proof is straightforward).

Every function may be factorized as the composition of a surjection followed by an injection, where s is the canonical surjection of X onto *f*(*X*) and i is the canonical injection of *f*(*X*) into Y. This is the *canonical factorization* of f.

"One-to-one" and "onto" are terms that were more common in the older English language literature; "injective", "surjective", and "bijective" were originally coined as French words in the second quarter of the 20th century by the Bourbaki group and imported into English. As a word of caution, "a one-to-one function" is one that is injective, while a "one-to-one correspondence" refers to a bijective function. Also, the statement "*f* maps *X* *onto* *Y*" differs from "*f* maps *X* *into* *B*", in that the former implies that *f* is surjective, while the latter makes no assertion about the nature of *f*. In a complicated reasoning, the one letter difference can easily be missed. Due to the confusing nature of this older terminology, these terms have declined in popularity relative to the Bourbakian terms, which have also the advantage of being more symmetrical.

## Restriction and extension

If is a function and *S* is a subset of *X*, then the *restriction* of to *S*, denoted , is the function from *S* to *Y* defined by

for all *x* in *S*. Restrictions can be used to define partial inverse functions: if there is a subset *S* of the domain of a function such that is injective, then the canonical surjection of onto its image is a bijection, and thus has an inverse function from to *S*. One application is the definition of inverse trigonometric functions. For example, the cosine function is injective when restricted to the interval [0, *π*]. The image of this restriction is the interval [−1, 1], and thus the restriction has an inverse function from [−1, 1] to [0, *π*], which is called arccosine and is denoted arccos.

Function restriction may also be used for "gluing" functions together. Let be the decomposition of X as a union of subsets, and suppose that a function is defined on each such that for each pair of indices, the restrictions of and to are equal. Then this defines a unique function such that for all i. This is the way that functions on manifolds are defined.

An *extension* of a function f is a function g such that f is a restriction of g. A typical use of this concept is the process of analytic continuation, that allows extending functions whose domain is a small part of the complex plane to functions whose domain is almost the whole complex plane.

Here is another classical example of a function extension that is encountered when studying homographies of the real line. A *homography* is a function such that *ad* − *bc* ≠ 0. Its domain is the set of all real numbers different from and its image is the set of all real numbers different from If one extends the real line to the projectively extended real line by including ∞, one may extend h to a bijection from the extended real line to itself by setting and .

## Resources

## Licensing

Content obtained and/or adapted from:

- Functions (mathematics), Wikipedia under a CC BY-SA license