Question:

Check the injectivity and surjectivity of the following functions:

  1. f: N \(\to\) N given by f(x) = x2
  2. f: Z \(\to\) Z given by f(x) = x2
  3. f: R \(\to\) R given by f(x) = x2
  4. f: N \(\to\) N given by f(x) = x3
  5. f: Z \(\to\) Z given by f(x) = x3

Updated On: Aug 23, 2023
Hide Solution
collegedunia
Verified By Collegedunia

Solution and Explanation

(i) f: N \(\to\) N is given by,
f(x) = x2
It is seen that for x, y ∈ N, f(x) = f(y) ⇒ x2 = y ⇒ 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. 

Was this answer helpful?
0
0

Concepts Used:

Types of Functions

Types of Functions

One to One Function

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. 

Many to One Function

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.

Onto Function

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. 

One – One and 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