The document defines key concepts related to functions including:
- A function maps elements of one set (the domain) to elements of another set (the range).
- Composite functions can be formed by applying multiple functions sequentially.
- A function is one-to-one if each element in the range has at most one element in the domain mapping to it. A function is onto if each element in the range has at least one element in the domain mapping to it.
- Permutations are bijective (one-to-one and onto) functions from a set to itself. Permutations can be represented as products of cycles or transpositions.