Section Functions and Sets
We conclude this section with a connection between subsets and functions. A bit of notation first. If is a function from a set to a set and if is a subset of and is a subset of we define and as
and
We call the image of the set under and is the preimage of the set under Note that is defined for any function, not just invertible functions. So it is important to recognize that the use of the notation does not imply that is invertible.
When we work with continuous functions in later sections, we will need to understand how a function behaves with respect to subsets. One result is in the following lemma.
Proof.
Let be a function and let be a collection of subsets of for in some indexing set To prove part 1, we demonstrate the containment in both directions.
For part 2, we again demonstrate the containments in both directions. Let Then So there exists such that This implies that We conclude that
For the reverse containment, let Then for some Thus, So Thus, The two containments verify part 2.
At this point it is reasonable to ask if Lemma 2.11 would still hold if we replace unions with intersections. We leave that question for Exercise 7.
Another result is contained in the next activity.
Activity 2.8.
Let and be sets, and let and be functions. Let be a subset of There is a relationship between and Find and prove this relationship.