Composition of Functions
Definition and Properties
Similarly to relations, we can compose two or more functions to create a new function. This operation is called the composition of functions.
Let g : A → B and f : B → C be two functions such that the range of g equals the domain of f. The composition of the functions f and g, denoted by f∘g, is another function defined as
Since functions are a special case of relations, they inherit all properties of composition of relations and have some additional properties. We list here some of them:
- The composition of functions is associative. If
and then - The composition of functions is not commutative. If
and then, as a rule, - Let
and be injective functions. Then the composition of the functions is also injective. - Let
and be surjective functions. Then the composition of the functions is also surjective. - It follows from the last two properties that if two functions
and are bijective, then their composition is also bijective.
Examples
Example 1. Composition of Functions Defined on Finite Sets
Consider the sets
It is convenient to illustrate the mapping between the sets in an arrow diagram:
Given the mapping, we see that
Hence, the composition of functions
This is represented in the following diagram:
Example 2. Composition of Functions Defined on Infinite Sets
Let
Determine the composite functions
The first composite function
Similarly we find the other composite functions:
Compositions Involving Inverse Functions
Let
where
Similarly,
where