Function (mathematics) ====================== In mathematics, a function from a set to a set assigns to each element of exactly one element of . The set is called the domain of the function and the set is called the codomain of the function. 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. 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 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 , or . The value of a function at an element of its domain (that is, the element of the codomain that is associated with ) is denoted by ; for example, the value of at is denoted by . Commonly, a specific function is defined by means of an expression depending on , such as f(x)=x^2+1; in this case, some computation, called function evaluation, may be needed for deducing the value of the function at a particular value; for example, if f(x)=x^2+1, then f(4)=4^2+1=17.… In mathematics, a function from a set to a set assigns to each element of exactly one element of . The set is called the domain of the function and the set is called the codomain of the function. 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. 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 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 , or . The value of a function at an element of its domain (that is, the element of the codomain that is associated with ) is denoted by ; for example, the value of at is denoted by . Commonly, a specific function is defined by means of an expression depending on , such as f(x)=x^2+1; in this case, some computation, called function evaluation, may be needed for deducing the value of the function at a particular value; for example, if f(x)=x^2+1, then f(4)=4^2+1=17. Given its domain and its codomain, a function is uniquely represented by the set of all pairs , called the graph of the function, a popular means of illustrating the function. 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. 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. If the element in is assigned to in by the function , one says that maps to , and this is commonly written y=f(x). In this notation, is the argument or variable of the function. A specific element of is a value of the variable, and the corresponding element of is the value of the function at , or the image of under the function. The image of a function, sometimes called its range, is the set of the images of all elements in the domain. A function , its domain , and its codomain are often specified by the notation f: X\to Y. One may write x\mapsto y instead of y=f(x) , where the symbol \mapsto (read 'maps to') is used to specify where a particular element in the domain is mapped to by . This allows the definition of a function without naming. For example, the square function is the function x\mapsto x^2. 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 f:\R\to\R is a real function, the determination of the domain of the function x\mapsto 1/f(x) requires knowing the zeros of This is one of the reasons for which, in mathematical analysis, "a function may refer to a function having a proper subset of as a domain. For example, a "function from the reals to the reals" may refer to a real-valued function of a real variable whose domain is a proper subset of the real numbers, typically a subset that contains a non-empty open interval. Such a function is then called a partial function. A function on a set means a function from the domain , without specifying a codomain. However, some authors use it as shorthand for saying that the function is . If (x,y)\in R and (x,z)\in R, then y=z. 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 (often as an ordered triple), the domain X, the codomain Y, and the graph R that satisfy the three following conditions. R \subseteq \{(x,y) \mid x\in X, y\in Y\} \forall x\in X, \exists y\in Y, \left(x, y\right) \in R \qquad (x,y)\in R \land (x,z)\in R \implies y=z\qquad A relation satisfying these conditions is called a functional relation. The more usual terminology and notation can be derived from this formal definition as follows. Let be a function defined by a functional relation . For every in the domain of , the unique element of the codomain that is related to is denoted . If is this element, one writes commonly instead of or , and one says that " maps to ", " is the image by of ", or "the application of on gives ", etc. === Multivariate functions === 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 variables is a function whose domain is a set of -tuples. For example, multiplication of integers 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 parametric surface, as used in, e.g., bivariate interpolation. Commonly, an -tuple is denoted enclosed in parentheses, such as in (1,2,\ldots, n). When using functional notation, one usually omits the parentheses surrounding tuples, writing f(x_1,\ldots,x_n) instead of f((x_1,\ldots,x_n)). Given sets X_1,\ldots, X_n, the set of all -tuples (x_1,\ldots,x_n) such that x_1\in X_1, \ldots, x_n\in X_n is called the Cartesian product of X_1,\ldots, X_n, and denoted X_1\times\cdots\times X_n. Therefore, a multivariate function is a function that has a Cartesian product or a proper subset of a Cartesian product as a domain. f: U\to Y, where the domain has the form U\subseteq X_1\times\cdots\times X_n. If all the X_i are equal to the set \R of the real numbers or to the set \C of the complex numbers, one talks respectively of a function of several real variables or of a function of several complex variables. f(x), \quad \sin(3),\quad \text{or}\quad f(x^2+1). The argument between the parentheses may be a variable, often , that represents an arbitrary element of the domain of the function, a specific element of the domain ( in the above example), or an expression that can be evaluated to an element of the domain ( x^2+1 in the above example). The use of an unspecified variable between parentheses is useful for defining a function explicitly, such as in "let f(x)=\sin(x^2+1) ". 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 instead of . Functional notation was first used by Leonhard Euler in 1734. 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 " " 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 f(x) be a function". This is an abuse of notation that is useful for a simpler formulation. \begin{align} \operatorname{sqr}\colon \Z &\to \Z\\ x &\mapsto x^2.\end{align} This defines a function from the integers to the integers that returns the square of its input. As a common application of the arrow notation, suppose f: X\times X\to Y;\;(x,t) \mapsto f(x,t) is a function in two variables, and we want to refer to a partially applied function X\to Y produced by fixing the second argument to the value without introducing a new function name. The map in question could be denoted x\mapsto f(x,t_0) using the arrow notation. The expression x\mapsto f(x,t_0) (read: "the map taking to of comma nought") represents this new function with just one argument, whereas the expression refers to the value of the function at the The index notation can also be 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 x\mapsto 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,t\in X . For example, a(\cdot)^2 or a(-)^2 may stand for the function x\mapsto ax^2 , and \int_a^{\, (\cdot)} f(u)\,du or \int_a^{\, (-)} f(u)\,du may stand for a function defined by an integral with variable upper bound: x\mapsto \int_a^x f(u)\,du . ===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 can be defined as mapping any pair of real numbers (x, y) to the sum of their squares, x^2 + y^2 . Such a function is commonly written as f(x, y)=x^2 + y^2 and referred to as "a function of two variables". Likewise one can have a function of three or more variables, with notations such as f(w,x, y) , f(w,x, y, z) . 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 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. For example, in the above example, f can be defined by the formula f(n) = n+1 , for n\in\{1,2,3\} . 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 zeros of auxiliary functions. Similarly, if square roots occur in the definition of a function from \mathbb{R} to \mathbb{R}, 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, f(x)=\sqrt{1+x^2} defines a function f: \mathbb{R} \to \mathbb{R} whose domain is \mathbb{R}, because 1+x^2 is always positive if is a real number. On the other hand, f(x)=\sqrt{1-x^2} defines a function from the reals to the reals whose domain is reduced to the interval . (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 f(x) = ax^2+bx+c, where are 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, f(x) = x^3-3x-1 and f(x) = (x-1)(x^3+1) +2x^2 -1 are polynomial functions of x . A rational function is the same, with divisions also allowed, such as f(x) = \frac{x-1}{x+1}, and f(x) = \frac 1{x+1}+\frac 3x-\frac 2{x-1}. An algebraic function is the same, with th roots and roots of polynomials also allowed. An elementary function is the same, with logarithms and exponential functions allowed. For example, the equation of the unit circle x^2+y^2=1 defines a relation on real numbers. If there are two possible values of , one positive and one negative. For , these two values become both equal to 0. Otherwise, there is no possible value of . This means that the equation defines two implicit functions with domain and respective codomains and . In this example, the equation can be solved in , giving y=\pm \sqrt{1-x^2}, but, in more complicated examples, this is impossible. For example, the relation y^5+y+x=0 defines as an implicit function of , called the Bring radical, which has \mathbb R as domain and range. The Bring radical cannot be expressed in terms of the four arithmetic operations and th roots. The implicit function theorem provides mild differentiability conditions for existence and uniqueness of an implicit function in the neighborhood of a point. Power series can be used to define functions on the domain in which they converge. For example, the exponential function is given by e^x = \sum_{n=0}^{\infty} {x^n \over n!} . 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 numbers, 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 and the trigonometric functions of a complex number. n!=n(n-1)!\quad\text{for}\quad n>0, and the initial condition 0!=1. G=\{(x,f(x))\mid x\in X\}. In the frequent case where and 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 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 x\mapsto x^2, consisting of all points with coordinates (x, x^2) for x\in \R, yields, when depicted in Cartesian coordinates, the well known parabola. If the same quadratic function x\mapsto 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. 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 f:\{1,\ldots,5\}^2 \to \mathbb{R} defined as f(x,y)=xy can be represented by the familiar multiplication table 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: Before the advent of handheld calculators and personal computers, such tables were often compiled and published for functions such as logarithms and trigonometric functions. Given a function f: X\to Y, the canonical surjection of onto its image f(X)=\{f(x)\mid x\in X\} is the function from to that maps to . For every subset of a set , the inclusion map of into is the injective (see below) function that maps every element of to itself. The identity function on a set , often denoted by , is the inclusion of into itself. (g \circ f)(x) = g(f(x)). That is, the value of g \circ f is obtained by first applying to to obtain and then applying to the result to obtain . In this notation, the function that is applied first is always written on the right. The composition g\circ 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, and may deliver different values for the same argument. For example, let and , 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 (h\circ g)\circ f and h\circ (g\circ f) is defined, then the other is also defined, and they are equal, that is, (h\circ g)\circ f = h\circ (g\circ f). Therefore, it is usual to just write h\circ g\circ f. The identity functions \operatorname{id}_X and \operatorname{id}_Y are respectively a right identity and a left identity for functions from to . That is, if is a function with domain , and codomain , one has f\circ \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 composition File:Compfun.svg|Another composition. In this example, . f(A)=\{f(x)\mid x\in A\}. The image of is the image of the whole domain, that is, . It is also called the range of , although the term range may also refer to the codomain. On the other hand, the inverse image or preimage under of an element of the codomain is the set of all elements of the domain whose images under equal . In symbols, the preimage of is denoted by f^{-1}(y) and is given by the equation f^{-1}(y) = \{x \in X \mid f(x) = y\}. Likewise, the preimage of a subset of the codomain is the set of the preimages of the elements of , that is, it is the subset of the domain consisting of all elements of whose images belong to . It is denoted by f^{-1}(B) and is given by the equation 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 of the domain is always a single element of the codomain. However, the preimage f^{-1}(y) of an element of the codomain may be empty or contain any number of elements. For example, if is the function from the integers to themselves that maps every integer to 0, then f^{-1}(0) = \mathbb{Z} . If f : X\to Y is a function, and are subsets of , and and are subsets of , then one has the following properties: A\subseteq B \Longrightarrow f(A)\subseteq f(B) C\subseteq 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) The preimage by of an element of the codomain is sometimes called, in some contexts, the fiber of under . If a function 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 of . 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. The function is injective (or one-to-one, or is an injection) if for every two different elements and of . Equivalently, is injective if and only if, for every y\in Y, the preimage f^{-1}(y) contains at most one element. An empty function is always injective. If is not the empty set, then is injective if and only if there exists a function g: Y\to X such that g\circ f=\operatorname{id}_X, that is, if has a left inverse. Proof: If is injective, for defining , one chooses an element x_0 in (which exists as is supposed to be nonempty), and one defines by g(y)=x if y=f(x) and g(y)=x_0 if y\not\in f(X). Conversely, if g\circ f=\operatorname{id}_X, and y=f(x), then x=g(y), and thus f^{-1}(y)=\{x\}. The function is surjective (or onto, or is a surjection) if its range f(X) equals its codomain Y , that is, if, for each element y of the codomain, there exists some element x of the domain such that f(x) = y (in other words, the preimage f^{-1}(y) of every y\in Y is nonempty). If, as usual in modern mathematics, the axiom of choice is assumed, then is surjective if and only if there exists a function g: Y\to X such that f\circ g=\operatorname{id}_Y, that is, if has a right inverse. The axiom of choice is needed, because, if is surjective, one defines by g(y)=x, where x is an arbitrarily chosen element of f^{-1}(y). The function is bijective (or is a bijection or a one-to-one correspondence) if it is both injective and surjective. That is, is bijective if, for every y\in Y, the preimage f^{-1}(y) contains exactly one element. The function is bijective if and only if it admits an inverse function, that is, a function g : Y\to X such that g\circ f=\operatorname{id}_X and f\circ g=\operatorname{id}_Y. (Contrarily to the case of surjections, this does not require the axiom of choice; the proof is straightforward). Every function f: X\to Y may be factorized as the composition i\circ s of a surjection followed by an injection, where is the canonical surjection of onto and is the canonical injection of into . This is the canonical factorization of . "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 " maps onto " differs from " maps into ", in that the former implies that is surjective, while the latter makes no assertion about the nature of . In a complicated reasoning, the one letter difference can easily be missed. Due to the confusing nature of this older terminology, these terms have declined in popularity relative to the Bourbakian terms, which have also the advantage of being more symmetrical. === Restriction and extension === If f : X \to Y is a function and is a subset of , then the restriction of f to S, denoted f|_S , is the function from to defined by f|_S(x) = f(x) for all in . Restrictions can be used to define partial inverse functions: if there is a subset of the domain of a function f such that f|_S is injective, then the canonical surjection of f|_S onto its image f|_S(S) = f(S) is a bijection, and thus has an inverse function from f(S) to . One application is the definition of inverse trigonometric functions. For example, the cosine function is injective when restricted to the interval . The image of this restriction is the interval , and thus the restriction has an inverse function from to , which is called arccosine and is denoted . Function restriction may also be used for "gluing" functions together. Let X=\bigcup_{i\in I}U_i be the decomposition of as a union of subsets, and suppose that a function f_i : U_i \to Y is defined on each U_i such that for each pair i, j of indices, the restrictions of f_i and f_j to U_i \cap U_j are equal. Then this defines a unique function f : X \to Y such that f|_{U_i} = f_i for all . This is the way that functions on manifolds are defined. An extension of a function is a function such that is a restriction of . A typical use of this concept is the process of analytic continuation, that allows extending functions whose domain is a small part of the complex plane to functions whose domain is almost the whole complex plane. Here is another classical example of a function extension that is encountered when studying homographies of the real line. A homography is a function h(x)=\frac{ax+b}{cx+d} such that . 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 including , one may extend to a bijection from the extended real line to itself by setting h(\infty)=a/c and h(-d/c)=\infty . \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}. The domains of the resulting functions are the intersection of the domains of and . 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 from the intersection of the domains of and . 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 x\mapsto \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 has the original function as a derivative. For example, the function x\mapsto\frac 1x is continuous, and even differentiable, on the positive real numbers. Thus one antiderivative, which takes the value zero for , is a differentiable function called the natural logarithm. A real function is monotonic in an interval if the sign of \frac{f(x)-f(y)}{x-y} does not depend of the choice of and 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 is monotonic in an interval , it has an inverse function, which is a real function with domain and image . 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, \quad\frac{\partial \sin x}{\partial x}(0)=1, \quad\frac{\partial \cos x}{\partial x}(0)=0. 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 to a root of x^3-3x-y =0 (see the figure on the right). For one may choose either 0, \sqrt 3,\text{ or } -\sqrt 3 for . By the implicit function theorem, each choice defines a function; for the first one, the (maximal) domain is the interval and the image is ; for the second one, the domain is and the image is ; for the last one, the domain is and the image is . 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 that has three values for , and only one value for and . 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 for the square root of −1; while, when extending through complex numbers with negative imaginary parts, one gets . 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. REFERENCES ---------- BIBLIOGRAPHY (BibTeX) -------------------- @article{ref0, title = {Function (mathematics)}, url = {https://encyclopegia.org/a/function-mathematics} } BIBLIOGRAPHY (RIS) ------------------- TY - JOUR TI - Function (mathematics) UR - https://encyclopegia.org/a/function-mathematics ER - CITE THIS ARTICLE ---------------- Cite this article: Function (mathematics) Derived from: https://en.wikipedia.org/w/index.php?oldid=1374579623 Licence: CC BY-SA 4.0 Snapshot: enwiki-001374579623 Permalink: /a/function-mathematics