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.