f: \(A \times B → B \times A\) is defined as f(a, b) = (b, a).
Let \((a_1,b_1)\), \((a_2,b_2)\) \(∈ A\times B\) such that \(f(a_1,b_1)=f(a_2,b_2)\).
\(⇒ (b_1,a_1)=(b_2,a_2)\)
\(⇒ b_1=b_2 \text{ and } a_1=a_2\)
\(⇒ (a_1,b_1)=(a_2,b_2)\)
∴ f is one-one.
Now, let (b, a) ∈ B × A be any element.
Then, there exists (a, b) ∈A × B such that f(a, b) = (b, a). [By definition of f]
∴ f is onto.
Hence, f is bijective.
LIST I | LIST II | ||
A. | Range of y=cosec-1x | I. | R-(-1, 1) |
B. | Domain of sec-1x | II. | (0, π) |
C. | Domain of sin-1x | III. | [-1, 1] |
D. | Range of y=cot-1x | IV. | \([\frac{-π}{2},\frac{π}{2}]\)-{0} |
What is the Planning Process?
A function is said to be one to one function when f: A → B is One to One if for each element of A there is a distinct element of B.
A function which maps two or more elements of A to the same element of set B is said to be many to one function. Two or more elements of A have the same image in B.
If there exists a function for which every element of set B there is (are) pre-image(s) in set A, it is Onto Function.
A function, f is One – One and Onto or Bijective if the function f is both One to One and Onto function.
Read More: Types of Functions