# GetWiki

*function (mathematics)*

ARTICLE SUBJECTS

being →

database →

ethics →

fiction →

history →

internet →

language →

linux →

logic →

method →

news →

policy →

purpose →

religion →

science →

software →

truth →

unix →

wiki →

ARTICLE TYPES

essay →

feed →

help →

system →

wiki →

ARTICLE ORIGINS

critical →

forked →

imported →

original →

function (mathematics)

[ temporary import ]

**please note:**

- the content below is remote from Wikipedia

- it has been imported raw for GetWiki

**function**The words

**map**,

**mapping**,

**transformation**,

**correspondence**, and

**operator**are often used synonymously. {{harvnb |Halmos |1970 |p=30}}. was originally the idealization of how a varying quantity depends on another quantity. For example, the position of a planet is a

*function*of time. 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 (that is, they had a high degree of regularity). The concept of function was formalized at the end of the 19th century in terms of set theory, and this greatly enlarged the domains of application of the concept.A function is a process or a relation that associates each element {{mvar|x}} of a set {{mvar|X}}, the

*domain*of the function, to a single element {{mvar|y}} of another set {{mvar|Y}} (possibly the same set), the

*codomain*of the function. If the function is called {{mvar|f}}, this relation is denoted {{math|1=

*y*=

*f*{{space|hair}}(

*x*)}} (read {{mvar|f}} of {{mvar|x}}), the element {{mvar|x}} is the

*argument*or

*input*of the function, and {{mvar|y}} is the

*value of the function*, the

*output*, or the

*image*of {{mvar|x}} by {{mvar|f}}.BOOK, MacLane, Saunders, Saunders MacLane, Birkhoff, Garrett, Garrett Birkhoff, Algebra, Macmillan, First, 1967, New York, 1â€“13, The symbol that is used for representing the input is the variable of the function (one often says that {{mvar|f}} is a function of the variable {{mvar|x}}).A function is uniquely represented by its graph which is the set of all pairs {{math|(

*x*,

*f*{{space|hair}}(

*x*))}}. When the domain and the codomain are sets of numbers, each such pair may be considered as the Cartesian coordinates of a point in the plane. In general, these points form a curve, which is also called the graph of the function. This is a useful representation of the function, which is commonly used everywhere. For example, graphs of functions are commonly used in newspapers for representing the evolution of price indexes and stock market indexesFunctions are widely used in science, and in most fields of mathematics. Their role is so important that it has been said that they are "the central objects of investigation" in most fields of mathematics.{{sfn |Spivak |2008 |p=39}}File:Function machine2.svg|thumb|right|Schematic depiction of a function described metaphorically as a "machine" or "black boxblack boxImage:Graph of example function.svg|thumb|right|The red curve is the graph of a function, because any vertical line has exactly one crossing point with the curve.]](File:Function color example 3.svg|thumb|A function that associates any of the four colored shapes to its color.)

## Definition

{{multiple image| width = 220| align = right| direction = vertical| image1 = Injection keine Injektion 2a.svg| caption1 = Diagram of a function, with domain*X*={1, 2, 3} and codomain

*Y*={A, B, C, D}, which is defined by the set of ordered pairs {(1,D), (2,C), (3,C)}. The image/range is the set {C,D}.----|| image2 = Injection keine Injektion 1.svg! 1! 2! 3! 4! 5

not define a function. One reason is that 2 is the first element in more than one ordered pair, {{nowrap>(2,â€‰B)}} and {{nowrap|(2,â€‰C)}}, of this set. Two other reasons, also sufficient by themselves, is that neither 3 nor 4 are first elements (input) of any ordered pair therein.}}Intuitively, a function is a process that associates to each element of a set {{math|X}} a single element of a set {{math|Y}}.Formally, a function {{math|f}} from a set {{math|X}} to a set {{math|Y}} is defined by a set {{mvar|G}} of ordered pairs {{math|(x, y)}} such that {{math|x âˆˆ X}}, {{math|y âˆˆ Y}}, and every element of {{math|X}} is the first component of exactly one ordered pair in {{mvar|G}}.BOOK, Hamilton, A. G., Numbers, sets, and axioms: the apparatus of mathematics, 83, Cambridge University Press, 978-0-521-24509-8,weblink 1982, The sets X, Y are parts of data defining a function; i.e., a function is a set of ordered pairs (x, y) with x in X, y in Y, together with the sets X, Y, such that for each x in X, there is a unique y in Y with (x, y) in the set. In other words, for every {{math|x}} in {{math|X}}, there is exactly one element {{math|y}} such that the ordered pair {{math|(x, y)}} belongs to the set of pairs defining the function {{math|f}}. The set {{mvar|G}} is called the graph of the function. Formally speaking, it may be identified with the function, but this hides the usual interpretation of a function as a process. Therefore, in common usage, the function is generally distinguished from its graph. Functions are also called maps or mappings, though some authors make some distinction between "maps" and "functions" (see #Map vs function).In the definition of function, {{math|X}} and {{math|Y}} are respectively called the domain and the codomain of the function {{mvar|f}}. If {{math|(x, y)}} belongs to the set defining {{mvar|f}}, then {{mvar|y}} is the image of {{mvar|x}} under {{mvar|f}}, or the value of {{mvar|f}} applied to the argument {{mvar|x}}. Especially in the context of numbers, one says also that {{mvar|y}} is the value of {{mvar|f}} for the value {{mvar|x}} of its variable, or, still shorter, {{mvar|y}} is the value of {{mvar|f}} of {{mvar|x}}, denoted as {{math|y {{=}} f(x)}}.Two functions {{mvar|f}} and {{mvar|g}} are equal if their domain and codomain sets are the same and their output values agree on the whole domain. Formally, {{math|1=f = g}} if {{math|1=f(x) = g(x)}} for all {{math|x âˆˆ X}}, where {{math|f:X â†’ Y}} and {{math|g:X â†’ Y}}.{{sfn |Apostol |1981 |p=35}}{{sfn |Kaplan |1972 |p=25}}This follows from the axiom of extensionality, which says two sets are the same if and only if they have the same members. Some authors drop codomain from a definition of a function, and in that definition, the notion of equality has to be handled with care; see, for example,weblink domain and codomain are not always explicitly given when a function is defined, and, without some (possibly difficult) computation, one knows only that the domain is contained in a larger set. Typically, this occurs in mathematical analysis, where "a function {{nowrap|from {{mvar|X}} to {{mvar|Y}} "}} often refers to a function that may have a proper subset of {{mvar|X}} as domain. For example, a "function from the reals to the reals" may refer to a real-valued function of a real variable, and this phrase does not mean that the domain of the function is the whole set of the real numbers, but only that the domain is a set of real numbers that contains a non-empty open interval; such a function is then called a partial function. For example, if {{mvar|f}} is a function that has the real numbers as domain and codomain, then a function mapping the value {{mvar|x}} to the value g(x)=tfrac 1{f(x)} is a function {{mvar|g}} from the reals to the reals, whose domain is the set of the reals {{mvar|x}}, such that {{math|f(x) â‰ 0}}.The range of a function is the set of the images of all elements in the domain. However, range is sometimes used as a synonym of codomain, generally in old textbooks.## Relational approachAny subset of the Cartesian product of a domain X and a codomain Y is said to define a binary relation Rsubseteq (Xtimes Y) between these two sets. It is immediate that an arbitrary relation may contain pairs that violate the necessary conditions for a function, given above.A univalent relation is a relation such that
(x,y)in R; land ;(x,z) in RquadRightarrow quad y=z.
Univalent relations may be identified to functions whose domain is a subset of {{mvar|X}}.A left-total relation is a relation such that
forall x in X ;exists y in Ycolon (x,y)in R.
Formally, functions may be identified to relations that are both univalent and left total. Violating the left-totality is similar to giving a convenient encompassing set instead of the true domain, as explained above.Various properties of functions and function composition may be reformulated in the language of relations. For example, a function is injective if the converse relation R^{text{T}}subseteq (Ytimes X) is univalent, where the converse relation is defined as R^{text{T}} = {(y,x) : (x,y) in R}.Gunther Schmidt( 2011) Relational Mathematics, Encyclopedia of Mathematics and its Applications, vol. 132, sect 5.1 Functions, pp. 49â€“60, Cambridge University Press {{ISBN|978-0-521-76268-7}} CUP blurb for Relational Mathematics## As an element of a Cartesian product over a domainThe set of all functions from some given domain to a codomain is sometimes identified with the Cartesian product of copies of the codomain, indexed by the domain. Namely, given sets X, Y, any function f: X to Y is an element of the Cartesian product of copies of Y's over the index set X
f in prod_X Y = Y^X.
Viewing f as tuple with coordinates, then for each x in X, the x-th coordinate of this tuple is the value f(x) in Y. This reflects the intuition that for each x in X, the function picks some element y in Y, namely, f(x). (This point of view is used for example in the discussion of a choice function.)Note: infinite Cartesian products are often simply "defined" as sets of functions.Halmos, Naive Set Theory, 1968, sect.9 ("Families")## NotationThere are various standard ways for denoting functions. The most commonly used notation is functional notation, which defines the function using an equation that gives the names of the function and the argument explicitly. This gives rise to a subtle point, often glossed over in elementary treatments of functions:functions are distinct from their values. Thus, a function {{math|f}} should be distinguished from its value {{math|f(x0)}} at the value {{math|x0}} in its domain. To some extent, even working mathematicians will conflate the two in informal settings for convenience, and to avoid the use of pedantic language. However, strictly speaking, it is an abuse of notation to write "let fcolon mathbb{R}tomathbb{R} be the function {{math|1=f(x) = x2}} ", since {{math|f(x)}} and {{math|x2}} should both be understood as the value of f at x, rather than the function itself. Instead, it is correct, though pedantic, to write "let fcolon mathbb{R}tomathbb{R} be the function defined by the equation {{math|1=f(x) = x2,}} valid for all real values of {{math|x}} ".This distinction in language and notation becomes important in cases where functions themselves serve as inputs for other functions. (A function taking another function as an input is termed a functional.) Other approaches to denoting functions, detailed below, avoid this problem but are less commonly used.## Functional notationAs first used by Leonhard Euler in 1734,{{citation |page=19 |title=Calculus of a Single Variable |author=Ron Larson, Bruce H. Edwards |publisher=Cengage Learning |year=2010 |isbn=978-0-538-73552-0}} functions are denoted by a symbol consisting generally of a single letter in italic font, most often the lower-case letters {{math|f, g, h}}. Some widely used functions are represented by a symbol consisting of several letters (usually two or three, generally an abbreviation of their name). By convention, in this case, a roman type is used, such as "{{math|sin}}" for the sine function, in contrast to italic font for single-letter symbols.The notation (read: "{{mvar|y}} equals {{mvar|f}} of {{mvar|x}}")
y=f(x)
means that the pair {{math|(x, y)}} belongs to the set of pairs defining the function {{mvar|f}}. If {{mvar|X}} is the domain of {{mvar|f}}, the set of pairs defining the function is thus, using set-builder notation,
{(x, f(x)) : xin X}.
Often, a definition of the function is given by what f does to the explicit argument x. For example, a function f can be defined by the equation
f(x)=sin(x^2+1)
for all real numbers x. In this example, f can be thought of as the composite of several simpler functions: squaring, adding 1, and taking the sine. However, only the sine function has a common explicit symbol (sin), while the combination of squaring and then adding 1 is described by the polynomial expression x^2+1. In order to explicitly reference functions such as squaring or adding 1 without introducing new function names (e.g., by defining function g and h by g(x)=x^2 and h(x)=x+1), one of the methods below (arrow notation or dot notation) could be used.Sometimes the parentheses of functional notation are omitted when the symbol denoting the function consists of several characters and no ambiguity may arise. For example, sin x can be written instead of sin(x).## Arrow notationFor explicitly expressing domain {{math|X}} and the codomain {{math|Y}} of a function {{math|f}}, the arrow notation is often used (read: {{nowrap|"the function {{math|f}} from {{mvar|X}} to {{mvar|Y}}"}} or {{nowrap|"the function {{math|f}} mapping elements of {{mvar|X}} to elements of {{mvar|Y}}"}}):
fcolon X to Y
or
X ~ stackrel{f}{to} ~ Y.
This is often used in relation with the arrow notation for elements (read: "{{mvar|f}} maps {{mvar|x}} to {{math|f{{space|hair}}(x)}}"), often stacked immediately below the arrow notation giving the function symbol, domain, and codomain:
xmapsto f(x).
For example, if a multiplication is defined on a set {{mvar|X}}, then the square function operatorname{sqr} on {{mvar|X}} is unambiguously defined by (read: "the function operatorname{sqr} from {{mvar|X}} to {{mvar|X}} that maps {{mvar|x}} to {{math|x â‹… x}}")
begin{align}
operatorname{sqr}colon X &to Xx &mapsto xcdot x,end{align}the latter line being more commonly written
xmapsto x^2.
Often, the expression giving the function symbol, domain and codomain is omitted. Thus, the arrow notation is useful for avoiding introducing a symbol for a function that is defined, as it is often the case, by a formula expressing the value of the function in terms of its argument. As a common application of the arrow notation, suppose fcolon Xtimes Xto Y;;(x,t) mapsto f(x,t) is a two-argument function, and we want to refer to a partially applied function Xto Y produced by fixing the second argument to the value {{math|t0}} without introducing a new function name. The map in question could be denoted xmapsto f(x,t_0) using the arrow notation for elements. Note that the expression xmapsto f(x,t_0) (read: "the map taking {{math|x}} to f(x,t_0)") represents this new function with just one argument, whereas the expression f(x_0,t_0) refers to the value of the function {{math|f}} at the {{nowrap|point (x_0,t_0).}}## Index notationIndex notation is often used instead of functional notation. That is, instead of writing {{math|f{{space|hair}}(x)}}, one writes f_x.This is typically the case for functions whose domain is the set of the natural numbers. Such a function is called a sequence, and, in this case the element f_n is called the {{mvar|n}}th element of sequence.The index notation is also often used for distinguishing some variables called parameters 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 xmapsto f(x,t) (see above) would be denoted f_t using index notation, if we define the collection of maps f_t by the formula f_t(x)=f(x,t) for all x,tin X.## Dot notationIn the notationxmapsto f(x),the symbol {{mvar|x}} does not represent any value, it is simply a 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{{space|hair}}(â‹…)}} from its value {{math|f{{space|hair}}(x)}} at {{mvar|x}}.For example, a(cdot)^2 may stand for the function xmapsto ax^2, and textstyle int_a^{, (cdot)} f(u),du may stand for a function defined by an integral with variable upper bound: textstyle xmapsto int_a^x f(u),du.## Specialized notationsThere are other, specialized notations for functions in sub-disciplines of mathematics. For example, in linear algebra and functional analysis, linear forms and the vectors they act upon are denoted using a dual pair to show the underlying duality. This is similar to the use of braâ€“ket notation in quantum mechanics. In logic and the theory of computation, the function notation of lambda calculus is used to explicitly express the basic notions of function abstraction and application. In category theory and homological algebra, networks of functions are described in terms of how they and their compositions commute with each other using commutative diagrams that extend and generalize the arrow notation for functions described above.## Map vs functionA function is often also called amap 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., a group homomorphism between groups can simply be called a map between those groups for the sake of succinctness. See also: maps of manifolds. Some authorsBOOK, T. M. Apostol, Mathematical Analysis, 1981, Addison-Wesley, 35, reserve the word mapping to the case where the codomain Y belongs explicitly to the definition of the function. In this sense, the graph of the mapping recovers the function as the set of pairs.Because the term "map" is synonymous with "morphism" in category theory, the term "map" can in particular emphasize the aspect that a function is a morphism in the category of sets: in the informal definition of function f:Xto Y, it is a subset of Xtimes Y consisting of all the pairs (x,f(x)) for xin X. In this sense, the function doesn't capture the information of which set Y is used as the co-domain. Only the range f(X) is determined by the function.Some authors, such as Serge Lang,{{citation|first=Serge|last=Lang|title=Linear Algebra|edition=2nd|year=1971|page=83|publisher=Addison-Wesley}} use "function" only to refer to maps in which the codomain is a set of numbers (i.e. a subset of the fields R or C) and the term mapping for more general functions.In the theory of dynamical systems, a map denotes an evolution function used to create discrete dynamical systems. See also PoincarÃ© map.A partial map is a partial function, and a total map is a total function. Related terms like domain, codomain, injective, continuous, etc. can be applied equally to maps and functions, with the same meaning. All these usages can be applied to "maps" as general functions or as functions with special properties.## Specifying a functionGiven a function f, by definition, to each element x of the domain of the function f, there is a unique element associated to it, the value f(x) of f at x. There are several ways to specify or describe how x is related to f(x), both explicitly and implicitly (or axiomatically). Often, the specification or description is referred to as the definition of the function f.- 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. E.g., if A = { 1, 2, 3 }, then one can define a function f: A to mathbb{R} by f(1) = 2, f(2) = 3, f(3) = 4.
- Depending on a function, if possible, one might use a (closed) formula to define the function. For example, in the above example, f can be defined by the formula f(n) = n+1, for nin{1,2,3}.
- One often combines arithmetic or algebraic operations to define a new function; for example, a function f: mathbb{R} to mathbb{R}, defined by f(x)=sqrt{1+x^2}, is defined by a combination of the polynomial 1 + x^2 and the square root function.
- The following is an example of an implicit definition of a function: using calculus, one can show that, for each real number x, y^2 = x^2 + 1 has two distinct real roots, a positive and a negative one. One can then define f: mathbb{R} to mathbb{R} by saying that f(x) is the positive root of the equation y^2 = x^2 + 1 (cf. Multi-valued functions). This is the same function as the previous one. The natural logarithm is often defined by an appeal to the implicit function theorem.
- A power series can be used to define a function on the domain in which the series converges: for example, the exponential function is given by e^x = sum_{n=0}^{infty} {x^n over n!}.
- In general, given a function f, there might not be a (closed) formula or condition that can be used to define it. An elementary functionHere "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. is a function that can be defined by a finite number of applications of arithmetic operations and composition involving only constants, arithmetic operations, exponential functions, logarithms, and roots of polynomials.
- A choice function in the axiom of choice is an example of a function that exists only by
*postulation*.
sum_{n=1}^inftyfrac{1}{n^s}
can be shown to converge if the real part of s is strictly greater than 1. Hence, it defines a function on the domain { s in mathbb{C} | operatorname{Re}(s) > 1 }. This function is analytic and has a unique analytic extension defined on mathbb{C} smallsetminus { 1 }, called the Riemann zeta function. Note the value zeta(s) is given by the above series if operatorname{Re}(s) > 1 but is not so in general.Differential equations are sometimes used to define a function. For example, the exponential function is the solution of the initial value problem frac{df}{dx}=f such that f(0)=1.## Representing a functionA graph is commonly used to give an intuitive picture of a function. As an example of how a graph helps 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 charts.## Graphs and plotsFile:Motor vehicle deaths in the US.svg|thumb|The function mapping each year to its US motor vehicle death count, shown as a line chartline chart(File:Motor vehicle deaths in the US histogram.svg|thumb|The same function, shown as a bar chart)Given a function fcolon Xto Y, itsgraph is, formally, the set
G={(x,f(x)) : xin X}.
In the frequent case where {{mvar|X}} and {{mvar|Y}} are subsets of the real numbers (or may be identified with such subsets, e.g. intervals), an element (x,y)in G 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 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
xmapsto x^2,
consisting of all points with coordinates (x, x^2) for xin R, yields, when depicted in Cartesian coordinates, the well known parabola. If the same quadratic function xmapsto x^2, with the same formal graph, consisting of pairs of numbers, is plotted instead in polar coordinates (r,theta) =(x,x^2), the plot obtained is Fermat's spiral.## TablesA 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 fcolon{1,ldots,5}^2 to mathbb{R} defined as f(x,y)=xy 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 | |||

| 5 | |||

| 10 | |||

| 15 | |||

| 20 | |||

| 25 |

*x*}}| 0.960557| 0.960835| 0.961112| 0.961387| 0.961662Before 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

Bar charts are often used for representing functions whose domain is a finite set, the natural numbers, or the integers. In this case, an element {{mvar|x}} of the domain is represented by an 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.### Canonical functions

Some functions are uniquely defined by their domain and codomain, and are sometimes called*canonical*: {{anchor|Empty function}}

- For every set {{mvar|X}}, there is a unique function, called the
**empty function**from the empty set to {{mvar|X}}. This function is not interesting by itself, but useful for simplifying statements, similarly as the empty sum (equal to 0) and the empty product equal to 1. - For every set {{mvar|X}} and every singleton set {{math|{
*s*}{{void}}}}, there is a unique function, called the**canonical surjection**, from {{mvar|X}} to {{math|{*s*}{{void}}}}, which maps to {{mvar|s}} every element of {{mvar|X}}. This is a surjection (see below), except if {{mvar|X}} is the empty set. - Given a function fcolon Xto Y, the
**canonical surjection**of {{mvar|f}} onto its*image*f(X)={f(x)mid xin X} is the function from {{mvar|X}} to {{math|*f*(*X*)}} that maps {{mvar|x}} to {{math|*f*(*x*)}} - For every subset {{mvar|X}} of a set {{mvar|Y}}, the
**canonical injection**of {{mvar|X}} into {{mvar|Y}} is the injective (see below) function that maps every element of {{mvar|X}} to itself. - The identity function of {{mvar|X}}, often denoted by operatorname{id}_X is the canonical injection of {{mvar|X}} into itself.

### Function composition

Given two functions fcolon Xto Y and gcolon Yto Z such that the domain of {{mvar|g}} is the codomain of {{mvar|f}}, their*composition*is the function g circ fcolon X rightarrow Z defined by

(g circ f)(x) = g(f(x)).

That is, the value of g circ f 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 the notation the function that is applied first is always written on the right.The composition gcirc f is an operation on functions that is defined only if the codomain of the first function is the domain of the second one. Even when both g circ f and f circ g satisfy these conditions, the composition is not necessarily commutative, that is, the functions g circ f and f circ g need not be equal, but may deliver different values for the same argument. For example, let {{math|1=

*f*(

*x*) =

*x*2}} and {{math|1=

*g*(

*x*) =

*x*+ 1}}, then g(f(x))=x^2+1 and f(g(x)) = (x+1)^2 agree just for x=0.The function composition is associative in the sense that, if one of (hcirc g)circ f and hcirc (gcirc f) is defined, then the other is also defined, and they are equal. Thus, one writes

hcirc gcirc f = (hcirc g)circ f = hcirc (gcirc f).

The identity functions operatorname{id}_X and operatorname{id}_Y 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 hasfcirc operatorname{id}_X = operatorname{id}_Y circ f = f.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 compositionFile:Compfun.svg|Another composition. In this example, {{math|1=(

*g*â€‰âˆ˜â€‰

*f*â€‰)(c) = #}}.

### Image and preimage

Let fcolon Xto Y. The*image*by {{mvar|f}} of an element {{mvar|x}} of the domain {{mvar|X}} is {{math|

*f*(

*x*)}}. If {{math|

*A*}} is any subset of {{math|

*X*}}, then the

*image*of {{mvar|A}} by {{mvar|f}}, denoted {{math|

*f*(

*A*)}} is the subset of the codomain {{math|

*Y*}} consisting of all images of elements of {{mvar|A}}, that is,

f(A)={f(x)mid xin A}.

The *image*of {{math|

*f*}} is the image of the whole domain, that is {{math|

*f*(

*X*)}}. It is also called the range of {{mvar|f}}, although the term may also refer to the codomain.

*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)On the other hand, the

*inverse image*, or

*preimage*by {{mvar|f}} of a subset {{math|

*B*}} of the codomain {{math|

*Y*}} is the subset of the domain {{math|

*X*}} consisting of all elements of {{math|

*X*}} whose images belong to {{math|

*B*}}. It is denoted by f^{-1}(B). That is

f^{-1}(B) = {x in X mid f(x) in B}.

For example, the preimage of {4, 9} under the square function is the set {âˆ’3,âˆ’2,2,3}.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 of a single element {{mvar|y}}, denoted f^{-1}(x), may be empty or contain any number of elements. For example, if {{mvar|f}} is the function from the integers to themselves that map every integer to 0, then {{math|1=

*f*âˆ’1(0) =

**Z**}}.If fcolon Xto Y 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:

- Asubseteq B Longrightarrow f(A)subseteq f(B)
- Csubseteq D Longrightarrow f^{-1}(C)subseteq f^{-1}(D)
- A subseteq f^{-1}(f(A))
- C supseteq f(f^{-1}(C))
- f(f^{-1}(f(A)))=f(A)
- f^{-1}(f(f^{-1}(C)))=f^{-1}(C)

*y*}} under {{mvar|

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

### Injective, surjective and bijective functions

Let fcolon Xto Y be a function.The function {{mvar|f}} is*injective*(or

*one-to-one*, or is an

*injection*) if {{math|

*f*(

*a*) â‰

*f*(

*b*)}} for any two different elements {{math|

*a*}} and {{mvar|

*b*}} of {{mvar|X}}. Equivalently, {{mvar|f}} is injective if, for any yin Y, the preimage f^{-1}(y) contains at most one element. An empty function is always injective. If {{mvar|X}} is not the empty set, and if, as usual, the axiom of choice is assumed, then {{mvar|f}} is injective if and only if there exists a function gcolon yto X such that gcirc f=operatorname{id}_X, that is, if {{mvar|f}} has a left inverse. The axiom of choice is needed, because, if {{mvar|f}} is injective, one defines {{mvar|g}} by g(y)=x if y=f(x), and by g(y)=x_0, if ynotin f(X), where x_0 is an

*arbitrarily chosen*element of {{mvar|X}}.The function {{mvar|f}} is

*surjective*(or

*onto*, or is a

*surjection*) if the range equals the codomain, that is, if {{math|1=

*f*(

*X*) =

*Y*}}. In other words, the preimage f^{-1}(y) of every yin Y is nonempty. If, as usual, the axiom of choice is assumed, then {{mvar|f}} is surjective if and only if there exists a function gcolon yto X such that fcirc g=operatorname{id}_Y, that is, if {{mvar|f}} has a right inverse. The axiom of choice is needed, because, if {{mvar|f}} is injective, one defines {{mvar|g}} by g(y)=x, where x is an

*arbitrarily chosen*element of f^{-1}(y).The function {{mvar|f}} is

*bijective*(or is

*bijection*or a

*one-to-one correspondence*) if it is both injective and surjective. That is {{mvar|f}} is bijective if, for any yin Y, the preimage f^{-1}(y) contains exactly one element. The function {{mvar|f}} is bijective if and only if it admits an inverse function, that is a function gcolon yto X such that gcirc f=operatorname{id}_X, and fcirc g=operatorname{id}_Y. (Contrarily to the case of injections and surjections, this does not require the axiom of choice.)Every function fcolon Xto Y may be factorized as the composition {{math|

*i*âˆ˜

*s*}} 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 Bourbaki group and imported into English. As a word of caution, "a one-to-one function" is one that is injective, while a "one-to-one correspondence" refers to a bijective function. Also, the statement "{{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*}} the mapping. 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 to be more symmetrical.

### Restriction and extension{{anchor|Restrictions and extensions}}

If fcolon Xto Y is a function, and {{mvar|S}} is a subset of {{mvar|X}}, then the*restriction*of {{mvar|f}} to {{mvar|S}}, denoted {{math|

*f*{{!}}

*S*}}, is the function from {{mvar|S}} to {{mvar|Y}} that is defined by

f_{|S}(x)= f(x)quad text{for all } xin S.

This often used for define partial inverse functions: if there is a subset {{mvar|S}} of a function {{mvar|f}} such that {{math|*f*{{!}}

*S*}} is injective, then the canonical surjection of {{math|

*f*{{!}}

*S*}} on its image {{math|1=

*f*{{!}}

*S*(

*S*) =

*f*(

*S*)}} is a bijection, which has an inverse function from {{math|

*f*(

*S*)}} to {{mvar|S}}. This is in this way that inverse trigonometric functions are defined. The cosine function, for example, is injective, when restricted to the interval {{math|(â€“0, {{pi}})}}; the image of this restriction is the interval {{math|(â€“1, 1)}}; this defines thus an inverse function from {{math|(â€“1, 1)}} to {{math|(â€“0, {{pi}})}}, which is called arccosine and denoted {{math|arccos}}.Function restriction may also be used for "gluing" functions together: let textstyle X=bigcup_{iin I}U_i be the decomposition of {{mvar|X}} as a union of subsets. Suppose that a function f_icolon U_ito Y is defined on each U_i, such that, for each pair of indices, the restrictions of f_i and f_j to U_icap U_j are equal. Then, this defines a unique function fcolon Xto Y such that f_{|U_i} =f_i for every {{mvar|i}}. This is generally in this way that functions on manifolds 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 homographies of the real line. An

*homography*is a function h(x)=frac{ax+b}{cx+d} such that {{math|

*ad*â€“

*bc*â‰ 0}}. Its domain is the set of all real numbers different from -d/c, and its image is the set of all real numbers different from a/c. If one extends the real line to the projectively extended real line by adding {{math|âˆž}} to the real numbers, one may extend {{mvar|h}} for being a bijection of the extended real line to itself, by setting h(infty)=a/c and h(-d/c)=infty.

## Multivariate function {{anchor|MULTIVARIATE_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 (x, y) the result xcirc y.)A**multivariate 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 and its speed.More formally, a function of {{mvar|n}} variables is a function whose domain is a set of {{mvar|n}}-tuples.For example, multiplication of integers is a function of two variables, or

**bivariate function**, whose domain is the set of all pairs (2-tuples) of integers, and whose codomain is the set of integers. The same is true for every binary operation. More generally, every mathematical operation is defined as a multivariate function.The Cartesian product X_1timescdotstimes X_n of {{mvar|n}} sets X_1, ldots, X_n is the set of all {{mvar|n}}-tuples (x_1, ldots, x_n) such that x_iin X_i for every {{mvar|i}} with 1 leq i leq n. Therefore, a function of {{mvar|n}} variables is a function

fcolon Uto Y,

where the domain {{mvar|U}} has the form
Usubseteq X_1timescdotstimes X_n.

When using function notation, one usually omits the parentheses surrounding tuples, writing f(x_1,x_2) instead of f((x_1,x_2)).In the case where all the X_i are equal to the set R of real numbers, one has a function of several real variables. If the X_i are equal to the set C of complex numbers, one has a function of several complex variables.It is common to also consider functions whose codomain is a product of sets. For example, Euclidean division maps every pair {{math|(*a*,

*b*)}} of integers with {{math|

*b*â‰ 0}} to a pair of integers called the

*quotient*and the

*remainder*:

begin{align}

text{Euclidean division}colonquad Ztimes (Zsetminus {0}) &to ZtimesZ

(a,b) &mapsto (operatorname{quotient}(a,b),operatorname{remainder}(a,b)).

end{align}

The codomain may also be a vector space. In this case, one talks of a vector-valued function. If the domain is contained in a Euclidean space, or more generally a manifold, a vector-valued function is often called a vector field.(a,b) &mapsto (operatorname{quotient}(a,b),operatorname{remainder}(a,b)).

end{align}

## In calculus

The idea of function, starting in the 17th century, was fundamental to the new infinitesimal calculus (see History of the function concept). At that time, only real-valued functions of a real variable were considered, and all functions were assumed to be smooth. But the definition was soon extended to functions of several variables and to function 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.|right)File:Sine cosine one period.svg|thumb|right|Graph of two trigonometric functions: sine and cosinecosineA*real function*is a real-valued function of a real variable, that is, a function whose codomain is the field of real numbers and whose domain is a set of real numbers that contains an 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, differentiable, and even analytic. This regularity insures that these functions can be visualized by their graphs. In this section, all functions are differentiable in some interval.Functions enjoy pointwise operations, that is, if {{mvar|f}} and {{mvar|g}} are functions, their sum, difference and product are functions defined by

begin{align}

(f+g)(x)&=f(x)+g(x)(f-g)(x)&=f(x)-g(x)(fcdot g)(x)&=f(x)cdot g(x)end{align}.The domains of the resulting functions are the intersection of the domains of {{mvar|f}} and {{mvar|g}}. The quotient of two functions is defined similarly by
frac fg(x)=frac{f(x)}{g(x)},

but the domain of the resulting function is obtained by removing the zeros of {{mvar|g}} from the intersection of the domains of {{mvar|f}} and {{mvar|g}}.The polynomial functions are defined by polynomials, and their domain is the whole set of real numbers. They include constant functions, linear functions and quadratic functions. Rational functions 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 xmapsto frac 1x, 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 is differentiable in any open interval in which the original function is continuous. For example, the function xmapstofrac 1x 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 in an interval if the sign of frac{f(x)-f(y)}{x-y} 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 equations. For example, the sine and the cosine functions are the solutions of the linear differential equation

y''+y=0

such that
sin 0=0, quad cos 0=1, quadfrac{partial sin x}{partial x}(0)=1, quadfrac{partial cos x}{partial x}(0)=0.

### Function of several real or complex variables

{{expand section|date=April 2018}}Functions of several real (or complex) variables are functions which domain consists of tuples of real (or complex) numbers. This is, the domain is a subset of mathbb{R}^n or mathbb{C}^n. For example, the division operation is a function that inputs a pair of real or complex numbers, one to be the dividend and the other the divisor, and returns their quotient (a,b)mapsto a/b.In the case of functions of several variables, the functional notation can be used in two ways. The symbol f(x) could denote a function of several variables, if x is assumed to be denoting tuples of real or complex numbers x=(x_1,x_2,ldots,x_n). Alternatively, the components of the tuple can be made explicit in the notation when this is written as f(x_1,x_2,ldots,x_n). The repeated parentheses f((x_1,x_2,ldots,x_n)) that would result from syntactically replacing x by (x_1,x_2,ldots,x_n) in the symbol f(x) are generally avoided in mathematics.### Vector-valued function

{{expand section|date=April 2018}}When the elements of the co-domain of a function are vectors the function is said to be a vector-valued function. These functions are particularly useful in applications, for example modeling physical properties. The function that associates to each point of a fluid its velocity vector is a vector-valued function.Some vector-valued function are defined on a subset of mathbb{R}^n or other spaces that share geometric or topological properties similar to mathbb{R}^n, like manifolds. These vector-valued functions are given the name vector fields.## Function space

In mathematical analysis, and more specifically in functional analysis, a**function space**is a set of scalar-valued or vector-valued functions, which share a specific property and form a topological vector space. For example, the real smooth functions 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 distributions.Function spaces play a fundamental role in advanced mathematical analysis, by allowing the use of their algebraic and topological properties for studying properties of functions. For example, all theorems of existence and uniqueness of solutions of ordinary or partial differential equations result of the study of function spaces.

## Multi-valued functions

(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 of a point, and then extend by continuity the function to a much larger domain. Frequently, for a starting point x_0, 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 x_0, there are two choices for the value of the square root, one of which is positive and denoted sqrt {x_0}, and another which is negative and denoted -sqrt {x_0}. 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 {{mvar|x}} of x^3-3x-y =0 (see the figure on the right). For {{math|1=*y*= 0}} one may choose either 0, sqrt 3,text{ or } -sqrt 3 for {{mvar|x.}} By the implicit function theorem, each choice defines a function; for the first one, the (maximal) domain is the interval {{math|[â€“2, 2]}} and the image is {{math|[â€“1, 1]}}; for the second one, the domain is {{math|[â€“2, âˆž)}} and the image is {{math|[1, âˆž)}}; for the last one, the domain is {{math|(â€“âˆž, 2]}} and the image is {{math|(â€“âˆž, â€“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 functions. 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 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 foundations of mathematics and set theory

The definition of a function that is given in this article requires the concept of 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 xmapsto {x}. 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 definition for these weakly specified functions.{{harvnb |GÃ¶del |1940 |p=16}}; {{harvnb |Jech |2003 |p=11}}; {{harvnb |Cunningham |2016 |p=57}}These generalized functions may be critical in the development of a formalization of foundations of mathematics. For example, the Von Neumannâ€“Bernaysâ€“GÃ¶del set theory, is an extension of the set theory in which the collection of all sets is a class. This theory includes the replacement axiom, which may be interpreted as "if {{mvar|X}} is a set, and {{mvar|F}} is a function, then {{math|*F*[

*X*]}} is a set".

## In computer science

{{expand section|date=April 2018}}In computer science, functions are callable units of code. For example, the code
Â Â

Â Â Â Â

can be called by the expression square_function(x), where x can be replaced, for example, by numeric literals as in square_function(2) or identifiers of other valid input.The calling of the unit of code consists in the expression square_function(x) being replaced by the execution of the code inside the function's definition. In the example, it would be replaced by executing the evaluation of the expression x*x. This expression in turn, could be indicating to compute the multiplication of x by itself, in the case of x representing a numeric value. The evaluation would then compute the square of x. The result of this evaluation is called the return value of the function.As in the example, some functions in computer science behave like mathematical functions. The computer science function of the example would normally behave for numerical inputs like the mathematical function f(x)=x^2. On the other hand, not all functions in computer science behave like mathematical functions. Functions in computer science could not have a return value. The return value could not be unique for a given input as they are required to be for mathematical functions. This is due to the execution of the unit of code depending also on the state of the computing machine at the time in which the call is executed.A function may{{clarify|date=February 2019}} be described by an algorithm, and any kind of algorithm may{{clarify|date=February 2019}} be used. Sometimes, the definition of a function may involve elements or properties that can be defined, but not computed. For example, if one considers the set mathcal P of the programs in a given programming language that take an integer as input. The **define**square_function(x):Â Â Â Â

**return**x*x*terminating function*is the function that returns 1 if a program of mathcal P runs forever when executed on a given integer input, and returns 0 otherwise. It is a basic theorem of computability theory that there does not exist an algorithm for computing this function. More generally, computability theory is the study of computable functions, that is, the functions that can be computed by an algorithm.The above ways of defining functions define them "pointwise", that is, each value is defined independently of the other values. This is not necessarily the case.

## See also

### Subpages

{{div col|colwidth=22em}} {{div col end}}### Generalizations

{{div col|colwidth=22em}} {{div col end}}### Related topics

{{div col|colwidth=22em}}- Associative array
- Functional
- Functional decomposition
- Functional predicate
- Functional programming
- Parametric equation
- Elementary function
- Closed-form expression

## Notes

{{Reflist|group=note}}{{Reflist}}## References

- BOOK, harv, Bartle, Robert, Robert G. Bartle, The Elements of Real Analysis, 1967, John Wiley & Sons,
- BOOK, harv, Bloch, Ethan D., Proofs and Fundamentals: A First Course in Abstract Mathematics, Springer, 2011, 978-1-4419-7126-5,weblink
- BOOK, harv, Cunningham, Daniel W., Set theory: A First Course, Cambridge University Press, 2016, 978-1-107-12032-7,
- BOOK, harv, GÃ¶del, Kurt, Kurt GÃ¶del, The Consistency of the Continuum Hypothesis, Princeton University Press, 1940, 978-0-691-07927-1,
- BOOK, harv, Halmos, Paul R., Paul Halmos, 1970, Naive Set Theory, Springer-Verlag, 978-0-387-90092-6,weblink
- BOOK, harv, Jech, Thomas, Thomas Jech, Set theory, Third Millennium, Springer-Verlag, 2003, 978-3-540-44085-7,
- BOOK, harv, Calculus, Michael, Spivak, Michael Spivak, 4th, 2008, Publish or Perish, 978-0-914098-91-1,weblink

## Further reading

- BOOK, Anton, Howard, Calculus with Analytical Geometry, 1980, John Wiley & Sons, Wiley, 978-0-471-03248-9,
- BOOK, Bartle, Robert G., The Elements of Real Analysis, 2nd, 1976, Wiley, 978-0-471-05464-1,
- BOOK, The Concept of Function: Aspects of Epistemology and Pedagogy, Mathematical Association of America, 1992, Ed, Dubinsky, Guershon, Harel, 978-0-88385-081-7,
- BOOK, Hammack, Richard, Book of Proof, 2009, Virginia Commonwealth University,weblink 12. Functions,weblink 2012-08-01,
- BOOK, Husch, Lawrence S., Visual Calculus, 2001, University of Tennessee,weblink 2007-09-27,
- BOOK, Katz, Robert, Axiomatic Analysis, 1964, D. C. Heath and Company,
- JOURNAL, Evolution of the Function Concept: A Brief Survey, Israel, Kleiner, The College Mathematics Journal, 20, 4, 1989, 282â€“300, 10.2307/2686848, 2686848, 10.1.1.113.6352,
- BOOK, The Cambridge History of Science: The modern physical and mathematical sciences, Between rigor and applications: Developments in the concept of function in mathematical analysis, Jesper, LÃ¼tzen,weblink Roy, Porter, Cambridge University Press, 2003, 978-0-521-57199-9, An approachable and diverting historical presentation.
- JOURNAL, Historical and pedagogical aspects of the definition of function, Malik, M. A., International Journal of Mathematical Education in Science and Technology, 11, 4, 1980, 489â€“492, 10.1080/0020739800110404,
- Reichenbach, Hans (1947)
*Elements of Symbolic Logic*, Dover Publishing Inc., New York, {{isbn|0-486-24004-5}}. - JOURNAL, Ruthing, D., Some definitions of the concept of function from Bernoulli, Joh. to Bourbaki, N., Mathematical Intelligencer, 6, 4, 72â€“77, 1984,
- BOOK, Thomas, George B., Finney, Ross L., Calculus and Analytic Geometry, 9th, 1995, Addison-Wesley, 978-0-201-53174-9,

## External links

- {{springer|title=Function|id=p/f041940}}
- {{MathWorld| title=Function| id=Function}}
- The Wolfram Functions Site gives formulae and visualizations of many mathematical functions.
- NIST Digital Library of Mathematical Functions

**- content above as imported from Wikipedia**

- "

- time: 1:47pm EST - Sun, Feb 17 2019

- "

__function (mathematics)__" does not exist on GetWiki (yet)- time: 1:47pm EST - Sun, Feb 17 2019

[ this remote article is provided by Wikipedia ]

LATEST EDITS [ see all ]

GETWIKI 09 MAY 2016

GETWIKI 18 OCT 2015

GETWIKI 20 AUG 2014

GETWIKI 19 AUG 2014

GETWIKI 18 AUG 2014

© 2019 M.R.M. PARROTT | ALL RIGHTS RESERVED