Let A be the set of all 50 students of Class X in a school. Let \(f:A\)->\(N\) be function defined by \(f(x)\) = roll number of the student \(x.\) Show that \(f\) is one-one but not onto.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine a class where every student wears a unique name badge with a number. No two students share the same badge number. So if two students show identical badges, they must be the same person. That is what one-one means. Now, badges only use a small set of numbers, but all counting numbers exist. Many counting numbers, like 100, never appear on any badge. So the function misses most natural numbers, making it not onto.
Answer: The function \( f \) is one-one because distinct students have distinct roll numbers, so \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). It is not onto because the range has only 50 values while the codomain \( N \) is infinite, so some natural numbers (e.g. \( 100 \)) are never taken as images. Hence \( f \) is one-one but not onto.
A function \( f: A \to B \) is called one-one (injective) if different elements of the domain always give different images. Formally, if \( f(x_1) = f(x_2) \) forces \( x_1 = x_2 \), then \( f \) is one-one. A function is called onto (surjective) if every element of the codomain is the image of at least one element of the domain, that is, the range of \( f \) equals the codomain \( B \). Here the domain \( A \) is the set of 50 students, the codomain is \( N \) (natural numbers), and \( f(x) \) is the roll number of student \( x \). Since every student has a unique roll number, no two students share the same one, which gives one-one. But roll numbers only take a few natural values, so most natural numbers are never used, which shows \( f \) is not onto.
One-one: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Onto: range of \( f \) equals the codomain \( N \).
The function \( f \) is one-one because distinct students have distinct roll numbers, so \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). It is not onto because the range has only 50 values while the codomain \( N \) is infinite, so some natural numbers (e.g. \( 100 \)) are never taken as images. Hence \( f \) is one-one but not onto.
A common mistake is to say \( f \) is onto because 'every roll number belongs to some student.' Onto requires every element of the codomain \( N \) to have a pre-image, not just the roll numbers that happen to appear. Since \( N \) is infinite and only 50 values are used, \( f \) cannot be onto.
The function \( f \) is one-one because distinct students have distinct roll numbers, so \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). It is not onto because the range has only 50 values while the codomain \( N \) is infinite, so some natural numbers (e.g. \( 100 \)) are never taken as images. Hence \( f \) is one-one but not onto.
One common mistake: students sometimes confuse the range with the codomain and incorrectly claim that because every student has a roll number the function is onto — but 'onto' requires every natural number to appear as a roll number, not merely that every student has one.
Answer: The function \( f \) is one-one because distinct students have distinct roll numbers, so \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). It is not onto because the range has only 50 values while the codomain \( N \) is infinite, so some natural numbers (e.g. \( 100 \)) are never taken as images. Hence \( f \) is one-one but not onto.
Question: Let B be the set of all 30 employees working in an office. Let g: B → N be the function defined by g(x) = employee ID number of the employee x, where each employee has a unique ID from 1 to 30. Show that g is one-one but not onto.
Solution: We are given that B is a set of 30 employees and g: B → N is defined by g(x) = employee ID of x, with each employee having a distinct ID in the range 1 to 30. Step 1: Show g is one-one. Assume g(x) = g(y) for some x, y in B. This means the employee ID of x equals the employee ID of y. Since each employee has a unique ID, this implies x and y are the same employee, i.e., x = y. Hence g(x) = g(y) implies x = y, so g is one-one. Step 2: Show g is not onto. The co-domain of g is N, the set of all natural numbers. However, the range of g is only the set of 30 employee IDs, say \( \{1, 2, 3, \ldots, 30\} \). Consider any natural number greater than 30, for example \( 31 \in \mathbb{N} \). There is no employee x in B such that g(x) = 31, because no employee has ID 31. Since there exists an element in N (namely 31) that has no pre-image in B, g is not onto. Conclusion: g is one-one but not onto.
Answer: g is one-one because distinct employees have distinct IDs. g is not onto because natural numbers greater than 30 (e.g., 31) have no pre-image in B.
Question: Let C be the set of 25 books in a library. Let h: C → N be the function defined by h(x) = accession number of the book x, where each book is assigned a unique accession number from 101 to 125. Show that h is one-one but not onto.
Solution: We are given that C is the set of 25 library books and h: C → N is defined by h(x) = accession number of book x. Each book has a distinct accession number drawn from \( \{101, 102, \ldots, 125\} \). Step 1: Show h is one-one. Let x, y be any two books in C such that h(x) = h(y). This means the accession number of book x equals the accession number of book y. Since every book has a unique accession number, we conclude x = y. Therefore h(x) = h(y) implies x = y, and so h is one-one. Step 2: Show h is not onto. The co-domain of h is N, the set of all natural numbers. The range of h is \( \{101, 102, \ldots, 125\} \), which contains exactly 25 elements. Consider \( 1 \in \mathbb{N} \). Since all accession numbers are at least 101, there is no book x in C for which h(x) = 1. Thus the element 1 in N has no pre-image in C, which means h is not onto. Conclusion: h is one-one but not onto.
Answer: h is one-one because each book has a unique accession number. h is not onto because many natural numbers (e.g., 1) are not accession numbers of any book in C.
Question: Let B be the set of all 30 employees of a company. Let \( f : B \to \mathbb{N} \) be a function defined by \( f(x) = \) the employee ID number of employee \( x \), where the ID numbers assigned are 1, 2, 3, …, 30 (each employee has a unique ID). Show that \( f \) is one-one but not onto.
Answer: The function \( f \) is one-one because every employee has a unique ID, so \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). It is not onto because the range contains only 30 values \( \{1, 2, \ldots, 30\} \), while the codomain \( \mathbb{N} \) is infinite; for example, the natural number \( 75 \) is never the image of any employee. Hence \( f \) is one-one but not onto.