. yethatif kK stemware + jy Now we shal Gi) No’ aE R a, R DER (as Ris transitive) 2) E R | io . é Soe R (as Ris symmetric) = Ris circular = ion if R is reflexive, symmetric and trangiy, 7 te RE tbe an equivalence relation if R is ret relat tA is sai a ‘A relation R on a sel sitive, ivalence relation we shall hays i iven set to be an equiv: non We shall i any relation on a Bvt ing reflexive, symmetric and transitive, ee 7 odes 1 fes al the three properties “ rein iin iit ahs Gldentied'ar fines prove ina angles in a plané and the rel HAis setofall thetriang) Exar cs ” € AxA:xiscongruentto y) then prove that R isan equivalence relation. pel ere, pease GEC sseien Proof: (a) To prove that R is reflexive: Since Ox = is reflexive. x) € R. Hence Ris re ae (b) To prove that R is symmetric: For any x,y € A, (x, y) € > dy=Oxory,xER Hence R is symmetric. sed eh stant y (©) Toprove that R is transitive: ¥y x, y,2€ A, we have (x, y) € R and (y, Ox= Oy and Oy=Oz = x= Ozor(x,z)ER therefore R is transitive, Example 20: Let L be a set of straight lines in a plane, which one of the following two relations is 2 equivalence relation? (a) R,={(x,y):x,y@ Land x}y) (b) Rp=((x,y):x,y © Landx Ly} ‘olution: (a) (i) x € L, xis parallel to itself ie, xRx so R, is reflexive. ) wxye L,xlly>y [|x ie. xR,y = yR,x, so R, is symmetric, (ii) Vx,y,z€ L xllyand y||2= x||zi.e x,y and yR,z = xR,z SOR is transitive. Therefore R, is an equivalence relation, (©) v xe L, xis not perpendicular to itself so R, is not reflexive, Hence R, is not an equivalence relation. . mple 21: IfA = (0,1, 2,3, ......} and R= {(x, (aRy iff x—y is divisible by 8), Solution: YW xE A,x—x is divi y):x-y=8k, kis an integer} then prove that R is an equivalence relation. sible by 8 orx—x = 8k Le. xRx. So Ris Teflexive. com: V&YE A,ifx—yis divisible by 8, then y —xis algo divisible by 8 i.e. xRy = yRx SoRis symmetric. Again y x, »2ifx~y and y—z both are divisible by 8 = ; isalsodivisible by 8 ie xRy and yRz oxo. So Ris transitive, wermenx=2n(n—yey Therefore R is an equivalence relation. \Spainpte Pe be ae of positive integers anda Telation R is defined on A as follows: » DR(c, Sa+d=b+cvabcdeR, then tRi vale i a by a rove th; i . Solution: () Ava s b=bsa thes by definitign ar R PI that R is an equivalence relation. @, DR(a,b). SOR : is reflexivepgLATIONS AND FUNCTIONS 249 ‘y (a, b)R(C. 4) Gi) Oe ad=b+e a b+csatd af ctb=dt+a (c, d)R(a, b). So R is symmetric ai) Let (a, b). (¢, d), (¢, ) € Ax A and (a, b)R(c, d (i) ee ed=b+candc+ fade Dand en dDR¢e, 2 @tMtC+N=+0)+ +e) zs atf=b+e= (a,b) R (e, 1). So Ris transitive, ence by (i), (i) & Gi) R is an equivalence relation, samples At Ais the set of real numbers and R is the relation on A defined as follows: (uy) € AXA: x—y isan integer) : or xRy iff x —y is an integer prove that Ris an equivalence relation, Solution: Sincex—x=0€ A VxE A,so xRx thus Ris reflexive. ‘again ifx—y is an integer, then y —x =~ (x — xRy = yRx. So R is symmetric, Now let x, y, 2 € A. If (xy) and (y ~ z) both are integers then x —z = two integers is also an integer. It means that (x~y)€ Rand (y—2)€R = xRz. So Ris transitive. Consequently R is an equivalence relation, Example 241 Prove that the relation R = {(x, y) : x ~ y = an even integer vx, y € I} is equivalence relation. (U.P.T.U., M.C.A., 2010-11] Solution: {i) Let x € I, then x ~ x = 0, an even integer i.e. xRx. So Ris reflexive. (i) Let x, y € J, then if x —y is an even integer, then y — x = ~ (x ~ y) is also an even integer i.e. xRy =yRx. So Ris symmetric. ii) Letx, y, 2 € I. Also if xy and y ~z both are even integer, then x — z= (x—y) + (y —2) is also an even integer (being sum of two even integers) i.e. xRy and yRz => xRz. So R is reflexive. Therefore R isanequivalence relation, Example 5¢ Let A be the set of all integers and a relation Ris defined as (x, y) x =y (mod m)}, m divide x — y, where m is a positive integer. Prove that R is an equivalence relation. Solution: (i) Since x — x is divisible by m, therefore x = x (mod m)i.e. xRx. Thus R is reflexive. i) Ifx,y€ A and x~y is divisible by m, then y- (ky) is also divisible by mi.e. x =y (mod m) = y =x (mod y) or xRy = yRx. So R is symmettic. (ii) If, y,2€ A and also x—y as well as y —z both are divisible by m then X-Z= (x~y) +(y—z) shall also be divisible by m. ¥)isalso an integer. It means (x—y)€ A= (y-x)€ Aor (-y) + (yz) being sum of => (x-z)€ Ror xRy and yRz or X= y (mod m) and y =z (mod m). Se x =z (mod m) ie __xRy and yRz => xRz, So Ris transitive. Hence by (i), (i) & (ii) Ris an equivalence relation. ‘ote: The relation x = y (mod m) read as “x is congruent to y mod m” can also be ie 3 x=T ‘mod and y =r mod m which means that x and y yield the same remainder r when divided by m. eeVISCHETEMATHEN i a N ote the set of real numbers. A relation R is defined on A such that Let A den nb (ab) R (ca) iff 0 + pec td Show that R is an equivalence relation. Dayan eb? F Sohution: i) (a, BYR (aD) ea | = Ris reflexive (i) (a D)R (c,d) = aavecded = cad aat eb? = (6,4) R (a,b) = Ris symmetric (iii) (a,b) R (c,d) and (c,d) Re, = abapract+dtandc? +d? =e +f? = aebractef? = (a, b)R (ef) = Ris transitive From (i), (ii) and (iii), R is an equivalence relation. Example 27: Let A= (1,2,3,4}. Give an example of Ron A which is G@) Neither symmetric nor antisymmetric Gi) antisymmetric and reflexive but not transitive Gii) transitive and reflexive but not antisymmetric [UPTU., B. Tech., 2005-06] Solution: (i) R = {(1, 3), (, 1), G, 1), (1, 2), G, 3), 4 4} - isnot symmetric, as (1, 2) € R but (2, 1) ¢ R — is not antisymmetric, as these exists a pair of distinct elements 1, 3, € A such that (1, 3) € R and GB, 1) ER. di) R=( (1, 1), 1, 3), (2, 2), (3, 3), (3, 4), (4, 4)} ~ isreflexive asaRayae A. - _ is antisymmetric as no pair of distinct elements x, y € A exist such that (x, y) € R and (y,x) eR - is not transitive as 1R3, 3R4 ie. (1, 3) € R, (3, 4) € R but (1, 4) does not belong to R. Gil) R= (1, 1), CL, 2), (2, D, (2, 2), G, 3), G4), 4, 3), 4 49} ~ isreflexive, as aRay ae A. - is transitive, as aRb and bRe = aRc y a,b,ce A - is not antisymmetric as there exist a pair of distinct elements 1, 2 € A such that (1, 2) ER an ha (2, 1) € R. Similar is the case with elements 3, 4 € R. Ki ample 28: Let R be a binary relation defined as R = {(a,b) € R/a—b < 3 ), determine whether Ri reflexive, symmetric, antisymmetric and transitive, {UPTU.,B. Tech., 2006-0 Solution: R = {(a,b)€ R? |a-b $3} reflexive: as Va € R,a~a = 0 $3 soRis reflexive symmetric: a,b€ R = a-b<3 then b-a>3 soR is not symmetric antisymmetric: Let (a-b)€ R= a—b <3DISCRETE jy e 220 —— on B any p Let A denote the set of real numbers. A relation R is defined on A such that xno 26: s P RE (a,b) R (c,d) iff a? +b? = 0? +d Show that R is an equivalence relation. : 2442 Solution: (i) (a,b) R (a,b) Ris reflexive ; Gi) (@,b)R (c,d) => ath? acted? z = 4d sarap? 5 es (c,d) R (a,b) ; = Ris symmetric Gil) Gb) R ©, d) and (¢, d) R(e, = VED = 4d? onde? 4d? se? 4 f? = Pep seras? => (@,d) Re, f) = Ris transitive From (i, (i) and (ii), is an equivalence relation. Example 27: Let A=(1,2,3,4}.Givean example of R on A which is @ Neither symmetric nor antisymmetric Gi) antisymmetric and reflexive but not transitive Gi) transitive and reflexive but Solution: (i) R = {(1, 3), (UPTU.,B. Tech., 2005.04 not antisymmetric (1, Ds G, 1), (1, 2), @, 3), (4, 4)} is not symmetric, as (1, 2) € R but (2, 1) ¢R is not antisymmetric, as these exists a pair of distinct elements 1, 3, A such that (1,3) € Rand GB, DeER. Gi) R= (1,0, 0,3), 2,2), , 3), 3, 4), (4, 4)} — isreflexive asa Rayae A, is antisymmetric as no Pair of distinct is not transitive as 1R3, 3R4 i.e, ii) R= lements x, y € A exist such that (x, , 3) € R, 3,4) € R bu (2,1, (, 2), 2 1), 2 2), (3, 3), 35-4), is reflexive, as aRay ac A. y)€ Rand(y,x)er t (1, 4) does not belong to R. 4, 3), (4, 4)) is transitive, as aRb and bRe = aRe y ab,ce A is not antisymmetric as there exist a pair of distinct elements 1,2 A such that (1, 2) ER ant a /: (, 1) € R, Similar is the case with elements 3,4 € R, Ki ‘ample 28: Let R be a binary relation defined as R= ((@,b) € R/a—b < 3 }, determine whether Ri reflexive, symmetric, antisymmetric and transitive. {UPTU.,B. Tech., 2006-01 Solution: R = ((a,b) € R? la-b<3) reflexive: as Wa €R,a-~a=0<3 soR is reflexive symmetric: a,b€ R => a-b<3 then b- antisymmetric: Let (a. beRSa- 23 so R is not symmetric bs3RELATIONS AND FUNCTIONS 221 = b-a23 ab $3and b ~a 3 is possible only if a = b so R is antisymmetric ransitive: Let (@, b) ER and (b,c) ER . a-bS3_... (1) and b-e<3 ee adding (1) and Q) a-c<6 so R is not transitive ple eae = (1, 2, oy 7) and R= ((x, y) x — y is divisible by 3). Show that R is an Gquivalence relation. [UPTU., B. Tech., 2006-07] solution: Given that X = (1,2, 3,4, 5,6,7) and R= ((x, y:x~y) is divisible by 3} peflexive: Vx € XX x is divisible by3 g0 (sX) EXVKEX or Risreflexive gymmetric: Letx,y €X and (x, y) eR 7 x-y is divisible by 3 = 3m,, (m, being an integer) = ~3m, = 3m, m, is also an integer so _y~Xis divisible by 3 or R is symmetric Transitive: Let x, y, Z, EX pea, 2) yoz=3m, z-sef2)) m, and m, being integers ‘Adding (1) and (2) we have, x — z= 3 (m, + m,) Where ml + m2 is also an integer Sox -zis also divisible by 3 or (x, z) ER So R is transitive Hence R is an equivalence relation ti 3 Let N = {1, 2, 3, ...} and a Relation in defined in N x N as follows: (a, b) is related to cb=da. (€,d)R (a,b) Hence it is symmetric Transitive: Let (a, b) R (c, d) & (c, d) R (, f) ad = be & ce = df or ada Pot, op = Be e