“There is no permanent place in the world for ugly mathematics ... . It may be very hard to define mathematical beauty but that is just as true of beauty of any kind, we may not know quite what we mean by a beautiful poem, but that does not prevent us from recognising one when we read it. — G. H. HARDY 1.1 Introduction Recall that the notion of relations and functions, domain, co-domain and range have been introduced in Class XI along with different types of specific real valued functions and their graphs. The concept of the term ‘relation’ in mathematics has been drawn from the meaning of relation in English language, according to which two objects or quantities are related if there is a recognisable connection or link between the two objects or quantities. Let A be the set of students of Class XII of a school and B be the set of students of Class XI of the same school. Then some of the examples of relations from A to B are ~_ i) {(a, b) € Ax B: ais brother of 5}, Lejeune (i) {(a, b) € Ax B: ais sister of b}, (1805-1859) (ii) {(a, b) € A xB: age of a is greater than age of b}, (iv) {(a, b) € Ax: total marks obtained by a in the final examination is less than the total marks obtained by b in the final examination}, (v) {(a, b) € Ax .B: a lives in the same locality as b). However, abstracting from this, we define mathematically a relation R from A to B as an arbitrary subset of AXB. If (a, b) € R, we say that a is related to b under the relation R and we write as @R b. In general, (a, b) € R, we do not bother whether there is a recognisable connection or link between a and b. As seen in Class XI, functions are special kind of relations. In this chapter, we will study different types of relations and functions, composition of functions, invertible functions and binary operations.MATHEMATICS 12 Types — like to study different types of relations. We kno, In this section, we WOU Ax A. Thus, the empty set @ and Ay 4 a is a subset of ' an relation in me io stoseation, consider a relation Rin the set A= {1,2,3, 4) 9° . are 7 10}. This is the empty set, as no pair (a, b) satisfies the Contig R={(@,6).a-0° © : . -|a—b 120} is the whole set A x A. igeSi larly, R’ = {(a, b) :1@ » 8 all py + a a tty |q—b | 2 0. These two extreme examples lead us (5 i (a, following definitions. ae Definition 1 A relation R in a set Ais called empty relation, if no element of Ai related to any element of A, i.e., R=OCAXA. Definition 2 A relation R in a set A is called universal relation, if each element oi is related to every element of A, ie., R=AxA. Both the empty relation and the universal relation are some times called srivi relations. Example 1 Let Abe the set of all students of a boys school. Show that the relation in A-given by R = {(a, b) : ais sister of b} is the empty relation and R’ = {(a,b):te difference between heights of a and b is less than 3 meters} is the universal relation Solution Since the school is boys school, no student of the school can be sister of) cor ate School. Hence, R= 4, showing that R is the empty relation. I's! less than 3 Saterace between heights of any two students of the school has! meters. This shows that R’ = A x A is the universal relation. Remark In Class XI, we of ‘method and set builder have seen two ways of representing a relation, namely R = (@, 6): be method. However, arelation R in the set {1,2,3,4} define bzatiby @ + 1} is also expressed as a R b if and ® Y Many authors: We ° ven @,bER, we say tha may also use this notation, as and when CO” = a is related to b and we denote it as @ Rb. esi relation ee: Which plays a significant role in Math to : ay equivalence relation, we first co" 3Atelation «, .°* Symmetric and transitive. reflective ip Ase A ig rive, if (a; @) ey ' called Symmetric, i¢ 7 1T eve; vif (ag Tyae A, transitive ig!“ © R impli A ig Gaye R sky that (a,, a,) R, for all ay 4 © walt ‘y @)€ R implies that (a,, 4,)€ ® QeRELATIONS AND FUNCTIONS 3 Definition 4 A relation R in a set A is said to be an equivalence relation if R is reflexive, symmetric and transitive. Example 2 Let T be the set of all triangles in a plane with R a relation in T given by R= {(T,,T,) : T, is congruent.to T,}. Show that R is an equivalence relation. Solution R is reflexive, since every triangle is congruent to itself. Further, (1, T,) € R= T, is congruent to T, = T, is congruent to T, => (T,, T,) € R. Hence, R is symmetric. Moreover, (T,, T,), (T,, T,) € R = T, is congruent to T, and T, is congruent to T, => T, is congruent to T, = (T,, T,) € R. Therefore, R is an equivalence relation. Example 3 Let L be the set of all lines in a plane and R be the relation in L defined as R= {(L, L,) : L, is perpendicular to L,}. Show that R is symmetric but neither teflexive nor transitive. Solution R is not reflexive, as a line L, can not be perpendicular to itself, i.e., (L,, L,) € R. Ris symmetric as (L,, L,)¢ R L, = L, is perpendicular to L, => L, is perpendicular to L, L, > “, Lye R. L, R is not transitive. Indeed, if L, is perpendicular to L, and Lis perpendicular to L,, then E, can never be perpendicular to L,, In fact, L, is parallel to L,, ie., (L,, L,).€ R,(L,,L,) € R but (LL, € R. Example 4 Show that the relation R in the set {1, 2, 3} given by R = {(1, 1), (2, 2), (3,3), (1; 2), (2, 3)) is reflexive but neither symmetric nor transitive. Fig Solution R is reflexive, since (1, 1), (2, 2) and (3, 3) lie in R. Also, R is not symmetric, as (1,2) € R but (2, 1) € R. Similarly, R is not transitive, as (1, 2) € Rand (2, 3) € R but (1,3) ¢ R. Example 5 Show that the relation R in the set Z of integers given by R= {(a, b): 2 divides a - b} isan equivalence relation. Solution R is reflexive, as 2 divides (a — a) for alla € Z. Further, if (a, b)é R, then 2 divides a ~b. Therefore, 2 divides b — a. Hence, (b, a) € R, which shows that R is symmetric. Similarly, if (a, 6) € R and (b, c) € R, thena—b and b—c are divisible by 2. Now, a — c= (a — b) + (b —c) is even (Why?). So, (a —c) is divisible by 2. This shows that R is transitive. Thus, R is an equivalence relation in Z.MATICS HE ers are related to zero, as (0, 4 all even integ' : ote as (0, + 1). (0, + 3) et (0, In Example 5, vd integer IS related to 0, as ( (0. ; et, “3 “ 7 aie Hiei? R084 no tegers are related to one and no nad integer ae : january, all Lepore even integers and the set O of all odd integers ane “ fore, the set © ve, . Fratstying flivinecondinn ~ (i All elements of E are related to each other. ; . i) Noelement of Eis related to any element of O and vice-versa, Gi) Eand O are disjoint andZ=EUO. The subset E is called the equivalence class containing zero and is each : {0}. Similarly, Ois the equivalence class containing | and is denoted by [1], Note thy {0)# (1), (0) = [27] and (=[2rt Ihre Z. Infact, what we have seen above iS tne for an arbitrary equivalence relation R ina set X. Given an arbitrary equivaleny relation R in an arbitrary set X, R divides X into mutually disjoint subsets A, cal partitions or subdivisions of X satisfying: (i) all elements of A, are related to each other, for all i. Gi) no element of A, is related to any element of A, . i #j. Gi) UA=Xand A, NA, = Qi #). : ae subsets A, are called equivalence classes. The interesting part of the situation A = ‘we can go reverse also, For example, consider a subdivision of the set Z git three mutually disjoint subsets A, A, and A, whose union is Z with A\s {xe Z:xisa multiple of 3} = {..., 6, —3, 0, 3, 6, -«} fo eee S52 4a 4 = {xe Z:x-2is.a multiple of 3} = -4,-1,2, 5,8.) amt +h other and all elements of O are i edi Define a relation R in Z gi ie arguments similar eu in Z given by R = ((a, b) : 3 divides a — b). Followiag®™ Telation. Also, Ose used in Example 5, we can show that R is an equiva’ - Or Als0, A, coincides wit Coincides with ae es with the set of all integers in Z which are related (0 net th i : Sct ofall integers in Z whi rks which are related to 1 and A. coincides ¥! [A= Bre iy ted to 2, Thus, A, = [0], A eerpei ray LEtR be the Vand A, = (3r+ 2}, forall r€ a eet defined inthe set A = (1, 2.3.4: 5:8.) * Show that a te odd or even}. Show that me eqs : Clement oy the g Clements of ~“lements of the subset {1,3,5,7) are rel 0 ma 0L3.3,7 A (2, 4, 6) are related to each ol ‘ rel ee rt ted to any element of the subset (2: 6 1"RELATIONS AND FUNCTIONS 5 Given any element a in A, both a and a must be either odd or even, so that (a, a) € R. Further, (a, b) € R = both a and b must be either odd or even = (b, a) € R. Similarly, (a, b) € R and (6, c) € R = all elements a, b, c, must be either even or odd simultaneously = (a,c) € R. Hence, R is an equivalence relation. Further, all the elements of {1, 3, 5, 7) are related to each other, as all the elements of this subset are odd. Similarly, all the elements of the subset {2, 4, 6} are related to each other, as all of them are even. Also, no element of the subset {1, 3, 5, 7} can be related to any element of {2, 4, 6), as elements of {1, 3, 5, 7) are odd, while elements of {2, 4, 6} are even, ERCISE 1.1) * Determine whether each of the following relations are reflexive, symmetric and transitive: (@ Relation R in the set A = (1, 2, 3,...., 13, 14} defined as R={(, y):3x-y=0} (ii) Relation R in the set N of natural numbers defined as R= ((x,y):y=x+5 andx<4} Gi) Relation R in the set A = {1, 2, 3, 4, 5, 6} as ; R= ((,y): yis divisible by x} (iv) Relation R in the set Z of all integers defined as R= {(x,y) :x—y is an integer} (), Relation R isi the set of human beings in atown ata particular time given by (a) R= ((x,y): x and y work at the same place} (b) R= {(x, y) :x and y live in the same locality) (¢) R= {(,y) : xis exactly 7 cm taller than y} (d) R= {G, y) :xis wife of y} (ey R= {(, y): xis father of y) 2: Show that the relation R int the set Rof real numbers, defined as R= (a,b) : a 0,1) Show oe ae ie ee transitive. sme eon Rin Nutr fags ant given by R=a(&y)* and y have ges} is an equiva” nee the relation R in the setA={1, 2, 3, 4,5) given by R= {(a, 6): a- bl is even}, is an equivalence relation. Show that aj. elements of (1,3. 5} are related to each other and all the elements of (2,4). related to each other. But noelement of { 1, 3, 5} is related to any element of { Show that each of the relation R in the set A= {xe Z:0SxS 12), givens, (@ R={(a,b):la—blisa multiple of 4} ‘ (i) R= ((a,b):4= 5) is an equivalence relation. Find the set of all elements related to I in each cae Give an example of a relation. Which is (i) Symmetric but neither reflexive nor transitive. (i) 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. Jane given ® s same as thedistance of te Further, show that the set through P with origit® R= {(P, Q) : distance of the point P from the origin i: point Q from the origin}, is an equivalence relation. all points related to a point P # (0, 0) is the circle passing centre. fe dt cds ine A of all triangles as R= ((T 2 Sn ;)+is equivalence relation. Consider three right angle tia" ith sides 3, 4,5, T, with sides 5, 12, 13 and, with sides 6. ® |? : _ among T,,T, and, are related? ») P, and rican R defined in the set A of all polygons 38 B+ . isi pata ae number of sides}, is an equivalence relation. wi ab ae in A related to the right angle triangle T with sides ened? R=((,L. ct . all lines in XY plane and R be the relation ink a pe the set ofall lines man toL,). Show that R is an equivalence — . to the line y = 2x + 4.RELATIONS AND FUNCTIONS 7 15. Let R be 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) Ris reflexive and symmetric but not transitive. (B) R is 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) G,8)ER (C) (6,8)ER (D) (8&,7)ER 1.3 Types of Functions The notion of a function along with some special functions like identity function, constant function, polynomial function, rational function, modulus function, signum function etc. along with their graphs have been given in Class XI. Addition, subtraction, multiplication and division of two functions have also been studied. As the concept of function is of paramount importance in mathematics and among 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 functions. Consider the functions f,,,,f, and f, given by the following diagrams, In Fig 1.2, we observe that the images of distinct elements of X, under the function f, are distinct, but the image of two distinct elements | and 2 of X, under f, is same, namely b. Further, there are some elements like ¢ and fin X, which are not images of any element of X, under, while all elements of X, are images of some elements of X, “ under f,. The above observations lead to the following definitions: Definition 5 A function f: X — Y is defined to be one-one (or injective), if the images of distinct elements of X under f are distinct, i.e., for every x,, x, € X, f( x) = f(x) implies x, = X,, Otherwise, fis called many-one. ‘The function f, and f,in Fig 1.2 (i) and (iv) are;one-one and the function f, and f, in Fig 1.2 (ii) and (iii) are many-one. . Definition 6 A function f : 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 € Y, there exists an element x in X such that f(x) = y. The function f, and f, in Fig 1.2 ii), (iv) are onto and the function f, in Fig 1.2 (i) is Not onto as elements e, f in X, are not the image of any element in X, under fisFig 1.2 (i) to fiv) f:X— Yis onto if and only if Range of f= Y. A function f: X — Y is said to be one-one and onto (or bijective) i} both one-one and onto. The function f, in Fig 1.2 (iv) is one-one and onto. Let Abe the set ofall 50 students of Class X in a'school. Letf:47™* function defined by f(x) = roll number of the student x. Show that fis om" ~ butnot onto, ae No two different students of the class can have same rol! number. The vee = - We'can assume Without any toss of generality that roll mo sg simi that 1 in Nis not roll number of any” neem in nage of any element of X under. Hence, /is™ Show th: a ‘ if onto, lat the furiction f:NN given by f(x) = 2x, is one-on® bi! The function fj 7 fis on fis one-o) ig $0t onto, as for De N there me, for f(x,) =f) = 2, = 2%, 24, af . oa? * Not exist any x in Nsuch that 0) *RELATIONS AND FUNCTIONS 9 Example 9 Prove that the function f: R — R, given by f(x) = 2x, is one-one and onto. Solution fis one-one, as f(x,) = f(x,) = 2x, = 2x, = x, = x, Also, given any real number yin , there exists 3 in Rsuch that f(2)=2. (3) =». Hence, fis onto. Fig 13 Example 10 Show that the function f: NON ny fad. 1, for every x > 2, is onto but not one-one. Solution fis not one-one, as f(1) =f (2) = 1. fi Fis ont verging a) ye Ny¥l, we can choose x as y + 1 such that f(y + puget! : y-Blso for 1 € N, we have f(1) = 1. : Example I Show that the function f: R > R, defined as f(x) ay, 4s neither one-one ner ont, Solution. Since fe > 1 =f), fis not a one, Also, the element — 72 in the co-demain Ri Po ieee aves Ste R: (Why?). Therefore fis not onts. Example 12 Show that NN, give ye i a +Lif.xis odd, : ' x) a Ete SCE hif risoven voc" Thedmage of 1 and-1 under f is 1. is both one-one andionto, : FigMATHEMATICS i if x, is odd and x, is even, the te that if x, 2ftz,)-No cea We * ible. Similarly, the possipiy.,* Wily se f(x) ich is impossible. ly, t ibility gry ee %4-%1 =o wi wale out, using the similar argument nN = 5 n also even. Suppose both x, and 4 are oat © x24, Similarly, if both x, and x, are eyen 7h, cha ont lent] "2 thus, fis one-one. Aiso, any eg foafey7% ~j2n- 1 Phe 2in the domain N and Odd ny, fos) =F) > A ain Nis the mage of 2r + 21 2 ANY even ‘2r+ 1 inthe CN js the image of 27 - 1.in the domain N. Thus, fis onto: in the co-dor = : shi Show that an onto furition f (1,2, 3} .{1, 2, 3} is always Oey , 4 ‘ n there exists two elements, say 1 fis not one-one. The ‘ and Din Solution Suppose in the co-domain is same. Also, the image of 3 under So domain peotaewcee the range set can have at the most two elements only one - 1,2,3}, showing that is not onto, a contradiction. Hence, Ftmust be cree Example 14Show that a one-one function f: {1, 2,3} > {1, 2, 3} must be on Solution Since fis one-one, three elements of {1, 2, 3} must be taken to 3 dif elements of the co-domain {1, 2, 3} under f. Hence, f has to be onto. Remark The results mentioned in Examples 13 and 14 are also true for an arbite, finite set X, ie., a one-one function f : X — X is necessarily onto and an onto mp f:X~ Xis necessarily one-one, for every finite set X. In contrast to this, Example! and 10 show that for an infinite set, this may not be true. In fact, this is a charactets difference between a finite and an infinite set. 1. Show thatthe function f: R, > R, defined by f(x) = — is one-one aol x where R, is the set of all non-ze; -ethe dott oe -Zero real , if the R, is replaced by N with cond numbers. Is the result true, i lomain bein; 2 2 Check the injectivity and su ig same as R, 3 ‘ ijectivity of the fi owii ions: @ f:Non sive by fee Se ¢ following functions Biven by f(a) = 2 Biven by f(x) = 32 t Inte : sot! one-one nor Onto, Where la Function if: R> R, given by f= [x ‘a 1! Aenotes the greaiest integer less than ofIl. 12, RELATIONS AND FUNCTIONS IL - Show that the Modulus Function f; R — R, given by f(x) = |.xl, is neither one- one nor onto, where |x| is x, if x is positive or 0 and |x| is —x, if x is negative. . Show that the Signum Function f: R — R, given by Lifx>0 S(x)=40, if x=0 Lif x<0 is neither one-one nor onto. Let A= {1, 2, 3}, B= (4,5, 6, 7} and let f= {(1, 4), (2, 5), (3, 6)} be a function from A to B. Show that fis one-one In each of the following cases, state whether the function is one-one, onto or bijective. Justify your answer. (@) f: R > R defined by f(x) = 3 - 4x (ii) f: R > R defined by f(x) = 1+.° Let A and B be sets. Show that f: A x B — B x A such that f(a, b) = (b, a) is bijective function. 241 if nisodd Let f : N — N be defined by f(n) = for allne N. =, if miseven 2 State whether the function f is bijective. Justify your answer. Let A =R - {3} and B = R= {1}. Consider the function f: A> B defined by -2 f@= (=). Is f one-one and onto? Justify your answer. = Let f: R — R be defined as fix) = x*, Choose the correct answer. (B) fis many-one onto (A) fis one-one onto (D) fis neither one-one nor onto, (C) fis one-one but not onto Let f: R > R be defined as f(x) = 3x. Choose the correct answer. (B) fis many-one onto (A) fis one-one onto (D) fis neither one-one nor onto. (C) fis one-one but not ontoip MATHEMATICS j invertible Mune snetions and Invert ; tion of Functions two functions. Then the compo«;. 14 eT A>Bandg:B ga eed gof: A->C given by mtg Definition § is defined as : fand 8 denoted by gaf, gof(x) =8F@)» V ¥ eA. if pete ag Fig 5 ; dg: (3,4, 5,9} (7, I, 15} a F 5} > (3, 4,5, 9} an a 2 alae l2.3+h = f(5) = 5 and g (3) = e(4)=7ai functions defined as fQ) = 3,f@) = 4.f4) = £6) = 5 and g = = 11. Find gof. . g(5)= g(9)= 11. Find ge : Sgt 7 = 3) = g FG) =28l tion We have gof(2) = g(f(2)) = g(3) = 7, gof(3) = 8 i — = (5)= 11 and gof(5) = (5) =I. gof(4)= g(f(4)) = g(5) = 11 and g ae Example 16 Find gof and fog, iff: R-> Rand g:R — Rare given by. and g(x) = 3x2. Show that gof # fog. ty Solution We have gof(x) = g(f(x)) = g(cos x) = 3 (cos x) = 2 oe He fog(x) = f(g (x) = fx) = cos (3x7). Note that 3cos? x # cos 3x’, bof # fog. : watatusis Definition 9A function f: X ~ Y is defined to be invertible, if there Ge aft 8:¥—>Xsuch that gof=I, and fog = 1,. The function g is called the inver is denoted by f-!. it wing? nto then f must be invertible: This fact significantly helps for mee be invertible by showing that fis one-one and onto, specially ¢ of fis hot to be determined. Example 17 Let f: N >Ybea Y=(yeNzy ' 1 : Thus, iff is invertible, then f must be one-one and onto and converse one-one and function f to actual invers function defined as f(x) = 4x-+ 3, whet = 4r-+3 for some.x N). Show that is invertible. Find : aw element y of ¥.’By the definition of ¥+) for some x in the domain N, This shows that = he ive Solution Consider an arbitrary tyRELATIONS AND FUNCTIONS 13, (4x+3-3) _ and gQ)= « Now, gof(x) = g (f(x) = g(4x + 3) = +3 =y—343-=y. This shows that gof =, fog) =f) = (2 w=). 40-3) 4 4 and for ~ 1, which implies that fis invertible and g is the inverse of f. fisceilan f Example 18 If R, and R, are equivalence relations in a set A, show that R, 0 R, is also an equivalence relation. Solution Since R, and R, are equivalence relations, (a, a) € R,, and (a,a)€ R, Vae A. This implies that (a, a) € R, A R,, Va, showing RO R, is reflexive. Further, (a,b) € RAR, = (a,b) € R, and (a,b) € R, = (b, a) € R, and (b, a) R, => (b, a) € R, OR, hence, R, 0 R, is symmetric. Similarly, (a, b) € R, 0 R, and_ 0) € RAR, = (a,c) € R, and (a, c) € R, > (a,c) € R,OR,, This shows that R, OR, is transitive. Thus, R, R, is an equivalence relation. Example 19 Let R be a relation on the set A of ordered pairs of positive integers defined by (x,y) R (u, v) if and only if xv = yu. Show that R is an equivalence relation. Solettion Clearly, (x, y) R @; y), v @ y) € A, since xy = yx. This shows that R is reflexive. Further, (x, y) R (u, v) => xv = yu => uy = vx and hence (u, vy R (x, y). This shows that R is symmetric. Similarly, (x, y) R (u, v) and (u, v) R (a, b) => xv = yu and ba ub=va=> w 2= y= eee = xb = ya and hence (x, y) R (a, b). Thus, R u u 4 is transitive. Thus, R is an equivalence relation. Example 26 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 yf yy} C11, 4, 7}} or {x,y} € (2, 5, 8} or {x,y} C {3, 6, 9}}. Show that Sojation Note that the characteristic of sets {1, 4, 7}, {2, 5, 8} and (3, 6, 9) is that difference between any two elements of these sets is a multiple of 3. Therefore, @& y) eR, > x- y is a multiple of 3 => {x,y} ¢ (1, 4, 7} or {x,y} € (2, 5, 8} or {x,y} {3,69} > @ye R, Hence, R, CR, Similarly, {x, y} € R, => {x, ymarion 3,6, 9} > x~y ig g {xy} € (3.6 Y is divjg 2, 5, 8} OF ‘ R, =R; “ible, rr tion. Define a relation R in X given . ether R is an equiva’-nce relation o, a x. since f(a) = f(a), oe be Ris Fefley, ae b) = fla 5 S ie Fe every = fla) =f) =f) = f(a) nee - . Therefor, x Similars (DE Thy e Rand (b, 6) € R=9 f(a) = f(b) and f( = fear ee ‘which implies that R is transitive. Hence, R is an equiva =f >@ relation. Example 22 ees Solution One-one function from {1, 2, 3} to itself is simply a permutation On three symbols 1, 2, 3. Therefore, total number of one-one maps from ( 1,2, 3} to itself, oat as total ‘qumber of permutations on three symbols 1, 2, 3 which is 3! = 6. Example 23 Let A= {1,2, 3}. Then show that the number of relations Containing (1,9) and (2, 3) which are reflexive and transitive but not symmetric is three. x 9 Y be a fun 2iLetf: amine WI m((a, bY. fia) = RO)I- EX R={(a, 0): fi eneR Find the number of all yne-one iunctions from set A = {1, 2, 3} t0 ita Solution The smallest relation R, containing (1, 2) and (2, 3) which is reflexive ani transitive but not symmetric is {(1, 1), (2, 2), (3, 3), (1,2), (2, 3), (1, 3)}. Now, if weadd the pair (2, 1) to R, to get R, then the relation R, will be reflexive, transitive but na symmetric. Similarly, we can obtain R, by adding (3, 2) to R, to get the desired relation. However, we can not add two Pairs (2, 1), (3, 2) or single pair (3, 1) to R, ata time, by: doing So, we will be forced to add the remaining pair in order to maintain transitivity and in the process, the relation will become symmetric also which is not required. Thus the total number of desired relations is three. ie Examiple 24 Show that the . Sah = (1,2)and Q, 1) is tye, number of equivalence elation in the set {1, 2,3} containing one aioe i ening relation R, containing (1, 2) and (2, 1) is {( i es }. Now we are left with only 4 pairs namely (2, 3), 3.7) fr tansy 23) R, then for symmetry we ms! ot ity We are forced to add (1, 3) and (3, 1). Thus, the od Wvalence relationg oo! ee Universal relation, This shows that the ming (1, 2) and (2, 1) is two. ’ ty function |. oN Tyis onto but 1°" Wy tN > N defined as ly (ax? n+ N defined as *X+x= 2x is not onto.RELATIONS AND FUNCTIONS 15 Solution Clearly I, is onto. But I, + I, is not onto, as we can find an element 3 in the co- domain x such that there does not exist any x in the domain N with dy +1) @) = Example 26 Consider a function f : [oF] sR eiven by f(x) = sin x and » eiven by g(x) = cos x. Show that f and g are one-one, but f + g is not Solution Since for any two distinct elements x, and x, in [03] . sin x, # sin x, and cos x, # cos x,, both f and g must be one-one. But (f + g) (0) = sin 0 + cos 0 = I and 8 T (f+ (2) = sin +c085-=1. Therefore, f+ gis not one-one. Miscellaneous Exercise on Chapter I : 1. Show that the function f: R > {xe R:—1 B and g: AB such that f(a) = g(@) vae A, are called equal functions),. %. In this chapter, we s' composition of functions, invertible MATHEMATICS ber of relations containing (1, 2) and (1, 3) Whi {1,2,3}- Then num ih ap tae and symmetric but not transitive is (A) 1 (B) 2 (C) 3 (D) 4 Let A= (1, 2,3}. Then number of equivalence relations containing (1, is (A) 1 (B).2 (C) 3 (D) 4 Summary tudied different types of relations and equivalence Telation, fr-.clions and binary operations. The main feature, of this chapter are as follows: ° eee Sa o ¢ Empty relation is the relation Rin. X given by R= C XXX. Universal relation is the relation R in X given by R = X x X. Reflexive relation R iu X is a relation with (a, aye R yaeX. Symmetric relation. X is a relation satisfying (a, b) € R implies (b, a) € R. Transitive relation R in X is a relation satisfying (a, b) € R and (b,c)e R implies that (a,c) € R, Equivalence relation R in X is a relation which is reflexive, symmetric and transitive. Equivalence class {a] containing a € X for an equivalence relation R in X is the subset of X containing all elements b related to a. A function f : X > Y is one-one (or injective) if SO) = fla) = x, =x, V x, x, € X. A functions : X + Y:is onto seat teins $ (or ich that f(a) = y. (or surjective) if given any y e Y, dre Xsu A function f: a pees ction f : X + Y is one-one and oxto,tor bijective), if fis both ‘one-one and onto. a ere of functions f : 4 ay B and g: B > C is the function Sof AC given by gof(t) = gifQ))Y xe A. A function f.: a f:X% 9 Vis invertible if 3 g : Y + X such that gof fog =l,. =I, and A function f: X bag S:X 9 Y is invertible if and only if fis one-one and ont