2 answers
Best answer
We have f : (A × B) → (B × A) such that f(a, b) = (b, a).
(a) ∴ f{a1, b1) = (b1, a1), f(a2, b2) = (b2, a2) and
f(a1, b1) = f(a2, b2) ⇒ (b1,1) = (b2, a2)
⇒ b1 = b2 and a1 = a2
∴ f is onto
Thus, f is one-one and onto, ie. it is bijective.
Answer: f is both one-one and onto, so it is bijective.
Here \(f: A \times B \to B \times A\), \(f(a,b) = (b,a)\).
One-one: suppose \(f(a_1,b_1) = f(a_2,b_2)\). Then \((b_1,a_1) = (b_2,a_2)\), so \(b_1 = b_2\) and \(a_1 = a_2\). Hence \((a_1,b_1) = (a_2,b_2)\) and f is one-one.
Onto: take any element \((b,a) \in B \times A\), with \(b \in B\), \(a \in A\). Then \((a,b) \in A \times B\) and
\[f(a,b) = (b,a).\]
So every element of the co-domain has a pre-image, and f is onto.
Being one-one and onto, f is a bijective function.
Practise this chapter
Your answer
Log in or create a free account to answer this question.