View source for Function (mathematics)

{{Short description|Association of one output to each input}} 
{{redirect|f(x)|the musical group|f(x) (musical group)}}
{{Functions}}

In [[mathematics]], a '''function''' from a [[set (mathematics)|set]] {{mvar|X}} to a set {{mvar|Y}} assigns to each element of {{mvar|X}} exactly one element of {{mvar|Y}}.<ref name=halmos>{{harvnb |Halmos |1970 |p=30}}; the words ''map'', ''mapping'', ''transformation'', ''correspondence'', and ''operator'' are sometimes used synonymously.</ref> The set {{mvar|X}} is called the [[Domain of a function|domain]] of the function<ref>{{harvnb|Halmos|1970}}</ref> and the set {{mvar|Y}} is called the [[codomain]] of the function.<ref name=codomain>{{eom|title=Mapping|oldid=37940|mode=cs1}}</ref>

Functions were originally the idealization of how a varying quantity depends on another quantity. For example, the position of a [[planet]] is a ''function'' of time. [[History of the function concept|Historically]], the concept was elaborated with the [[infinitesimal calculus]] at the end of the 17th century, and, until the 19th century, the functions that were considered were [[differentiable function|differentiable]] (that is, they had a high degree of regularity). The concept of a function was formalized at the end of the 19th century in terms of [[set theory]], and this greatly increased the possible applications of the concept.

A function is often denoted by a letter such as {{mvar|f}}, {{mvar|g}} or {{mvar|h}}. The value of a function {{mvar|f}} at an element {{mvar|x}} of its domain (that is, the element of the codomain that is associated with {{mvar|x}}) is denoted by {{math|''f''(''x'')}}; for example, the value of {{mvar|f}} at {{math|''x'' {{=}} 4}} is denoted by {{math|''f''(4)}}. Commonly, a specific function is defined by means of an [[expression (mathematics)|expression]] depending on {{mvar|x}}, such as <math>f(x)=x^2+1;</math> in this case, some computation, called '''{{vanchor|function evaluation}}''', may be needed for deducing the value of the function at a particular value; for example, if <math>f(x)=x^2+1,</math> then <math>f(4)=4^2+1=17.</math>

Given its domain and its codomain, a function is uniquely represented by the set of all [[pair (mathematics)|pairs]] {{math|(''x'', ''f''{{hair space}}(''x''))}}, called the ''[[graph of a function|graph of the function]]'', a popular means of illustrating the function.<ref group="note">This definition of "graph" refers to a ''set'' of pairs of objects. Graphs, in the sense of ''diagrams'', are most applicable to functions from the real numbers to themselves. All functions can be described by sets of pairs but it may not be practical to construct a diagram for functions between other sets (such as sets of matrices).</ref><ref>{{Cite web|title=function {{!}} Definition, Types, Examples, & Facts| url=https://www.britannica.com/science/function-mathematics|access-date=2020-08-17|website=Encyclopedia Britannica|language=en}}</ref> When the domain and the codomain are sets of real numbers, each such pair may be thought of as the [[Cartesian coordinates]] of a point in the plane.

Functions are widely used in [[science]], [[engineering]], and in most fields of mathematics. It has been said that functions are "the central objects of investigation" in most fields of mathematics.{{sfn |Spivak |2008 |p=39}}

The concept of a function has evolved significantly over centuries, from its informal origins in ancient mathematics to its formalization in the 19th century. See [[History of the function concept]] for details.

== Definition ==

[[File:Function machine2.svg|thumb|right|Schematic depiction of a function described metaphorically as a "machine" or "[[black box]]" that for each input yields a corresponding output]]
[[Image:Example Function.png|thumb|right|The red curve is the [[graph of a function]], because any [[Vertical line test|vertical line]] has exactly one crossing point with the curve.]]

A '''function''' {{mvar|f}} from a [[set (mathematics)|set]] {{mvar|X}} to a set {{mvar|Y}} is an assignment of one element of {{mvar|Y}} to each element of {{mvar|X}}. The set {{mvar|X}} is called the [[Domain of a function|domain]] of the function and the set {{mvar|Y}} is called the [[codomain]] of the function.

If the element {{mvar|y}} in {{mvar|Y}} is assigned to {{mvar|x}} in {{mvar|X}} by the function {{mvar|f}}, one says that {{mvar|f}} ''maps'' {{mvar|x}} to {{mvar|y}}, and this is commonly written <math>y=f(x).</math> In this notation, {{mvar|x}} is the ''[[Argument of a function|argument]]'' or ''[[Variable (mathematics)|variable]]'' of the function.

A specific element {{mvar|x}} of {{mvar|X}} is a ''value of the variable'', and the corresponding element of {{mvar|Y}} is the ''value of the function'' at {{mvar|x}}, or the [[Image (mathematics)|image]] of {{mvar|x}} under the function. The ''image of a function'', sometimes called its [[range of a function|range]], is the set of the images of all elements in the domain.<ref name="EOM Function"/><ref name="T&K Calc p.3">{{Taalman Kohn Calculus|p=3}}</ref><ref name="Trench RA pp.30-32">{{Trench Intro Real Analysis|pp=30–32}}</ref><ref name="TBB RA pp.A4-A5">{{Thomson Bruckner Bruckner Elementary Real Analysis|pp=A-4–A-5}}</ref>

A function {{mvar|f}}, its domain {{mvar|X}}, and its codomain {{mvar|Y}} are often specified  by the notation <math>f: X\to Y.</math> One may write <math>x\mapsto y</math> instead of <math>y=f(x)</math>, where the symbol <math>\mapsto</math> (read '[[maps to]]') is used to specify where a particular element {{mvar|x}} in the domain is mapped to by {{mvar|f}}.  This allows the definition of a function without naming. For example, the [[square function]] is the function <math>x\mapsto x^2.</math>

The domain and codomain are not always explicitly given when a function is defined. In particular, it is common that one might only know, without some (possibly difficult) computation, that the domain of a specific function is contained in a larger set. For example, if <math>f:\R\to\R</math> is a [[real function]], the determination of the domain of the function <math>x\mapsto 1/f(x)</math> requires knowing the [[zero of a function|zeros]] of {{mvar|f.}} This is one of the reasons for which, in [[mathematical analysis]], "a function {{nowrap|from {{mvar|X}} to {{mvar|Y}} "}} may refer to a function having a proper subset of {{mvar|X}} as a domain.<ref group="note">The true domain of such a function is often called the ''domain of definition'' of the function.</ref> For example, a "function from the reals to the reals" may refer to a [[real-valued function|real-valued]] function of a [[function of a real variable|real variable]] whose domain is a proper subset of the [[real number]]s, typically a subset that contains a non-empty [[open interval]]. Such a function is then called a [[partial function]].

A function {{mvar|f}} on a set {{mvar|S}} means a function from the domain {{mvar|S}}, without specifying a codomain. However, some authors use it as shorthand for saying that the function is {{math|''f'' : ''S'' → ''S''}}.

=== Formal definition ===

[[file:Injection keine Injektion 2a.svg|thumb|Diagram of a function]]
[[file:Injection keine Injektion 1.svg|thumb|Diagram of a relation that is not a function. One reason is that 2 is the first element in more than one ordered pair.  Another reason is that neither 3 nor 4 are the first element (input) of any ordered pair therein]]

The above definition of a function is essentially that of the founders of [[calculus]], [[Leibniz]], [[Isaac Newton|Newton]] and [[Euler]]. However, it cannot be [[formal proof|formalized]], since there is no mathematical definition of an "assignment". It is only at the end of the 19th century that the first formal definition of a function could be provided, in terms of [[set theory]]. This set-theoretic definition is based on the fact that a function establishes a ''relation'' between the elements of the domain and some (possibly all) elements of the codomain. Mathematically, a [[binary relation]] between two sets {{math|''X''}} and {{math|''Y''}} is a [[subset]] of the set of all [[ordered pair]]s <math>(x, y)</math> such that <math>x\in X</math> and <math>y\in Y.</math> The set of all these pairs is called the [[Cartesian product]] of {{math|''X''}} and {{math|''Y''}} and denoted <math>X\times Y.</math> Thus, the above definition may be formalized as follows.

A ''function'' with domain {{math|''X''}} and codomain {{math|''Y''}} is a binary relation {{mvar|R}} between {{math|''X''}} and {{math|''Y''}} that satisfies the two following conditions:<ref>{{cite book | last=Halmos | first=Paul R. | title=Naive Set Theory | publisher=Springer | year=1974 | pages=30–33}}</ref>
* For every <math>x</math> in <math>X</math> there exists <math>y</math> in <math>Y</math> such that <math>(x,y)\in R.</math>
* If <math>(x,y)\in R</math> and <math>(x,z)\in R,</math> then <math>y=z.</math>

This definition may be rewritten more formally, without referring explicitly to the concept of a relation, but using more notation (including [[set-builder notation]]):

A function is formed by three sets, the ''domain'' <math>X,</math> the ''codomain'' <math>Y,</math> and the ''graph'' <math>R</math> that satisfy the three following conditions. 
*<math>R \subseteq \{(x,y) \mid x\in X, y\in Y\}</math>
*<math>\forall x\in X, \exists y\in Y, \left(x, y\right) \in R \qquad</math>
*<math>(x,y)\in R \land (x,z)\in R \implies y=z\qquad</math>

=== Partial functions ===
{{main|Partial function}}

Partial functions are defined similarly to ordinary functions, with the "total" condition removed. That is, a ''partial function'' from {{mvar|X}} to {{mvar|Y}} is a binary relation {{mvar|R}} between {{mvar|X}} and {{mvar|Y}} such that, for every <math>x\in X,</math> there is ''at most one'' {{mvar|y}} in {{mvar|Y}} such that <math>(x,y) \in R.</math>

Using functional notation, this means that, given <math>x\in X,</math> either <math>f(x)</math> is in {{mvar|Y}}, or it is undefined.

The set of the elements of {{mvar|X}} such that <math>f(x)</math> is defined and belongs to {{mvar|Y}} is called the ''domain of definition'' of the function. A partial function from {{mvar|X}} to {{mvar|Y}} is thus a ordinary function that has as its domain a subset of {{mvar|X}} called the domain of definition of the function. If the domain of definition equals {{mvar|X}}, one often says that the partial function is a ''total function''.

In several areas of mathematics the term "function" refers to partial functions rather than to ordinary functions. This is typically the case when functions may be specified in a way that makes difficult or even impossible to determine their domain.

In [[calculus]], a ''real-valued function of a real variable'' or ''[[real function]]'' is a partial function from the set <math>\R</math> of the [[real number]]s to itself. Given a real function <math>f:x\mapsto f(x)</math> its [[multiplicative inverse]] <math>x\mapsto 1/f(x)</math> is also a real function. The determination of the domain of definition of a multiplicative inverse of a (partial) function amounts to compute the [[zero of a function|zeros]] of the function, the values where the function is defined but not its multiplicative inverse.

Similarly, a ''[[function of a complex variable]]'' is generally a partial function with a domain of definition included in the set <math>\Complex</math> of the [[complex number]]s. The difficulty of determining the domain of definition of a [[complex function]]  is illustrated by the multiplicative inverse of the [[Riemann zeta function]]: the determination of the domain of definition of the function <math>z\mapsto 1/\zeta(z)</math> is more or less equivalent to the proof or disproof of one of the major open problems in mathematics, the [[Riemann hypothesis]]. 

In [[computability theory]], a [[general recursive function]] is a partial function from the integers to the integers whose values can be computed by an [[algorithm]] (roughly speaking). The domain of definition of such a function is the set of inputs for which the algorithm does not run forever. A fundamental theorem of computability theory is that there cannot exist an algorithm that takes an arbitrary general recursive function as input and tests whether {{math|0}} belongs to its domain of definition (see [[Halting problem]]).

=== Multivariate functions <span class="anchor" id="MULTIVARIATE_FUNCTION"></span> ===
{{distinguish|Multivalued function}}
[[File:Binary operations as black box.svg|thumb|A binary operation is a typical example of a bivariate function which assigns to each pair <math>(x, y)</math> the result <math>x\circ y</math>.]]

A '''multivariate function''', '''multivariable function''', or '''function of several variables''' is a function that depends on several arguments. Such functions are commonly encountered. For example, the position of a car on a road is a function of the time travelled and its average speed.

Formally, a function of {{mvar|n}} variables is a function whose domain is a set of {{mvar|n}}-tuples.<ref group=note>{{mvar|n}} may also be 1, thus subsuming functions as defined above. For {{math|1=''n'' = 0}}, each [[constant (mathematics)|constant]] is a special case of a multivariate function, too.</ref>
For example, multiplication of [[integer]]s is a function of two variables, or '''bivariate function''', whose domain is the set of all [[ordered pairs]] (2-tuples) of integers, and whose codomain is the set of integers. The same is true for every [[binary operation]]. The graph of a bivariate surface over a two-dimensional real domain may be interpreted as defining a [[Surface_(mathematics)#Graph_of_a_bivariate_function|parametric surface]], as used in, e.g., [[bivariate interpolation]].

Commonly, an {{mvar|n}}-tuple is denoted enclosed between parentheses, such as in <math>(1,2,\ldots, n).</math>  When using [[functional notation]], one usually omits the parentheses surrounding tuples, writing  <math>f(x_1,\ldots,x_n)</math> instead of <math>f((x_1,\ldots,x_n)).</math>

Given {{mvar|n}} sets <math>X_1,\ldots, X_n,</math> the set of all {{mvar|n}}-tuples <math>(x_1,\ldots,x_n)</math> such that <math>x_1\in X_1, \ldots, x_n\in X_n</math> is called the [[Cartesian product]] of <math>X_1,\ldots, X_n,</math> and denoted <math>X_1\times\cdots\times X_n.</math>

Therefore, a multivariate function is a function that has a Cartesian product or a [[proper subset]] of a Cartesian product as a domain.
: <math>f: U\to Y,</math>
where the domain {{mvar|U}} has the form
: <math>U\subseteq X_1\times\cdots\times X_n.</math>

If all the <math>X_i</math> are equal to the set <math>\R</math> of the [[real number]]s or to the set <math>\C</math> of the [[complex number]]s, one talks respectively of a [[function of several real variables]] or of a [[function of several complex variables]].

== Notation ==

There are various standard ways for denoting functions. The most commonly used notation is functional notation, which is the first notation described below.

=== Functional notation ===
The functional notation requires that a name is given to the function, which, in the case of a unspecified function is often the letter {{mvar|f}}. Then, the application of the function to an argument is denoted by its name followed by its argument (or, in the case of a multivariate functions, its arguments) enclosed between parentheses, such as in 
:<math>f(x), \quad \sin(3),\quad \text{or}\quad f(x^2+1).</math>
The argument between the parentheses may be a [[variable (mathematics)|variable]], often {{mvar|x}}, that represents an arbitrary element of the domain of the function, a specific element of the domain ({{math|3}} in the above example), or an [[expression (mathematics)|expression]] that can be evaluated to an element of the domain (<math>x^2+1</math> in the above example). The use of a unspecified variable between parentheses is useful for defining a function explicitly such as in "let <math>f(x)=\sin(x^2+1)</math>".

When the symbol denoting the function consists of several characters and no ambiguity may arise, the parentheses of functional notation might be omitted. For example, it is common to write {{math|sin ''x''}} instead of {{math|sin(''x'')}}.

Functional notation was first used by [[Leonhard Euler]] in 1734.<ref>{{cite book|first1=Ron|last1=Larson|first2=Bruce H.|last2=Edwards|title=Calculus of a Single Variable|page=19|year=2010|publisher=Cengage Learning|isbn=978-0-538-73552-0}}</ref> Some widely used functions are represented by a symbol consisting of several letters (usually two or three, generally an abbreviation of their name). In this case, a [[roman type]] is customarily used instead, such as "{{math|sin}}" for the [[sine function]], in contrast to italic font for single-letter symbols.

The functional notation is often used colloquially for referring to a function and simultaneously naming its argument, such as in "let <math>f(x)</math> be a function". This is an [[abuse of notation]] that is useful for a simpler formulation.

=== Arrow notation ===
Arrow notation defines the rule of a function inline, without requiring a name to be given to the function. It uses the ↦ arrow symbol, pronounced "[[maps to]]". For example, <math>x\mapsto x+1</math> is the function which takes a real number as input and outputs that number plus 1. Again, a domain and codomain of <math>\R</math> is implied.

The domain and codomain can also be explicitly stated, for example:
: <math>\begin{align}
\operatorname{sqr}\colon \Z &\to \Z\\
x &\mapsto x^2.\end{align}</math>

This defines a function {{math|sqr}} from the integers to the integers that returns the square of its input.

As a common application of the arrow notation, suppose <math>f: X\times X\to Y;\;(x,t) \mapsto f(x,t)</math> is a function in two variables, and we want to refer to a [[Partial application|partially applied function]] <math>X\to Y</math> produced by fixing the second argument to the value {{math|''t''<sub>0</sub>}} without introducing a new function name.  The map in question could be denoted <math>x\mapsto f(x,t_0)</math> using the arrow notation. The expression <math>x\mapsto f(x,t_0)</math> (read: "the map taking {{mvar|x}} to {{mvar|f}} of {{mvar|x}} comma {{mvar|t}} nought") represents this new function with just one argument, whereas the expression {{math|''f''(''x''<sub>0</sub>, ''t''<sub>0</sub>)}} refers to the value of the function {{mvar|f}} at the {{nowrap|point {{math|(''x''<sub>0</sub>, ''t''<sub>0</sub>)}}.}}

=== Index notation ===

Index notation may be used instead of functional notation. That is, instead of writing {{math|''f''{{hair space}}(''x'')}}, one writes <math>f_x.</math>

This is typically the case for functions whose domain is the set of the [[natural number]]s. Such a function is called a [[sequence (mathematics)|sequence]], and, in this case the element <math>f_n</math> is called the {{mvar|n}}th element of the sequence.

The index notation can also be used for distinguishing some variables called ''[[Parameter (mathematics)|parameter]]s'' from the "true variables". In fact, parameters are specific variables that are considered as being fixed during the study of a problem.  For example, the map <math>x\mapsto f(x,t)</math> (see above) would be denoted <math>f_t</math> using index notation, if we define the collection of maps <math>f_t</math> by the formula <math>f_t(x)=f(x,t)</math> for all <math>x,t\in X</math>.

=== Dot notation ===

In the notation
<math>x\mapsto f(x),</math>
the symbol {{mvar|x}} does not represent any value; it is simply a [[placeholder name|placeholder]], meaning that, if {{mvar|x}} is replaced by any value on the left of the arrow, it should be replaced by the same value on the right of the arrow. Therefore, {{mvar|x}} may be replaced by any symbol, often an [[interpunct]] "{{math| ⋅ }}". This may be useful for distinguishing the function {{math|''f''{{hair space}}(⋅)}} from its value {{math|''f''{{hair space}}(''x'')}} at {{mvar|x}}.

For example, <math> a(\cdot)^2</math> may stand for the function <math> x\mapsto ax^2</math>, and <math display="inline"> \int_a^{\, (\cdot)} f(u)\,du</math> may stand for a function defined by an integral with variable upper bound: <math display="inline"> x\mapsto \int_a^x f(u)\,du</math>.

=== Specialized notations ===
There are other, specialized notations for functions in sub-disciplines of mathematics.  For example, in [[linear algebra]] and [[functional analysis]], [[linear form]]s and the [[Vector (mathematics and physics)|vectors]] they act upon are denoted using a [[dual pair]] to show the underlying [[Duality (mathematics)|duality]].  This is similar to the use of [[bra–ket notation]] in quantum mechanics.  In [[Mathematical logic|logic]] and the [[theory of computation]], the function notation of [[lambda calculus]] is used to explicitly express the basic notions of function [[Abstraction (computer science)|abstraction]] and [[Function application|application]].  In [[category theory]] and [[homological algebra]], networks of functions are described in terms of how they and their compositions [[Commutative property|commute]] with each other using [[commutative diagram]]s that extend and generalize the arrow notation for functions described above.

===Functions of more than one variable===
In some cases the argument of a function may be an ordered pair of elements taken from some set or sets. For example, a function {{mvar|f}} can be defined as mapping any pair of real numbers <math>(x, y)</math> to the sum of their squares, <math>x^2 + y^2</math>. Such a function is commonly written as <math>f(x, y)=x^2 + y^2</math> and referred to as "a function of two variables". Likewise one can have a function of three or more variables, with notations such as <math>f(w,x, y)</math>, <math>f(w,x, y, z)</math>.

== Other terms ==
{{broader|Map (mathematics)}}

{| class="wikitable floatright" style= "width: 50%"
!Term
!Distinction from "function"
|-
| rowspan="3" |[[Map (mathematics)|Map/Mapping]]
|None; the terms are synonymous.<ref>{{Cite web|url=http://mathworld.wolfram.com/Map.html|title=Map|last=Weisstein|first=Eric W.|website=mathworld.wolfram.com|language=en|access-date=2019-06-12}}</ref>
|-
|A map can have ''any set'' as its codomain, while, in some contexts, typically in older books, the codomain of a function is specifically the set of [[real number|real]] or [[complex number|complex]] numbers.<ref name=Lang87p43>{{cite book |last=Lang |first=Serge |title=Linear Algebra |chapter=III §1. Mappings |chapter-url={{GBurl|0DUXym7QWfYC|p=43}} |publisher=Springer |date=1987 |isbn=978-0-387-96412-6 |edition=3rd |page=43 |quote=A function is a special type of mapping, namely it is a mapping from a set into the set of numbers, i.e. into, '''R''', or '''C''' or into a field ''K''.}}</ref>
|-
|Alternatively, a map is associated with a ''special structure'' (e.g. by explicitly specifying a structured codomain in its definition). For example, a [[linear map]].<ref name=Apostol81p35/>
|-
|[[Homomorphism]]
|A function between two [[structure (mathematics)|structures]] of the same type that preserves the operations of the structure (e.g. a [[group homomorphism]]).<ref>{{Cite book |last1=James |first1=Robert C. |author-link1=Robert C. James |title=Mathematics dictionary |last2=James |first2=Glenn |date=1992 |publisher=Van Nostrand Reinhold |isbn=0-442-00741-8 |edition=5th |page=202 |oclc=25409557}}</ref>
|-
|[[Morphism]]
|A generalisation of homomorphisms to any [[Category (mathematics)|category]], even when the objects of the category are not sets (for example, a [[group (mathematics)|group]] defines a category with only one object, which has the elements of the group as morphisms; see {{slink|Category (mathematics)|Examples}} for this example and other similar ones).<ref>{{harvnb|James|James|1992|p=48}}</ref>
|}

A function may also be called a '''map''' or a '''mapping''', but some authors make a distinction between the term "map" and "function". For example, the term "map" is often reserved for a "function" with some sort of special structure (e.g. [[maps of manifolds]]). In particular ''map'' may be used in place of ''homomorphism'' for the sake of succinctness (e.g., [[linear map]] or ''map from {{mvar|G}} to {{mvar|H}}'' instead of ''[[group homomorphism]] from {{mvar|G}} to {{mvar|H}}''). Some authors<ref name=Apostol81p35>{{cite book |first=T.M. |last=Apostol |title=Mathematical Analysis|year=1981 |publisher=Addison-Wesley |page=35 |isbn=978-0-201-00288-1 |oclc=928947543 |edition=2nd}}</ref> reserve the word ''mapping'' for the case where the structure of the codomain belongs explicitly to the definition of the function.

Some authors, such as [[Serge Lang]],<ref name=Lang87p43/> use "function" only to refer to maps for which the [[codomain]] is a subset of the [[real number|real]] or [[complex number|complex]] numbers, and use the term ''mapping'' for more general functions.

In the theory of [[dynamical system]]s, a map denotes an [[Discrete-time dynamical system|evolution function]] used to create [[Dynamical system#Maps|discrete dynamical systems]]. See also [[Poincaré map]].

Whichever definition of ''map'' is used, related terms like ''[[Domain of a function|domain]]'', ''[[codomain]]'', ''[[Injective function|injective]]'', ''[[Continuous function|continuous]]'' have the same meaning as for a function.

== Specifying a function ==
Given a function <math>f</math>, by definition, to each element <math>x</math> of the domain of the function <math>f</math>, there is a unique element associated to it, the value <math>f(x)</math> of <math>f</math> at <math>x</math>. There are several ways to specify or describe how <math>x</math> is related to <math>f(x)</math>, both explicitly and implicitly. Sometimes, a theorem or an [[axiom]] asserts the existence of a function having some properties, without describing it more precisely. Often, the specification or description is referred to as the definition of the function <math>f</math>.

=== By listing function values ===
On a finite set a function may be defined by listing the elements of the codomain that are associated to the elements of the domain. For example, if <math>A = \{ 1, 2, 3 \}</math>, then one can define a function <math>f: A \to \mathbb{R}</math> by <math>f(1) = 2, f(2) = 3, f(3) = 4.</math>

=== By a formula ===
Functions are often defined by an [[expression (mathematics)|expression]] that describes a combination of [[arithmetic operations]] and previously defined functions; such a formula allows computing the value of the function from the value of any element of the domain.
For example, in the above example, <math>f</math> can be defined by the formula <math>f(n) = n+1</math>, for <math>n\in\{1,2,3\}</math>.

When a function is defined this way, the determination of its domain is sometimes difficult. If the formula that defines the function contains divisions, the values of the variable for which a denominator is zero must be excluded from the domain; thus, for a complicated function, the determination of the domain passes through the computation of the [[zero of a function|zeros]] of auxiliary functions. Similarly, if [[square root]]s occur in the definition of a function from <math>\mathbb{R}</math> to <math>\mathbb{R},</math> the domain is included in the set of the values of the variable for which the arguments of the square roots are nonnegative.

For example, <math>f(x)=\sqrt{1+x^2}</math> defines a function <math>f: \mathbb{R} \to \mathbb{R}</math> whose domain is <math>\mathbb{R},</math> because <math>1+x^2</math> is always positive if {{mvar|x}} is a real number. On the other hand, <math>f(x)=\sqrt{1-x^2}</math> defines a function from the reals to the reals whose domain is reduced to the interval {{closed-closed|−1, 1}}. (In old texts, such a domain was called the ''domain of definition'' of the function.)

Functions can be classified by the nature of formulas that define them:
* A [[quadratic function]] is a function that may be written <math>f(x) = ax^2+bx+c,</math> where {{math|''a'', ''b'', ''c''}} are [[constant (mathematics)|constants]].
* More generally, a [[polynomial function]] is a function that can be defined by a formula involving only additions, subtractions, multiplications, and [[exponentiation]] to nonnegative integer powers. For example, <math>f(x) = x^3-3x-1</math> and <math>f(x) = (x-1)(x^3+1) +2x^2 -1</math> are polynomial functions of <math>x</math>.
* A [[rational function]] is the same, with divisions also allowed, such as <math>f(x) = \frac{x-1}{x+1},</math> and <math>f(x) = \frac 1{x+1}+\frac 3x-\frac 2{x-1}.</math>
* An [[algebraic function]] is the same, with [[nth root|{{mvar|n}}th roots]] and [[zero of a function|roots of polynomials]] also allowed.
* An [[elementary function]]<ref group=note>Here "elementary" has not exactly its common sense: although most functions that are encountered in elementary courses of mathematics are elementary in this sense, some elementary functions are not elementary for the common sense, for example, those that involve roots of polynomials of high degree.</ref> is the same, with [[logarithm]]s and [[exponential functions]] allowed.

=== Inverse and implicit functions ===
A function <math>f : X\to Y,</math> with domain {{mvar|X}} and codomain {{mvar|Y}}, is [[bijective]], if for every {{mvar|y}} in {{mvar|Y}}, there is one and only one element {{mvar|x}} in {{mvar|X}} such that {{math|1=''y'' = ''f''(''x'')}}. In this case, the [[inverse function]] of {{mvar|f}} is the function <math>f^{-1} : Y \to X</math> that maps <math>y\in Y</math> to the element <math>x\in X</math> such that {{math|1=''y'' = ''f''(''x'')}}. For example, the [[natural logarithm]] is a bijective function from the positive real numbers to the real numbers. It thus has an inverse, called the [[exponential function]], that maps the real numbers onto the positive numbers.

If a function <math>f: X\to Y</math> is not bijective, it may occur that one can select subsets <math>E\subseteq X</math> and <math>F\subseteq Y</math> such that the [[restriction of a function|restriction]] of {{mvar|f}} to {{mvar|E}} is a bijection from {{mvar|E}} to {{mvar|F}}, and has thus an inverse. The [[inverse trigonometric functions]] are defined this way. For example, the [[cosine function]] induces, by restriction, a bijection from the [[interval (mathematics)|interval]] {{closed-closed|0, ''π''}} onto the interval {{closed-closed|−1, 1}}, and its inverse function, called [[arccosine]], maps {{closed-closed|−1, 1}} onto {{closed-closed|0, ''π''}}. The other inverse trigonometric functions are defined similarly.

More generally, given a [[binary relation]] {{mvar|R}} between two sets {{mvar|X}} and {{mvar|Y}}, let {{mvar|E}} be a subset of {{mvar|X}} such that, for every <math>x\in E,</math> there is some <math>y\in Y</math> such that {{math|''x R y''}}. If one has a criterion allowing selecting such a {{mvar|y}} for every <math>x\in E,</math> this defines a function <math>f: E\to Y,</math> called an [[implicit function]], because it is implicitly defined by the relation {{mvar|R}}.

For example, the equation of the [[unit circle]] <math>x^2+y^2=1</math> defines a relation on real numbers. If {{math|−1 < ''x'' < 1}} there are two possible values of {{mvar|y}}, one positive and one negative. For {{math|1=''x'' = ± 1}}, these two values become both equal to 0. Otherwise, there is no possible value of {{mvar|y}}. This means that the equation defines two implicit functions with domain {{closed-closed|−1, 1}} and respective codomains {{closed-open|0, +∞}} and {{open-closed|−∞, 0}}.

In this example, the equation can be solved in {{mvar|y}}, giving <math>y=\pm \sqrt{1-x^2},</math> but, in more complicated examples, this is impossible. For example, the relation <math>y^5+y+x=0</math> defines {{mvar|y}} as an implicit function of {{mvar|x}}, called the [[Bring radical]], which has <math>\mathbb R</math> as domain and range. The Bring radical cannot be expressed in terms of the four arithmetic operations and [[nth root|{{mvar|n}}th roots]].

The [[implicit function theorem]] provides mild [[differentiability]] conditions for existence and uniqueness of an implicit function in the neighborhood of a point.

=== Using differential calculus ===
Many functions can be defined as the [[antiderivative]] of another function. This is the case of the [[natural logarithm]], which is the antiderivative of {{math|1/''x''}} that is 0 for {{math|1=''x'' = 1}}. Another common example is the [[error function]].

More generally, many functions, including most [[special function]]s, can be defined as solutions of [[differential equation]]s. The simplest example is probably the [[exponential function]], which can be defined as the unique function that is equal to its derivative and takes the value 1 for {{math|1=''x'' = 0}}.

[[Power series]] can be used to define functions on the domain in which they converge. For example, the [[exponential function]] is given by <math display="inline">e^x = \sum_{n=0}^{\infty} {x^n \over n!}</math>. However, as the coefficients of a series are quite arbitrary, a function that is the sum of a convergent series is generally defined otherwise, and the sequence of the coefficients is the result of some computation based on another definition. Then, the power series can be used to enlarge the domain of the function. Typically, if a function for a real variable is the sum of its [[Taylor series]] in some interval, this power series allows immediately enlarging the domain to a subset of the [[complex number]]s, the [[disc of convergence]] of the series. Then [[analytic continuation]] allows enlarging further the domain for including almost the whole [[complex plane]]. This process is the method that is generally used for defining the [[logarithm]], the [[exponential function|exponential]] and the [[trigonometric functions]] of a complex number.

=== By recurrence ===
{{main|Recurrence relation}}
Functions whose domain are the nonnegative integers, known as [[sequence]]s, are sometimes defined by [[recurrence relation]]s.

The [[factorial]] function on the nonnegative integers (<math>n\mapsto n!</math>) is a basic example, as it can be defined by the recurrence relation
: <math>n!=n(n-1)!\quad\text{for}\quad n>0,</math>
and the initial condition
: <math>0!=1.</math>

== Representing a function ==

A [[Graph of a function|graph]] is commonly used to give an intuitive picture of a function.  As an example of how a graph helps to understand a function, it is easy to see from its graph whether a function is increasing or decreasing. Some functions may also be represented by [[bar chart]]s.

=== Graphs and plots ===
{{main|Graph of a function}}
[[File:Motor vehicle deaths in the US.svg|thumb|The function mapping each year to its US motor vehicle death count, shown as a [[line chart]]]]
[[File:Motor vehicle deaths in the US histogram.svg|thumb|The same function, shown as a bar chart]]

Given a function <math>f : X\to Y,</math> its ''graph'' is, formally, the set
: <math>G=\{(x,f(x))\mid x\in X\}.</math>

In the frequent case where {{mvar|X}} and {{mvar|Y}} are subsets of the [[real number]]s (or may be identified with such subsets, e.g. [[interval (mathematics)|intervals]]), an element <math>(x,y)\in G</math> may be identified with a point having coordinates {{math|''x'', ''y''}} in a 2-dimensional coordinate system, e.g. the [[Cartesian plane]]. Parts of this may create a [[Plot (graphics)|plot]] that represents (parts of) the function. The use of plots is so ubiquitous that they too are called the ''graph of the function''. Graphic representations of functions are also possible in other coordinate systems. For example, the graph of the [[square function]]
: <math>x\mapsto x^2,</math>
consisting of all points with coordinates <math>(x, x^2)</math> for <math>x\in \R,</math> yields, when depicted in Cartesian coordinates, the well known [[parabola]]. If the same quadratic function <math>x\mapsto x^2,</math> with the same formal graph, consisting of pairs of numbers, is plotted instead in [[polar coordinates]] <math>(r,\theta) =(x,x^2),</math> the plot obtained is [[Fermat's spiral]].

=== Tables ===
{{Main|Mathematical table}}
A function can be represented as a table of values.  If the domain of a function is finite, then the function can be completely specified in this way.  For example, the multiplication function <math>f:\{1,\ldots,5\}^2 \to \mathbb{R}</math> defined as <math>f(x,y)=xy</math> can be represented by the familiar [[multiplication table]]

{| class="wikitable" style="text-align: center;"
! {{diagonal split header|{{mvar|x}}|{{mvar|y}}}}
! 1  !! 2  !! 3  !! 4  !! 5
|-
! 1
| 1  || 2  || 3  || 4 || 5
|-
! 2
| 2  || 4  ||6 || 8  || 10
|-
! 3
| 3  || 6  || 9  || 12 || 15
|-
! 4
| 4  || 8  || 12 || 16 || 20
|-
! 5
| 5  || 10 || 15 || 20 || 25
|}

On the other hand, if a function's domain is continuous, a table can give the values of the function at specific values of the domain.  If an intermediate value is needed, [[interpolation]] can be used to estimate the value of the function.  For example, a portion of a table for the sine function might be given as follows, with values rounded to 6 decimal places:

{| class="wikitable" style="text-align: center;"
! {{mvar|x}} !! {{math|sin ''x''}}
|-
|1.289 || 0.960557
|-
|1.290 || 0.960835
|-
|1.291 || 0.961112
|-
|1.292 || 0.961387
|-
|1.293 || 0.961662
|}

Before the advent of handheld calculators and personal computers, such tables were often compiled and published for functions such as logarithms and trigonometric functions.

=== Bar chart ===
{{main|Bar chart}}
A bar chart can represent a function whose domain is a finite set, the [[natural number]]s, or the [[integer]]s. In this case, an element {{mvar|x}} of the domain is represented by an [[interval (mathematics)|interval]] of the {{mvar|x}}-axis, and the corresponding value of the function, {{math|''f''(''x'')}}, is represented by a [[rectangle]] whose base is the interval corresponding to {{mvar|x}} and whose height is {{math|''f''(''x'')}} (possibly negative, in which case the bar extends below the {{mvar|x}}-axis).

== General properties ==

This section describes general properties of functions, that are independent of specific properties of the domain and the codomain.

=== Standard functions ===
There are a number of standard functions that occur frequently:
* For every set {{mvar|X}}, there is a unique function, called the '''{{vanchor|empty function}}''', or '''empty map''', from the [[empty set]] to {{mvar|X}}. The graph of an empty function is the empty set.<ref group=note>By definition, the graph of the empty function to {{mvar|X}} is a subset of the Cartesian product {{math|∅ × ''X''}}, and this product is empty.</ref> The existence of empty functions is needed both for the coherency of the theory and for avoiding exceptions concerning the empty set in many statements. Under the usual set-theoretic definition of a function as an [[Tuple|ordered triplet]] (or equivalent ones), there is exactly one empty function for each set, thus the empty function <math>\varnothing \to X</math> is not equal to <math>\varnothing \to Y</math> if and only if <math>X\ne Y</math>, although their graphs are both the [[empty set]].
* For every set {{mvar|X}} and every [[singleton set]] {{math|{{mset|''s''}}}}, there is a unique function from {{mvar|X}} to {{math|{{mset|''s''}}}}, which maps every element of {{mvar|X}} to {{mvar|s}}. This is a surjection (see below) unless {{mvar|X}} is the empty set.
* Given a function <math>f: X\to Y,</math> the ''canonical surjection'' of {{mvar|f}} onto its image <math>f(X)=\{f(x)\mid x\in X\}</math> is the function from {{mvar|X}} to {{math|''f''(''X'')}} that maps {{mvar|x}} to {{math|''f''(''x'')}}.
* For every [[subset]] {{mvar|A}} of a set {{mvar|X}}, the [[inclusion map]] of {{mvar|A}} into {{mvar|X}} is the injective (see below) function that maps every element of {{mvar|A}} to itself.
* The [[identity function]] on a set {{mvar|X}}, often denoted by {{math|id<sub>''X''</sub>}}, is the inclusion of {{mvar|X}} into itself.

=== Function composition ===
{{Main|Function composition}}

Given two functions <math>f: X\to Y</math> and <math>g: Y\to Z</math> such that the domain of {{mvar|g}} is the codomain of {{mvar|f}}, their ''composition'' is the function <math>g \circ f: X \rightarrow Z</math> defined by
: <math>(g \circ f)(x) = g(f(x)).</math>

That is, the value of <math>g \circ f</math> is obtained by first applying {{math|''f''}} to {{math|''x''}} to obtain {{math|1=''y'' = ''f''(''x'')}} and then applying {{math|''g''}} to the result {{mvar|y}} to obtain {{math|1=''g''(''y'') = ''g''(''f''(''x''))}}. In this notation, the function that is applied first is always written on the right.

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

The function composition is [[associative property|associative]] in the sense that, if one of <math>(h\circ g)\circ f</math> and <math>h\circ (g\circ f)</math> is defined, then the other is also defined, and they are equal, that is, <math>(h\circ g)\circ f = h\circ (g\circ f).</math> Therefore, it is usual to just write <math>h\circ g\circ f.</math>

The [[identity function]]s <math>\operatorname{id}_X</math> and <math>\operatorname{id}_Y</math> are respectively a [[right identity]] and a [[left identity]] for functions from {{mvar|X}} to {{mvar|Y}}. That is, if {{mvar|f}} is a function with domain {{mvar|X}}, and codomain {{mvar|Y}}, one has
<math>f\circ \operatorname{id}_X = \operatorname{id}_Y \circ f = f.</math>

<gallery widths="250" heights="300">
File:Function machine5.svg|A composite function ''g''(''f''(''x'')) can be visualized as the combination of two "machines".
File:Example for a composition of two functions.svg|A simple example of a function composition
File:Compfun.svg|Another composition. In this example, {{math|1=(''g'' ∘ ''f'' )(c) = #}}.
</gallery>

=== Image and preimage ===
{{Main|Image (mathematics)}}
Let <math>f: X\to Y.</math> The ''image'' under {{mvar|f}} of an element {{mvar|x}} of the domain {{mvar|X}} is {{math|''f''(''x'')}}.<ref name="EOM Function"/> If {{math|''A''}} is any subset of {{math|''X''}}, then the ''image'' of {{mvar|A}} under {{mvar|f}}, denoted {{math|''f''(''A'')}}, is the subset of the codomain {{math|''Y''}} consisting of all images of elements of {{mvar|A}},<ref name="EOM Function"/> that is,
: <math>f(A)=\{f(x)\mid x\in A\}.</math>

The ''image'' of {{math|''f''}} is the image of the whole domain, that is, {{math|''f''(''X'')}}.{{r|PCM p.11}} It is also called the [[range of a function|range]] of {{mvar|f}},{{r|EOM Function|T&K Calc p.3|Trench RA pp.30-32|TBB RA pp.A4-A5}} although the term ''range'' may also refer to the codomain.{{r|TBB RA pp.A4-A5|PCM p.11}}<ref name = "standard">''Quantities and Units - Part 2: Mathematical signs and symbols to be used in the natural sciences and technology'', p. 15.  ISO 80000-2 (ISO/IEC 2009-12-01)</ref>

On the other hand, the ''[[inverse image]]'' or ''[[preimage]]'' under {{mvar|f}} of an element {{mvar|y}} of the codomain {{mvar|Y}} is the set of all elements of the domain {{math|''X''}} whose images under {{mvar|f}} equal {{mvar|y}}.<ref name="EOM Function"/> In symbols, the preimage of {{mvar|y}} is denoted by <math>f^{-1}(y)</math> and is given by the equation
: <math>f^{-1}(y) = \{x \in X \mid f(x) = y\}.</math>
Likewise, the preimage of a subset {{math|''B''}} of the codomain {{math|''Y''}} is the set of the preimages of the elements of {{math|''B''}}, that is, it is the subset of the domain {{math|''X''}} consisting of all elements of {{math|''X''}} whose images belong to {{math|''B''}}.<ref name="EOM Function"/> It is denoted by <math>f^{-1}(B)</math> and is given by the equation
: <math>f^{-1}(B) = \{x \in X \mid f(x) \in B\}.</math>
For example, the preimage of <math>\{4, 9\}</math> under the [[square function]] is the set <math>\{-3,-2,2,3\}</math>.

By definition of a function, the image of an element {{math|''x''}} of the domain is always a single element of the codomain. However, the preimage <math>f^{-1}(y)</math> of an element {{mvar|y}} of the codomain may be [[empty set|empty]] or contain any number of elements. For example, if {{mvar|f}} is the function from the integers to themselves that maps every integer to 0, then <math>f^{-1}(0) = \mathbb{Z}</math>.

If <math>f : X\to Y</math> is a function, {{math|''A''}} and {{math|''B''}} are subsets of {{math|''X''}}, and {{math|''C''}} and {{math|''D''}} are subsets of {{math|''Y''}}, then one has the following properties:
* <math>A\subseteq B \Longrightarrow f(A)\subseteq f(B)</math>
* <math>C\subseteq D \Longrightarrow f^{-1}(C)\subseteq f^{-1}(D)</math>
* <math>A \subseteq f^{-1}(f(A))</math>
* <math>C \supseteq f(f^{-1}(C))</math>
* <math>f(f^{-1}(f(A)))=f(A)</math>
* <math>f^{-1}(f(f^{-1}(C)))=f^{-1}(C)</math>

The preimage by {{mvar|f}} of an element {{mvar|y}} of the codomain is sometimes called, in some contexts, the [[fiber (mathematics)|fiber]] of {{math|''y''}} under {{mvar|''f''}}.

If a function {{mvar|f}} has an inverse (see below), this inverse is denoted <math>f^{-1}.</math> In this case <math>f^{-1}(C)</math> may denote either the image by <math>f^{-1}</math> or the preimage by {{mvar|f}} of {{mvar|C}}. This is not a problem, as these sets are equal. The notation <math>f(A)</math> and <math>f^{-1}(C)</math> may be ambiguous in the case of sets that contain some subsets as elements, such as <math>\{x, \{x\}\}.</math> In this case, some care may be needed, for example, by using square brackets <math>f[A], f^{-1}[C]</math> for images and preimages of subsets and ordinary parentheses for images and preimages of elements.

=== Injective, surjective and bijective functions ===
{{main|Bijection, injection and surjection}}

Let <math>f : X\to Y</math> be a function.

The function {{mvar|f}} is ''[[injective function|injective]]'' (or ''one-to-one'', or is an ''injection'') if {{math|''f''(''a'') ≠ ''f''(''b'')}} for every two different elements {{math|''a''}} and {{mvar|''b''}} of {{mvar|X}}.<ref name="PCM p.11">{{Princeton Companion to Mathematics|p=11}}</ref><ref name="EOM Injection">{{eom |title=Injection |oldid=30986 |author-first=O.A. |author-last=Ivanova|mode=cs1}}</ref> Equivalently, {{mvar|f}} is injective if and only if, for every <math>y\in Y,</math> the preimage <math>f^{-1}(y)</math> contains at most one element. An empty function is always injective. If {{mvar|X}} is not the empty set, then {{mvar|f}} is injective if and only if there exists a function <math>g: Y\to X</math> such that <math>g\circ f=\operatorname{id}_X,</math> that is, if {{mvar|f}} has a [[left inverse function|left inverse]].<ref name="EOM Injection"/> ''Proof'': If {{mvar|f}} is injective, for defining {{mvar|g}}, one chooses an element <math>x_0</math> in {{mvar|X}} (which exists as {{mvar|X}} is supposed to be nonempty),<ref group=note>The [[axiom of choice]] is not needed here, as the choice is done in a single set.</ref> and one defines {{mvar|g}} by <math>g(y)=x</math> if <math>y=f(x)</math> and <math>g(y)=x_0</math> if <math>y\not\in f(X).</math> Conversely, if <math>g\circ f=\operatorname{id}_X,</math> and <math>y=f(x),</math>  then <math>x=g(y),</math> and thus <math>f^{-1}(y)=\{x\}.</math>

The function {{mvar|f}} is ''[[surjective]]'' (or ''onto'', or is a ''surjection'') if its range <math>f(X)</math> equals its codomain <math>Y</math>, that is, if, for each element <math>y</math> of the codomain, there exists some element <math>x</math> of the domain such that <math>f(x) = y</math> (in other words, the preimage <math>f^{-1}(y)</math> of every <math>y\in Y</math> is nonempty).<ref name="PCM p.11"/><ref name="EOM Surjection">{{eom |title=Surjection |oldid=35689 |author-first=O.A. |author-last=Ivanova|mode=cs1}}</ref> If, as usual in modern mathematics, the [[axiom of choice]] is assumed, then {{mvar|f}} is surjective if and only if there exists a function <math>g: Y\to X</math> such that <math>f\circ g=\operatorname{id}_Y,</math> that is, if {{mvar|f}} has a [[right inverse function|right inverse]].<ref name="EOM Surjection"/> The axiom of choice is needed, because, if {{mvar|f}} is surjective, one defines {{mvar|g}} by <math>g(y)=x,</math> where <math>x</math> is an ''arbitrarily chosen'' element of <math>f^{-1}(y).</math>

The function {{mvar|f}} is ''[[bijective]]'' (or is a ''bijection'' or a ''one-to-one correspondence'') if it is both injective and surjective.<ref name="PCM p.11"/><ref name="EOM Bijection">{{eom |title=Bijection |oldid=30987 |author-first=O.A. |author-last=Ivanova|mode=cs1}}</ref> That is, {{mvar|f}} is bijective if, for every <math>y\in Y,</math> the preimage <math>f^{-1}(y)</math> contains exactly one element. The function {{mvar|f}} is bijective if and only if it admits an [[inverse function]], that is, a function <math>g : Y\to X</math> such that <math>g\circ f=\operatorname{id}_X</math> and <math>f\circ g=\operatorname{id}_Y.</math><ref name="EOM Bijection"/> (Contrarily to the case of surjections, this does not require the axiom of choice; the proof is straightforward).

Every function <math>f: X\to Y</math> may be [[factorization|factorized]] as the composition <math>i\circ s</math> of a surjection followed by an injection, where {{mvar|s}} is the canonical surjection of {{mvar|X}} onto {{math|''f''(''X'')}} and {{mvar|i}} is the canonical injection of {{math|''f''(''X'')}} into {{mvar|Y}}. This is the ''canonical factorization'' of {{mvar|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 [[Nicolas Bourbaki|Bourbaki group]] and imported into English.<ref>{{Cite web |last=Hartnett |first=Kevin |date=9 November 2020 |title=Inside the Secret Math Society Known Simply as Nicolas Bourbaki |url=https://www.quantamagazine.org/inside-the-secret-math-society-known-as-nicolas-bourbaki-20201109/ |access-date=2024-06-05 |website=Quanta Magazine}}</ref> 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 "{{math|''f''}} maps {{math|''X''}} ''onto'' {{math|''Y''}}" differs from "{{math|''f''}}  maps {{math|''X''}} ''into'' {{math|''B''}}", in that the former implies that {{math|''f''}} is surjective, while the latter makes no assertion about the nature of {{math|''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 <span class="anchor" id="Restrictions and extensions"></span> ===
<!-- This section is linked from [[Subgroup]], [[Restriction]], [[Quadratic form]] -->
{{main|Restriction (mathematics)}}
If <math>f : X \to Y</math> is a function and {{math|''S''}} is a subset of {{math|''X''}}, then the ''restriction'' of <math>f</math> to ''S'', denoted <math>f|_S</math>, is the function from {{math|''S''}} to {{math|''Y''}} defined by
: <math>f|_S(x) = f(x)</math>
for all {{math|''x''}} in {{math|''S''}}. Restrictions can be used to define partial [[inverse function]]s: if there is a [[subset]] {{math|''S''}} of the domain of a function <math>f</math> such that <math>f|_S</math> is injective, then the canonical surjection of <math>f|_S</math> onto its image <math>f|_S(S) = f(S)</math> is a bijection, and thus has an inverse function from <math>f(S)</math> to {{math|''S''}}. One application is the definition of [[inverse trigonometric functions]]. For example, the [[cosine]] function is injective when restricted to the [[interval (mathematics)|interval]] {{closed-closed|0, ''π''}}. The image of this restriction is the interval {{closed-closed|−1, 1}}, and thus the restriction has an inverse function from {{closed-closed|−1, 1}} to {{closed-closed|0, ''π''}}, which is called [[arccosine]] and is denoted {{math|arccos}}.

Function restriction may also be used for "gluing" functions together. Let <math display="inline"> X=\bigcup_{i\in I}U_i</math> be the decomposition of {{mvar|X}} as a [[set union|union]] of subsets, and suppose that a function <math>f_i : U_i \to Y</math> is defined on each <math>U_i</math> such that for each pair <math>i, j</math> of indices, the restrictions of <math>f_i</math> and <math>f_j</math> to <math>U_i \cap U_j</math> are equal. Then this defines a unique function <math>f : X \to Y</math> such that <math>f|_{U_i} = f_i</math> for all {{mvar|i}}. This is the way that functions on [[manifold]]s are defined.

An ''extension'' of a function {{mvar|f}} is a function {{mvar|g}} such that {{mvar|f}} is a restriction of {{mvar|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 [[homography|homographies]] of the [[real line]]. A ''homography'' is a function <math>h(x)=\frac{ax+b}{cx+d}</math> such that {{math|''ad'' − ''bc'' ≠ 0}}. Its domain is the set of all [[real number]]s different from <math>-d/c,</math> and its image is the set of all real numbers different from <math>a/c.</math> If one extends the real line to the [[projectively extended real line]] by including {{math|∞}}, one may extend {{mvar|h}} to a bijection from the extended real line to itself by setting <math>h(\infty)=a/c</math> and <math>h(-d/c)=\infty</math>.

== In calculus ==
{{further|History of the function concept}}

The idea of function, starting in the 17th century, was fundamental to the new [[infinitesimal calculus]]. At that time, only [[real-valued function|real-valued]] functions of a [[function of a real variable|real variable]] were considered, and all functions were assumed to be [[smooth function|smooth]]. But the definition was soon extended to [[#Multivariate function|functions of several variables]] and to [[functions of a complex variable]]. In the second half of the 19th century, the mathematically rigorous definition of a function was introduced, and functions with arbitrary domains and codomains were defined.

Functions are now used throughout all areas of mathematics. In introductory [[calculus]], when the word ''function'' is used without qualification, it means a real-valued function of a single real variable. The more general definition of a function is usually introduced to second or third year college students with [[STEM]] majors, and in their senior year they are introduced to calculus in a larger, more rigorous setting in courses such as [[real analysis]] and [[complex analysis]].

=== Real function ===
{{see also|Real analysis}}
[[File:Gerade.svg|thumb|right|Graph of a linear function]]
[[File:Polynomialdeg2.svg|thumb|right|Graph of a polynomial function, here a quadratic function.]]
[[File:Sine cosine one period.svg|thumb|right|Graph of two trigonometric functions: [[sine]] and [[cosine]].]]
A ''real function'' is a [[real-valued function|real-valued]] [[function of a real variable]], that is, a function whose codomain is the [[real number|field of real numbers]] and whose domain is a set of [[real number]]s that contains an [[interval (mathematics)|interval]]. In this section, these functions are simply called ''functions''.

The functions that are most commonly considered in mathematics and its applications have some regularity, that is they are [[continuous function|continuous]], [[differentiable function|differentiable]], and even [[analytic function|analytic]]. This regularity insures that these functions can be visualized by their [[#Graph and plots|graphs]]. In this section, all functions are differentiable in some interval.

Functions enjoy [[pointwise operation]]s, that is, if {{mvar|f}} and {{mvar|g}} are functions, their sum, difference and product are functions defined by
: <math>\begin{align}
(f+g)(x)&=f(x)+g(x)\\
(f-g)(x)&=f(x)-g(x)\\
(f\cdot g)(x)&=f(x)\cdot g(x)\\
\end{align}.</math>
The domains of the resulting functions are the [[set intersection|intersection]] of the domains of {{mvar|f}} and {{mvar|g}}. The quotient of two functions is defined similarly by
: <math>\frac fg(x)=\frac{f(x)}{g(x)},</math>
but the domain of the resulting function is obtained by removing the [[zero of a function|zeros]] of {{mvar|g}} from the intersection of the domains of {{mvar|f}} and {{mvar|g}}.

The [[polynomial function]]s are defined by [[polynomial]]s, and their domain is the whole set of real numbers. They include [[constant function]]s, [[linear function]]s and [[quadratic function]]s. [[Rational function]]s are quotients of two polynomial functions, and their domain is the real numbers with a finite number of them removed to avoid [[division by zero]]. The simplest rational function is the function <math>x\mapsto \frac 1x,</math> whose graph is a [[hyperbola]], and whose domain is the whole [[real line]] except for 0.

The [[derivative]] of a real differentiable function is a real function. An [[antiderivative]] of a continuous real function is a real function that has the original function as a derivative. For example, the function <math display="inline">x\mapsto\frac 1x</math> is continuous, and even differentiable, on the positive real numbers. Thus one antiderivative, which takes the value zero for {{math|1=''x'' = 1}}, is a differentiable function called the [[natural logarithm]].

A real function {{mvar|f}} is [[monotonic function|monotonic]] in an interval if the sign of <math>\frac{f(x)-f(y)}{x-y}</math> does not depend of the choice of {{mvar|x}} and {{mvar|y}} in the interval. If the function is differentiable in the interval, it is monotonic if the sign of the derivative is constant in the interval. If a real function {{mvar|f}} is monotonic in an interval {{mvar|I}}, it has an [[inverse function]], which is a real function with domain {{math|''f''(''I'')}} and image {{mvar|I}}. This is how [[inverse trigonometric functions]] are defined in terms of [[trigonometric functions]], where the trigonometric functions are monotonic. Another example: the natural logarithm is monotonic on the positive real numbers, and its image is the whole real line; therefore it has an inverse function that is a [[bijection]] between the real numbers and the positive real numbers. This inverse is the [[exponential function]].

Many other real functions are defined either by the [[implicit function theorem]] (the inverse function is a particular instance) or as solutions of [[differential equation]]s. For example, the [[sine]] and the [[cosine]] functions are the solutions of the [[linear differential equation]]
: <math>y''+y=0</math>
such that
: <math>\sin 0=0, \quad \cos 0=1, \quad\frac{\partial \sin x}{\partial x}(0)=1, \quad\frac{\partial \cos x}{\partial x}(0)=0.</math>

=== Vector-valued function ===
{{main|Vector-valued function|Vector field}}

When the elements of the codomain of a function are [[vector (mathematics and physics)|vectors]], the function is said to be a vector-valued function. These functions are particularly useful in applications, for example modeling physical properties. For example, the function that associates to each point of a fluid its [[velocity vector]] is a vector-valued function.

Some vector-valued functions are defined on a subset of <math>\mathbb{R}^n</math> or other spaces that share geometric or [[topological]] properties of <math>\mathbb{R}^n</math>, such as [[manifolds]]. These vector-valued functions are given the name ''vector fields''.

== Function space ==
{{Main|Function space|Functional analysis}}
In [[mathematical analysis]], and more specifically in [[functional analysis]], a '''function space''' is a set of [[scalar-valued function|scalar-valued]] or [[vector-valued function]]s, which share a specific property and form a [[topological vector space]]. For example, the real [[smooth function]]s with a [[compact support]] (that is, they are zero outside some [[compact set]]) form a function space that is at the basis of the theory of [[distribution (mathematics)|distributions]].

Function spaces play a fundamental role in advanced mathematical analysis, by allowing the use of their algebraic and [[topology|topological]] properties for studying properties of functions. For example, all theorems of existence and uniqueness of solutions of [[ordinary differential equation|ordinary]] or [[partial differential equation]]s result of the study of function spaces.

== Multi-valued functions ==
{{main|Multi-valued function}}
[[File:Function with two values 1.svg|thumb|right|Together, the two square roots of all nonnegative real numbers form a single smooth curve.]]
[[File:Xto3minus3x.svg|thumb|right]]
Several methods for specifying functions of real or complex variables start from a local definition of the function at a point or on a [[neighbourhood (mathematics)|neighbourhood]] of a point, and then extend by continuity the function to a much larger domain. Frequently, for a starting point <math>x_0,</math> there are several possible starting values for the function.

For example, in defining the [[square root]] as the inverse function of the square function, for any positive real number <math>x_0,</math> there are two choices for the value of the square root, one of which is positive and denoted <math>\sqrt {x_0},</math> and another which is negative and denoted <math>-\sqrt {x_0}.</math> These choices define two continuous functions, both having the nonnegative real numbers as a domain, and having either the nonnegative or the nonpositive real numbers as images. When looking at the graphs of these functions, one can see that, together, they form a single [[smooth curve]]. It is therefore often useful to consider these two square root functions as a single function that has two values for positive {{mvar|x}}, one value for 0 and no value for negative {{mvar|x}}.

In the preceding example, one choice, the positive square root, is more natural than the other. This is not the case in general. For example, let consider the [[implicit function]] that maps {{mvar|y}} to a [[root of a function|root]] {{mvar|x}} of <math>x^3-3x-y =0</math> (see the figure on the right). For {{math|1=''y'' = 0}} one may choose either <math>0, \sqrt 3,\text{ or } -\sqrt 3</math> for {{mvar|x}}. By the [[implicit function theorem]], each choice defines a function; for the first one, the (maximal) domain is the interval {{closed-closed|−2, 2}} and the image is {{closed-closed|−1, 1}}; for the second one, the domain is {{closed-open|−2, ∞}} and the image is {{closed-open|1, ∞}}; for the last one, the domain is {{open-closed|−∞, 2}} and the image is {{open-closed|−∞, −1}}. As the three graphs together form a smooth curve, and there is no reason for preferring one choice, these three functions are often considered as a single ''multi-valued function'' of {{mvar|y}} that has three values for {{math|−2 < ''y'' < 2}}, and only one value for {{math|''y'' ≤ −2}} and {{math|''y'' ≥ −2}}.

Usefulness of the concept of multi-valued functions is clearer when considering complex functions, typically [[analytic function]]s. The domain to which a complex function may be extended by [[analytic continuation]] generally consists of almost the whole [[complex plane]]. However, when extending the domain through two different paths, one often gets different values. For example, when extending the domain of the square root function, along a path of complex numbers with positive imaginary parts, one gets {{mvar|i}} for the square root of −1; while, when extending through complex numbers with negative imaginary parts, one gets {{math|−''i''}}. There are generally two ways of solving the problem. One may define a function that is not [[continuous function|continuous]] along some curve, called a [[branch cut]]. Such a function is called the [[principal value]] of the function. The other way is to consider that one has a ''multi-valued function'', which is analytic everywhere except for isolated singularities, but whose value may "jump" if one follows a closed loop around a singularity. This jump is called the [[monodromy]].

== In the foundations of mathematics ==

The definition of a function that is given in this article requires the concept of [[set (mathematics)|set]], since the domain and the codomain of a function must be a set. This is not a problem in usual mathematics, as it is generally not difficult to consider only functions whose domain and codomain are sets, which are well defined, even if the domain is not explicitly defined. However, it is sometimes useful to consider more general functions.

For example, the [[singleton set]] may be considered as a function <math>x\mapsto \{x\}.</math> Its domain would include all sets, and therefore would not be a set. In usual mathematics, one avoids this kind of problem by specifying a domain, which means that one has many singleton functions. However, when establishing foundations of mathematics, one may have to use functions whose domain, codomain or both are not specified, and some authors, often logicians, give precise definitions for these weakly specified functions.<ref>{{harvnb |Gödel |1940 |p=16}}; {{harvnb |Jech |2003 |p=11}}; {{harvnb |Cunningham |2016 |p=57}}</ref>

These generalized functions may be critical in the development of a formalization of the [[foundations of mathematics]]. For example, [[Von Neumann–Bernays–Gödel set theory]], is an extension of the set theory in which the collection of all sets is a [[Class (set theory)|class]]. This theory includes the [[Von Neumann–Bernays–Gödel set theory#NBG's axiom of replacement|replacement axiom]], which may be stated as: If {{mvar|X}} is a set and {{mvar|F}} is a function, then {{math|''F''[''X'']}} is a set.

In alternative formulations of the foundations of mathematics using [[type theory]] rather than set theory, functions are taken as [[primitive notion]]s rather than defined from other kinds of object. They are the inhabitants of [[function type]]s, and may be constructed using expressions in the [[lambda calculus]].<ref>
{{cite book
 | last = Klev | first = Ansten
 | editor1-last = Centrone | editor1-first = Stefania
 | editor2-last = Kant | editor2-first = Deborah
 | editor3-last = Sarikaya | editor3-first = Deniz
 | contribution = A comparison of type theory with set theory
 | doi = 10.1007/978-3-030-15655-8_12
 | isbn = 978-3-030-15654-1
 | location = Cham
 | mr = 4352345
 | pages = 271–292
 | publisher = Springer
 | series = Synthese Library
 | title = Reflections on the Foundations of Mathematics: Univalent Foundations, Set Theory and General Thoughts
 | volume = 407
 | year = 2019}}</ref>

== In computer science ==
{{main|Function (computer programming)|Lambda calculus}}
In [[computer programming]], a [[Function (programming)|function]] is, in general, a piece of a [[computer program]], which [[implementation|implements]] the abstract concept of function. That is, it is a program unit that produces an output for each input. However, in many [[programming language]]s every [[subroutine]] is called a function, even when there is no output, and when the functionality consists simply of modifying some data in the [[computer memory]].

[[Functional programming]] is the [[programming paradigm]] consisting of building programs by using only subroutines that behave like mathematical functions. For example, <code>if_then_else</code> is a function that takes three functions as arguments, and, depending on the result of the first function (''true'' or ''false''), returns the result of either the second or the third function. An important advantage of functional programming is that it makes easier [[program proof]]s, as being based on a well founded theory, the [[lambda calculus]] (see below).

Except for computer-language terminology, "function" has the usual mathematical meaning in [[computer science]]. In this area, a property of major interest is the [[computable function|computability]] of a function. For giving a precise meaning to this concept, and to the related concept of [[algorithm]], several [[models of computation]] have been introduced, the old ones being [[μ-recursive function|general recursive function]]s, [[lambda calculus]] and [[Turing machine]]. The fundamental theorem of [[computability theory]] is that these three models of computation define the same set of computable functions, and that all the other models of computation that have ever been proposed define the same set of computable functions or a smaller one. The [[Church–Turing thesis]] is the claim that every philosophically acceptable definition of a ''computable function'' defines also the same functions.

General recursive functions are [[partial function]]s from integers to integers that can be defined from 
* [[constant function]]s, 
* [[successor function|successor]], and
* [[projection function|projection]] functions 
via the operators
* [[#Function composition|composition]], 
* [[primitive recursion]], and 
* [[μ operator|minimization]]. 
Although defined only for functions from integers to integers, they can model any computable function as a consequence of the following properties:
* a computation is the manipulation of finite sequences of symbols (digits of numbers, formulas, ...),
* every sequence of symbols may be coded as a sequence of [[bit]]s,
* a bit sequence can be interpreted as the [[binary representation]] of an integer.

[[Lambda calculus]] is a theory that defines computable functions without using [[set theory]], and is the theoretical background of functional programming. It consists of ''terms'' that are either variables, function definitions (''{{lambda}}''-terms), or applications of functions to terms. Terms are manipulated through some rules, (the {{math|''α''}}-equivalence, the {{mvar|β}}-reduction, and the {{mvar|η}}-conversion), which are the [[axiom]]s of the theory and may be interpreted as rules of computation.

In its original form, lambda calculus does not include the concepts of domain and codomain of a function. Roughly speaking, they have been introduced in the theory under the name of ''type'' in [[typed lambda calculus]]. Most kinds of typed lambda calculi can define fewer functions than untyped lambda calculus.

== See also ==
=== Subpages ===
{{div col|colwidth=22em}}
* [[History of the function concept]]
* [[List of types of functions]]
* [[List of functions]]
* [[Function fitting]]
* [[Implicit function]]
{{div col end}}

=== Generalizations ===
{{div col|colwidth=22em}}
* [[Higher-order function]]
* [[Homomorphism]]
* [[Morphism]]
* [[Microfunction]]
* [[Distribution (mathematics)|Distribution]]
* [[Functor]]
{{div col end}}

=== Related topics ===
{{div col|colwidth=22em}}
* [[Associative array]]
* [[Closed-form expression]]<!-- a function may or may not be defined by closed form -->
* [[Elementary function]]
* [[Functional (mathematics)|Functional]]
* [[Functional decomposition]]
* [[Functional predicate]]
* [[Functional programming]]
* [[Parametric equation]]
* [[Set function]]
* [[Simple function]]
{{div col end}}

== Notes ==
{{reflist|group=note}}

== References ==
{{reflist|refs=
<ref name="EOM Function">{{eom |title=Function |oldid=36823 |author-first=L.D. |author-last=Kudryavtsev|mode=cs1}}</ref>
}}

== Sources ==
{{refbegin}}
* {{cite book |last=Bartle |first=Robert |author-link=Robert G. Bartle |title=The Elements of Real Analysis |publisher=Wiley |isbn=978-0-471-05465-8 |date=1976 |edition=2nd |oclc=465115030}}
* {{cite book |last=Bloch |first=Ethan D. |title=Proofs and Fundamentals: A First Course in Abstract Mathematics |publisher=Springer |year=2011|isbn=978-1-4419-7126-5 |url=https://books.google.com/books?id=QJ_537n8zKYC}}
* {{cite book |last=Cunningham |first=Daniel W. |title=Set theory: A First Course |publisher=Cambridge University Press |year=2016 |isbn=978-1-107-12032-7}}
* {{cite book |last=Gödel |first=Kurt | author-link=Kurt Gödel|title=The Consistency of the Continuum Hypothesis |publisher=Princeton University Press |year=1940 |isbn=978-0-691-07927-1}}
* {{cite book |last=Halmos |first=Paul R. |author-link=Paul Halmos |year=1970 |title=Naive Set Theory |publisher=Springer-Verlag |isbn=978-0-387-90092-6 |url=https://books.google.com/books?id=x6cZBQ9qtgoC}}
* {{cite book |last=Jech | first=Thomas| author-link=Thomas Jech| title=Set theory| edition=3rd  |publisher=[[Springer-Verlag]]| year=2003| isbn=978-3-540-44085-7}}
* {{cite book |title=Calculus |first=Michael |last=Spivak |author-link=Michael Spivak |edition=4th |year=2008 |publisher=Publish or Perish |isbn=978-0-914098-91-1 |url=https://books.google.com/books?id=7JKVu_9InRUC}}
{{refend}}

== Further reading ==
{{refbegin}}
* {{cite book |last=Anton |first=Howard |title=Calculus with Analytical Geometry |url=https://archive.org/details/studentssolution00anto |url-access=registration |year=1980 |publisher=[[John Wiley & Sons|Wiley]] |isbn=978-0-471-03248-9}}
* {{cite book |last=Bartle |first=Robert G. |title=The Elements of Real Analysis |edition=2nd |year=1976 |publisher=Wiley |isbn=978-0-471-05464-1}}
* {{Cite book |title=The Concept of Function: Aspects of Epistemology and Pedagogy|publisher=Mathematical Association of America |year=1992 |first1=Ed |last1=Dubinsky |first2=Guershon |last2=Harel |isbn=978-0-88385-081-7}}
* {{cite book |last=Hammack |first=Richard |title=Book of Proof |year=2009 |publisher=[[Virginia Commonwealth University]] |url=https://www.people.vcu.edu/~rhammack/BookOfProof/ |chapter=12. Functions |chapter-url=https://www.people.vcu.edu/~rhammack/BookOfProof/Main.pdf#page=235 |access-date=2012-08-01}}
* {{cite book |last=Husch |first=Lawrence S. |title=Visual Calculus |year=2001 |publisher=[[University of Tennessee]] |url=http://archives.math.utk.edu/visual.calculus/ |access-date=2007-09-27}}
* {{cite book |last=Katz |first=Robert |title=Axiomatic Analysis |year=1964 |publisher=[[D. C. Heath and Company]]}}
* {{cite journal |title=Evolution of the Function Concept: A Brief Survey |first=Israel |last=Kleiner |journal=The College Mathematics Journal |volume=20 |issue=4 |year=1989 |pages=282–300 |doi=10.2307/2686848|jstor=2686848 |citeseerx=10.1.1.113.6352 }}
* {{cite book |title=The Cambridge History of Science: The modern physical and mathematical sciences |chapter=Between rigor and applications: Developments in the concept of function in mathematical analysis |first=Jesper |last=Lützen |chapter-url=https://books.google.com/books?id=B3WvWhJTTX8C&pg=PA468 |editor-first=Roy|editor-last=Porter |publisher=Cambridge University Press |year=2003 |isbn=978-0-521-57199-9}} An approachable and diverting historical presentation.
* {{cite journal |title=Historical and pedagogical aspects of the definition of function |last=Malik |first=M. A. |journal=International Journal of Mathematical Education in Science and Technology |volume=11 |issue=4 |year=1980 |pages=489–492 |doi=10.1080/0020739800110404}}
* {{cite book |last=Reichenbach |first=Hans |date=1947 |title=Elements of Symbolic Logic |publisher=Dover  |isbn=0-486-24004-5}}
* {{cite journal |last=Ruthing |first=D. |title=Old Intelligencer: Some definitions of the concept of function from Bernoulli, Joh. to Bourbaki, N. |journal=Mathematical Intelligencer |volume=6 |issue=4 |pages=71–78 |year=1984 |doi=10.1007/BF03026743|s2cid=189883712 }}
* {{cite book |last1=Thomas |first1=George B. |last2=Finney |first2=Ross L. |title=Calculus and Analytic Geometry |url=https://archive.org/details/calculusanalytic00geor_0 |url-access=registration |edition=9th |year=1995 |publisher=[[Addison-Wesley]] |isbn=978-0-201-53174-9}}
{{refend}}

== External links ==
{{Commons category|Functions (mathematics)}}
* [http://functions.wolfram.com/ The Wolfram Functions] – website giving formulae and visualizations of many mathematical functions
* [https://dlmf.nist.gov/ NIST Digital Library of Mathematical Functions]

{{Analysis-footer}}
{{Authority control}}

[[Category:Functions and mappings| ]]
[[Category:Basic concepts in set theory]]
[[Category:Elementary mathematics]]