SOLVER7 Study. Nothing Else.
Exercise 1.2 Q6

Let \(A =\{1, 2, 3\},\) \(B=\{4, 5, 6, 7\}\) and let \(f=\{(1, 4), (2, 5), (3, 6)\}\) be a function from A to B. Show that \(f\) is one-one.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine three friends each getting a unique locker number at school. A one-one function works exactly like that — every person gets a different locker, and no two people share the same one. Here, the numbers 1, 2, and 3 are like the friends, and 4, 5, and 6 are their locker numbers. Nobody shares a locker, so the rule is followed perfectly. When every input gets its own unique output, we call that a one-one function.

Answer: Since \( f(1) = 4 \), \( f(2) = 5 \), \( f(3) = 6 \) are all distinct, no two distinct elements of \( A \) have the same image. Therefore \( f \) is a one-one function.

📖 Proving f is One-One (Injective)

Detailed Explanation

A function \( f: A \to B \) is called one-one (also called injective) if different elements of the domain \( A \) always have different images in the codomain \( B \). In simple words, no two distinct elements of \( A \) are mapped to the same element of \( B \). Formally, \( f \) is one-one if for all \( a_1, a_2 \in A \), whenever \( f(a_1) = f(a_2) \), it must follow that \( a_1 = a_2 \). For a function given as a set of ordered pairs on a small finite set, the easiest way to check this is to list out every image and confirm that all images are distinct (no repetitions).

Formula Used

\( f \) is one-one if for all \( a_1, a_2 \in A \), \( f(a_1) = f(a_2) \Rightarrow a_1 = a_2 \). Equivalently, distinct elements have distinct images: \( a_1 \ne a_2 \Rightarrow f(a_1) \ne f(a_2) \).

Solution

  1. Step 1: Identify the images of each element: From the given function \( f = \{(1, 4), (2, 5), (3, 6)\} \), read off the image of each element of \( A = \{1, 2, 3\} \): \[ f(1) = 4, \quad f(2) = 5, \quad f(3) = 6. \]
  2. Step 2: Compare all the images: Now check whether any two different elements share the same image. The images obtained are \( 4, 5, \) and \( 6 \). Since \( 4 \ne 5 \), \( 5 \ne 6 \), and \( 4 \ne 6 \), all three images are distinct from one another.
  3. Step 3: Apply the definition of one-one: Because distinct elements of \( A \) have distinct images in \( B \), the condition \( a_1 \ne a_2 \Rightarrow f(a_1) \ne f(a_2) \) is satisfied for every pair. Equivalently, if \( f(a_1) = f(a_2) \), the only way this can happen is when \( a_1 = a_2 \), since no image is repeated.
  4. Step 4: Conclusion: Since no two different elements of \( A \) map to the same element of \( B \), the function \( f \) satisfies the definition of a one-one function. Hence \( f \) is one-one (injective).

Final Answer

Since \( f(1) = 4 \), \( f(2) = 5 \), \( f(3) = 6 \) are all distinct, no two distinct elements of \( A \) have the same image. Therefore \( f \) is a one-one function.

Common Mistake

A common mistake is to confuse one-one with onto. Being one-one only requires distinct images; it does NOT require that every element of \( B \) is used. Here \( 7 \in B \) has no pre-image, but this does not affect the one-one property — it only means \( f \) is not onto.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write down the given function explicitly. The function is given as a set of ordered pairs: \( f = \{(1, 4),\ (2, 5),\ (3, 6)\} \) with domain \( A = \{1, 2, 3\} \). — Reason: Identifying the ordered pairs first makes it easy to read off each input-output relationship without confusion.
  2. Step 2: Extract the image (output) of each element of the domain from the ordered pairs: \( f(1) = 4 \), \( f(2) = 5 \), \( f(3) = 6 \). — Reason: Listing every image separately lets us directly compare them in the next step to detect any repetitions.
  3. Step 3: Compare every pair of images to check whether any two are equal. We check: \( f(1) \ne f(2) \) because \( 4 \ne 5 \), \( f(2) \ne f(3) \) because \( 5 \ne 6 \), and \( f(1) \ne f(3) \) because \( 4 \ne 6 \). — Reason: For a finite domain, checking all pairs of images is the most direct way to verify the one-one condition.
  4. Step 4: Apply the definition of a one-one function. Since all three images \( 4 \), \( 5 \), and \( 6 \) are distinct, the condition \( a_1 \ne a_2 \Rightarrow f(a_1) \ne f(a_2) \) holds for every pair \( a_1, a_2 \in A \). — Reason: Confirming that distinct inputs always produce distinct outputs is precisely what the definition of a one-one function requires, so this concludes the proof.

Final Answer

Since \( f(1) = 4 \), \( f(2) = 5 \), \( f(3) = 6 \) are all distinct, no two distinct elements of \( A \) have the same image. Therefore \( f \) is a one-one function.

Common Mistake

One common mistake: Students sometimes check only one or two pairs of images (e.g., only \( f(1) \ne f(2) \)) and declare the function one-one without checking every possible pair — for a domain with \( n \) elements, all \( \frac{n(n-1)}{2} \) pairs of images must be verified to be distinct.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \( f = \{(1, 4),\ (2, 5),\ (3, 6)\} \), so \( f(1) = 4 \), \( f(2) = 5 \), \( f(3) = 6 \).
  2. Step 2: Check: \( 4 \ne 5 \), \( 5 \ne 6 \), \( 4 \ne 6 \) — all images are distinct.
  3. Step 3: Distinct elements of \( A \) map to distinct elements of \( B \), so the one-one condition \( a_1 \ne a_2 \Rightarrow f(a_1) \ne f(a_2) \) holds.

Answer: Since \( f(1) = 4 \), \( f(2) = 5 \), \( f(3) = 6 \) are all distinct, no two distinct elements of \( A \) have the same image. Therefore \( f \) is a one-one function.

➕ More Examples

More Examples

Example 1

Question: Let \( P = \{2, 3, 4\} \) and \( Q = \{10, 11, 12, 13\} \). A function \( g : P \to Q \) is defined by \( g = \{(2, 11), (3, 13), (4, 10)\} \). Show that \( g \) is one-one.

Solution: We are given the function \( g : P \to Q \) where \( P = \{2, 3, 4\} \) and \( Q = \{10, 11, 12, 13\} \), defined by \( g = \{(2, 11), (3, 13), (4, 10)\} \). From the definition of \( g \), we identify the images of each element: \[ g(2) = 11, \quad g(3) = 13, \quad g(4) = 10 \] To check whether \( g \) is one-one, we verify that no two distinct elements of \( P \) have the same image in \( Q \). Observe that \( g(2) = 11 \), \( g(3) = 13 \), and \( g(4) = 10 \) are all distinct values in \( Q \). More formally, suppose \( g(x_1) = g(x_2) \) for some \( x_1, x_2 \in P \). By inspecting the pairs, the only way two images are equal is if the inputs are equal. So \( g(x_1) = g(x_2) \) implies \( x_1 = x_2 \). Since all three elements of \( P \) have distinct images in \( Q \), the function \( g \) is one-one (injective).

Answer: g is one-one because g(2) = 11, g(3) = 13, and g(4) = 10 are all distinct. No two different elements of P share the same image in Q.

Example 2

Question: Let \( X = \{a, b, c, d\} \) and \( Y = \{1, 2, 3, 4, 5\} \). A function \( h : X \to Y \) is defined by \( h = \{(a, 3), (b, 5), (c, 1), (d, 4)\} \). Show that \( h \) is one-one.

Solution: We are given the function \( h : X \to Y \) where \( X = \{a, b, c, d\} \) and \( Y = \{1, 2, 3, 4, 5\} \), defined by \( h = \{(a, 3), (b, 5), (c, 1), (d, 4)\} \). From the definition of \( h \), the images of each element of \( X \) are: \[ h(a) = 3, \quad h(b) = 5, \quad h(c) = 1, \quad h(d) = 4 \] To verify that \( h \) is one-one, we check whether distinct elements of \( X \) always map to distinct elements of \( Y \). The images \( 3, 5, 1, 4 \) are all distinct elements of \( Y \). There is no repeated value among the images. Formally, suppose \( h(x_1) = h(x_2) \) for \( x_1, x_2 \in X \). Since each element of \( X \) is mapped to a unique element of \( Y \), \( h(x_1) = h(x_2) \) can only happen when \( x_1 = x_2 \). Since all four elements of \( X \) have distinct images under \( h \), the function \( h \) is one-one (injective). Note: The element \( 2 \in Y \) has no pre-image in \( X \), which means \( h \) is not onto. But the question only asks us to show it is one-one, which is confirmed above.

Answer: h is one-one because h(a) = 3, h(b) = 5, h(c) = 1, and h(d) = 4 are all distinct. No two different elements of X share the same image in Y.

🎯 Try a Similar Question

Try a Similar Question

Question: Let P = {2, 4, 6} and Q = {1, 3, 5, 7, 9}. A function g : P → Q is defined as g = {(2, 3), (4, 7), (6, 1)}. Show that g is a one-one function.

Solution

  1. Step 1: Write down the function explicitly: The function g : P → Q is given by g = {(2, 3), (4, 7), (6, 1)}, which means \[g(2) = 3, \quad g(4) = 7, \quad g(6) = 1\]
  2. Step 2: Recall the definition of a one-one function: A function is one-one (injective) if no two distinct elements of the domain have the same image in the codomain. Formally, for all \( a, b \in P \), if \( g(a) = g(b) \), then \( a = b \).
  3. Step 3: Check all pairs of elements in P: We check whether any two distinct elements of P share the same image under g. We have \( g(2) = 3 \), \( g(4) = 7 \), and \( g(6) = 1 \). Comparing: \[g(2) = 3 \ne 7 = g(4)\] \[g(2) = 3 \ne 1 = g(6)\] \[g(4) = 7 \ne 1 = g(6)\]
  4. Step 4: State the conclusion: Since \( g(2) = 3 \), \( g(4) = 7 \), and \( g(6) = 1 \) are all distinct values, no two distinct elements of P are mapped to the same element of Q. Therefore, g is a one-one (injective) function.

Answer: Since \( g(2) = 3 \), \( g(4) = 7 \), and \( g(6) = 1 \) are all distinct, no two distinct elements of P share the same image in Q. Hence, g : P → Q is a one-one function.

Everything you get with Solver7

More questions in Relations and Functions