Chapter 1 Relations and Functions

EXERCISE 1.1
Question 1:
Determine whether each of the following relations are reflexive, symmetric and transitive.
(i) Relation R in the set defined as

(ii) Relation R in the set of N natural numbers defined as

(iii) Relation R in the set as

(iv) Relation R in the set Z of all integers defined as

(v) Relation R in the set A of human beings in a town at a particular time given by
(a)
(b)
(c)
(d)
(e)

Solution:
(i)
R is not reflexive because .
R is not symmetric because .
R is not transitive because .
Hence, R is neither reflexive nor symmetric nor transitive.

(ii)
R is not reflexive because .
R is not symmetric because .
R is not transitive because there isn’t any ordered pair in R such that
.
Hence, R is neither reflexive nor symmetric nor transitive.

(iii)
We know that any number other than 0 is divisible by itself.
Thus,
So, R is reflexive.
 [because 4 is divisible by 2]
But [since 2 is not divisible by 4]
So, R is not symmetric.
Let and . So, y is divisible by x and z is divisible by y.
So, z is divisible by x
So, R is transitive.
So, R is reflexive and transitive but not symmetric.

(iv)
For because is an integer.
So, R is reflexive.
For, , if , then is an integer is an integer.
So,
So, R is symmetric.
Let and , where .
and are integers.
is an integer.
So, R is transitive.
So, R is reflexive, symmetric and transitive.

(v)
a)
R is reflexive because
R is symmetric because ,
If , then and work at the same place and and also work at the
same place. .
R is transitive because,
Let
and work at the same place and and work at the same place.
Then, and also works at the same place. .
Hence, R is reflexive, symmetric and transitive.

b)
R is reflexive because
R is symmetric because,
If , then and live in the same locality and and also live in the
same locality .
R is transitive because,
 Let
and live in the same locality and and live in the same locality.
Then and also live in the same locality. .
Hence, R is reflexive, symmetric and transitive.

c)
R is not reflexive because .
R is not symmetric because,
If , then is exactly taller than and is clearly not taller than
. .
R is not transitive because,
Let

is exactly taller than and is exactly taller than .

Then is exactly taller than .
Hence, R is neither reflexive nor symmetric nor transitive.

d)
R is not reflexive because .
R is not symmetric because,
Let , is the wife of and is not the wife of . .
R is not transitive because,
Let
is wife of and is wife of , which is not possible.
.
Hence, R is neither reflexive nor symmetric nor transitive.

e)
R is not reflexive because .
R is not symmetric because,
Let , is the father of and is not the father of . .
R is not transitive because,
Let
is father of and is father of , is not father of . .
Hence, R is neither reflexive nor symmetric nor transitive.
Question 2:
Show that the relation R in the set R of real numbers, defined as is neither
reflexive nor symmetric nor transitive.

Solution:

because

R is not reflexive.

. But is not less than .

R is not symmetric.

R is not transitive.
R is neither reflective nor symmetric nor transitive.

Question 3:
Check whether the relation R defined in the set as is
reflexive, symmetric or transitive.

Solution:

R is not reflexive.
 R is not symmetric.

R is not transitive.

R is neither reflective nor symmetric nor transitive.

Question 4:
Show that the relation R in R defined as is reflexive and transitive, but not
symmetric.

Solution:

R is reflexive.

R is not symmetric.

R is transitive.
R is reflexive and transitive but not symmetric.

Question 5:
Check whether the relation R in R defined as is reflexive, symmetric or
transitive.

Solution:

R is not reflexive.
 R is not symmetric.

R is not transitive.

R is neither reflexive nor symmetric nor transitive.

Question 6:
Show that the relation R in the set given by is symmetric but neither
reflexive nor transitive.

Solution:

R is not reflexive.

R is symmetric.

R is not transitive.

R is symmetric, but not reflexive or transitive.

Question 7:
Show that the relation R in the set A of all books in a library of a college, given by
is an equivalence relation.

Solution:

R is reflexive since as and have same number of pages.

 R is reflexive.

and have same number of pages and and have same number of pages
R is symmetric.

and have same number of pages, and have same number of pages.
Then and have same number of pages.

R is transitive.

R is an equivalence relation.

Question 8:

Show that the relation R in the set given by is an

equivalence relation. Show that all the elements of are related to each other and all the
elements of are related to each other. But no element of is related to any element
of .

Solution:

R is reflective.

R is symmetric.

is even and is even

is even and is even
is even
 is even

R is transitive.

R is an equivalence relation.

All elements of are related to each other because they are all odd. So, the modulus of
the difference between any two elements is even.

Similarly, all elements are related to each other because they are all even.

No element of is related to any elements of as all elements of are odd and

all elements of are even. So, the modulus of the difference between the two elements
will not be even.

Question 9:
Show that each of the relation R in the set , given by
i.
ii.
Is an equivalence relation. Find the set of all elements related to 1 in each case.

Solution:

i.

R is reflexive.

R is symmetric.

is a multiple of 4 and is a multiple of 4

is a multiple of 4 and is a multiple of 4
is a multiple of 4
is a multiple of 4
 R is transitive.
R is an equivalence relation.

The set of elements related to 1 is as

is a multiple of 4.
is a multiple of 4.
is a multiple of 4.

ii.

R is reflective.

R is symmetric.

R is transitive.

R is an equivalence relation.
The set of elements related to 1 is .

Question 10:
Give an example of a relation, which is
i. Symmetric but neither reflexive nor transitive.
ii. Transitive but neither reflexive nor symmetric.
iii. Reflexive and symmetric but not transitive.
iv. Reflexive and transitive but not symmetric.
v. Symmetric and transitive but not reflexive.

Solution:
i.
 R is not reflexive as
and , is symmetric.

R is not transitive.
Relation is symmetric but not reflexive or transitive.

ii.

R is not reflexive.

R is not symmetric.

R is transitive.
Relation is transitive but not reflexive and symmetric.

iii.

R is reflexive since

R is reflexive and symmetric but not transitive.

iv.

R is reflexive.
 R is not symmetric.

R is transitive.
R is reflexive and transitive but not symmetric
v.
Let Set 𝐴 = {1 , 3 , 5} Define a Relation R
On A.
𝑅∶𝐴 →𝐴
𝑅 = {(1,3) (3,1) (1,1) (3,3)}
Relation 𝑅 is not Reflexive as (5 , 5) ⊄ 𝑅
Relation 𝑅 is Symmetric as
(1,3) ∈ 𝑅 ⇒ (3,1) ∈ 𝑅
Relation 𝑅 is Transitive
(𝑎, 𝑏) ∈ 𝑅 , (𝑏, 𝑐 ) ∈ 𝑅 ⇒ (𝑎, 𝑐 ) ∈ 𝑅
(3,1) ∈ 𝑅 , (1,1) ∈ 𝑅 ⇒ (3,1) ∈ 𝑅
Alternative Answer
𝑅 = (𝑎, 𝑏) ∶ 𝑎 is brother of 𝑏 {suppose 𝑎 and 𝑏 are male}
Ref → 𝑎 is not brother of 𝑎
So, (𝑎, 𝑎) ⊄ 𝑅
Relation 𝑅 is not Reflexive
Symmetric→ 𝑎 is brother of 𝑏 so
𝑏 is brother of 𝑎
𝑎, 𝑏 ∈ R ⇒ (𝑏, 𝑎) ∈ R
Transitive→ 𝑎 is brother of 𝑏 and
𝑏 is brother of 𝑐 so
𝑎 is brother of 𝑐
(𝑎, 𝑏) ∈ 𝑅 , (𝑏, 𝑐 ) ∈ 𝑅 ⇒ (𝑎, 𝑐 ) ∈ 𝑅
Question 11:
Show that the relation R in the set A of points in a plane given by

, is an equivalence relation. Further, show that the set of all points related to a point is
the circle passing through P with origin as centre.

Solution:

Clearly,
R is reflexive.

Clearly R is symmetric.

The distance of and from the origin is the same and also, the distance of and from
the origin is the same.
The distance of and from the origin is the same.

R is transitive.
R is an equivalence relation.

The set of points related to will be those points whose distance from origin is same
as distance of from the origin.

Set of points forms a circle with the centre as origin and this circle passes through .

Question 12:

Solution:

R is reflexive since every triangle is similar to itself.

If , then is similar to .
is similar to .

R is symmetric.
 is similar to and is similar to .
is similar to .

R is transitive.

Corresponding sides of triangles and are in the same ratio.

Triangle is similar to triangle .
Hence, is related to .

Question 13:
Show that the relation R defined in the set A of all polygons as

, is an equivalence relation. What is the set of

all elements in A related to the right angle triangle T with sides ?
Solution:

as same polygon has same number of sides.

R is reflexive.

and have same number of sides.

and have same number of sides.

R is symmetric.

and have same number of sides.

and have same number of sides.
and have same number of sides.

R is transitive.
R is an equivalence relation.
The elements in A related to right-angled triangle (T) with sides are those polygons which
have three sides.
Set of all elements in a related to triangle T is the set of all triangles.

Question 14:
Let L be the set of all lines in XY plane and R be the relation in L defined as
. Show that R is an equivalence relation. Find the set of all lines
related to the line .

Solution:

R is reflexive as any line is parallel to itself i.e.,

If , then
is parallel to .
is parallel to .
 R is symmetric.

is parallel to
is parallel to
is parallel to .

R is transitive.

R is an equivalence relation.

Set of all lines related to the line is the set of all lines that are parallel to the line
.
Slope of the line is .
Line parallel to the given line is in the form , where .
Set of all lines related to the given line is given by , where .

Question 15:
Let R be the relation in the set given by
.
Choose the correct answer.
A. R is reflexive and symmetric but not transitive.
B. R is reflexive and transitive but not symmetric.
C. R is symmetric and transitive but not reflexive.
D. R is an equivalence relation.
Solution:

for every
R is reflexive.

R is not symmetric.

R is not transitive.

R is reflexive and transitive but not symmetric.

The correct answer is B.

Question 16:
Let R be the relation in the set N given by . Choose the correct
answer.
A.
B.
C.
D.

Solution:

Now,

Consider

The correct answer is C.

 EXERCISE 1.2
Question 1:

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-
domain being same as ?

Solution:

is by
For one-one:
such that

is one-one.

For onto:

For there exists such that

is onto.

Given function is one-one and onto.

 Consider function defined by

We have,
is one-one.

is not onto as for there exist any in such that

Function is one-one but not onto.

Question 2:
Check the injectivity and surjectivity of the following functions:
i. given by
ii. given by
iii. given by
iv. given by
v. given by

Solution:
i. For given by

is injective.
 But, there does not exist any in such that
is not surjective
Function is injective but not surjective.

ii. given by

is not injective.

But, there does not exist any such that

is not surjective.
Function is neither injective nor surjective.

iii. given by

is not injective.

But, there does not exist any such that

is not surjective.
Function is neither injective nor surjective.

iv. given by

is injective.

But, there does not exist any in such that

is not surjective
Function is injective but not surjective.
v. given by

is injective.

. But, there does not exist any in such that

is not surjective.
Function is injective but not surjective.
Question 3:
Prove that the greatest integer function given by is neither one-one nor
onto, where denotes the greatest integer less than or equal to .

Solution:
given by

is not one-one.

Consider
is an integer. There does not exist any element such that
is not onto.
The greatest integer function is neither one-one nor onto.

Question 4:
Show that the modulus function given by is neither one-one nor onto,
where is , if is positive or and is , if is negative.

Solution:

is

is not one-one.

Consider
is non-negative. There exist any element in domain such that
is not onto.
The modulus function is neither one-one nor onto.
Question 5:

Show that the signum function given by is neither one-one nor

onto.

Solution:

is

is not one-one.

takes only 3 values for the element in co-domain

R, there does not exist any in domain R such that .
is not onto.

The signum function is neither one-one nor onto.

Question 6:
Let and let be a function from . Show
that f is one-one.

Solution:
,
is defined as

It is seen that the images of distinct elements of under are distinct.

is one-one.

Question 7:
In each of the following cases, state whether the function is one-one, onto or bijective.
Justify your answer.
i. defined by
ii. defined by
Solution:
i. defined by
such that

is one-one.

For any real number in , there exists in such that

is onto.
Hence, is bijective.

ii. defined by
such that

does not imply that

Consider
is not one-one.

Consider an element in co domain .

It is seen that is positive for all .
is not onto.
Hence, is neither one-one nor onto.

Question 8:
Let and be sets. Show that such that
is a bijective function.
Solution:
is defined as .
such that
 is one-one.
there exist such that
is onto.
is bijective.

Question 9:

State whether the function is bijective. Justify your answer.

Solution:

be defined as for all .

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

for some there exists such that

is onto.

is not a bijective function.

Question 10:

Solution:

and defined by
such that

is one-one.

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

Thus, for any , there exists such that

is onto.
Hence, the function is one-one and onto.
Question 11:
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

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
 is one-one.

For any real number in co domain R, there exist in R such that

is onto.
Hence, function is one-one and onto.
The correct answer is A.
 MISCELLANEOUS EXERCISE

Question 1:

Show that function defined by , is one-one and

onto function.

Solution:

is defined by , .
For one-one:

If is positive and is negative,

Since, is positive and is negative,

is negative.

Case of being positive and being negative, can be ruled out.

and have to be either positive or negative.
If and are positive,
 is one-one.

For onto:

Let such that .

If is negative, then there exists such that

If is positive, then there exists such that

is onto.

Hence, is one-one and onto.

Question 2:
Show that function be defined by is injective.

Solution:
is defined by

For one-one:
where

We need to show that

Suppose , their cubes will also not be equal.

This will be a contradiction to .

. Hence, is injective.
Question 3:
Given a non-empty set , consider which is the set of all subsets of .
Define the relation in as follows:
For subsets in , if and only if . Is an equivalence relation on ?
Justify you answer.

Solution:
Since every set is a subset of itself, for all .
is reflexive.

Let
This cannot be implied to .
If and , then it cannot be implied that is related to .
is not symmetric.

If and , then and .

is transitive.

is not an equivalence relation as it is not symmetric.

Question 4:
Find the number of all onto functions from the set to itself.

Solution:
Onto functions from the set to itself is simply a permutation on symbols
.
Thus, the total number of onto maps from to itself is the same as the total number
of permutations on symbols , which is .
Question 5:

Solution:
It is given that ,

Also, is defined by , and .

Hence, the functions and are equal.

Question 6:
Let . Then number of relations containing and which are reflexive and
symmetric but not transitive is,
A.
B.
C.
D.

Solution:
The given set is .
The smallest relation containing and which are reflexive and symmetric but not
transitive is given by,

This is because relation is reflexive as .

Relation is symmetric as .
Relation is transitive as but .
Now, if we add any two pairs and (or both) to relation , then relation will
become transitive.
Hence, the total number of desired relations is one.
The correct answer is A.
Question 7:
Let . Then number of equivalence relations containing is,
A.
B.
C.
D.

Solution:
The given set is .
The smallest equivalence relation containing is given by;

Now, we are left with only four pairs i.e.,

If we odd any one pair [say ] to , then for symmetry we must add . Also, for
transitivity we are required to add and .

Hence, the only equivalence relation (bigger than ) is the universal relation.
This shows that the total number of equivalence relations containing is two.
The correct answer is B.