In mathematics, function composition is the pointwise application of one function to another to produce a third function. For instance, the functions f : X → Y and g : Y → Z can be composed to yield a function which maps x in X to g(f(x)) in Z. Intuitively, if z is a function g of y and y is a function f of x, then z is a function of x.
The resulting composite function, notated g ∘ f : X → Z --- interchangeable written, in many sources and within this article, as --- is defined by (g ∘ f )(x) = g(f(x)) for all x in X. The notation g ∘ f is read as "g circle f", or "g round f", or "g composed with f", "g after f", "g following f", or "g of f".
|x ↦ f(x)|
|By domain and codomain|
|Constant · Identity · Linear · Polynomial · Rational · Algebraic · Analytic · Smooth · Continuous · Measurable|
|Restriction · Composition · λ · Inverse|
|Partial · Multivalued · Implicit|
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 ∘ (g ∘ h) = (f ∘ g) ∘ 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 ∘ f = f ∘ 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, |x| + 3 = |x + 3| only when x ≥ 0.
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 ∘ h)(t) describes the oxygen concentration around the plane at time t.
Repeated composition of a function with itself is called iterated function.
- By convention, the identity map on the domain of f ).
- If admits an inverse function, negative functional powers are defined as the opposite power of the inverse function, .
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) · 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: sin2(x) = sin(x) · sin(x). However, for negative exponents (especially −1), it nevertheless usually refers to the inverse function, e.g., tan−1 = arctan (≠ 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.
Suppose one has two (or more) functions f: X → X, g: X → X having the same domain and codomain. Then one can form long, potentially complicated chains of these functions composed together, such as f ∘ f ∘ g ∘ 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 → X is called the full transformation semigroup on X.
|This section does not cite any references or sources. (May 2013)|
- Many mathematicians omit the composition symbol, writing gf for g ∘ f.
- In the mid-20th century, some mathematicians decided that writing "g ∘ 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).
Given a function g, the composition operator Cg is defined as that operator which maps functions to functions as
Composition operators are studied in the field of operator theory.
Composition of relations is a generalization to relations, which gives the formula for g ∘ f ⊆ X × Z in terms of f ⊆ X × Y and g ⊆ Y × 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 xi of the function f is replaced by the function g is called a composition of f and g, and is denoted f |xi = g
- Combinatory logic
- Function composition (computer science)
- Functional decomposition
- Flow (mathematics)
- Higher-order function
- Cobweb plot – a graphical technique for functional composition
- Lambda calculus
- Functional square root
- Fractional calculus
- Composition ring, a formal axiomatization of the composition operation
- Bryant, R.E. (August 1986). "Logic Minimization Algorithms for VLSI Synthesis". IEEE Transactions on Computers. C-35 issue=8: 677–691.