You’ve certainly seen many functions before. For example, you’ve worked with linear functions, such as quadratic functions, such as and more complicated functions such as You’ve seen functions of more than one variable in the form of linear transformations, such as
Not surprisingly, in multivariable calculus, we’ll be studying functions of more than one variable. Before starting to work with these functions, we now cover some of the fundamental definitions and properties related to functions in general, beginning with the definition of a function.
Definition of a function
Although we’ll often think of a function as some rule, such as . However, a function really consists of three pieces: a domain, a codomain, and some sort of assignment. This assignment could be given by a simple rule, like , or could be much more difficult to describe.
We call the domain of , and the codomain of .
You might have seen some sort of “blob” diagram like the one below, showing that each element of gets mapped to some element of .
We can think of as the set of inputs to a function, and as the set containing the outputs. Each input coming from the set has to have some corresponding output, but some elements of might not actually occur as outputs of the function.
If we would like to refer to the elements in the codomain which actually do occur as outputs, we call this the range of .
We can visualize the range as a smaller set contained within the codomain.
We can define a function by . In this case, the range of is the set , and it’s somewhat difficult to find a simpler way to describe the range. However, we can see that the range of is not all of , since is not in the range of . We can see this by writing , and trying to solve for and . Here, implies that we must have or . If , the first and second components give us and , a contradiction. If , the first and second components give us and , also a contradiction. Thus, is not in the range of .
Sometimes we work with functions that aren’t defined on all of . When the domain of is a subset of , we write When we’re working with functions on subsets of , we’ll frequently want to work with the largest possible set that the function is defined on. We call this the natural domain of the function.
Often, we’ll define a function just by giving a “rule” determining its assignment, and in this case, you should assume that the domain is the natural domain.
Types of functions
In some special situations, every element of really does appear as an output of the function . In this case, we say that is onto, or surjective.
We can visualize this as every element of getting mapped to by some element of , and possibly more than one element.
Consider the function defined by . We previously showed that , so is not onto.
Another important type of function is a one-to-one, or injective, function. For a one-to-one function, different inputs always go to different outputs.
Another way to say this is that whenever , we have .
We can visualize this as no two elements of getting mapped to the same element of .
Consider the function defined by . We’ll show that is one-to-one, by showing that if two inputs map to the same output, they must have been the same input. That is, suppose we have . Then In order to show that and , we actually only need to look at the first two components, which give us the system of equations Adding these two equations together, we obtain , which implies . Substituting this into the first equation, we then also get that . So, we have shown that is one-to-one.
Component functions
When we’re trying to understand the behavior of a function , it can sometimes be helpful to split into its components. From this, we get the component functions of .