SOLVER7 Study. Nothing Else.
Exercise 1.2 Q8

Let A and B be sets. Show that \(f : A \times B → B \times A\) such that \( f(a, b) = (b, a)\) is bijective function.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have a box of name tags, each saying something like 'red-circle'. The function just flips every tag to say 'circle-red' instead. Every flipped tag is unique because each original was unique. Also, every possible 'circle-red' tag comes from exactly one original 'red-circle' tag. Nothing is lost and nothing repeats. That is why swapping the two parts of every pair is a perfect two-way matching between the two sets, making the function bijective.

Answer: The function \( f : A \times B \to B \times A \) defined by \( f(a, b) = (b, a) \) is both one-one and onto, hence it is bijective.

📖 Proving f(a,b) = (b,a) is Bijective

Detailed Explanation

A function is called bijective if it is both one-one (injective) and onto (surjective). A function \( f \) is one-one if different inputs always give different outputs, that is \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). A function \( f \) is onto if every element of the codomain is the image of at least one element of the domain. Here we have \( f : A \times B \to B \times A \) defined by \( f(a, b) = (b, a) \), which simply swaps the order of the components of an ordered pair. We must verify both properties for the elements of the sets \( A \times B \) (the domain) and \( B \times A \) (the codomain).

Formula Used

One-one: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Onto: for every \( y \) in codomain, there exists \( x \) in domain with \( f(x) = y \). Bijective = one-one AND onto.

Solution

  1. Step 1: Understand the function. The domain is \( A \times B \), whose elements are ordered pairs \( (a, b) \) with \( a \in A \) and \( b \in B \). The rule \( f(a, b) = (b, a) \) gives an element of \( B \times A \), since \( b \in B \) and \( a \in A \). So \( f \) is a well-defined function from \( A \times B \) to \( B \times A \).
  2. Step 2: Prove that \( f \) is one-one. Take any two elements \( (a_1, b_1) \) and \( (a_2, b_2) \) in \( A \times B \) and assume they have the same image: \[ f(a_1, b_1) = f(a_2, b_2) \] By the definition of \( f \), this means \[ (b_1, a_1) = (b_2, a_2) \]
  3. Step 3: Use equality of ordered pairs. Two ordered pairs are equal only when their corresponding components are equal. So from \( (b_1, a_1) = (b_2, a_2) \) we get \[ b_1 = b_2 \quad \text{and} \quad a_1 = a_2 \] Therefore \[ (a_1, b_1) = (a_2, b_2) \] This shows equal images force equal inputs, so \( f \) is one-one (injective).
  4. Step 4: Prove that \( f \) is onto. Take any arbitrary element \( (b, a) \) in the codomain \( B \times A \), where \( b \in B \) and \( a \in A \). We must find a pre-image in the domain \( A \times B \).
  5. Step 5: Find the pre-image. Consider the element \( (a, b) \), which belongs to \( A \times B \) since \( a \in A \) and \( b \in B \). Applying \( f \): \[ f(a, b) = (b, a) \] So every element \( (b, a) \) of \( B \times A \) has a pre-image \( (a, b) \) in \( A \times B \). Hence \( f \) is onto (surjective).
  6. Step 6: Conclude. Since \( f \) is both one-one and onto, \( f \) is a bijective function from \( A \times B \) to \( B \times A \).

Final Answer

The function \( f : A \times B \to B \times A \) defined by \( f(a, b) = (b, a) \) is both one-one and onto, hence it is bijective.

Common Mistake

A common mistake is checking only one property (usually one-one) and forgetting to prove onto, or vice versa. Bijective requires BOTH one-one and onto to be shown clearly.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the function and verify it is well-defined: The domain is \( A \times B \), whose elements are ordered pairs \( (a, b) \) with \( a \in A \) and \( b \in B \). The rule \( f(a, b) = (b, a) \) produces an ordered pair with first component \( b \in B \) and second component \( a \in A \), which belongs to \( B \times A \). — Reason: We confirm the output of \( f \) genuinely lands in the stated codomain \( B \times A \), so \( f \) is a well-defined function.
  2. Step 2: Set up the one-one test: Pick any two elements \( (a_1, b_1) \) and \( (a_2, b_2) \) from \( A \times B \) and suppose their images are equal: \[ f(a_1, b_1) = f(a_2, b_2) \] — Reason: The standard method to prove injectivity is to assume equal outputs and then deduce equal inputs.
  3. Step 3: Expand using the definition of f: Applying the rule \( f(a, b) = (b, a) \) to both sides gives \[ (b_1, a_1) = (b_2, a_2) \] — Reason: Substituting the definition of \( f \) converts the abstract equality into a concrete equality of ordered pairs that we can analyse component-wise.
  4. Step 4: Use equality of ordered pairs to conclude one-one: Two ordered pairs are equal if and only if their corresponding components are equal. So from \( (b_1, a_1) = (b_2, a_2) \) we get \( b_1 = b_2 \) and \( a_1 = a_2 \), which means \( (a_1, b_1) = (a_2, b_2) \). — Reason: This shows that equal outputs force equal inputs, confirming \( f \) is one-one (injective).
  5. Step 5: Set up the onto test: Take an arbitrary element \( (b, a) \in B \times A \), where \( b \in B \) and \( a \in A \). We need to find some element in the domain \( A \times B \) that maps to \( (b, a) \). — Reason: To prove surjectivity, we must show every element of the codomain has at least one pre-image in the domain.
  6. Step 6: Exhibit the pre-image and verify: Consider the pair \( (a, b) \in A \times B \). Applying \( f \) gives \[ f(a, b) = (b, a) \] which is exactly the element we started with. — Reason: We have explicitly produced a pre-image \( (a, b) \in A \times B \) for every \( (b, a) \in B \times A \), so \( f \) is onto (surjective).
  7. Step 7: Combine both results: Since \( f \) has been shown to be one-one (Step 4) and onto (Step 6), it satisfies both conditions required for bijectivity. — Reason: Bijectivity requires both properties simultaneously; having verified each independently, we can now conclude.

Final Answer

The function \( f : A \times B \to B \times A \) defined by \( f(a, b) = (b, a) \) is both one-one and onto, hence it is bijective.

Common Mistake

One common mistake: Students sometimes forget to check both properties and only prove one-one, then declare the function bijective — always verify onto separately by finding an explicit pre-image for an arbitrary codomain element.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: One-one: Let \( (a_1, b_1), (a_2, b_2) \in A \times B \). Assume \( f(a_1, b_1) = f(a_2, b_2) \), so \( (b_1, a_1) = (b_2, a_2) \), giving \( b_1 = b_2 \) and \( a_1 = a_2 \), hence \( (a_1, b_1) = (a_2, b_2) \). Therefore \( f \) is one-one.
  2. Step 2: Onto: For any \( (b, a) \in B \times A \), the element \( (a, b) \in A \times B \) satisfies \( f(a, b) = (b, a) \). Every element of the codomain has a pre-image, so \( f \) is onto.

Answer: The function \( f : A \times B \to B \times A \) defined by \( f(a, b) = (b, a) \) is both one-one and onto, hence it is bijective.

➕ More Examples

More Examples

Example 1

Question: Let \( P \) and \( Q \) be two non-empty sets. Define a function \( g : P \times Q \times P \to Q \times P \times P \) by \( g(p, q, p') = (q, p, p') \) for all \( (p, q, p') \in P \times Q \times P \). Show that \( g \) is a bijective function.

Solution: We need to prove that \( g \) is both injective (one-one) and surjective (onto). Step 1: Prove g is Injective. Let \( (p_1, q_1, p_1') \) and \( (p_2, q_2, p_2') \) be two arbitrary elements of \( P \times Q \times P \) such that \( g(p_1, q_1, p_1') = g(p_2, q_2, p_2') \). By definition of \( g \): \[ (q_1, p_1, p_1') = (q_2, p_2, p_2') \] Two ordered triples are equal if and only if their corresponding components are equal. Therefore: \[ q_1 = q_2, \quad p_1 = p_2, \quad p_1' = p_2' \] This gives us \( (p_1, q_1, p_1') = (p_2, q_2, p_2') \). Hence \( g \) is injective. Step 2: Prove g is Surjective. Let \( (q, p, p') \) be an arbitrary element of \( Q \times P \times P \), where \( q \in Q \), \( p \in P \), and \( p' \in P \). Consider the element \( (p, q, p') \in P \times Q \times P \). Then: \[ g(p, q, p') = (q, p, p') \] So for every element \( (q, p, p') \) in the codomain \( Q \times P \times P \), we have found a preimage \( (p, q, p') \in P \times Q \times P \). Hence \( g \) is surjective. Conclusion: Since \( g \) is both injective and surjective, \( g \) is a bijective function.

Answer: g is bijective (both injective and surjective).

Example 2

Question: Let \( \mathbb{R} \) denote the set of real numbers. Define \( h : \mathbb{R} \times \mathbb{R} \to \mathbb{R} \times \mathbb{R} \) by \( h(x, y) = (y + 1, x - 1) \) for all \( (x, y) \in \mathbb{R} \times \mathbb{R} \). Show that \( h \) is a bijective function.

Solution: We need to prove that \( h \) is both injective (one-one) and surjective (onto). Step 1: Prove h is Injective. Let \( (x_1, y_1), (x_2, y_2) \in \mathbb{R} \times \mathbb{R} \) such that \( h(x_1, y_1) = h(x_2, y_2) \). By definition of \( h \): \[ (y_1 + 1,\; x_1 - 1) = (y_2 + 1,\; x_2 - 1) \] Equating the first components: \[ y_1 + 1 = y_2 + 1 \implies y_1 = y_2 \] Equating the second components: \[ x_1 - 1 = x_2 - 1 \implies x_1 = x_2 \] Therefore \( (x_1, y_1) = (x_2, y_2) \), which shows \( h \) is injective. Step 2: Prove h is Surjective. Let \( (a, b) \) be an arbitrary element of \( \mathbb{R} \times \mathbb{R} \), where \( a, b \in \mathbb{R} \). We need to find \( (x, y) \in \mathbb{R} \times \mathbb{R} \) such that \( h(x, y) = (a, b) \), i.e., \[ (y + 1,\; x - 1) = (a, b) \] This gives \( y + 1 = a \) and \( x - 1 = b \), so \( y = a - 1 \) and \( x = b + 1 \). Since \( a, b \in \mathbb{R} \), we have \( x = b + 1 \in \mathbb{R} \) and \( y = a - 1 \in \mathbb{R} \), so \( (x, y) = (b+1,\, a-1) \in \mathbb{R} \times \mathbb{R} \). Verification: \[ h(b+1,\; a-1) = ((a-1)+1,\; (b+1)-1) = (a, b) \] So for every \( (a, b) \in \mathbb{R} \times \mathbb{R} \), there exists a preimage \( (b+1, a-1) \in \mathbb{R} \times \mathbb{R} \). Hence \( h \) is surjective. Conclusion: Since \( h \) is both injective and surjective, \( h \) is a bijective function.

Answer: h is bijective (both injective and surjective).

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( \mathbb{R} \) denote the set of all real numbers. Define a function \( g : \mathbb{R} \times \mathbb{R} \to \mathbb{R} \times \mathbb{R} \) by \( g(x, y) = (x + y,\\, x - y) \). Show that \( g \) is a bijective function.

Solution

  1. Step 1: Check One-One (Injectivity): Assume \( g(x_1, y_1) = g(x_2, y_2) \) for some \( (x_1, y_1),\\, (x_2, y_2) \in \mathbb{R} \times \mathbb{R} \). Then by definition of \( g \): \[ (x_1 + y_1,\\, x_1 - y_1) = (x_2 + y_2,\\, x_2 - y_2) \] This gives us two equations: \[ x_1 + y_1 = x_2 + y_2 \quad \text{...(i)} \] \[ x_1 - y_1 = x_2 - y_2 \quad \text{...(ii)} \]
  2. Step 2: Solve the System to Confirm Injectivity: Adding equations (i) and (ii): \[ 2x_1 = 2x_2 \implies x_1 = x_2 \] Subtracting equation (ii) from (i): \[ 2y_1 = 2y_2 \implies y_1 = y_2 \] Since \( x_1 = x_2 \) and \( y_1 = y_2 \), we get \( (x_1, y_1) = (x_2, y_2) \). Therefore \( g \) is one-one.
  3. Step 3: Check Onto (Surjectivity): Let \( (a, b) \in \mathbb{R} \times \mathbb{R} \) be an arbitrary element of the codomain. We need to find \( (x, y) \in \mathbb{R} \times \mathbb{R} \) such that \( g(x, y) = (a, b) \), i.e., \( x + y = a \) and \( x - y = b \). Solving: \[ x = \frac{a + b}{2}, \quad y = \frac{a - b}{2} \] Since \( a, b \in \mathbb{R} \), we have \( x, y \in \mathbb{R} \), so \( (x, y) \in \mathbb{R} \times \mathbb{R} \).
  4. Step 4: Verify the Pre-image: Substituting \( x = \frac{a+b}{2} \) and \( y = \frac{a-b}{2} \) into \( g \): \[ g\\!\left(\frac{a+b}{2},\\, \frac{a-b}{2}\right) = \left(\frac{a+b}{2} + \frac{a-b}{2},\\; \frac{a+b}{2} - \frac{a-b}{2}\right) = (a,\\, b) \] Since every \( (a, b) \in \mathbb{R} \times \mathbb{R} \) has a pre-image in \( \mathbb{R} \times \mathbb{R} \), \( g \) is onto.
  5. Step 5: Conclusion: Since \( g \) is both one-one and onto, \( g : \mathbb{R} \times \mathbb{R} \to \mathbb{R} \times \mathbb{R} \) defined by \( g(x, y) = (x + y,\\, x - y) \) is a bijective function.

Answer: The function \( g : \mathbb{R} \times \mathbb{R} \to \mathbb{R} \times \mathbb{R} \) defined by \( g(x, y) = (x + y,\\, x - y) \) is bijective, because it is one-one (injectivity shown by solving \( g(x_1, y_1) = g(x_2, y_2) \) to get \( x_1 = x_2,\\, y_1 = y_2 \)) and onto (for every \( (a,b) \) in the codomain, the pre-image \( \left(\frac{a+b}{2}, \frac{a-b}{2}\right) \) exists in the domain).

Everything you get with Solver7

More questions in Relations and Functions