Show that an onto function \(f:\{1, 2, 3\}\) \( →\{1, 2, 3\}\) is always one-one.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
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.
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.
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 \).
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.
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.
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.
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.
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.
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.
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.
Question: Let \( A = \{1, 2, 3, 4\} \). Show that every onto function \( f: A \to A \) 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.