SOLVER7 Study. Nothing Else.
2026 Board Paper Q36(ii)

A school wants the students of class XII to do a project on ‘Sustainability’ keeping the world environment in mind. They select the student participants on the basis of an essay writing competition. 7 students out of 80 are selected for the project and are categorized into two sets such that :
Girl students belong to Set \(A =\{G_1, G_2, G_3, G_4\},\)
Boy students belong to Set \(B=\{B1, B2, B3\}.\) Based on the above information, answer the following questions :Let R be a relation from \(A\rightarrow B\) such that
\(R=\{(G_1, B_1), (G_2, B_2), (G_3, B_2), (G_4, B_3), (G_1, B_2)\}.\)
Is R an injective function ? Justify your answer.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a phone directory where each person has exactly one phone number. If someone appears twice with two different numbers, the directory is broken. Here, \( G_1 \) is like that person — paired with both \( B_1 \) and \( B_2 \). A relation must give every input exactly one output before we can even call it a function. Since \( G_1 \) has two outputs, the whole relation breaks down immediately. Asking if it is one-one is like asking if a broken phone directory is alphabetical — the question does not even apply.

Answer: No, \( R \) is not an injective function. In fact, \( R \) is not a function at all, because \( G_1 \) is related to two different elements \( B_1 \) and \( B_2 \), so \( G_1 \) does not have a unique image.

📖 Is R an Injective Function?

Detailed Explanation

Before checking whether a relation is injective, we must first check whether it is a function at all. A relation \( R \) from \( A \) to \( B \) is a function only if every element of \( A \) has exactly one image in \( B \). This means no element of \( A \) can be paired with two different elements of \( B \). A function is called injective (one-one) if different elements of \( A \) always map to different elements of \( B \), i.e. no two distinct elements of the domain share the same image. So the logical order is: first confirm it is a function, then test injectivity. If the relation fails to be a function, the question of injectivity does not even arise.

Formula Used

A relation is a function if each \( a \in A \) has a unique image. It is injective if \( f(a_1) = f(a_2) \Rightarrow a_1 = a_2 \).

Solution

  1. Step 1: Write down the given relation clearly: \[ R = \{(G_1, B_1), (G_2, B_2), (G_3, B_2), (G_4, B_3), (G_1, B_2)\} \] Here the domain is \( A = \{G_1, G_2, G_3, G_4\} \) and the codomain is \( B = \{B_1, B_2, B_3\} \).
  2. Step 2: Check whether \( R \) is a function. For \( R \) to be a function, every element of \( A \) must have exactly one image in \( B \). Look at \( G_1 \): it appears in the pairs \( (G_1, B_1) \) and \( (G_1, B_2) \). So \( G_1 \) is mapped to two different elements, namely \( B_1 \) and \( B_2 \).
  3. Step 3: Since \( G_1 \) has two distinct images \( B_1 \) and \( B_2 \), the element \( G_1 \) does not have a unique image. Therefore \( R \) is not a function at all.
  4. Step 4: Because \( R \) is not even a function, it cannot be an injective function. Injectivity is a property that we test only after confirming that the relation is a function. Hence the question of \( R \) being injective does not arise.

Final Answer

No, \( R \) is not an injective function. In fact, \( R \) is not a function at all, because \( G_1 \) is related to two different elements \( B_1 \) and \( B_2 \), so \( G_1 \) does not have a unique image.

Common Mistake

A common mistake is to jump straight into checking injectivity (whether images repeat) without first verifying that R is a function. Here students may notice \( B_2 \) is repeated and conclude 'not one-one', but the real reason is that \( G_1 \) has two images, so \( R \) fails to be a function in the first place.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write down the given relation clearly: \[ R = \\{(G_1, B_1),\\ (G_2, B_2),\\ (G_3, B_2),\\ (G_4, B_3),\\ (G_1, B_2)\\} \] The domain is \( A = \\{G_1, G_2, G_3, G_4\\} \) and the codomain is \( B = \\{B_1, B_2, B_3\\} \). — Reason: Listing all ordered pairs lets us inspect every mapping systematically before drawing any conclusion.
  2. Step 2: Recall the definition of a function: for \( R \) to be a function from \( A \) to \( B \), each element of \( A \) must appear as the first coordinate in exactly one ordered pair. — Reason: This is the most fundamental requirement; without it, we cannot even begin to discuss injectivity.
  3. Step 3: Scan the ordered pairs for the element \( G_1 \). We find two pairs: \( (G_1, B_1) \) and \( (G_1, B_2) \). This means \( G_1 \) is associated with both \( B_1 \) and \( B_2 \). — Reason: Identifying a domain element that appears more than once immediately signals a potential violation of the function condition.
  4. Step 4: Since \( G_1 \) maps to two distinct elements \( B_1 \) and \( B_2 \), the element \( G_1 \) does not have a unique image. Therefore \( R \) fails the definition of a function. — Reason: A mapping with a non-unique image is not a function; the uniqueness of image is non-negotiable.
  5. Step 5: Because \( R \) is not a function, the question of whether it is injective (one-one) does not arise at all. Injectivity is a property that is defined only for functions. — Reason: Testing injectivity on a non-function is meaningless; the logical order is to confirm the relation is a function first, then check injectivity.

Final Answer

No, \( R \) is not an injective function. In fact, \( R \) is not a function at all, because \( G_1 \) is related to two different elements \( B_1 \) and \( B_2 \), so \( G_1 \) does not have a unique image.

Common Mistake

One common mistake: students jump straight to testing injectivity (checking whether two different inputs share the same output) without first verifying that the relation is actually a function. Always confirm uniqueness of image for every domain element before applying any further tests.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \[R = \\{(G_1, B_1),\\ (G_2, B_2),\\ (G_3, B_2),\\ (G_4, B_3),\\ (G_1, B_2)\\}\]
  2. Step 2: \( G_1 \) appears in both \( (G_1, B_1) \) and \( (G_1, B_2) \), giving two distinct images \( B_1 \) and \( B_2 \).
  3. Step 3: Since \( G_1 \) does not have a unique image, \( R \) is not a function, so injectivity does not apply.

Answer: No, \( R \) is not an injective function. In fact, \( R \) is not a function at all, because \( G_1 \) is related to two different elements \( B_1 \) and \( B_2 \), so \( G_1 \) does not have a unique image.

➕ More Examples

More Examples

Example 1

Question: A college organises a science quiz. 6 participants are divided into two teams: Team P (players) = \( \{P_1, P_2, P_3\} \) and Team Q (quizmasters) = \( \{Q_1, Q_2, Q_3\} \). A relation R from Team P to Team Q is defined as \[ R = \{(P_1, Q_1),\, (P_2, Q_2),\, (P_3, Q_3),\, (P_1, Q_3)\}. \] Is R an injective function? Justify your answer.

Solution: Step 1: Check whether R is a function from P to Q. For R to be a function, every element of the domain (Team P) must have exactly one image in Q. Consider element \( P_1 \): it appears in both \( (P_1, Q_1) \) and \( (P_1, Q_3) \). So \( P_1 \) has two images, namely \( Q_1 \) and \( Q_3 \). Step 2: Conclusion about being a function. Since \( P_1 \) is mapped to two different elements \( Q_1 \) and \( Q_3 \), R does NOT satisfy the definition of a function. Step 3: Conclusion about injectivity. Since R is not even a function, the question of R being injective does not arise. R is NOT an injective function. Justification: A relation must first be a function (each element of the domain has a unique image) to be called injective. Since \( P_1 \) has two images \( Q_1 \) and \( Q_3 \) under R, R fails to be a function, and hence it cannot be an injective function.

Answer: R is NOT an injective function, because it is not even a function (P₁ has two images Q₁ and Q₃).

Example 2

Question: A fitness club has 7 members split into two groups: Trainers \( T = \{T_1, T_2, T_3\} \) and Members \( M = \{M_1, M_2, M_3, M_4\} \). A relation R from T to M is defined as \[ R = \{(T_1, M_2),\, (T_2, M_2),\, (T_3, M_4)\}. \] Is R an injective function? Justify your answer.

Solution: Step 1: Check whether R is a function from T to M. Every element of the domain T must appear exactly once as the first component. \( T_1 \) maps to \( M_2 \), \( T_2 \) maps to \( M_2 \), and \( T_3 \) maps to \( M_4 \). Each element of T has exactly one image, so R is indeed a function. Step 2: Check for injectivity (one-one). For R to be injective, distinct elements of T must map to distinct elements of M, i.e., if \( f(x_1) = f(x_2) \) then \( x_1 = x_2 \). Here, \( f(T_1) = M_2 \) and \( f(T_2) = M_2 \), but \( T_1 \ne T_2 \). Step 3: Conclusion. Since two distinct elements \( T_1 \) and \( T_2 \) in T have the same image \( M_2 \) in M, R is NOT injective. Justification: For a function to be injective (one-one), no two different domain elements can share the same image. Since both \( T_1 \) and \( T_2 \) map to \( M_2 \), this condition is violated, so R is a function but it is not an injective function.

Answer: R is a function but NOT an injective function, because two distinct elements T₁ and T₂ both map to M₂.

🎯 Try a Similar Question

Try a Similar Question

Question: A college selects 8 students for a science exhibition. The students are divided into two groups: Science students belong to Set \( P = \{S_1, S_2, S_3, S_4, S_5\} \) Arts students belong to Set \( Q = \{A_1, A_2, A_3\} \) Let \( R \) be a relation from \( P \to Q \) defined as \[ R = \{(S_1, A_1),\ (S_2, A_2),\ (S_3, A_3),\ (S_4, A_2),\ (S_5, A_3)\}. \] Is \( R \) an injective (one-one) function? Justify your answer.

Solution

  1. Step 1: Check whether R is a valid function: A relation from \( P \) to \( Q \) is a function if and only if every element of \( P \) has exactly one image in \( Q \). Check each element of \( P = \{S_1, S_2, S_3, S_4, S_5\} \): \( S_1 \) maps to \( A_1 \) (exactly one image), \( S_2 \) maps to \( A_2 \) (exactly one image), \( S_3 \) maps to \( A_3 \) (exactly one image), \( S_4 \) maps to \( A_2 \) (exactly one image), \( S_5 \) maps to \( A_3 \) (exactly one image). Since every element of \( P \) has a unique image in \( Q \), the relation \( R \) is indeed a function.
  2. Step 2: Check the condition for injectivity (one-one): A function \( f: P \to Q \) is called injective (one-one) if distinct elements of \( P \) always map to distinct elements of \( Q \), i.e., \[ f(a_1) = f(a_2) \Rightarrow a_1 = a_2. \] From the relation \( R \), observe that: \( R(S_3) = A_3 \) and \( R(S_5) = A_3 \). Here \( S_3 \ne S_5 \), but both are mapped to the same element \( A_3 \in Q \). This violates the condition for injectivity.
  3. Step 3: Also check the pair (S_2, S_4): Similarly, \( R(S_2) = A_2 \) and \( R(S_4) = A_2 \). Again, \( S_2 \ne S_4 \), but both map to the same element \( A_2 \). This is a second violation of the one-one condition.
  4. Step 4: Conclusion: Since two distinct pairs of elements in \( P \) share the same image in \( Q \), specifically \( R(S_3) = R(S_5) = A_3 \) and \( R(S_2) = R(S_4) = A_2 \), the function \( R \) is NOT injective (not one-one). However, \( R \) is a valid function because every element of \( P \) has exactly one image in \( Q \).

Answer: \( R \) is a valid function from \( P \) to \( Q \) (since each element of \( P \) has exactly one image), but \( R \) is NOT an injective (one-one) function, because two distinct elements \( S_3 \) and \( S_5 \) both map to the same element \( A_3 \), and similarly \( S_2 \) and \( S_4 \) both map to \( A_2 \).

Everything you get with Solver7

More questions in Relations and Functions