Learn and talk about Function composition, Basic concepts in set theory, Binary operations, Functions and mappings

For function composition in computer science, see function composition (computer science).

g \circ f

, the composition of

f

and

g

. For example,

(g \circ f)(c) = #

Compositions of two real-valued functions, absolute value and a cubic function, in different orders shows a non-commutativity of the composition

In mathematics, function composition is the application of one function to the results of another. For instance, the functions $f : X \to Y$ and $g : Y \to Z$ can be composed by computing the output of $g$ when it has an argument of $f (x)$ instead of $x$ . Intuitively, if $z$ is a function $g$ of $y$ and $y$ is a function $f$ of $x$ , then $z$ is a function of $x$ .

Thus one obtains a composite function $g \circ f$ : $X \to Z$ defined by $(g \circ f)(x) = g (f (x))$ for all $x$ in $X$ . The notation $g \circ f$ is read as " $g$ circle $f$ ", or " $g$ round $f$ ", or " $g$ composed with $f$ ", " $g$ after $f$ ", " $g$ following $f$ ", or just " $g$ of $f$ ".

The composition of functions is always associative. That is, if $f$ , $g$ , and $h$ are three functions with suitably chosen domains and codomains, then $f \circ (g \circ h) = (f \circ g) \circ h$ , where the parentheses serve to indicate that composition is to be performed first for the parenthesized functions. Since there is no distinction between the choices of placement of parentheses, they may be safely left off.

The functions $g$ and $f$ are said to commute with each other if $g \circ f = f \circ g$ . In general, composition of functions will not be commutative. Commutativity is a special property, attained only by particular functions, and often in special circumstances. For example, $\left| x \right| + 3 = \left| x + 3 \right|\,$ only when $x \ge 0$ .

Derivatives of compositions involving differentiable functions can be found using the chain rule. Higher derivatives of such functions are given by Faà di Bruno's formula.

1 Example
2 Functional powers
3 Composition monoids
4 Alternative notations
5 Composition operator
6 Generalizations
7 See also
8 References
9 External links

Example [edit]

The similarity that transforms triangle EFA into triangle ATB is the composition of a homothety

H

and a rotation

R

, of which the common centre is S. For example, the image of A under the rotation

R

is U, which may be written

R

(A) = U. And

H

(U) = B means that the mapping

H

transforms U into B. Thus

H (R

(A)) =

(H \circ R)

(A) = B.

As an example, suppose that an airplane's elevation at time $t$ is given by the function $h (t)$ and that the oxygen concentration at elevation $x$ is given by the function $c (x)$ . Then $(c \circ h)(t)$ describes the oxygen concentration around the plane at time $t$ .

Functional powers [edit]

Main article: Iterated function

If $Y \subseteq X$ then $f\colon X\rightarrow Y$ may compose with itself; this is sometimes denoted as f ². Thus:

$(f\circ f)(x) = f(f(x)) = f^2(x)$

$(f\circ f\circ f)(x) = f(f(f(x))) = f^3(x)$

Repeated composition of a function with itself is called iterated function.

The functional powers $f\circ f^n=f^n\circ f=f^{n+1}$ for natural n follow immediately.

By convention, $f^0= id_{D(f)}\,$ $\big($ the identity map on the domain of f ).
If $f\colon X\rightarrow X$ admits an inverse function, negative functional powers $f^{-k}\,$ $(k>0\,)$ are defined as the opposite power of the inverse function, $(f^{-1})^k\,$ .

Note: If $f$ takes its values in a ring (in particular for real or complex-valued $f$ ), there is a risk of confusion, as $f n$ could also stand for the $n$ -fold product of $f$ , e.g. $f 2 (x) = f (x) \cdot f (x)$ .

(For trigonometric functions, usually the latter is meant, at least for positive exponents. For example, in trigonometry, this superscript notation represents standard exponentiation when used with trigonometric functions: $sin 2 (x) = sin(x) \cdot sin(x)$ . However, for negative exponents (especially −1), it nevertheless usually refers to the inverse function, e.g., $tan -1 = arctan (\neq 1/tan)$ .

In some cases, an expression for $f$ in $g (x) = f r (x)$ can be derived from the rule for $g$ given non-integer values of $r$ . This is called fractional iteration. For instance, a half iterate of a function $f$ is a function $g$ satisfying $g (g (x)) = f (x).$ Another example would be that where $f$ is the successor function, $f r (x) = x + r$ . This idea can be generalized so that the iteration count becomes a continuous parameter; in this case, such a system is called a flow, specified through solutions of Schröder's equation.

Iterated functions and flows occur naturally in the study of fractals and dynamical systems.

Composition monoids [edit]

Main article: Transformation monoid

Suppose one has two (or more) functions $f : X \to X,$ $g : X \to X$ having the same domain and codomain. Then one can form long, potentially complicated chains of these functions composed together, such as $f \circ f \circ g \circ f$ . Such long chains have the algebraic structure of a monoid, called transformation monoid or composition monoid. In general, composition monoids can have remarkably complicated structure. One particular notable example is the de Rham curve. The set of all functions $f : X \to X$ is called the full transformation semigroup on $X$ .

If the functions are bijective, then the set of all possible combinations of these functions forms a transformation group; and one says that the group is generated by these functions.

The set of all bijective functions $f : X \to X$ form a group with respect to the composition operator. This is the symmetric group, also sometimes called the composition group.

Alternative notations [edit]

This section does not cite any references or sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (May 2013)

Many mathematicians omit the composition symbol, writing $gf$ for $g \circ f$ .

In the mid-20th century, some mathematicians decided that writing " $g \circ f$ " to mean "first apply $f$ , then apply $g$ " was too confusing and decided to change notations. They write " $xf$ " for " $f (x)$ " and " $(xf) g$ " for " $g (f (x))$ ". This can be more natural and seem simpler than writing functions on the left in some areas – in linear algebra, for instance, when $x$ is a row vector and $f$ and $g$ denote matrices and the composition is by matrix multiplication. This alternative notation is called postfix notation. The order is important because matrix multiplication is non-commutative. Successive transformations applying and composing to the right agrees with the left-to-right reading sequence.

Mathematicians who use postfix notation may write " $fg$ ", meaning first do $f$ then do $g$ , in keeping with the order the symbols occur in postfix notation, thus making the notation " $fg$ " ambiguous. Computer scientists may write "f;g" for this, thereby disambiguating the order of composition. To distinguish the left composition operator from a text semicolon, in the Z notation the U+2A1F ⨟ fat semicolon character is used for left relation composition. Since all functions are binary relations, it is correct to use the fat semicolon for function composition as well (see the article on Composition of relations for further details on this notation).

Composition operator [edit]

Main article: composition operator

Given a function $g$ , the composition operator $C g$ is defined as that operator which maps functions to functions as

$C_g f = f \circ g.$

Composition operators are studied in the field of operator theory.

Generalizations [edit]

The structures given by composition are axiomatized and generalized in category theory with the concept of morphism as the category-theoretical replacement of functions.

Composition of relations is a generalization to relations, which gives the formula for $g \circ f \subseteq X \times Z$ in terms of $f \subseteq X \times Y$ and $g \subseteq Y \times Z$ by applying the existential quantification. Considering functions as its special case (namely functional relations), composition of functions satisfies the definition for relations.

Composition is possible for multivariate functions. The function resulting when some argument $x i$ of the function $f$ is replaced by the function $g$ is called a composition of $f$ and $g$ , and is denoted $f | x i = g$ ,

$f|_{x_i = g} = f (x_1, \ldots, x_{i-1}, g(x_1, x_2, \ldots, x_n), x_{i+1}, x_n).$

When $g$ is a simple constant b, composition degenerates into a (partial) valuation, whose result is also known as restriction or co-factor^[1]

$f|_{x_i = b} = f (x_1, \ldots, x_{i-1}, b, x_{i+1}, x_n).$

References [edit]

^ Bryant, R.E. (August 1986). "Logic Minimization Algorithms for VLSI Synthesis". IEEE Transactions on Computers. C-35 issue=8: 677–691.

External links [edit]

Hazewinkel, Michiel, ed. (2001), "Composite function", Encyclopedia of Mathematics, Springer, ISBN 978-1-55608-010-4
"Composition of Functions" by Bruce Atwood, the Wolfram Demonstrations Project, 2007.

Original courtesy of Wikipedia: http://en.wikipedia.org/wiki/Function_composition — Please support Wikipedia.
A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia.

Function composition

Contents