0% found this document useful (0 votes)
4 views5 pages

chapter1relationfunctionsEX1 2solnforprint

The document discusses various mathematical functions, specifically focusing on their properties of being one-one (injective) and onto (surjective). It includes multiple questions and solutions that analyze the injectivity and surjectivity of different functions, including the greatest integer function and the modulus function, ultimately concluding that many of these functions are neither one-one nor onto. The document also poses questions regarding specific functions and provides answers based on their defined properties.

Uploaded by

haneshoffc
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views5 pages

chapter1relationfunctionsEX1 2solnforprint

The document discusses various mathematical functions, specifically focusing on their properties of being one-one (injective) and onto (surjective). It includes multiple questions and solutions that analyze the injectivity and surjectivity of different functions, including the greatest integer function and the modulus function, ultimately concluding that many of these functions are neither one-one nor onto. The document also poses questions regarding specific functions and provides answers based on their defined properties.

Uploaded by

haneshoffc
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

EXERCISE 1.

2 Consider function defined by

Question 1: We have,
is one-one.
Show that the function defined by is one –one and onto, where is the set
of all non –zero real numbers. Is the result true, if the domain is replaced by N with co- is not onto as for there exist any in such that

domain being same as ? Function is one-one but not onto.

Solution:

is by
For one-one:
such that
Question 2:
Check the injectivity and surjectivity of the following functions:
i. given by
ii. given by

is one-one. iii. given by


iv. given by
For onto:
v. given by
For there exists such that
Solution:
i. For given by

is onto. is injective.

Given function is one-one and onto.


But, there does not exist any in such that
Question 3:
is not surjective
Function is injective but not surjective. Prove that the greatest integer function given by is neither one-one nor
onto, where denotes the greatest integer less than or equal to .
ii. given by
Solution:
is not injective. given by

But, there does not exist any such that


is not surjective. is not one-one.
Function is neither injective nor surjective.
Consider
iii. given by is an integer. There does not exist any element such that
is not onto.
The greatest integer function is neither one-one nor onto.
is not injective.

But, there does not exist any such that Question 4:


is not surjective.
Show that the modulus function given by is neither one-one nor onto,
Function is neither injective nor surjective.
where is , if is positive or and is , if is negative.
iv. given by
Solution:

is injective. is

But, there does not exist any in such that


is not one-one.
is not surjective
Function is injective but not surjective. Consider
v. given by is non-negative. There exist any element in domain such that
is not onto.
The modulus function is neither one-one nor onto.
is injective.

. But, there does not exist any in such that


is not surjective.
Function is injective but not surjective.
Question 5:
Solution:
i. defined by
Show that the signum function given by is neither one-one nor such that
onto.

Solution:

is one-one.

is
For any real number in , there exists in such that
is not one-one. is onto.
Hence, is bijective.
takes only 3 values for the element in co-domain
ii. defined by
R, there does not exist any in domain R such that .
is not onto. such that

The signum function is neither one-one nor onto.

Question 6: does not imply that


Let and let be a function from . Show
that f is one-one. Consider
is not one-one.
Solution:
, Consider an element in co domain .

is defined as It is seen that is positive for all .


is not onto.
Hence, is neither one-one nor onto.
It is seen that the images of distinct elements of under are distinct.
is one-one.
Question 8:
Question 7: Let and be sets. Show that such that is a bijective function.
In each of the following cases, state whether the function is one-one, onto or bijective.
Justify your answer. Solution:
i. defined by is defined as .
ii. defined by such that
Question 10:

is one-one.
Let and defined by . Is one-one and onto?
there exist such that Justify your answer.
is onto.
is bijective. Solution:

and defined by
Question 9:
such that

Let be defined as for all . State whether the


function is bijective. Justify your answer.

Solution:
is one-one.

be defined as for all . Let , then


The function is onto if there exists such that .
Now,

is not one-one.

Consider a natural number in co domain .

Case I: is odd
for some there exists such that

Case II: is even Thus, for any , there exists such that
for some there exists such that

is onto.

is not a bijective function. is onto.


Hence, the function is one-one and onto.
is one-one.

Question 11:
Let defined as .Choose the correct answer. For any real number in co domain R, there exist in R such that
A. is one-one onto is onto.
B. is many-one onto Hence, function is one-one and onto.
C. is one-one but not onto The correct answer is A.
D. is neither one-one nor onto

Solution:
defined as
such that

does not imply that .


For example
is not one-one.

Consider an element 2 in co domain there does not exist any in domain such that
.
is not onto.
Function is neither one-one nor onto.
The correct answer is D.

Question 12:
Let defined as .Choose the correct answer.
A. is one-one onto
B. is many-one onto
C. is one-one but not onto
D. is neither one-one nor onto

Solution:
defined as
such that

You might also like