Home
Class 12
MATHS
Let S and T be two non- empty sets. Show...

Let S and T be two non- empty sets. Show that, `f:SxxT rarr TxxS` defined by , `f(a,b)=(b,a)` for all `(a,b) in Sxx T` is a bijection.

Text Solution

Verified by Experts

The correct Answer is:
f is a bijection
Promotional Banner

Topper's Solved these Questions

  • MAPPING OR FUNCTION

    CHHAYA PUBLICATION|Exercise EXERCISE 2A|12 Videos
  • MAPPING OR FUNCTION

    CHHAYA PUBLICATION|Exercise EXERCISE 2A ( very short answer type questions)|22 Videos
  • LOGARITHM

    CHHAYA PUBLICATION|Exercise Long Answer Type Question|12 Videos
  • MATHEMATICAL REASONING

    CHHAYA PUBLICATION|Exercise JEE Main (AIEEE) Archive (2016 )|1 Videos

Similar Questions

Explore conceptually related problems

Show that, the mapping f: RR rarr RR defined by f(x)=mx +n , where m,n, x in RR and m ne 0 , is a bijection.

Let CC and RR be the sets of complex numbers and real numbers respectively . Show that, the mapping f:CC rarr RR defined by, f(z)=|z| , for all z in CC is niether injective nor surjective.

Let NN be the set of natural numbers and D be the set of odd natural numbers. Then show that the mapping f:NN rarr D , defined by f(x)=2x-1, for all x in NN is a surjection.

let A={x:-(pi)/(2) le x le (pi)/(2)} and B={x:-1 le x le 1} . Show that the function f: A rarr B defined by, f(x)= sin x for all x in A , is bijective . Hence, find a formula that defines f^(-1)

Show f:R rarr R defined by f(x)= x^2 + x for all x in R is many one.

Let A and B sets. Show that f : A xx B to Bxx A such that f (a,b) = (b,a) is bijective function.

If NN be the set natural numbers, then prove that, the mapping f: NN rarr NN defined by , f(n) =n-(-1)^(n) is a bijection.

Let A=RR-{2} and B=RR-{1} . Show that, the function f:A rarr B defined by f(x)=(x-3)/(x-2) is bijective .

Let RR be the set of real numbers and A=R-{3},B=R-{1} . Show that , f: A rarr B defined by , f(x) =(x-1)/(x-3) is a one-one onto function.

Let @ be an operation defined on RR . The set of real numbers, by a@b=min(a,b) for all a,binRR . Show that @ is a binary operation on RR .