SOLVER7 Study. Nothing Else.
2026 Board Paper Q22(b)

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

Solution

👶 Simple Explanation

Simple Explanation

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).

📖 Checking Injectivity of f(x, y) = (2y, 3x)

Detailed Explanation

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.

Formula Used

\( f \) is injective if \( f(x_1, y_1) = f(x_2, y_2) \Rightarrow (x_1, y_1) = (x_2, y_2) \)

Solution

  1. Step 1: Take two arbitrary elements \( (x_1, y_1) \) and \( (x_2, y_2) \) in \( \mathbb{Z} \times \mathbb{Z} \) and assume their images are equal, that is \( f(x_1, y_1) = f(x_2, y_2) \).
  2. Step 2: Using the definition \( f(x, y) = (2y, 3x) \), write both images: \[ (2y_1, 3x_1) = (2y_2, 3x_2) \]
  3. Step 3: Two ordered pairs are equal only when their corresponding components are equal. So we compare component by component: \[ 2y_1 = 2y_2 \quad \text{and} \quad 3x_1 = 3x_2 \]
  4. Step 4: From \( 2y_1 = 2y_2 \), dividing both sides by 2 gives \( y_1 = y_2 \). From \( 3x_1 = 3x_2 \), dividing both sides by 3 gives \( x_1 = x_2 \).
  5. Step 5: Since \( x_1 = x_2 \) and \( y_1 = y_2 \), the two elements are equal: \( (x_1, y_1) = (x_2, y_2) \). Thus equal images force equal inputs, which is exactly the condition for injectivity.

Final 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).

Common Mistake

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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Let \( (x_1, y_1) \) and \( (x_2, y_2) \) be any two elements in \( \mathbb{Z} \times \mathbb{Z} \), and suppose their images under \( f \) are equal, i.e., assume \( f(x_1, y_1) = f(x_2, y_2) \). — Reason: This is the standard starting assumption for testing injectivity; we want to find out whether equal outputs must come from equal inputs.
  2. Step 2: Apply the definition \( f(x, y) = (2y,\, 3x) \) to both sides of the assumption. This gives \[ (2y_1,\, 3x_1) = (2y_2,\, 3x_2). \] — Reason: Writing out the function explicitly allows us to work with concrete equations instead of an abstract equality.
  3. Step 3: Two ordered pairs are equal precisely when each corresponding component matches. Equating the first components and then the second components separately gives \[ 2y_1 = 2y_2 \] and \[ 3x_1 = 3x_2. \] — Reason: Component-wise equality is the definition of equality for ordered pairs, so this step splits one vector equation into two scalar equations.
  4. Step 4: From \( 2y_1 = 2y_2 \), divide both sides by \( 2 \) to obtain \( y_1 = y_2 \). From \( 3x_1 = 3x_2 \), divide both sides by \( 3 \) to obtain \( x_1 = x_2 \). — Reason: Since \( 2 \ne 0 \) and \( 3 \ne 0 \), division is valid in \( \mathbb{Z} \), and it isolates each variable to yield a direct equality.
  5. Step 5: Because we now have \( x_1 = x_2 \) and \( y_1 = y_2 \), the two original inputs must be the same ordered pair: \( (x_1, y_1) = (x_2, y_2) \). — Reason: Both components being equal is exactly the condition for two ordered pairs to be identical, completing the injectivity argument.

Final 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).

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Assume \( f(x_1, y_1) = f(x_2, y_2) \), i.e., \( (2y_1, 3x_1) = (2y_2, 3x_2) \).
  2. Step 2: Equating components: \( 2y_1 = 2y_2 \Rightarrow y_1 = y_2 \) and \( 3x_1 = 3x_2 \Rightarrow x_1 = x_2 \).
  3. Step 3: Therefore \( (x_1, y_1) = (x_2, y_2) \).

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).

➕ More Examples

More Examples

Example 1

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).

Example 2

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).

🎯 Try a Similar Question

Try a Similar Question

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.

Solution

  1. Step 1: Assume two inputs give the same output: Let \( (x_1, y_1) \) and \( (x_2, y_2) \) be any two elements of \( \mathbb{Z} \times \mathbb{Z} \) such that \( f(x_1, y_1) = f(x_2, y_2) \).
  2. Step 2: Write out the component equations: Using the definition of \( f \), the equation \( f(x_1, y_1) = f(x_2, y_2) \) gives \[ (x_1 + y_1,\; x_1 - y_1) = (x_2 + y_2,\; x_2 - y_2). \] Equating corresponding components: \[ x_1 + y_1 = x_2 + y_2 \quad \text{...(i)} \] \[ x_1 - y_1 = x_2 - y_2 \quad \text{...(ii)} \]
  3. Step 3: Add the two equations: Adding equation (i) and equation (ii): \[ (x_1 + y_1) + (x_1 - y_1) = (x_2 + y_2) + (x_2 - y_2) \] \[ 2x_1 = 2x_2 \] Therefore \( x_1 = x_2 \).
  4. Step 4: Subtract the two equations: Subtracting equation (ii) from equation (i): \[ (x_1 + y_1) - (x_1 - y_1) = (x_2 + y_2) - (x_2 - y_2) \] \[ 2y_1 = 2y_2 \] Therefore \( y_1 = y_2 \).
  5. Step 5: Conclude injectivity: Since \( f(x_1, y_1) = f(x_2, y_2) \) implies \( x_1 = x_2 \) AND \( y_1 = y_2 \), we have \( (x_1, y_1) = (x_2, y_2) \). However, we must also check whether \( f \) maps into \( \mathbb{Z} \times \mathbb{Z} \) properly. Notice that for any integers \( x \) and \( y \), both \( x + y \) and \( x - y \) are integers. Now observe: for \( (x + y) \) and \( (x - y) \) to both be odd or both be even, their sum \( 2x \) is always even — consistent. But can every pair \( (a, b) \in \mathbb{Z} \times \mathbb{Z} \) be achieved? We need \( x + y = a \) and \( x - y = b \), giving \( x = \frac{a+b}{2} \), which is not always an integer (e.g. \( a = 1, b = 0 \) gives \( x = \frac{1}{2} \notin \mathbb{Z} \)). So \( f \) is NOT surjective, but the injectivity argument above is valid: \( f(x_1, y_1) = f(x_2, y_2) \Rightarrow (x_1, y_1) = (x_2, y_2) \). Hence \( f \) IS injective.

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} \).

Everything you get with Solver7

More questions in Relations and Functions