0 votes
178 views
in Chapter 1 Relations and Functions by (8.1k points)
edited
Let A and B be two sets. Show that f : A × B → B × A such that f(a, b) = (b, a) is bijective function.

1 Answer

0 votes
by (8.1k points)
selected by
 
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.

Related questions

Doubtly is an online community for engineering students, offering:

  • Free viva questions PDFs
  • Previous year question papers (PYQs)
  • Academic doubt solutions
  • Expert-guided solutions

Get the pro version for free by logging in!

5.7k questions

5.1k answers

108 comments

563 users

...