SOLVER7 Study. Nothing Else.
Chapter 1 Examples Q14

Show that a one-one function \( f :\{1, 2, 3\}\) \( →\{1, 2, 3\}\) must be onto.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

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.

📖 One-One Function on a Finite Set is Onto

Detailed Explanation

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.

Formula Used

One-one: \( f(a_1) = f(a_2) \Rightarrow a_1 = a_2 \). Onto: range \( = \) codomain, i.e. \( f(A) = B \).

Solution

  1. Step 1: State the given information. We have \( f: \{1,2,3\} \to \{1,2,3\} \) and \( f \) is one-one. We must show \( f \) is onto.
  2. Step 2: Use the one-one condition. Since the domain elements \( 1, 2, 3 \) are all different and \( f \) is one-one, their images \( f(1), f(2), f(3) \) must all be different from each other.
  3. Step 3: Count the outputs. So \( f(1), f(2), f(3) \) are 3 distinct elements. Each of them belongs to the codomain \( \{1,2,3\} \), which itself contains exactly 3 elements.
  4. Step 4: Match the counts. We are placing 3 distinct values into a set that has only 3 members. The only way to have 3 distinct values inside \( \{1,2,3\} \) is to use all three of them. Hence the range is \( \{f(1), f(2), f(3)\} = \{1,2,3\} \).
  5. Step 5: Conclude onto. Since the range equals the codomain, \( f(A) = \{1,2,3\} = B \). Every element of the codomain has a pre-image, so \( f \) is onto.

Final 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.

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify what is given and what must be proved. We are given the function \( f: \{1, 2, 3\} \to \{1, 2, 3\} \) and told that \( f \) is one-one. Our goal is to show that \( f \) is also onto. — Reason: Clearly stating the hypothesis and the target conclusion keeps the logic structured and avoids confusion.
  2. Step 2: Apply the one-one property to the three domain elements \( 1, 2, 3 \). Since \( 1, 2, 3 \) are three distinct elements and \( f \) is one-one, the images \( f(1), f(2), f(3) \) must all be mutually distinct, i.e. \( f(1) \ne f(2) \), \( f(2) \ne f(3) \), and \( f(1) \ne f(3) \). — Reason: The definition of one-one directly tells us that no two different inputs can share the same output.
  3. Step 3: Count the distinct output values produced. We have established that \( f(1), f(2), f(3) \) are three distinct values. Each of these values belongs to the codomain \( \{1, 2, 3\} \), which contains exactly \( 3 \) elements. — Reason: Counting is key here; 3 distinct outputs drawn from a 3-element set must account for every element of that set.
  4. Step 4: Match the number of distinct outputs with the size of the codomain. Since we have \( 3 \) distinct values placed inside a set of size \( 3 \), every element of \( \{1, 2, 3\} \) must appear as an image. No element of the codomain can be left out. — Reason: By the pigeonhole principle applied in reverse, 3 distinct values cannot fit into 3 slots without filling all 3 slots.
  5. Step 5: Conclude that \( f \) is onto. Since every element of the codomain \( \{1, 2, 3\} \) is the image of some element of the domain, we have \( \text{range of } f = \{1, 2, 3\} = \text{codomain} \). This is precisely the definition of an onto function. — Reason: Onto requires that the range equals the codomain, and we have just shown that condition is satisfied.

Final 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.

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given \( f: \{1,2,3\} \to \{1,2,3\} \) is one-one, so \( f(1), f(2), f(3) \) are 3 distinct elements.
  2. Step 2: Each of \( f(1), f(2), f(3) \) lies in the codomain \( \{1,2,3\} \), which has exactly 3 elements.
  3. Step 3: 3 distinct outputs placed in a 3-element set \( \Rightarrow \) every codomain element is covered \( \Rightarrow \) range \( = \) codomain.

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.

➕ More Examples

More Examples

Example 1

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.

Example 2

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.

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( f: \{1, 2, 3, 4\} \to \{1, 2, 3, 4\} \) be a one-one function. Show that \( f \) must be onto.

Solution

  1. Step 1: State the given information: We are given that \( f: \{1, 2, 3, 4\} \to \{1, 2, 3, 4\} \) is a one-one (injective) function. The domain is \( A = \{1, 2, 3, 4\} \) and the codomain is \( B = \{1, 2, 3, 4\} \), both having exactly 4 elements.
  2. Step 2: Use the definition of one-one: Since \( f \) is one-one, distinct elements in the domain map to distinct elements in the codomain. That is, if \( a_1 \ne a_2 \) in \( A \), then \( f(a_1) \ne f(a_2) \) in \( B \). Therefore, the four elements \( f(1),\, f(2),\, f(3),\, f(4) \) are all distinct elements of \( B \).
  3. Step 3: Count the images: The range of \( f \), defined as \( \{f(1), f(2), f(3), f(4)\} \), contains exactly 4 distinct elements (since the function is one-one). Each of these 4 distinct images belongs to the codomain \( B = \{1, 2, 3, 4\} \), which itself has exactly 4 elements.
  4. Step 4: Conclude that range equals codomain: Since the range of \( f \) is a subset of \( B \) containing 4 distinct elements, and \( B \) also has exactly 4 elements, we must have: \[ \text{Range of } f = \{1, 2, 3, 4\} = B \] Thus every element of the codomain \( B \) is the image of some element in \( A \).
  5. Step 5: Conclude that f is onto: By definition, a function is onto (surjective) if every element of the codomain has a pre-image in the domain. Since the range of \( f \) equals the entire codomain \( \{1, 2, 3, 4\} \), the function \( f \) is onto. Hence, every one-one function \( f: \{1, 2, 3, 4\} \to \{1, 2, 3, 4\} \) is necessarily onto, and therefore bijective.

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).

Everything you get with Solver7

More questions in Relations and Functions