Functions as relations
- Read carefully pages 216 through 219 (sections 9.1, 9.2)
- Some key questions to answer:
- A function from a set \(A\) to \(B\) is a special kind of relation from \(A\) to \(B\). What special property does it need to satisfy?
- What other name do we use for a function?
- How do we call the sets \(A\) and \(B\) in relation to a function \(f\colon A\to B\)?
- Explain why when we think of a function \(f\) as a relation, i.e. a subset of \(A\times B\), then the cardinality (number of elements) of that relation must equal the cardinality of \(A\).
- What do we define as the range of a function \(f\)? How does it differ from the codomain?
- Consider the empty relation. When can that relation be a function?
- Consider the full relation \(A\times B\). When can that relation be a function?
- When do we say that two functions are equal? Prove that this condition is equivalent to asking for the two functions to be equal as subsets of \(A\times B\).
- Think about the following sentence: “If we have a real function \(y=f(x)\) from Calculus, then its graph, a subset of \(\mathbb{R}\times\mathbb{R}\) is exactly what this function is thought of as a relation”.
- How many functions are there from the set \(A=\{1,2,3\}\) to the set \(B=\{x, y\}\)?
- In general, how many functions are there from a set with \(k\) elements to a set with \(n\) elements?
- Given a function \(f\colon A\to B\) and a subset \(C\) of \(A\), what do we denote as the image set \(f(C)\)?
- Given a function \(f\colon A\to B\) and a subset \(D\) of \(B\), what do we denote as the inverse image set \(f^{-1}(D)\)? Note that this is defined regardless of whether the function \(f\) has an “inverse” in the sense learned in Calculus.
- What is \(f(\emptyset)\)? What is \(f^{-1}(\emptyset)\)?
- True or False: \(x\in f^{-1}(D)\) if and only if \(f(x) \in D\).
- Food for thought: The set of all functions \(f\colon A\to\{0,1\}\) is in correspondence with the subsets of \(A\):
- Given such a function, we can associate it to the set \(B=f^{-1}(\{1\})\subseteq A\).
- Given a subset \(B\subseteq A\), we can build a function \(f\colon A\to\{0,1\}\) so that \(f(x) = 1\) if \(x\in B\) and \(f(x) = 0\) if \(x\not\in B\).
- This is often called the “incidence function” or “characteristic function” of the subset.
- Suppose \(f\colon A\to B\) is a function, thought of as a relation, i.e. subset of \(A\times B\). Suppose \(C\subseteq A\) is a subset of \(A\). Consider the relation \(f \cap \left(C\times B\right)\). Show that this defines a function from \(C\) to \(B\). This is known as the restriction of the domain of \(f\) to \(C\).
- Practice problems from section 9.1 (page 234): 9.1, 9.3, 9.5, 9.7, 9.8, 9.9, 9.11, 9.12
- Practice problems from section 9.2 (page 235): 9.15, 9.16