CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Give examples of two functions f : N → Z and g : Z → Z, such that gof is injective but g is not injective.

Open in App
Solution

Let f : N → Z be given by f (x) = x, which is injective.
(If we take f(x) = f(y), then it gives x = y)

Let g : Z → Z be given by g (x) = |x|, which is not injective.
If we take f(x) = f(y), we get:
|x| = |y|
x = ± y

Now, gof : N → Z.
gof x=g f x=g x=x
Let us take two elements x and y in the domain of gof , such that
gof x=gof yx=yx=y We don't get ± here because x, y ∈N
So, gof is injective.


flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Operations on Sets
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon