6.5 Images and preimages
If we restrict the codomain of our function to only contain its outputs, we obtain the image of the function.
Definition 6.35 (Image of a function).
Given a function , the set is called the image of .
Exercise 6.36.
-
1.
What is the image of the function defined by ?
-
2.
What is the image of the function defined by ?
Solution (please try for yourself before looking)
-
1.
Since and for all , we have for all such . In particular, for every ,
and implies that so the square root is defined. Hence, the image of is the set .
-
2.
The function is the the function but with a domain that is a strict subset of the domain of . This means the image of should be a subset of the image of . Indeed, if we take any , we know from the previous part that
but now we need to ensure that . We know that by definition of the square root, so the only possible issue is if and this only occurs when . Hence, we need to remove from the image of to give us for the image of .
We can also talk about the image of a subset of our domain.
Definition 6.37 (Image of a subset).
Given a function and a subset , the set
is called the image of under .
The image of a subset of the domain is the set of outputs that our function maps elements of to. If we instead consider all the inputs that our function maps into a particular subset of the codomain, we obtain the preimage of that subset .
Definition 6.38 (Preimage).
Given a function , the preimage of under is the subset
Note that the preimage is defined for all functions and all subsets of a function’s codomain. It has nothing to do with the inverse of a function (we haven’t even defined the inverse yet!).
Proposition 6.39.
Let be a function with and . Then
-
(a)
and
-
(b)
.
Proof.
-
(a)
If we take , then . Thus, is an element of the domain that maps to an element in . Hence, and so, .
-
(b)
If we take , then there exists some such that . But since , we must have . Hence, .
Theorem 6.40.
Let be a function and . Then
-
(a)
and
-
(b)
.
Proof.
To show the first equality in part (a), note that if and only if . Therefore, and , which is true if and only if and , that is, if and only if . Thus, .
The second equation in part (b) has a similar proof to (a) (just change “and” to “or”).