Solveeit Logo

Question

Question: Let A and B be sets. Show that \(f:A \times B \to B \times A\) such that \(f\left( {a,b} \right) = \...

Let A and B be sets. Show that f:A×BB×Af:A \times B \to B \times A such that f(a,b)=(b,a)f\left( {a,b} \right) = \left( {b,a} \right) is a bijective function.

Explanation

Solution

In this question, we want to prove that the given function is bijective. The function will be bijective if the function will be one-one and the function will be onto. Based on the property of the ordered pair we can prove that the function is one-one. Based on the pre-image or matching element, we can prove that the function is onto.

Complete step-by-step solution:
In this question,
f:A×BB×Af:A \times B \to B \times A is defined as f(a,b)=(b,a)f\left( {a,b} \right) = \left( {b,a} \right).
To show the given function is bijective:
First, let us prove the function is one-one.
Here, two elements (a1,b1)\left( {{a_1},{b_1}} \right) and (a2,b2)\left( {{a_2},{b_2}} \right) belongs to A×BA \times B.
Therefore,
(a1,b1),(a2,b2)A×B\left( {{a_1},{b_1}} \right),\left( {{a_2},{b_2}} \right) \in A \times B such that f(a1,b1)=f(a2,b2)f\left( {{a_1},{b_1}} \right) = f\left( {{a_2},{b_2}} \right)
From the property of ordered pairs and based on function definition.
(b1,a1)=(b2,a2)\Rightarrow ({b_1},{a_1}) = ({b_2},{a_2})
If two ordered pairs are equal then the first element should be equal and the second element should also be equal.
b1=b2\Rightarrow {b_1} = {b_2} and a1=a2{a_1} = {a_2}
So, we can write,
(a1,b1)=(a2,b2)\Rightarrow ({a_1},{b_1}) = ({a_2},{b_2})
Hence, the function f is one-one.
Now, let us prove that the function f is onto.
Take (b,a)B×A\left( {b,a} \right) \in B \times A be any element.
bB\Rightarrow b \in B and aAa \in A
Here, (a,b)=(b,a)\left( {a,b} \right) = \left( {b,a} \right) is a pre-image if (a,b)A×B\left( {a,b} \right) \in A \times B because bBb \in B and aAa \in A
Then there exists (a,b)A×B\left( {a,b} \right) \in A \times B
We also knowf(a,b)=(b,a)f\left( {a,b} \right) = \left( {b,a} \right) from the function definition.
Hence, the function f is onto.
Here, the function f is one-one and onto.
Therefore, this is a bijective function.

Note: An ordered pair consists of two elements that are written in the fixed order. The pair of elements that occur in a particular order and are enclosed in brackets is called a set of ordered pairs. Ordered pair is not a set consisting of two elements.