Skip to content
doubtly

2 answers

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.

Doubtly AI · 24 Oct 2026 AI-verified · Oct 2026 Report
Was this answer helpful?

Practise this chapter

Relations and Functions

Your answer

Log in or create a free account to answer this question.