Home
Class 12
MATHS
Let A and B be sets. Show that f" ":" "A...

Let A and B be sets. Show that `f" ":" "AxxB` ,`BxxA` such that `f" "(a ," "b)" "=" "(b ," "a)` is bijective function.

Text Solution

Verified by Experts

In `f: AxxB to BxxA`
`f(a, b) = (b, a) AA (a, b) in A xx B`
Let `" " (a, b), (c, d) in AxxB`
and `" " f(a, b) = f(c,d)`
`rArr (b, a) = (d, c)`
`rArr b =d and a = c `
`rArr (a, b) = (c, d)`
`therefore f ` is one-one.
Again, for each `(a, b) in B xx A, (b, a) in A xx B` is such that
`therefore " " f(b, a) = (a, b)`
`therefore f` is onto.
Therefore, `f` is one-one onto function.
Promotional Banner

Topper's Solved these Questions

  • RELATIONS AND FUNCTIONS

    NAGEEN PRAKASHAN|Exercise Exercise 1.3|14 Videos

  • RELATIONS AND FUNCTIONS

    NAGEEN PRAKASHAN|Exercise Exercise 1.4|13 Videos

  • RELATIONS AND FUNCTIONS

    NAGEEN PRAKASHAN|Exercise Exercise 1.1|8 Videos

  • PROBABIILITY

    NAGEEN PRAKASHAN|Exercise Miscellaneous Exercise|19 Videos

  • THREE-DIMENSIONAL GEOMETRY

    NAGEEN PRAKASHAN|Exercise Miscellaneous Exercise|23 Videos

Similar Questions

Explore conceptually related problems

Let A and B be two sets. Show that f: AxxB->BxxA defined by f(a ,\ b)=(b ,\ a) is a bijection.

Let A and B be sets.Show that f:A times B rarr B times A such that (a,b)=(b,a) is bijective function.

Let A and B be two sets such that AxxB = {(a, 1), (b, 3), (a, 3), (b, 1), (a, 2), (b, 2)} Then,

Let Z be the set of integers and f:Z rarr Z is a bijective function then

Let A" "=" "{1," "2," "3} , B" "=" "{4," "5," "6," "7} and let f" "=" "{(1," "4)," "(2," "5)," "(3," "6)} be a function from A to B. Show that f is one-one.

If AxxB=BxxA then the angle between A and B is

If A and B be two sets such that n(A)=3,n(B)=4" and "n(AnnB)=2 then find: (i) n(AxxB)" " (ii) n(BxxA)" "(iii) n{(AxxB)nn(BxxA)}

Let A=R~(3) and B=R~{(2)/(3)} . If f :A rarr B defined as f(x)=(2x-4)/(3x-9) then prove that f is a bijective function.

The values of a and b for which the map f: R to R , given by f(x)=ax+b (a,b in R) is a bijection with fof as indentity function, are

A function is said to be bijective if it is both one-one and onto, Consider the mapping f : A rarr B be defined by f(x) = (x-1)/(x-2) such that f is a bijection. A function f(x) is said to be one-one iff :