(i)Let f: Z → Z given by f(x) =
Let us check one-one condition on f(x) =
Injectivity:
Let x and y be any two elements in the domain (Z), such that f(x) = f(y).
f (x) = f(y)
⇒
⇒
⇒ x = y
⇒ f(x) = f(y)
⇒ x = y
So, f is one-one.
Surjectivity:
Let y be any element in the co-domain (Z), such that f(x) = y for some element x in Z(domain).
Let f(x) = y
⇒
⇒
⇒
. It may not be in the domain (Z)
Because if we take y =
,
domain Z.
So, for every element in the co domain there need not be any element in the domain such that f(x) = y.
Thus, f is not onto.
(ii) Example for the function which is not one-one but onto
Let
given by
Injectivity:
Let x and y be any two elements in the domain (Z),
Such that f(x) = f(y).
⇒
So, different elements of domain f may give the same image.
So, f is not one-one.
Surjectivity:
Let y be any element in the co domain (Z), such that f(x) = y for some element x in Z (domain).
f(x) = y
⇒
Which is an element in Z (domain).
So, for every element in the co-domain, there exists a pre-image in the domain.
Thus, f is onto.
(iii) Example for the function which is neither one-one nor onto.
Let f: Z → Z given by f(x) =
Injectivity:
Let x and y be any two elements in the domain (Z), such that f(x) = f(y).
f(x) = f(y)
⇒
⇒
⇒
⇒
So, different elements of domain f may give the same image.
Thus, f is not one-one.
Surjectivity:
Let y be any element in the co-domain (Z), such that f(x) = y for some element x in Z (domain).
f (x) = y
⇒
⇒
⇒
⇒
always.
For example, if we take, y =
,
=
=
So, x may not be in Z (domain).
Thus, f is not onto.