Composite Functions

In mathematics, function composition is an operation that takes two functions f and g and produces a function h such that h(x) = g(f(x)). In this operation, the function g is applied to the result of applying the function f to x. That is, the functions f : X → Y and g : Y → Z are composed to yield a function that maps x in X to g(f(x)) in Z.

Intuitively, if z is a function of y, and y is a function of x, then z is a function of x. The resulting composite function is denoted g ∘ f : X → Z, defined by (g ∘ f )(x) = g(f(x)) for all x in X. The notation g ∘ f is read as "g circle f ", "g round f ", "g about f ", "g composed with f ", "g after f ", "g following f ", "g of f", "f then g", or "g on f ", or "the composition of g and f ". Intuitively, composing functions is a chaining process in which the output of function f feeds the input of function g.

The composition of functions is a special case of the composition of relations, sometimes also denoted by $\circ$. As a result, all properties of composition of relations are true of composition of functions, though the composition of functions has some additional properties.

Composition of functions is different from multiplication of functions, and has quite different properties; in particular, composition of functions is not commutative.

Examples

Concrete example for the composition of two functions.

• Composition of functions on a finite set: If f = {(1, 1), (2, 3), (3, 1), (4, 2)}, and g = {(1, 2), (2, 3), (3, 1), (4, 2)}, then g ∘ f = {(1, 2), (2, 1), (3, 2), (4, 3)}, as shown in the figure.
• Composition of functions on an infinite set: If f: ℝ → ℝ (where ℝ is the set of all real numbers) is given by f(x) = 2x + 4 and g: ℝ → ℝ is given by g(x) = x³, then:

(f ∘ g)(x) = f(g(x)) = f(x³) = 2x³ + 4, and

(g ∘ f)(x) = g(f(x)) = g(2x + 4) = (2x + 4)³.

• If an airplane's altitude at time t is a(t), and the air pressure at altitude x is p(x), then (p ∘ a)(t) is the pressure around the plane at time t.

Properties

The composition of functions is always associative—a property inherited from the composition of relations. That is, if f, g, and h are composable, then f ∘ (g ∘ h) = (f ∘ g) ∘ h. Since the parentheses do not change the result, they are generally omitted.

In a strict sense, the composition g ∘ f is only meaningful if the codomain of f equals the domain of g; in a wider sense, it is sufficient that the former be a subset of the latter. Moreover, it is often convenient to tacitly restrict the domain of f, such that f produces only values in the domain of g. For example, the composition g ∘ f of the functions f : ℝ → (−∞,+9] defined by f(x) = 9 − x² and g : [0,+∞) → ℝ defined by $g(x)={\sqrt {x}}$ can be defined on the interval [−3,+3].

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

The functions g and f are said to commute with each other if g ∘ f = f ∘ g. 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. The picture shows another example.

The composition of one-to-one (injective) functions is always one-to-one. Similarly, the composition of onto (surjective) functions is always onto. It follows that the composition of two bijections is also a bijection. The inverse function of a composition (assumed invertible) has the property that (f ∘ g)⁻¹ = g⁻¹∘ f⁻¹.

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.

Composition monoids

Suppose one has two (or more) functions f: X → X, g: X → X having the same domain and codomain; these are often called transformations. Then one can form chains of transformations composed together, such as f ∘ f ∘ g ∘ f. Such chains have the algebraic structure of a monoid, called a transformation monoid or (much more seldom) a composition monoid. In general, transformation 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 or symmetric semigroup on X. (One can actually define two semigroups depending how one defines the semigroup operation as the left or right composition of functions.)

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 ∘ R )(A) = B.

If the transformations are bijective (and thus invertible), 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. A fundamental result in group theory, Cayley's theorem, essentially says that any group is in fact just a subgroup of a permutation group (up to isomorphism).

The set of all bijective functions f: X → X (called permutations) forms a group with respect to function composition. This is the symmetric group, also sometimes called the composition group.

In the symmetric semigroup (of all transformations) one also finds a weaker, non-unique notion of inverse (called a pseudoinverse) because the symmetric semigroup is a regular semigroup.

Functional powers

If Y ⊆ X, then f: X→Y may compose with itself; this is sometimes denoted as f ². That is:

(f ∘ f)(x) = f(f(x)) = f ²(x)

(f ∘ f ∘ f)(x) = f(f(f(x))) = f ³(x)

(f ∘ f ∘ f ∘ f)(x) = f(f(f(f(x)))) = f ⁴(x)

More generally, for any natural number n ≥ 2, the nth functional power can be defined inductively by f ⁿ = f ∘ f ⁿ⁻¹ = f ⁿ⁻¹ ∘ f, a notation introduced by Hans Heinrich Bürmann and John Frederick William Herschel. Repeated composition of such a function with itself is called iterated function.

• By convention, f ⁰ is defined as the identity map on f 's domain, id_X.
• If even Y = X and f: X → X admits an inverse function f ⁻¹, negative functional powers f ⁻ⁿ are defined for n > 0 as the negated power of the inverse function: f ⁻ⁿ = (f ⁻¹)ⁿ.

Alternative notations

Many mathematicians, particularly in group theory, 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 function composition is not necessarily commutative (e.g. matrix multiplication). 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 apply f and then apply 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 ⨾ 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.

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.

Multivariate functions

Partial 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 in some computer engineering contexts, and is denoted f |_{xi = g}

$f|_{x_{i}=g}=f(x_{1},\ldots ,x_{i-1},g(x_{1},x_{2},\ldots ,x_{n}),x_{i+1},\ldots ,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.

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

In general, the composition of multivariate functions may involve several other functions as arguments, as in the definition of primitive recursive function. Given f, a n-ary function, and n m-ary functions g₁, ..., g_n, the composition of f with g₁, ..., g_n, is the m-ary function

$h(x_{1},\ldots ,x_{m})=f(g_{1}(x_{1},\ldots ,x_{m}),\ldots ,g_{n}(x_{1},\ldots ,x_{m}))$.

This is sometimes called the generalized composite or superposition of f with g₁, ..., g_n. The partial composition in only one argument mentioned previously can be instantiated from this more general scheme by setting all argument functions except one to be suitably chosen projection functions. Here g₁, ..., g_n can be seen as a single vector/tuple-valued function in this generalized scheme, in which case this is precisely the standard definition of function composition.

A set of finitary operations on some base set X is called a clone if it contains all projections and is closed under generalized composition. Note that a clone generally contains operations of various arities. The notion of commutation also finds an interesting generalization in the multivariate case; a function f of arity n is said to commute with a function g of arity m if f is a homomorphism preserving g, and vice versa i.e.:

$f(g(a_{11},\ldots ,a_{1m}),\ldots ,g(a_{n1},\ldots ,a_{nm}))=g(f(a_{11},\ldots ,a_{n1}),\ldots ,f(a_{1m},\ldots ,a_{nm}))$.

A unary operation always commutes with itself, but this is not necessarily the case for a binary (or higher arity) operation. A binary (or higher arity) operation that commutes with itself is called medial or entropic.

Generalizations

Composition can be generalized to arbitrary binary relations. If R ⊆ X × Y and S ⊆ Y × Z are two binary relations, then their composition R∘S is the relation defined as {{math|{(x, z) ∈ X × Z : ∃y ∈ Y. (x, y) ∈ R ∧ (y, z) ∈ S} Considering a function as a special case of a binary relation (namely functional relations), function composition satisfies the definition for relation composition. A small circle R∘S has been used for the infix notation of composition of relations, as well as functions. When used to represent composition of functions $(g\circ f)(x)\ =\ g(f(x))$ however, the text sequence is reversed to illustrate the different operation sequences accordingly.

The composition is defined in the same way for partial functions and Cayley's theorem has its analogue called the Wagner–Preston theorem.

The category of sets with functions as morphisms is the prototypical category. The axioms of a category are in fact inspired from the properties (and also the definition) of function composition. The structures given by composition are axiomatized and generalized in category theory with the concept of morphism as the category-theoretical replacement of functions. The reversed order of composition in the formula (f ∘ g)⁻¹ = (g⁻¹ ∘ f ⁻¹) applies for composition of relations using converse relations, and thus in group theory. These structures form dagger categories.

Resources

• Composite Functions, The Organic Chemistry Tutor
• Intro to Composing Functions, Khan Academy

References

1. "Comprehensive List of Algebra Symbols". Math Vault. 2020-03-25. Retrieved 2020-08-28.
2. Velleman, Daniel J. (2006). How to Prove It: A Structured Approach. Cambridge University Press. p. 232. ISBN 978-1-139-45097-3.
3. "3.4: Composition of Functions". Mathematics LibreTexts. 2020-01-16. Retrieved 2020-08-28.
4. Weisstein, Eric W. "Composition". mathworld.wolfram.com. Retrieved 2020-08-28.
5. Rodgers, Nancy (2000). Learning to Reason: An Introduction to Logic, Sets, and Relations. John Wiley & Sons. pp. 359–362. ISBN 978-0-471-37122-9.
6. Hollings, Christopher (2014). Mathematics across the Iron Curtain: A History of the Algebraic Theory of Semigroups. American Mathematical Society. p. 334. ISBN 978-1-4704-1493-1.
7. Grillet, Pierre A. (1995). Semigroups: An Introduction to the Structure Theory. CRC Press. p. 2. ISBN 978-0-8247-9662-4.
8. Dömösi, Pál; Nehaniv, Chrystopher L. (2005). Algebraic Theory of Automata Networks: An introduction. SIAM. p. 8. ISBN 978-0-89871-569-9.
9. Carter, Nathan (2009-04-09). Visual Group Theory. MAA. p. 95. ISBN 978-0-88385-757-1.
10. Ganyushkin, Olexandr; Mazorchuk, Volodymyr (2008). Classical Finite Transformation Semigroups: An Introduction. Springer Science & Business Media. p. 24. ISBN 978-1-84800-281-4.
11. Ivanov, Oleg A. (2009-01-01). Making Mathematics Come to Life: A Guide for Teachers and Students. American Mathematical Society. pp. 217–. ISBN 978-0-8218-4808-1.
12. Gallier, Jean (2011). Discrete Mathematics. Springer. p. 118. ISBN 978-1-4419-8047-2.
13. Barr, Michael; Wells, Charles (1998). Category Theory for Computing Science (PDF). p. 6. Archived from the original (PDF) on 2016-03-04. Retrieved 2014-08-23. (NB. This is the updated and free version of book originally published by Prentice Hall in 1990 as ISBN 978-0-13-120486-7.)
14. ISO/IEC 13568:2002(E), p. 23
15. Bryant, R. E. (August 1986). "Logic Minimization Algorithms for VLSI Synthesis" (PDF). IEEE Transactions on Computers. C-35 (8): 677–691. doi:10.1109/tc.1986.1676819. S2CID 10385726.
16. Bergman, Clifford (2011). Universal Algebra: Fundamentals and Selected Topics. CRC Press. pp. 79–80, 90–91. ISBN 978-1-4398-5129-6.
17. Tourlakis, George (2012). Theory of Computation. John Wiley & Sons. p. 100. ISBN 978-1-118-31533-0.
18. Lipscomb, S. (1997). Symmetric Inverse Semigroups. AMS Mathematical Surveys and Monographs. p. xv. ISBN 0-8218-0627-0.
19. Hilton, Peter; Wu, Yel-Chiang (1989). A Course in Modern Algebra. John Wiley & Sons. p. 65. ISBN 978-0-471-50405-4.