SOLVER7 Study. Nothing Else.
Chapter 1 Examples Q13

Show that an onto function \(f:\{1, 2, 3\}\) \( →\{1, 2, 3\}\) is always one-one.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine 3 children and 3 chairs. Every chair must be occupied — that is what onto means. There are exactly 3 children and exactly 3 chairs, so no two children can sit in the same chair. If two children shared a chair, one chair would be left empty. An empty chair breaks the onto rule. So every child automatically goes to a unique chair, which is exactly what one-one means.

Answer: Since the domain and codomain \( \{1, 2, 3\} \) have the same finite number of elements, an onto function must use 3 distinct output values, so no two inputs can share an output. Hence every onto function \( f:\{1, 2, 3\} \to \{1, 2, 3\} \) is necessarily one-one.

📖 Onto Functions on a Finite Set Are One-One

Detailed Explanation

A function \( f:A \to B \) is called onto (surjective) if every element of the codomain \( B \) has at least one pre-image in \( A \). It is called one-one (injective) if different inputs give different outputs, that is \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Here both the domain and codomain are the same finite set \( \{1, 2, 3\} \), which has exactly 3 elements. The key idea is counting: if a function on a finite set hits every element of the codomain (onto), it cannot repeat any output value, otherwise it would miss some element. Missing an element would make it not onto. So for a function from a finite set to itself, being onto forces it to be one-one.

Formula Used

Onto: for every \( y \in B \) there exists \( x \in A \) with \( f(x) = y \). One-one: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \).

Solution

  1. Step 1: Note the sets involved. We have \( f:\{1, 2, 3\} \to \{1, 2, 3\} \), so both the domain and codomain have exactly 3 elements. We are told \( f \) is onto and we must prove it is one-one.
  2. Step 2: Recall what onto means here. Since \( f \) is onto, every element of the codomain \( \{1, 2, 3\} \) must appear as an output of \( f \). So among the three outputs \( f(1), f(2), f(3) \), all of \( 1, 2, 3 \) must occur.
  3. Step 3: Count the outputs. There are exactly 3 domain elements, giving exactly 3 output values \( f(1), f(2), f(3) \). These 3 outputs together must cover all 3 distinct values \( 1, 2, 3 \).
  4. Step 4: Argue that no output repeats. Suppose, for contradiction, two outputs were equal, say \( f(1) = f(2) \). Then the three outputs \( f(1), f(2), f(3) \) would take at most 2 distinct values. But then one of \( 1, 2, 3 \) would have no pre-image, contradicting the fact that \( f \) is onto.
  5. Step 5: Conclude injectivity. Since no two outputs can be equal, distinct inputs give distinct outputs. That is, \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \), which is exactly the definition of a one-one function.

Final Answer

Since the domain and codomain \( \{1, 2, 3\} \) have the same finite number of elements, an onto function must use 3 distinct output values, so no two inputs can share an output. Hence every onto function \( f:\{1, 2, 3\} \to \{1, 2, 3\} \) is necessarily one-one.

Common Mistake

A common mistake is to think this result holds for any onto function. It only works because the domain and codomain are the SAME finite set (equal, finite sizes). For infinite sets or sets of different sizes, an onto function need not be one-one.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the function and its properties. We are given \( f : \{1, 2, 3\} \to \{1, 2, 3\} \) and told that \( f \) is onto. Our goal is to show \( f \) must also be one-one. — Reason: Clearly stating the given information and the target helps us plan the proof without confusion.
  2. Step 2: Count the elements. Both the domain \( \{1, 2, 3\} \) and the codomain \( \{1, 2, 3\} \) each contain exactly 3 elements. The function produces exactly 3 output values, namely \( f(1) \), \( f(2) \), and \( f(3) \). — Reason: Fixing the count of inputs and outputs is the key to the entire argument; finite-set cardinality drives the logic.
  3. Step 3: Apply the onto condition. Because \( f \) is onto, every element of the codomain \( \{1, 2, 3\} \) must be hit by at least one input. In other words, each of the values \( 1 \), \( 2 \), and \( 3 \) must appear among the outputs \( f(1) \), \( f(2) \), \( f(3) \). — Reason: This is the literal definition of surjectivity; applying it converts an abstract condition into a concrete coverage requirement.
  4. Step 4: Check whether any output can repeat. Suppose, for contradiction, that two inputs share the same output, say \( f(x_1) = f(x_2) \) for some \( x_1 \ne x_2 \). Then among the three outputs \( f(1) \), \( f(2) \), \( f(3) \), at most 2 distinct values are produced (since two of the three positions carry the same value). — Reason: A repeated output reduces the number of distinct values that can be covered, threatening the onto condition.
  5. Step 5: Derive the contradiction. If only 2 distinct output values appear, at least one element of the codomain \( \{1, 2, 3\} \) is never reached, making \( f \) not onto. This contradicts our given assumption that \( f \) is onto. — Reason: A contradiction with a given fact means our supposition (repeated output) must be false.
  6. Step 6: Conclude one-one-ness. Since repeating any output leads to a contradiction, all three outputs \( f(1) \), \( f(2) \), \( f(3) \) must be distinct. Therefore \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \), which is exactly the definition of a one-one function. — Reason: Establishing distinct outputs for distinct inputs fulfils the injective criterion completely.

Final Answer

Since the domain and codomain \( \{1, 2, 3\} \) have the same finite number of elements, an onto function must use 3 distinct output values, so no two inputs can share an output. Hence every onto function \( f:\{1, 2, 3\} \to \{1, 2, 3\} \) is necessarily one-one.

Common Mistake

One common mistake: Students sometimes think the result requires a specific formula or direct computation of \( f \). In reality, the proof is entirely based on counting — the equal sizes of the domain and codomain do all the work, no explicit formula for \( f \) is needed.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given \( f:\{1,2,3\} \to \{1,2,3\} \) is onto, so every element of \( \{1,2,3\} \) is in the range of \( f \).
  2. Step 2: The 3 outputs \( f(1), f(2), f(3) \) must together cover all 3 distinct values \( 1, 2, 3 \), so all three outputs are distinct.
  3. Step 3: If \( f(x_1) = f(x_2) \) for any \( x_1, x_2 \in \{1,2,3\} \), only 2 distinct output values exist, so one element of the codomain is missed, contradicting onto. Hence \( x_1 = x_2 \), proving \( f \) is one-one.

Answer: Since the domain and codomain \( \{1, 2, 3\} \) have the same finite number of elements, an onto function must use 3 distinct output values, so no two inputs can share an output. Hence every onto function \( f:\{1, 2, 3\} \to \{1, 2, 3\} \) is necessarily one-one.

➕ More Examples

More Examples

Example 1

Question: Show that every onto function \( f: \{1, 2, 3, 4\} \to \{1, 2, 3, 4\} \) is necessarily one-one.

Solution: Let \( A = \{1, 2, 3, 4\} \) and let \( f: A \to A \) be an onto (surjective) function. Since \( f \) is onto, every element of the codomain \( \{1, 2, 3, 4\} \) has at least one pre-image in the domain \( \{1, 2, 3, 4\} \). The domain \( A \) has exactly 4 elements and the codomain \( A \) also has exactly 4 elements. Since \( f \) is onto, every one of the 4 elements in the codomain must be covered. That means we need at least 4 distinct pre-images — one for each codomain element. But the domain itself has only 4 elements. So each domain element must map to a distinct codomain element (otherwise some codomain element would have no pre-image, contradicting the onto condition). Formally: Suppose \( f \) is NOT one-one. Then there exist \( a, b \in A \) with \( a \ne b \) such that \( f(a) = f(b) \). This means 2 domain elements map to the same codomain element, so the remaining 2 domain elements can cover at most 2 more distinct codomain elements. In total, the range of \( f \) has at most \( 1 + 2 = 3 \) elements, which is less than 4. This contradicts the assumption that \( f \) is onto (since the codomain has 4 elements). Therefore, our assumption is false, and \( f \) must be one-one.

Answer: Every onto function \( f: \{1, 2, 3, 4\} \to \{1, 2, 3, 4\} \) is always one-one, proved by contradiction using the Pigeonhole Principle.

Example 2

Question: Let \( B = \{a, b, c, d, e\} \) be a set with 5 elements. Show that any onto function \( g: B \to B \) must also be one-one.

Solution: Let \( B = \{a, b, c, d, e\} \) and suppose \( g: B \to B \) is an onto function. Since \( g \) is onto, every element of the codomain \( B \) must have at least one pre-image in the domain \( B \). The codomain has 5 elements. So \( g \) must map onto all 5 elements \( a, b, c, d, e \) of \( B \). Now suppose, for contradiction, that \( g \) is NOT one-one. Then there exist two distinct elements \( x_1, x_2 \in B \) with \( x_1 \ne x_2 \) such that \( g(x_1) = g(x_2) \). In this case, two elements of the domain share the same image. So the 5 domain elements produce at most \( 5 - 1 = 4 \) distinct images in the codomain. Hence the range of \( g \) contains at most 4 elements, meaning at least one element of the codomain \( B \) is not in the range of \( g \). This directly contradicts the assumption that \( g \) is onto (surjective). Therefore, \( g \) must be one-one. In general, for any finite set \( S \) with \( n \) elements, if \( h: S \to S \) is onto, then \( h \) is one-one. This follows because the total number of domain and codomain elements are equal, so no two domain elements can share an image without leaving some codomain element uncovered.

Answer: Every onto function \( g: B \to B \) where \( B = \{a, b, c, d, e\} \) is always one-one, established by a contradiction argument showing that non-injectivity violates surjectivity for equal finite sets.

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( A = \{1, 2, 3, 4\} \). Show that every onto function \( f: A \to A \) is necessarily one-one.

Solution

  1. Step 1: State the given information: We have a function \( f: \{1, 2, 3, 4\} \to \{1, 2, 3, 4\} \) that is onto (surjective). We need to prove that \( f \) is also one-one (injective).
  2. Step 2: Recall the definition of an onto function: A function \( f: A \to B \) is onto if every element of \( B \) has at least one pre-image in \( A \). Here, the codomain \( \{1, 2, 3, 4\} \) has 4 elements, so all 4 elements of the codomain must be in the range of \( f \).
  3. Step 3: Use the size of the domain: The domain \( A = \{1, 2, 3, 4\} \) also has exactly 4 elements. Since \( f \) is onto, the range of \( f \) must contain all 4 elements of the codomain. This means \( f \) takes exactly 4 distinct output values.
  4. Step 4: Argue by contradiction: Suppose \( f \) is NOT one-one. Then there exist two distinct elements \( a, b \in A \) with \( a \ne b \) such that \( f(a) = f(b) \). This means the 4 domain elements map to at most 3 distinct values in the codomain. But then the range of \( f \) can have at most 3 elements, so \( f \) cannot cover all 4 elements of the codomain. This contradicts the assumption that \( f \) is onto.
  5. Step 5: Conclude: Since assuming \( f \) is not one-one leads to a contradiction with \( f \) being onto, it follows that \( f \) must be one-one. Therefore, every onto function \( f: \{1, 2, 3, 4\} \to \{1, 2, 3, 4\} \) is necessarily one-one.

Answer: Since the domain and codomain both have exactly 4 elements and \( f \) is onto, all 4 codomain values must be achieved. With only 4 domain elements available, no two inputs can share the same output (otherwise at most 3 codomain values would be covered, contradicting surjectivity). Hence every onto function \( f: \{1, 2, 3, 4\} \to \{1, 2, 3, 4\} \) is necessarily one-one.

Everything you get with Solver7

More questions in Relations and Functions