Check the injectivity and surjectivity of the following functions:
(i) f: N \(\to\) N is given by,
f(x) = x2
It is seen that for x, y ∈ N, f(x) = f(y) ⇒ x2 = y2 ⇒ x = y.
∴f is injective.
Now, 2 ∈ N. But, there does not exist any x in N such that f(x) = x2 = 2.
∴ f is not surjective.
Hence, function f is injective but not surjective.
(ii) f: Z \(\to\) Z is given by,
f(x) = x2
It is seen that f(−1) = f(1) = 1, but −1 ≠ 1.
∴ f is not injective.
Now,−2 ∈ Z. But, there does not exist any element x ∈ Z such that f(x) = x2 = −2.
∴ f is not surjective.
Hence, function f is neither injective nor surjective.
(iii) f: R \(\to\) R is given by,
f(x) = x2
It is seen that f(−1) = f(1) = 1, but −1 ≠ 1.
∴ f is not injective.
Now,−2 ∈ R. But, there does not exist any element x ∈ R such that f(x) = x2 = −2.
∴ f is not surjective.
Hence, function f is neither injective nor surjective.
(iv) f: N \(\to\) N given by,
f(x) = x3
It is seen that for x, y ∈ N, f(x) = f(y) ⇒ x3 = y3 ⇒ x = y.
∴f is injective.
Now, 2 ∈ N. But, there does not exist any element x in domain N such that f(x) = x3 = 2.
∴ f is not surjective
Hence, function f is injective but not surjective.
(v) f : Z \(\)\(\to\) Z is given by,
f(x) = x3
It is seen that for x, y ∈ Z, f(x) = f(y) ⇒ x3 = y3 ⇒ x = y.
∴ f is injective.
Now, 2 ∈ Z. But, there does not exist any element x in domain Z such that f(x) = x3 = 2.
∴ f is not surjective.
Hence, function f is injective but not surjective.
A school is organizing a debate competition with participants as speakers and judges. $ S = \{S_1, S_2, S_3, S_4\} $ where $ S = \{S_1, S_2, S_3, S_4\} $ represents the set of speakers. The judges are represented by the set: $ J = \{J_1, J_2, J_3\} $ where $ J = \{J_1, J_2, J_3\} $ represents the set of judges. Each speaker can be assigned only one judge. Let $ R $ be a relation from set $ S $ to $ J $ defined as: $ R = \{(x, y) : \text{speaker } x \text{ is judged by judge } y, x \in S, y \in J\} $.
The correct IUPAC name of \([ \text{Pt}(\text{NH}_3)_2\text{Cl}_2 ]^{2+} \) is:
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