Show that a one-one function \( f :\{1, 2, 3\}\) \( →\{1, 2, 3\}\) must be onto.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine three children and three chairs, each with a unique name tag. If every child must sit in a different chair (no two children share a chair), all three chairs must be filled. There are exactly as many children as chairs. No chair can be left empty when everyone sits differently. That is the whole idea here: the set \( \\{1,2,3\\} \) plays both roles, and a one-one rule forces every element to get used.
Answer: Since \( f \) is one-one, its 3 images are distinct, and being 3 distinct elements of the 3-element codomain \( \{1,2,3\} \), they cover the whole codomain. Hence range \( = \) codomain, so \( f \) is onto. Therefore every one-one function \( f: \{1,2,3\} \to \{1,2,3\} \) is necessarily onto.
A function \( f: A \to B \) is called one-one (injective) if different elements of \( A \) have different images, that is \( f(a_1) = f(a_2) \Rightarrow a_1 = a_2 \). It is called onto (surjective) if every element of \( B \) is the image of at least one element of \( A \), meaning the range equals the codomain. Here both the domain and codomain are the SAME finite set \( \{1, 2, 3\} \), which has exactly 3 elements. If \( f \) is one-one, the three distinct inputs must give three distinct outputs. But the codomain also has only 3 elements, so these 3 distinct outputs must fill up the entire codomain. Therefore no element of the codomain can be left out, which is exactly what onto means. This is a special property of functions from a finite set to itself.
One-one: \( f(a_1) = f(a_2) \Rightarrow a_1 = a_2 \). Onto: range \( = \) codomain, i.e. \( f(A) = B \).
Since \( f \) is one-one, its 3 images are distinct, and being 3 distinct elements of the 3-element codomain \( \{1,2,3\} \), they cover the whole codomain. Hence range \( = \) codomain, so \( f \) is onto. Therefore every one-one function \( f: \{1,2,3\} \to \{1,2,3\} \) is necessarily onto.
A common mistake is thinking this holds for all sets. This result is true ONLY because the set is finite and the domain and codomain have the same number of elements. For an infinite set (for example \( f(x) = 2x \) on natural numbers), a one-one function need not be onto.
Since \( f \) is one-one, its 3 images are distinct, and being 3 distinct elements of the 3-element codomain \( \{1,2,3\} \), they cover the whole codomain. Hence range \( = \) codomain, so \( f \) is onto. Therefore every one-one function \( f: \{1,2,3\} \to \{1,2,3\} \) is necessarily onto.
One common mistake: Students assume this result holds for all sets of any size, but it is specifically true only when the domain and codomain are the same finite set with equal cardinality; for infinite sets or sets of different sizes, a one-one function need not be onto.
Answer: Since \( f \) is one-one, its 3 images are distinct, and being 3 distinct elements of the 3-element codomain \( \{1,2,3\} \), they cover the whole codomain. Hence range \( = \) codomain, so \( f \) is onto. Therefore every one-one function \( f: \{1,2,3\} \to \{1,2,3\} \) is necessarily onto.
Question: Show that a one-one function \( f : \{a, b, c, d\} \to \{a, b, c, d\} \) must be onto.
Solution: Let \( A = \{a, b, c, d\} \). Note that \( |A| = 4 \), so both the domain and the codomain have exactly 4 elements. Suppose \( f : A \to A \) is one-one (injective). This means that no two distinct elements of the domain map to the same element in the codomain, i.e., \( x_1 \ne x_2 \Rightarrow f(x_1) \ne f(x_2) \). Since the domain has 4 elements and \( f \) is one-one, the images \( f(a), f(b), f(c), f(d) \) are all distinct. Thus the range of \( f \) contains exactly 4 distinct elements. But the codomain \( A \) also has exactly 4 elements. Therefore the range of \( f \) equals the entire codomain \( A \). By definition, this means \( f \) is onto (surjective). Hence every one-one function \( f : \{a, b, c, d\} \to \{a, b, c, d\} \) must be onto.
Answer: Every one-one function f : {a, b, c, d} → {a, b, c, d} is necessarily onto, because its 4 distinct images fill all 4 elements of the codomain.
Question: Let \( f : \{1, 2, 3, 4, 5\} \to \{1, 2, 3, 4, 5\} \) be a one-one function. Prove that \( f \) must also be onto.
Solution: Let \( A = \{1, 2, 3, 4, 5\} \). Here \( |A| = 5 \), so both the domain and the codomain contain exactly 5 elements. Assume \( f : A \to A \) is one-one. Then for any two distinct elements \( x_1, x_2 \in A \), \( f(x_1) \ne f(x_2) \). Now consider the images of all 5 elements of the domain: \( f(1), f(2), f(3), f(4), f(5) \). Because \( f \) is one-one, these 5 images are pairwise distinct, so the range of \( f \) has exactly 5 distinct elements. Since the range of \( f \) is a subset of the codomain \( A \) and both have exactly 5 elements, we conclude: \[ \text{Range}(f) = A \] This means every element of the codomain \( A \) is the image of some element of the domain, which is precisely the definition of \( f \) being onto. Therefore, a one-one function \( f : \{1, 2, 3, 4, 5\} \to \{1, 2, 3, 4, 5\} \) must be onto.
Answer: Every one-one function f : {1, 2, 3, 4, 5} → {1, 2, 3, 4, 5} is necessarily onto, since 5 distinct images exactly exhaust the 5-element codomain.
Question: Let \( f: \{1, 2, 3, 4\} \to \{1, 2, 3, 4\} \) be a one-one function. Show that \( f \) must be onto.
Answer: Since \( f \) is one-one, its 4 images \( f(1), f(2), f(3), f(4) \) are all distinct elements of the 4-element codomain \( \{1, 2, 3, 4\} \). A subset of 4 distinct elements from a set of 4 elements must equal the entire set. Therefore, range of \( f \) \( = \{1, 2, 3, 4\} = \) codomain, which means \( f \) is onto. Hence every one-one function \( f: \{1, 2, 3, 4\} \to \{1, 2, 3, 4\} \) is necessarily onto (and thus bijective).