SOLVER7 Study. Nothing Else.
Chapter 1 Examples Q7

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

Solution

👶 Simple Explanation

Simple Explanation

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.

📖 One-One but Not Onto: Roll Number Function

Detailed Explanation

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.

Formula Used

One-one: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Onto: range of \( f \) equals the codomain \( N \).

Solution

  1. Step 1: Write down the setup. Let \( A \) be the set of all 50 students of Class X, and let \( f: A \to N \) be defined by \( f(x) = \) roll number of the student \( x \). Each student in the school is assigned exactly one roll number, so \( f \) is a well-defined function.
  2. Step 2: Check the one-one condition. Take any two students \( x_1, x_2 \in A \) and suppose \( f(x_1) = f(x_2) \). This means the roll number of \( x_1 \) equals the roll number of \( x_2 \).
  3. Step 3: Use the key fact that no two students of the same class can have the same roll number. So if two students have equal roll numbers, they must actually be the same student. Hence \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \), which proves that \( f \) is one-one (injective).
  4. Step 4: Check the onto condition. The codomain is \( N = \{1, 2, 3, \ldots\} \), which is infinite. But there are only 50 students, so the range of \( f \) contains at most 50 natural numbers (the 50 roll numbers).
  5. Step 5: Since the range has only 50 elements while \( N \) has infinitely many, there exist natural numbers that are not the roll number of any student. For example, the natural number \( 100 \in N \) has no student mapped to it, since no student has roll number \( 100 \). Thus the range of \( f \) is not equal to \( N \), so \( f \) is not onto (not surjective).

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

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the domain, codomain, and the rule of the function. Here, the domain \( A \) is the set of all 50 students of Class X, the codomain is \( N \) (the set of all natural numbers), and the function \( f: A \to N \) assigns to each student \( x \) their roll number \( f(x) \). — Reason: Clearly stating these three components is the starting point for any analysis of a function's properties.
  2. Step 2: To test the one-one condition, assume two students \( x_1, x_2 \in A \) satisfy \( f(x_1) = f(x_2) \). This means both students have been assigned the same roll number. — Reason: The standard approach for proving injectivity is to start with the assumption that two outputs are equal and then check whether the inputs must also be equal.
  3. Step 3: Use the real-world fact that every student in a class is assigned a unique roll number; no two different students ever share one. Therefore \( f(x_1) = f(x_2) \) forces \( x_1 = x_2 \). — Reason: This uniqueness property is precisely the definition of an injective function, so \( f \) is one-one.
  4. Step 4: Now check the onto condition. The range of \( f \) consists of exactly the roll numbers assigned to those 50 students — at most 50 distinct natural numbers. — Reason: The range can contain at most as many values as there are students in the domain.
  5. Step 5: Compare the range with the codomain \( N \). Since \( N \) is infinite and the range contains only 50 values, most natural numbers — for example \( 100 \) — are not the roll number of any student in Class X and therefore have no pre-image in \( A \). — Reason: For \( f \) to be onto, every element of \( N \) must appear as an output, but the finite range makes this impossible.
  6. Step 6: Conclude: because the range of \( f \) is a finite subset of \( N \) while \( N \) is infinite, the range is strictly smaller than the codomain, so \( f \) is not onto. — Reason: The onto condition requires range = codomain, which fails here.

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

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Let \( A \) = set of 50 students of Class X, \( f: A \to N \), \( f(x) \) = roll number of student \( x \).
  2. Step 2: One-one: Suppose \( f(x_1) = f(x_2) \). Since no two students share a roll number, \( x_1 = x_2 \). Hence \( f \) is one-one.
  3. Step 3: Not onto: Range of \( f \) contains exactly 50 values, whereas the codomain \( N \) is infinite. Natural numbers such as \( 100 \) (if unused as a roll number) have no pre-image in \( A \), so Range \( \ne N \).

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.

➕ More Examples

More Examples

Example 1

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.

Example 2

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.

🎯 Try a Similar Question

Try a Similar Question

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.

Solution

  1. Step 1: Identify the Domain and Codomain: The domain is the set \( B \) of all 30 employees of the company. The codomain is \( \mathbb{N} \), the set of all natural numbers. Each employee is assigned a unique ID from the set \( \{1, 2, 3, \ldots, 30\} \).
  2. Step 2: Prove that f is One-One (Injective): Suppose \( x_1, x_2 \in B \) such that \( f(x_1) = f(x_2) \). Since \( f(x) \) gives the employee ID of employee \( x \), and every employee has a distinct ID number, it follows that \( f(x_1) = f(x_2) \) means both employees have the same ID number. Because ID numbers are unique (no two employees share an ID), we must have \( x_1 = x_2 \). Therefore, \( f \) is one-one.
  3. Step 3: Show that f is NOT Onto (Not Surjective): For \( f \) to be onto, every natural number \( n \in \mathbb{N} \) must be the image of some employee in \( B \). However, the range of \( f \) is \( \{1, 2, 3, \ldots, 30\} \), which contains only 30 elements. Consider the natural number \( 75 \in \mathbb{N} \). Since there are only 30 employees with IDs from 1 to 30, there is no employee \( x \in B \) such that \( f(x) = 75 \). Hence \( 75 \) has no pre-image in \( B \), and so \( f \) is not onto.
  4. Step 4: Formal Range vs Codomain Argument: The range of \( f \) is \( \{1, 2, \ldots, 30\} \), which is a finite set with exactly 30 elements. The codomain \( \mathbb{N} \) is infinite. Since the range is a proper subset of the codomain, i.e., \( \{1, 2, \ldots, 30\} \subsetneq \mathbb{N} \), the function \( f \) is not onto.
  5. Step 5: Conclusion: Since \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \) for all \( x_1, x_2 \in B \), the function \( f \) is one-one. Since the range \( \{1, 2, \ldots, 30\} \ne \mathbb{N} \), the function \( f \) is not onto. Hence \( 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.

Everything you get with Solver7

More questions in Relations and Functions