Question 15 Marks
Let $A$ and $B$ be two sets. Show that $f : A \times B \rightarrow B \times A$ such that $f ( a , b )=( b , a )$ is
$(i)$ injective
$(ii)$ bijective
$(i)$ injective
$(ii)$ bijective
Answer
View full question & answer→i. Let $\left(a_1 b_1\right)$ and $\left(a_2, b_2\right) \in A \times B$ such that
$f\left(a_1, b_1\right)=f\left(a_2, b_2\right)$
$\Rightarrow\left(a_1, b_1\right)=\left(a_2, b_2\right)$
$\Rightarrow a_1=a_2 \text { and } b_1=b_2$
$\Rightarrow\left(a_1, b_1\right)=\left(a_2, b_2\right)$
Therefore, $f$ is injective.
ii. Let $(b, a)$ be an arbitrary
Element of $B \times A$, then $b \in B$ and $a \in A$
$\Rightarrow( a , b )) \in( A \times B )$
Thus for all $(b, a) \in B \times A$ their exists $(a, b)) \in(A \times B)$
such that
$f (a, b) = (b, a)$
So $f: A \times B \rightarrow B \times A$
is an onto function.
Hence $f$ is bijective.
$f\left(a_1, b_1\right)=f\left(a_2, b_2\right)$
$\Rightarrow\left(a_1, b_1\right)=\left(a_2, b_2\right)$
$\Rightarrow a_1=a_2 \text { and } b_1=b_2$
$\Rightarrow\left(a_1, b_1\right)=\left(a_2, b_2\right)$
Therefore, $f$ is injective.
ii. Let $(b, a)$ be an arbitrary
Element of $B \times A$, then $b \in B$ and $a \in A$
$\Rightarrow( a , b )) \in( A \times B )$
Thus for all $(b, a) \in B \times A$ their exists $(a, b)) \in(A \times B)$
such that
$f (a, b) = (b, a)$
So $f: A \times B \rightarrow B \times A$
is an onto function.
Hence $f$ is bijective.

