Function (mathematics)



In mathematics, a function relates each of its inputs to exactly one output. A standard notation for the output of the function f with the input x is f(x). The set of all inputs which a function accepts is called the domain of the function. The set of all outputs is called the range.

For example, the expression f(x) = x2 describes a function, f, that relates each input, x, with one output, x2. Thus, an input of 3 is related to an output of 9. Once a function, f, has been defined we can write, for example, f(4) = 16.

It is a usual practice in mathematics to introduce functions with temporary names like f; in the next paragraph we might define f(x) = 2x+1, and then f(4) = 9. When a name for the function is not needed, often the form y=x2 is used.

If we use a function often, we may give it a permanent name as, for example
 * $$\mathrm{Square}(x)\, =\, x^2$$.

The essential property of a function is that for each input there must be one unique output. Thus, for example,
 * $$\mathrm{Root}(x) = \pm \sqrt x $$

does not define a function, because it may have two outputs. The square roots of 9 are 3 and − 3, for example. To make the square root a function, we must specify which square root to choose. The definition
 * $$\mathrm{Posroot}(x) = \sqrt x $$,

for any non-negative input chooses the non-negative square root as an output.

A function need not involve numbers. An example of a function that does not use numbers is the function that assigns to each nation its capital. In this case $$Capital(France)=Paris$$.

A more precise, but still informal definition follows. Let A and B be sets. A function from A to B is determined by any association of a unique element of B with each element of A. The set A is called the domain of the function; the set B is called the codomain.

In some contexts, such as lambda calculus, the function notion may be taken as primitive rather than defined in terms of set theory.

In most mathematical fields, the terms map, mapping, and transformation are usually synonymous with function. However, in some contexts they may be defined with a more specialized meaning. For example, in topology a map is sometimes defined to be a continuous function.

Mathematical definition of a function
A precise definition is required for the purposes of mathematics.

A function is a binary relation, f, with the property that for an element x there is no more than one element y such that x is related to y. This uniquely determined element y is denoted f(x).

Because two definitions of binary relation are in use, there are actually two definitions of function, in effect.

First definition
The simplest definition of binary relation is "A binary relation is a set of ordered pairs". Under this definition, the binary relation denoted by "less than" contains the ordered pair (2, 5) because 2 is less than 5.

A function is then a set of ordered pairs with the property that if (a,b) and (a,c) are in the set, then b must equal c. Thus the squaring function contains the pair (3, 9). The square root relation is not a function because it contains both the pair (9, 3) and the pair (9, −3), and 3 is not equal to −3.

The domain of a function is the set of elements x occurring as first coordinate in a pair of the relation. If x is not in the domain of f, then f(x) is not defined.

The range of a function is the set of elements y occurring as second coordinate in a pair of the relation.

Second definition
Some authors require that the definition of a binary relation specify not only the ordered pairs but also the domain and codomain. These authors define a binary relation as an ordered triple $$(X, Y, G)$$, where X and Y are sets (called the domain and codomain of the relation) and G is a subset of the cartesian product of X and Y (G is called the graph of the relation). A function is then a binary relation with the additional property that each element of X occurs exactly once as the first coordinate of an element of G. Under this second definition, a function has a uniquely determined codomain; this is not the case under the first definition.

History of the concept
As a mathematical term, "function" was coined by Gottfried Leibniz in 1694, to describe a quantity related to a curve, such as a curve's slope at a specific point of a curve. The functions Leibniz considered are today called differentiable functions, and they are the type of function most frequently encountered by nonmathematicians. For this type of function, one can talk about limits and derivatives; both are measurements of the output or the change in the output as it depends on the input or the change in the input. Such functions are the basis of calculus.

The word function was later used by Leonhard Euler during the mid-18th century to describe an expression or formula involving various arguments, e.g. f(x) = sin(x) + x3.

During the 19th century, mathematicians started to formalize all the different branches of mathematics. Weierstrass advocated building calculus on arithmetic rather than on geometry, which favoured Euler's definition over Leibniz's (see arithmetization of analysis).

At first, the idea of a function was rather limited. Joseph Fourier, for example, claimed that every function had a Fourier series, something no mathematician would claim today. By broadening the definition of functions, mathematicians were able to study "strange" mathematical objects such as continuous functions that are nowhere differentiable. These functions were first thought to be only theoretical curiosities, and they were collectively called "monsters" as late as the turn of the 20th century. However, powerful techniques from functional analysis have shown that these functions are in some sense "more common" than differentiable functions. Such functions have since been applied to the modeling of physical phenomena such as Brownian motion.

Towards the end of the 19th century, mathematicians started to formalize all of mathematics using set theory, and they sought to define every mathematical object as a set. Dirichlet and Lobachevsky independently and almost simultaneously gave the modern "formal" definition of function.

In this definition, a function is a special case of a relation, in particular a function is a relation in which every first element has a unique second element.

The notion of function as a rule for computing, rather than a special kind of relation, has been formalized in mathematical logic and theoretical computer science by means of several systems, including the lambda calculus, the theory of recursive functions and the Turing machine.

Functions in other fields
Functions are used in every quantitative science, to model relationships between all kinds of physical quantities — especially when one quantity is completely determined by another quantity. Thus, for example, one may use a function to describe how the temperature of water affects its density.

Functions are also used in computer science to model data structures and the effects of algorithms. However, the word is also used in computing in the very different sense of procedure or sub-routine; see function (computer science).

The vocabulary of functions
An input to a function is called argument of the function. For each argument x, the corresponding unique y in the codomain is called the function value at x, or the image of x under f. The image of x can be written as f(x) or as y. Written mathematics sometimes omits the parentheses around the argument, thus: sin x, but calculators and computers require parentheses around the argument. In some branches of mathematics, such as automata theory, the notation x f is used instead of f(x). The notation f$$\;:\;$$x$${}\mapsto{}$$y is sometimes used to mean f(x) = y.

The graph of a function f is the set of all ordered pairs (x, f(x)), for all x in the domain X. If X and Y are subsets of R, the real numbers, then this definition coincides with the familiar sense of "graph" as a picture or plot of the function, with the ordered pairs being the Cartesian coordinates of points.

The concept of the image can be extended from the image of a point to the image of a set. If A is any subset of the domain, then f(A) is the subset of the range consisting of all images of elements of A. We say the f(A) is the image of A under f.

This extension is consistent as long as no subset of the domain is also an element of the domain. A few authors write f[A] instead of f(A), to emphasize the distinction between the two concepts; a few others write f` x instead of f(x), and f``A instead of f[A].

Notice that the range of f is the image f(X) of its domain, and that the range of f is a subset of its codomain.

The preimage (or inverse image) of a subset B of the codomain Y under a function f is the subset of the domain X defined by
 * f&minus;1(B) = {x in X | f(x) is in B}

So, for example, the preimage of {4, 9} under the squaring function is the set {-3,-2,+2,+3}.

In general, the preimage of a singleton set (a set with exactly one element) may contain any number of elements. For example, if f(x) = 7, then the preimage of {5} is the empty set but the preimage of {7} is the entire domain. Thus the preimage of an element in the codomain is a subset of the domain. The usual convention about the preimage of an element is that f&minus;1(b) means f&minus;1({b}), i. e.
 * f&minus;1(b) = {x in X | f(x) = b}

Three important kinds of function are the injections (or one-to-one functions), which have the property that if f(a) = f(b) then a must equal b; the surjections (or onto functions), which have the property that for every y in the codomain there is an x in the domain such that f(x) = y; and the bijections, which are both one-to-one and onto. This nomenclature was introduced by the Bourbaki group.

When the first definition of function given above is used, since the codomain is not defined, the "surjection" must be accompanied with a statement about the set the function maps onto. For example, we might say f maps onto the set of all real numbers.

The function composition of two or more functions uses the output of one function as the input of another. For example, f(x) = sin(x2) is the composition of the sine function and the squaring function. The functions f: X &rarr; Y and g: Y &rarr; Z can be composed by first applying f to an argument x to obtain y = f(x) and then applying g to y to obtain z = g(y).

The composite function formed in this way is denoted g o f: X &rarr; Z defined by (g o f)(x) = g(f(x)) for all x in X. Note that the function on the right acts first, the function on the left acts second.

Informally, the inverse of a function f is one that "undoes" the effect of f, by taking each function value f(x) to its argument x. The squaring function is the inverse of the non-negative square root function. Formally, since every function f is a relation, its inverse f&minus;1 is just the inverse relation. That is, if f has domain X, codomain Y, and graph G, the inverse has domain Y, codomain X, and graph


 * G&minus;1 = { (y, x) : (x, y) &isin; G }

For example, if the graph of f is G = {(1,5), (2,4), (3,5)}, then the graph f&minus;1 is G&minus;1 = {(5,1), (4,2), (5,3)}.

The relation f&minus;1 is a function if and only if for each y in the codomain there is exactly one argument x such that f(x) = y; in other words, the inverse of a function f is a function if and only if f is a bijection. In that case, f&minus;1(f(x)) = x for every x in X, and f(f&minus;1(y)) = y for any y in Y. Sometimes a function can be modified, often by replacing the domain with a subset of the domain, and making corresponding changes in the codomain and graph, so that the modified function has an inverse that is a function.

For example, the inverse of y = sin(x), f(x) = arcsin (x), defined by y = arcsin (x) if and only if x = sin(y), is not a function, because its graph contains both the ordered pair (0, 0) and the ordered pair (0, 2π). But if we change the domain of y = sin(x) to -π/2 $$\leq$$ x $$\leq$$ π/2 and change the codomain to — 1 $$\leq$$ y $$\leq$$ 1, then the resulting function does have an inverse, denoted with a capital letter A, f(x) = Arcsin (x).

This does not work with every function, however, and inverses are sometimes difficult or impossible to find.

Specifying a function
If the domain X is finite, a function f may be defined by simply tabulating all the arguments x and their corresponding function values f(x).

More commonly, a function is defined by a formula, or more generally an algorithm — that is, a recipe that tells how to compute the value of f(x) given any x in the domain. More generally, a function can be defined by any mathematical condition relating the argument to the corresponding value. There are many other ways of defining functions. Examples include recursion, algebraic or analytic closure, limits, analytic continuation, infinite series, and as solutions to integral and differential equation.

There is a technical sense in which most mathematical functions cannot be defined at all, in any effective way, explicit or implicit. A fundamental result of computability theory says that there are functions that can be precisely defined which cannot be computed.

Functions of two (or more) variables
The concept of function can be extended to an object that takes a combination of two (or more) argument values to a single result. This intuitive concept is formalized by a function whose domain is the Cartesian product of two or more sets.

For example, consider the multiplication function that associates two integers to their product: f(x, y) = x&middot;y. This function can be defined formally as having domain Z&times;Z, the set of all integer pairs; codomain Z; and, for graph, the set of all pairs ((x,y), x&middot;y). Note that the first component of any such pair is itself a pair (of integers), while the second component is a single integer.

The function value of the pair (x,y) is f((x,y)). However, it is customary to drop one set of parentheses and consider f(x,y) a function of two variables, x and y.

Functions with output in a product set
The concept can still further be extended by considering a function that also produces output that is expressed as several variables. For example consider the function mirror(x, y) = (y, x) with domain R&times;R and codomain R&times;R as well. The pair (y, x) is a single value in the codomain seen as a set.

Binary operations
The familiar binary operations of arithmetic, addition and multiplication, can be viewed as functions from Z&times;Z to Z. This view is generalized in abstract algebra, where n-ary functions are used to model the operations of arbitrary algebraic structures. For example, an abstract group is defined as a set X and a function f from X&times;X to X that satisfies certain properties.

Traditionally, addition and multiplication are written in the infix notation: x+y and x&times;y instead of +(x, y) and  &times;(x, y).

Set of all functions
The set of all functions from a set X to a set Y is denoted by X &rarr; Y, by [X &rarr; Y], or by YX. The latter notation is justified by the fact that |YX| = |Y|undefined. See the article on cardinal numbers for more details.

It is traditional to write f: X &rarr; Y to mean f &isin; [X &rarr; Y]; that is, "f is a function from X to Y". This statement is sometimes read "f is a Y-valued function of an X-valued variable". One often writes informally "Let f: X &rarr; Y" to mean "Let f be a function from X to Y".

Is a function more than its graph?
Most mathematicians define a binary relation (and hence a function) as an ordered triple (X, Y, G), where X and Y are the domain and codomain sets, and G is the graph of f. However, some mathematicians define a relation as being simply the set of pairs G, without explicitly giving the domain and co-domain.

There are advantages and disadvantages to each definition, but either of them is satisfactory for most uses of functions in mathematics. The explicit domain and codomain are important mostly in formal contexts, such as category theory.

Partial functions and multi-functions
The condition for a binary relation f from X to Y to be a function can be split into two conditions:
 * 1) f is total, or entire: for each x in X, there exists some y in Y such that x is related to y.
 * 2) f is single-valued: for each x in X, there is at most one y  in Y such that x is related to y.

In some contexts, a relation that satisfies condition (1), but not necessarily (2), may be called a multivalued function; and a relation that satisfies condition (2), but not necessarily (1), may be called a partial function.

Other properties
There are many other special classes of functions that are important to particular branches of mathematics, or particular applications. Here is a partial list:
 * continuous, differentiable, integrable
 * linear, polynomial, rational
 * convex, monotonic, unimodal
 * trigonometric
 * algebraic
 * transcendental
 * fractal function
 * odd or even
 * vector-valued.

Restrictions and extensions
Informally, a restriction of a function f is the result of trimming its graph to a smaller domain.

More precisely, if f is a function from a X to Y, and S is any subset of X, the restriction of f to S is the function f|S from S to Y such that f|S(s) = f(s) for all s in S.

The restriction f|S can also be expressed as the composition f$$\circ$$ incS,X, where incS,X is the inclusion function of S in X.

If g is any restriction of f, we say that f is an extension of g.

Pointwise operations
If f: X &rarr; R and g: X &rarr; R are functions with common domain X and codomain is a ring R, then one can define the sum function f + g: X &rarr; R and the product function f &times; g: X &rarr; R as follows:
 * (f + g)(x) = f(x) + g(x)
 * (f &times; g)(x) = f(x) &times; g(x)

for all x in X.

This turns the set of all such functions into a ring. The binary operations in that ring have as domain ordered pairs of functions, and as codomain functions. This is an example of climbing up in abstraction, to functions of more complex types.

By taking some other algebraic structure A in the place of R, we can turn the set of all functions from X to A into an algebraic structure of the same type in an analogous way.

Computable and non-computable functions
The number of computable functions from integers to integers is countable, because the number of possible algorithms is. The number of all functions from integers to integers is higher: the same as the cardinality of the real numbers. This argument shows that there are functions from integers to integers that are not computable. For examples of noncomputable functions, see the articles on the halting problem and Rice's theorem.

Lambda calculus
The lambda calculus provides a powerful and flexible syntax for combining functions of several variables. In particular, composition becomes a special case of variable substitution; and n-ary functions can be reduced to functions with fewer arguments by a process called currying.

Functions in category theory
The notion of function can be generalized to the notion of morphism in the context of category theory. A category is a collection of objects and morphisms. The collection of objects is completely arbitrary. The morphisms are the relationships between the objects. Each morphism is an ordered triple (X, Y, f), where X is an object called the domain, Y is an object called the codomain, and f connects X to Y. There are a few restrictions on the morphisms which guarantee that they are analogous to functions (for these, see the article on categories). However, because category theory is designed to work with objects that may not be sets or may not behave like sets do, morphisms are not the same as functions.

In a concrete category, each morphism is associated with an underlying function.