SOLVER7 Study. Nothing Else.
2026 Board Paper Q36(iii)b

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 : Verify if any function \(f : B\rightarrow A\) is bijective. Give reason to support your answer

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine trying to pair up 3 children with 4 toys, giving each toy exactly one child and each child exactly one toy. You simply cannot do it — there are not enough children! A bijection is like that perfect pairing. Set \( B \) has only 3 elements, but set \( A \) has 4 elements. One element of \( A \) will always be left out with no partner from \( B \). No perfect pairing is possible when the two groups have different sizes.

Answer: No function \( f : B \rightarrow A \) is bijective, because \( n(B) = 3 \ne n(A) = 4 \). A bijection needs both sets to have the same number of elements. Since \( A \) has more elements than \( B \), at least one element of \( A \) will always lack a pre-image, so no such \( f \) can be onto, and hence none can be bijective.

📖 Is a Function from B to A Bijective?

Detailed Explanation

A function \( f : B \rightarrow A \) is called bijective if it is both one-one (injective) and onto (surjective). A function is one-one if different elements of the domain map to different elements of the co-domain. A function is onto if every element of the co-domain has at least one pre-image in the domain. A key idea from Class 12 Relations and Functions is that a bijection between two finite sets is possible ONLY when both sets have the same number of elements. Here the domain \( B = \{B_1, B_2, B_3\} \) has 3 elements, while the co-domain \( A = \{G_1, G_2, G_3, G_4\} \) has 4 elements. Since these counts are unequal, we must check whether the onto condition can ever be satisfied.

Formula Used

For finite sets, \( f : B \rightarrow A \) can be bijective only if \( n(B) = n(A) \). Here \( n(B) = 3 \) and \( n(A) = 4 \).

Solution

  1. Step 1: Count the elements in both sets. The domain is \( B = \{B_1, B_2, B_3\} \), so \( n(B) = 3 \). The co-domain is \( A = \{G_1, G_2, G_3, G_4\} \), so \( n(A) = 4 \).
  2. Step 2: Recall the requirement for onto. For \( f \) to be onto, every one of the 4 elements of \( A \) must be an image of some element of \( B \). But \( B \) has only 3 elements, so \( f \) can produce at most 3 distinct images.
  3. Step 3: Since at most 3 elements of \( A \) can be images, at least one element of \( A \) is left without any pre-image. Therefore no function \( f : B \rightarrow A \) can be onto (surjective).
  4. Step 4: A bijective function must be both one-one and onto. Even if a function is one-one, it fails the onto condition here. Since the onto requirement can never be met, no function \( f : B \rightarrow A \) can be bijective.

Final Answer

No function \( f : B \rightarrow A \) is bijective, because \( n(B) = 3 \ne n(A) = 4 \). A bijection needs both sets to have the same number of elements. Since \( A \) has more elements than \( B \), at least one element of \( A \) will always lack a pre-image, so no such \( f \) can be onto, and hence none can be bijective.

Common Mistake

A common mistake is checking only whether the function is one-one and concluding it is bijective. Even a one-one function from \( B \) to \( A \) fails here because it cannot be onto when \( n(A) > n(B) \); bijectivity requires BOTH conditions.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the two sets and count their elements. The domain is \( B = \\{B_1, B_2, B_3\\} \), giving \( n(B) = 3 \), and the co-domain is \( A = \\{G_1, G_2, G_3, G_4\\} \), giving \( n(A) = 4 \). — Reason: Before checking bijectivity, we always confirm the sizes of both sets, since those sizes directly determine whether a bijection is even possible.
  2. Step 2: Recall what it means for \( f \) to be onto (surjective). Every element of the co-domain \( A \) must be the image of at least one element from \( B \). In other words, all 4 elements \( G_1, G_2, G_3, G_4 \) must each receive at least one arrow from \( B \). — Reason: Surjectivity is one of the two pillars of bijectivity; we check it first here because it is the condition that immediately fails.
  3. Step 3: Count the maximum number of distinct images that \( f \) can produce. Since \( B \) has only 3 elements, the function \( f \) can assign at most 3 distinct images inside \( A \). No matter how we define \( f \), we cannot cover more than 3 of the 4 elements of \( A \). — Reason: Each element of the domain contributes exactly one image, so the total image set has size at most \( n(B) = 3 \).
  4. Step 4: Conclude that \( f \) cannot be onto. Because \( n(B) = 3 < 4 = n(A) \), at least \( 4 - 3 = 1 \) element of \( A \) will always be left without any pre-image in \( B \). Hence no function \( f : B \rightarrow A \) can be surjective. — Reason: The pigeonhole principle tells us that when the domain is strictly smaller than the co-domain, full coverage of the co-domain is impossible.
  5. Step 5: Conclude about bijectivity. A function is bijective only when it is both injective AND surjective. We have just shown that surjectivity fails for every possible \( f : B \rightarrow A \). Therefore, no such function can be bijective. — Reason: Failing even one of the two conditions (injective or surjective) is enough to rule out bijectivity entirely.

Final Answer

No function \( f : B \rightarrow A \) is bijective, because \( n(B) = 3 \ne n(A) = 4 \). A bijection needs both sets to have the same number of elements. Since \( A \) has more elements than \( B \), at least one element of \( A \) will always lack a pre-image, so no such \( f \) can be onto, and hence none can be bijective.

Common Mistake

One common mistake: students sometimes check only the one-one (injective) condition and, finding that an injective function from \( B \) to \( A \) can exist (since \( n(B) < n(A) \)), incorrectly conclude that a bijection might also exist. They forget that bijectivity requires BOTH conditions, and surjectivity fails here because the domain is too small to cover the entire co-domain.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \( B = \{B_1, B_2, B_3\} \), so \( n(B) = 3 \); and \( A = \{G_1, G_2, G_3, G_4\} \), so \( n(A) = 4 \).
  2. Step 2: Since \( n(B) = 3 \ne 4 = n(A) \), the function \( f : B \rightarrow A \) can produce at most 3 distinct images, leaving at least one element of \( A \) without a pre-image.
  3. Step 3: No \( f : B \rightarrow A \) can be onto (surjective), so no such \( f \) can be bijective.

Answer: No function \( f : B \rightarrow A \) is bijective, because \( n(B) = 3 \ne n(A) = 4 \). A bijection needs both sets to have the same number of elements. Since \( A \) has more elements than \( B \), at least one element of \( A \) will always lack a pre-image, so no such \( f \) can be onto, and hence none can be bijective.

➕ More Examples

More Examples

Example 1

Question: A library organises a quiz competition on environmental awareness. Participants are divided into two groups: Group P (girls) = \{\, p_1, p_2, p_3, p_4, p_5 \,\} and Group Q (boys) = \{\, q_1, q_2, q_3 \,\}. Determine whether any function \( f: Q \to P \) can be bijective. Justify your answer.

Solution: We are given two sets: \( P = \{p_1, p_2, p_3, p_4, p_5\} \) and \( Q = \{q_1, q_2, q_3\} \). First, count the elements in each set. The number of elements in \( Q \) is \( |Q| = 3 \). The number of elements in \( P \) is \( |P| = 5 \). For a function \( f: Q \to P \) to be bijective, it must be both one-one (injective) and onto (surjective). Checking onto (surjective): For \( f \) to be onto, every element of the codomain \( P \) must have at least one pre-image in \( Q \). Since \( |Q| = 3 \) and \( |P| = 5 \), there are only 3 elements in the domain to cover 5 elements in the codomain. By the Pigeonhole Principle, at least \( 5 - 3 = 2 \) elements of \( P \) will have no pre-image in \( Q \). Therefore, no function \( f: Q \to P \) can be onto. Since a bijective function must be onto, and no \( f: Q \to P \) can be onto (as \( |Q| < |P| \)), no function \( f: Q \to P \) can be bijective.

Answer: No function \( f: Q \to P \) is bijective, because \( |Q| = 3 < 5 = |P| \), so \( f \) cannot be onto, and hence cannot be bijective.

Example 2

Question: A science club has two teams for a project on biodiversity. Team X consists of boys \( X = \{x_1, x_2, x_3\} \) and Team Y consists of girls \( Y = \{y_1, y_2, y_3, y_4, y_5, y_6\} \). Can any function \( g: X \to Y \) be bijective? Give a proper mathematical justification.

Solution: We are given two sets: \( X = \{x_1, x_2, x_3\} \) and \( Y = \{y_1, y_2, y_3, y_4, y_5, y_6\} \). First, note the cardinalities of the two sets. The number of elements in \( X \) is \( |X| = 3 \). The number of elements in \( Y \) is \( |Y| = 6 \). For a function \( g: X \to Y \) to be bijective, it must satisfy two conditions simultaneously: Condition 1 — One-one (Injective): Distinct elements of \( X \) must map to distinct elements of \( Y \). This is achievable since \( |X| \le |Y| \). Condition 2 — Onto (Surjective): Every element of \( Y \) must be the image of at least one element of \( X \). Since \( g \) is a function from \( X \) to \( Y \), each of the 3 elements in \( X \) maps to exactly one element in \( Y \). So at most 3 elements of \( Y \) can be covered as images. Since \( |Y| = 6 \) and the function can produce at most 3 distinct images (one for each element of \( X \)), at least \( 6 - 3 = 3 \) elements of \( Y \) will not be mapped to by any element of \( X \). Therefore, \( g \) cannot be onto. Since \( g \) fails to be onto, \( g \) cannot be bijective. Conclusion: Since \( |X| \ne |Y| \) (specifically \( |X| < |Y| \)), no function \( g: X \to Y \) can be bijective.

Answer: No function \( g: X \to Y \) is bijective, because \( |X| = 3 \ne 6 = |Y| \), making it impossible for \( g \) to be onto, and therefore impossible to be bijective.

🎯 Try a Similar Question

Try a Similar Question

Question: A college organises a cultural fest and selects student volunteers through an audition. The selected students are divided into two groups: Dancers belong to Set \( P = \\{D_1, D_2, D_3\\} \) and Singers belong to Set \( Q = \\{S_1, S_2, S_3, S_4, S_5\\} \). Based on the above information, verify whether any function \( f : P \to Q \) can be bijective. Give a reason to support your answer.

Solution

  1. Step 1: Find the number of elements in each set: Count the elements in set \( P \) and set \( Q \). Set \( P = \\{D_1, D_2, D_3\\} \) has \( n(P) = 3 \) elements, and Set \( Q = \\{S_1, S_2, S_3, S_4, S_5\\} \) has \( n(Q) = 5 \) elements.
  2. Step 2: Recall the condition for a bijective function: A function \( f : P \to Q \) is bijective if and only if it is both one-one (injective) and onto (surjective). A necessary condition for bijectivity between two finite sets is that they must have equal cardinality, i.e., \( n(P) = n(Q) \).
  3. Step 3: Check the cardinality condition: Here \( n(P) = 3 \) and \( n(Q) = 5 \), so \( n(P) \ne n(Q) \). Since the number of elements in the domain is less than the number of elements in the codomain, every function \( f : P \to Q \) can have at most 3 elements of \( Q \) as images. Therefore, at least \( 5 - 3 = 2 \) elements of \( Q \) will not have any pre-image in \( P \).
  4. Step 4: Conclude about surjectivity and bijectivity: Since some elements of \( Q \) will always be left without a pre-image, no function \( f : P \to Q \) can be onto (surjective). Because onto is a necessary condition for bijectivity, no function \( f : P \to Q \) can be bijective.

Answer: No function \( f : P \to Q \) is bijective. Since \( n(P) = 3 \ne 5 = n(Q) \), the domain has fewer elements than the codomain. As a result, at least 2 elements of \( Q \) will always lack a pre-image, making it impossible for any such function to be onto, and hence none can be bijective.

Everything you get with Solver7

More questions in Relations and Functions