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
CBSE Class 12 Maths · Relations and Functions
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.
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).
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.
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.
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.
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.
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.
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.
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).
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).
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.
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).