EXERCISE 1.

1
1. Determine whether each of the following relations are reflexive, symmetric and
transitive:
(i) Relation R in the set A =
{1, 2, 3, 13, 14) defined
.., as
R= {x, y): 3x -y =
0}
(i) Relation R in the N of natural numbers defined
set as
R= {(, y) : y =x + 5
x < 4]
(i) Relation R in the set A ={1, 2,3, 4, 5,6} as
and
R={.y): y is divisible by x}
(iv) Relation R in the set Z of all integers defined as
R= {(r, y):x-y is an integer)
(v) Relation R in the set A of human beings in a town at a
particular time given by
(a) R {(x, y) :x and y work at the same
=

place
(b) R =
{(«, y): x and y live in the same locality}
(c) R= {(x. y):r is exactly 7 cm taller than y}
(d) R= {r, y) : x is wife of y}
(e) R= {(, y):x is father of y}
2. Show that the relation R in the set R of real numbers, defined as
R= {(a, b): a Sb} is neither
reflexive nor symmetric nor transitive.
3. Check whether the relation R defined in the set { 1, 2,3, 4, 5,6} as
R= {(a, b): b = a + 1} is reflexive, symmetric or transitive.
4 Show that the relation R in R defined as R = {(a, b): a <b], is reflexive and
transitive but not symmetric.
5. Check whether the relation R in Rdefined by R = {(a, b) :a Sb'} is reflexive,
symmetric or transitive.

2019-20
 MATHEMATICS

6. Show that the relation R in the set

{1, 2, 3} given by R =
{(1, 2), (2, 1)} is
symmetric but neither reflexive nor transitive.
Show that the relation R in the set A of all the
books in a library of a college,
given by R =
{(x, y):x and y have same number of
relation. pages} is an equivalence
8. Show that the relation R in the
A ={1,2,3, 4, S) given by
set
R {(a, b) la
:
- bl is even), is an equivalence relation. Show
that all the
elements of {1,3,5} are related to each other and all the
elements of {2, 4} are
related to each other. But no element of
{1,3, 5} is related to any element of {2,4}.
9. Show that each of
the relation R in the e set A ={x Z:0<xS 12}, given by
(i) R= {(a, b): la-bl is a
multiple of 4}
() R= {(a, b): a = b}
is an
equivalence relation. Find the set of all elements related to l in each case.
0. Give an
example of a relation. Which is
G) Symmetric but neither reflexive nor transitive.
(i) Transitive but neither reflexive nor symmetric.
(ii) Reflexive and symmetric but not transitive.
(iv) Reflexive and transitive but not symmetric.
(v) Symmetric and transitive but not reflexive.
I1. Show that the relation R in the set A of
points in a plane given by
R= {(P, Q): distance of
the point P from the origin is same as the distance of the
point Q from the origin), is an equivalence relation. Further, show that the set of
all points related to a point P + (0, 0) is the circle passing through P with origin as
centre.

2. Show that the relation R defined in the set A of all triangles as R ={(T, T,) : T,
is similar to T,}, is equivalence relation. Consider three right
angle triangles T,
with sides 3, 4, 5, T, with sides 5, 12, 13 and T, with sides 6, 8, 10. Which
triangles among T. T, and T, are related?
3. Show that the relation R defined in the A
set of all polygons as R =
{(P,, P,):
P, and P, have same number of sides }, is an equivalence relation. What is the
set of all elements in A related to the right angle triangle T with sides 3, 4 and 5?
4. Let L be the set of all lines in XY plane and R be the relation in L defined as
R= {(L, L):L, is parallel to L,}. Show that R is an equivalence relation. Find
the set of all lines related to the line y = 2r +4.

2019-20
 RELATIONS AND FUNCTIONS
5. Let Rbe the
relation in the set {1,2,3,4} given by R= {(1,2),(2,2). (1, 1), (4,4).
(1,3), (3, 3), (3, 2)}. Choose the
correct answer.
(A) Risreflexive and symmetric but not transitive.
(B) Ris reflexive and transitive but not
symmetric.
(C) Ris symmetric and transitive but not reflexive.
(D) Ris an equivalence relation.
16. Let R be the relation in the set Ngiven by R= {(a,
b): a=b-2,b>6). Choose
the correct answer.

(A) (2,4) eR (B) (3,8)e R (C) (6,8) e R (D) (8,7) e R

3 Types of Functions
he notion of a function along with some special functions like identity function, constant
unction, polynomial function, rational function, modulus function, signum function etc.
long with their graphs have been given in Class XI.
Addition, subtraction, multiplication and division of two functions have also
been
tudied. As the concept of function is of
paramount importance in mathematics and
mong other disciplines as well, we would like to extend our study about function from
where we finished earlier. In this section, we would like to study different types of
unctions.
Consider the functions fff, andf, given by the following diagrams.
In
Fig 1.2, we observe that the
images of distinct elements of X, under the function
are distinct, but the image of two distinct elements 1 and 2 of under is same,
X,
namely b. Further, there are some elements like e and fin X, which are notf,images of
any element of X, underf. while all elements of X, are images of some elements of X,
inderf. The above observations lead to the following definitions:
Definition 5Afunctionf: X-> Yis defined to be one-one (or injective), if the images
of distinct elements of X under f are distinct, i.e., for every X, , E X, fr,) =fr)
mplies x, =x. Otherwise, fis called many-one.
The functionf, andf, in Fig 1.2 (i) and (iv) are and the
in Fig 1.2 Gi) and (ii) are many-one.
one-one
functionf, and f
Definition 6 A functionf: X > Y is said to be onto (or surjective), if every element
of Y is the image of some element of X under f, i.e., for every y e Y, there exists an
element x in X such that f(r) = y.
The functionf, andf, in Fig 1.2 (ii), (iv) are onto and the functionf, in Fig 1.2 (i) is
not onto as elements e,fin X, are not the image of any element in X, underf

2019-20
 EXERCISE 1.2
1. Show that the function f: R, -R, defined by flx) = is one-one and onto,

where R, is the set of all non-zero real numbers. Is the result true, if the domain
R, is replaced by N with co-domain being same as R,?
2. Check the injectivity and surjectivity ofthe following functions:
) S:N N given by f ) =*
c) f:Z>Z given by fa) =*
(i) f: R-R given by fl) = *
(iv) f: NN given by fx) =r*
()f:Z Z given by flx) =*
3. Prove that the Greatest Integer Functionf: R-> R. given byf l ) = [a], is neither
one-one nor onto, where [x] denotes the greatest integer less than or equal to x.

2019-20

RELATIONS AND FUNCTIONS

Show that the Modulus Functionf: R->R, given by fx) = lxl, is neither one-
4.
one nor onto, where Ilxlis x, if x is positive or 0 and Irl is - x, if r is negative.

. Show that the Signum Functionf: R->R. given by

(1 if x>0
Sx)={0,if r=0
1 , if x<0

is neither one-one nor onto.

be function
6. Let A={1,2.3), B =
{4,5,6, 7} and letf= {(1,4). (2,5), (3, 6)} a

from A to B. Show that fis one-one.

the function is one-one, onto or
7. In each of the following cases, state whether

bijective. Justify your answer.

3 4x
) f: R > R defined by fx)
-
=

i) f: R - R defined by fx) = 1 +* is
Show that f: A x B >BxA such that f(a, b) =
(b, a)
8. Let A and B be sets.

bijective function.

i f nis odd for all n e N.

9. Letf: N > N be defined by fn) =

i f nis even
State whether the function fis bijective. Justify your
answer.

function f: A > B defined by

10. Let A =R- {3} and B R- {1}. Consider
=
the
8. Let A and B be sets. Show that f: A B B
x > x A such that fla, b)
bijective function.
=(b, a) is

i ffnis odd
9. Letf: N»N be defined by f(n) =
for all n E N.
,if n is even

State whether the function fis bijective. Justify your answer.

10. Let A=R- {3} and B =
R-{1}.Consider the function f:A > B defined by
s= . Is fone-one and onto? Justify your answer.

11. Letf: R> R be defined as flx) = x. Choose the corect answer.

(A) fis one-one onto (B) fis many-one onto
(C) fis one-one but not onto (D) fis neither one-one nor onto.
12. Let f: R> R be defined as fx) = 3r. Choose the correct answer.
(A) fis one-one onto (B) fis many-one onto
(C) fis one-one but not onto (D) fis neither one-one nor onto.

2019-20
 EXERCISE 1.3
1. Letf: {1, 3, 4) >{1, 2.5)
and g :{1,2,5)>{1,3) be given by
f= {(1,2). (3, 5), (4, 1)} and g =
{(1,3), (2, 3), (5, 1)}. Write down gof
2. Letf. g and h be functions from R to R. Show that

f+ 8)oh = foh + goh

. 8)oh = foh) . (goh)

3. Find gof and fog. if

) Su) =
Ix land glr) =I 5x -21
i ) f t ) = 8x and g ) = x3.

(4x+3)
4. If fx) = show that fof(x) = x, for all x * . What is the
(6x-4) **3
inverse off?
5. State with reason whether following functions have inverse

f:1,2,3, 4){10} with

f= {(1, 10), (2, 10). (3, 10), (4, 10)
ci) g: {5,6,7,8] {1,2,3,4) with
8=(6,4), (6, 3). (7,4). (8, 2)}
ii) h: {2,3, 4, 5)> {7,9, 11, 13) with
h 1(2,7). (3,9), (4, 11), (5, 13))

6. Show thatf: -1, 1]>R. givenby f ) = is one-one. Find the inverse

+

of the functionf: -1, 1] > Range f.

(Hint: Forye Rangef. in [-1, 1], i.e., X 2y

y=f)=4+2.1or some x =

(1-y)
(1-y)
7. Considerf: R >R given byflx) = 4x +3. Show that fis invertible. Find the
inverse off.
8. Considerf: R,-> [4, ) given byf) = r?+4. Show thatfis invertible with the
inversef offgiven byf0) =yy-4, where R, is the set of all non-negative
real numbers.

2019-20
 9x?+6r-5. Show thatfis invertible
R, >-5, co)givenby flr)
=

9. Considerf:

w i t h 9 ) = W y + 6 ) - 1

3
function. Show unique inverse.
that fhas
10. Letf: X-> Y be an invertible Then for all y e Y,
are two inverses off.
(Hint: suppose g, and g,
fos,()) 1,0) fog,0).
= Use one-one ness
= of f.
Find
11. Considerf: {1, 2, 3] > {a, b, c} given byf(1) =
a.f2) = b andf(3) = c.

f and show that f ) ' = f .

function. Show that the inverse of f - isf, i.e.,
12. Letf:X> Ybe an invertible
) ' = f.

13. Iff: R >R be given by flx) =

(3-x)", thenfof (t) is
(D) (3 - r).
(A) (B) x3 (C)

R be a function defined as fr)= 4x The inverse of

14. Letf: R- 3x+4

Sis the map g: Rangef R- given by

3y (B) 8 4-3y
4y
(A) 8 3-4y

3y
(C) 8(y)
-* =
(D) 8)4-3y
3-4y

1.5 Binary Operations

fundamental operations
Right from the school days, you must have come across four
The main feature of these
namely addition, subtraction, multiplication and division.
we associate another numbera +b
perations is that given any two numbers a and b,
a
b ab b+0. It is to be noted that only two numbers can be added or
or a -
or or ,
numbers
multiplied at a time. When we need to add three numbers, we first add twosubtraction
and the result is then added to the third number. Thus, addition, multiplication,

2019-20

20 MATHEMATICS

nd division are examples of binary operation, as "binary' means two. If we want to

ave a general definition which can cover all these four operations, then the set of
umbers is to be replaced by an arbitrary set X and then general binary operation is
othing but association of any pair of elements a, b from X to another element of X.
his gives rise to a general definition as follows:
1.
Determine whether or not EXERCISE 14
each of the
operation. In the event that definition of given below
*
* is not gives a
(i) On Z, define
a
binary operation, give binary
*
by a *
b =a -
b justification for this.
(i) On Z, define *
by a * b =
ab
(ii) On R, define *
by a * b = ab?
(iv) On 2Z', define *
by a * b =
la -

bl
(v) On Z, define *
by a * b =a
2. For each
operation
or associative.
*
defined below, determine
whether* is binary, commutative
(i) On Z, define a
*b=a- b
i) On Q. define a * b =
ab + 1

ii) On Q, define a * b =

iv) On 2Z', define a * b =

2uh
(v) On Z', define a *b = a*

(vi) On R a
-

{-1}, define a *b=

b+1
3. Consider the binary operation a on the set { 1, 2, 3, 4, 5} defined by
a ab= min {a, b}. Write the
operation table of the operation a.

2019-20
 4. Consider a binary operation* the
on set {1, 2, 3, 4, 5) given by the following
multiplication table (Table 1.2).
i) Compute (2 * 3) * 4 and 2 *
(3 *
4)
(i) Is * commutative?
(ii) Compute (2 * 3) * (4 * 5).
(Hint: use the following table)
Table 1.2

2
1|
2 1
13 1
2

5. Let *' be the

binary operation on the set {1, 2, 3, 4, 5} defined by
a*b= H.C.F of a and b. Is the operation * same as the operation * defined
in Exercise 4 above? Justify your answer.
6. Let * be the binary operation on N given by a *b =L.C.M. of a and b. Find

i) 5*7, 20 16 (ü) Is * commutative?

(i) Is * associative? (iv) Find the identity of * in N
(V) Which elements of N are invertible for the operation*?
7. Is defined on the set {1, 2, 3, 4, 5} by a *
b =L.C.M. ofa and b a binary
operation? Justify your answer.
8. Let be the binary operation on N defined by a * b = H.C.F. of a and b.
Is * Is * associative? Does there exist identity for this binary
commutative?
operation on N?
9. Let * be a binary operation on the set Q of rational numbers as follows:
(i) a * b =a - b (ü) a * b =a + b
(i) a *b=a + ab (iv) a * b =(a - b)

ab
(v) a * b 4 (vi) a * b =ab
Find which of the binary operations are commutative and which are associative.
10. Find which operations given above has identity.
ofthe
11. Let A = NxNand * be the binary operation on A defined by
(a, b) * (c, d) = (a + C, b+ d)

2019-20
26 MATHEMATICS

identity element for

* on
commutative and associative. Find
the
Show that * is
A, if any.
following statements are true or false. Justify.
12. State whether the
* on a set N, a * a a Va e N. =

(i) For arbitrary

an binary operation
operation on N, thena* (b
*
c) = (¢ * b) *a
i) If* is a commutative binary
* b =a'+ b'. Choose the
13. Consider a binary operation * on N defined
as a
correct answer.

both associative and commutative?

(A) Is *

commutative but not associative?

(B) Is *

(C) Is * associative but not commutative?

Is neither commutative nor associative?

(D) *

Miscellaneous Examples
equivalence relations in a set A, show that R, nR, is
Example 41 If R, and R, are

also an equivalence relation.

and (a, a) e R, Va e A.
Solution Since R, and R, are equivalence relations, (a, a) R,,
e

reflexive.
showing R,n R, is Further,
This implies that (a, a) e R,n R, Va,

(a, b) e R,nR, > (a, b) e R, and (a, b) e

R, > (b, a) e R, and (b, a) E R, »
(b, a) e R, nR, hence, symmetric. Similarly, (a, b) e R, n
R, n R, is R, and
b, c) e R, OR, (a, c) ¬ R, and (a, c) e R, (a, c) e R,nR. This shows that
R,OR, is transitive. Thus, R, n R, is an equivalence relation.

Example 42 Let R be a relation on the set A of ordered pairs of positive integers

relation.
defined by (x, y)R (u, v) if and only if rv yu. Show that R is an equivalence
=

Solution Clearly, (x, y) R (x. y), y(x, y) e A, since xy yx. This shows that R is
=

reflexive. Further, (r, ) R (u, v) a v = yu => uy = Vx and hence (u, ) R (&. y). This
shows that R is symmetric. Similarly, (r, y) R (u, v) and (u, v) R (a, b) ®w= yu and

ub = va v = yu n = yua xb = ya and hence (x, y) R (a, b). Thus, R

u

is transitive. Thus, R is an equivalence relation.

Example 43 Let X = {1, 2, 3, 4, 5, 6, 7, 8, 9}. Let R, be a relation in X given
by R, = {(«, y) :x - y is divisible by 3} and R, be another relation on X given by
R, ={(«,y):{x,y} e {1,4, 7}} or {x,y} e {2,5, 8} or {x,y} c(3,6,9}}. Show that
R, = R.

2019-20