Check whether \(f : Z \times Z \rightarrow Z \times Z\) (where \(Z\) is the set of integers) defined as \(f(x, y) = (2y, 3x)\) is injective or not.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine every student in a class has a unique locker number. No two students share the same locker. A function works the same way — if two inputs give the same output, they must be the same input. Here, the function takes a pair of numbers and rearranges them. When two different pairs give the same rearranged result, comparing piece by piece forces both pairs to match exactly. That is what makes this function injective, or one-one.
Answer: Since \( f(x_1, y_1) = f(x_2, y_2) \) implies \( (x_1, y_1) = (x_2, y_2) \), the function \( f \) is injective (one-one).
A function \( f \) is called injective (one-one) if different inputs always give different outputs. Formally, \( f \) is injective if whenever \( f(a) = f(b) \), it must follow that \( a = b \). Here the domain and codomain are both \( \mathbb{Z} \times \mathbb{Z} \), so every element is an ordered pair of integers. To test injectivity, we take two arbitrary elements \( (x_1, y_1) \) and \( (x_2, y_2) \), assume their images are equal, and check whether this forces the two elements to be equal.
\( f \) is injective if \( f(x_1, y_1) = f(x_2, y_2) \Rightarrow (x_1, y_1) = (x_2, y_2) \)
Since \( f(x_1, y_1) = f(x_2, y_2) \) implies \( (x_1, y_1) = (x_2, y_2) \), the function \( f \) is injective (one-one).
A common mistake is to check only one component, for example concluding injectivity from \( 2y_1 = 2y_2 \) alone. You must compare both components of the ordered pairs and show that both \( x_1 = x_2 \) and \( y_1 = y_2 \) before claiming the elements are equal.
Since \( f(x_1, y_1) = f(x_2, y_2) \) implies \( (x_1, y_1) = (x_2, y_2) \), the function \( f \) is injective (one-one).
One common mistake: students sometimes equate only one component (e.g., only the first entries) and conclude \( x_1 = x_2 \) without also checking the second component, leading to an incomplete proof of injectivity.
Answer: Since \( f(x_1, y_1) = f(x_2, y_2) \) implies \( (x_1, y_1) = (x_2, y_2) \), the function \( f \) is injective (one-one).
Question: Check whether the function \( f : \mathbb{Z} \times \mathbb{Z} \rightarrow \mathbb{Z} \times \mathbb{Z} \) defined by \( f(x, y) = (3x, 5y) \) is injective.
Solution: We need to check whether \( f(x_1, y_1) = f(x_2, y_2) \) implies \( (x_1, y_1) = (x_2, y_2) \). Suppose \( f(x_1, y_1) = f(x_2, y_2) \). Then \( (3x_1, 5y_1) = (3x_2, 5y_2) \). Equating the first components: \( 3x_1 = 3x_2 \), which gives \( x_1 = x_2 \). Equating the second components: \( 5y_1 = 5y_2 \), which gives \( y_1 = y_2 \). Since both components are equal, we conclude \( (x_1, y_1) = (x_2, y_2) \). Therefore, \( f \) is injective (one-one).
Answer: f is injective (one-one).
Question: Check whether the function \( f : \mathbb{Z} \times \mathbb{Z} \rightarrow \mathbb{Z} \times \mathbb{Z} \) defined by \( f(x, y) = (2x + y,\, x + y) \) is injective.
Solution: We need to check whether \( f(x_1, y_1) = f(x_2, y_2) \) implies \( (x_1, y_1) = (x_2, y_2) \). Suppose \( f(x_1, y_1) = f(x_2, y_2) \). Then \( (2x_1 + y_1,\, x_1 + y_1) = (2x_2 + y_2,\, x_2 + y_2) \). Equating the first components: \( 2x_1 + y_1 = 2x_2 + y_2 \) ... (i) Equating the second components: \( x_1 + y_1 = x_2 + y_2 \) ... (ii) Subtracting equation (ii) from equation (i): \[ (2x_1 + y_1) - (x_1 + y_1) = (2x_2 + y_2) - (x_2 + y_2) \] \[ x_1 = x_2 \] Substituting \( x_1 = x_2 \) back into equation (ii): \[ x_1 + y_1 = x_1 + y_2 \] \[ y_1 = y_2 \] Since \( x_1 = x_2 \) and \( y_1 = y_2 \), we have \( (x_1, y_1) = (x_2, y_2) \). Therefore, \( f \) is injective (one-one).
Answer: f is injective (one-one).
Question: Check whether \( f : \mathbb{Z} \times \mathbb{Z} \rightarrow \mathbb{Z} \times \mathbb{Z} \) defined by \( f(x, y) = (x + y,\; x - y) \) is injective (one-one) or not.
Answer: The function \( f(x, y) = (x + y,\; x - y) \) is injective (one-one), since \( f(x_1, y_1) = f(x_2, y_2) \) necessarily implies \( (x_1, y_1) = (x_2, y_2) \). However, \( f \) is NOT surjective, because elements like \( (1, 0) \in \mathbb{Z} \times \mathbb{Z} \) have no pre-image in \( \mathbb{Z} \times \mathbb{Z} \).