Example 1
Question: Let \ f: \mathbb{N} \to \mathbb{N} \ be defined by \( f(x) = x \) for all \( x \in \mathbb{N} \). Show that \( f \) is onto, but the function \( g: \mathbb{N} \to \mathbb{N} \) defined by \( g(x) = 3f(x) = 3x \) is NOT onto.
Solution: Step 1: Show that f is onto. For every \( y \in \mathbb{N} \), we need to find \( x \in \mathbb{N} \) such that \( f(x) = y \). Since \( f(x) = x \), choosing \( x = y \) gives \( f(y) = y \). Since \( y \in \mathbb{N} \) implies \( x = y \in \mathbb{N} \), every element of \( \mathbb{N} \) has a pre-image. Hence \( f \) is onto. Step 2: Show that g is NOT onto. The function is \( g(x) = 3x \). The range of \( g \) is the set of all multiples of 3 in \( \mathbb{N} \), i.e., \( \{3, 6, 9, 12, \ldots\} \). Consider \( y = 2 \in \mathbb{N} \). For \( g(x) = 2 \), we would need: \[ 3x = 2 \] which gives \( x = \dfrac{2}{3} \), and \( \dfrac{2}{3} \notin \mathbb{N} \). Since there is no \( x \in \mathbb{N} \) with \( g(x) = 2 \), the element \( 2 \in \mathbb{N} \) has no pre-image under \( g \). Therefore \( g \) is not onto. Conclusion: Although \( f: \mathbb{N} \to \mathbb{N} \) defined by \( f(x) = x \) is onto, the function \( g: \mathbb{N} \to \mathbb{N} \) defined by \( g(x) = 3x \) is not onto, because elements of \( \mathbb{N} \) that are not multiples of 3 (such as 1, 2, 4, 5, ...) have no pre-image in \( \mathbb{N} \) under \( g \).
Answer: f(x) = x is onto; g(x) = 3x is not onto since, for example, y = 2 has no pre-image in N under g.
Example 2
Question: Let \( h: \mathbb{N} \to \mathbb{N} \) be the identity function \( h(x) = x \) for all \( x \in \mathbb{N} \). Define a new function \( p: \mathbb{N} \to \mathbb{N} \) by \( p(x) = h(x) + h(x) + h(x) = 3h(x) \). Show that although \( h \) is onto, \( p \) is not onto. Also, separately define \( q: \mathbb{N} \to \mathbb{N} \) by \( q(x) = 2h(x) + h(x) = 3x \) and verify the same conclusion for \( q \).
Solution: Part A: Show h is onto. For any \( y \in \mathbb{N} \), taking \( x = y \in \mathbb{N} \) gives \( h(x) = x = y \). So every element of \( \mathbb{N} \) has a pre-image under \( h \), and \( h \) is onto. Part B: Show p is not onto, where \( p(x) = 3h(x) = 3x \). The range of \( p \) is: \[ \text{Range}(p) = \{p(x) : x \in \mathbb{N}\} = \{3, 6, 9, 12, \ldots\} \] This set contains only multiples of 3. Consider any natural number that is not a multiple of 3, for instance \( y = 4 \). For \( p(x) = 4 \): \[ 3x = 4 \implies x = \frac{4}{3} \] Since \( \dfrac{4}{3} \notin \mathbb{N} \), the element \( 4 \in \mathbb{N} \) has no pre-image under \( p \). Hence \( p \) is NOT onto. Part C: Show q is not onto, where \( q(x) = 2h(x) + h(x) = 3x \). Since \( q(x) = 3x \) is the same function as \( p(x) \), the same reasoning applies. The range of \( q \) consists only of multiples of 3. For example, \( y = 5 \in \mathbb{N} \) would require: \[ 3x = 5 \implies x = \frac{5}{3} \notin \mathbb{N} \] So \( 5 \in \mathbb{N} \) has no pre-image under \( q \), confirming that \( q \) is NOT onto. Conclusion: The identity function \( h: \mathbb{N} \to \mathbb{N} \) is onto, but forming \( p(x) = 3h(x) \) or equivalently \( q(x) = 2h(x) + h(x) \) gives functions that are not onto, since their ranges are proper subsets of \( \mathbb{N} \) (containing only multiples of 3).
Answer: h(x) = x is onto; p(x) = q(x) = 3x is not onto since natural numbers that are not multiples of 3 (e.g. 4, 5) have no pre-image in N.