P| Relations Art-1, Relation P.T.U. B.C.A. 12004, ( 2006) Definition : Let A and B are two sets, A relation from A to B is a subset of A x py, terms of symbols we can say RC A X B. If (x, y) is a member of relation then we say (x, ») R or x Ry, which means ; , related to y. Similarly if x is not related to y then we say (x,y) €R or x R y. Example : Let A = {1, 2, 3}, B= {a} b} AXB=((L.0), (1.0) 2.020) @, a), 3, ‘A x B has 6 elements, As number of subsets of A X B is 2° so we have 2° ie 6 different relations on A to B. Some of them are e Ry = (,.9.20,0,0) R=.) — (3,4), 3, B)} Ry =e Ry Note relgtion from A to B is also called binary relation as elements of relation are in mrt In present text relation means binary relation. . > Domain and Range of a Relation ; IFR is a relation from a set A to a'set B. Then the set of the first components of the elements of-R is called the domain of R and the set of the second components of the elements of R is called the range of R. Thus, domain of R= { a: (a,b) ER}, and range of R= { (a, b) ER}. IfR is a relation from a set A to the set A, then R is called a relation on A. This relation on a set A is defined as any subset of A x A. Example : Let A= {1,2, 3} Then AX A= {(1, Ds (1,2 (1,3) 2,162.2 2,3)G, 1.3.89)! Let R= {(1,2), 2,2) 8,2),(3,3)}. ; Then R & A x A, Therefore R is a relation on the set A, ¢ i Fe ence eres ON Ry ree eR REI DU 188 >} © scanned with OKEN Scanner1088 ~~ (1,2) ERs therefore 1 R 2 ce, 1 is R related to 2. ince (| ; gail since (1,1) €Rso1 RK 1 isnot R related to 1. : porate (223) Penge of R= {2,3}. ve, For any & 6 EN, the set of natural numbers, define a relation R by a R bif ides b aM pen R= (Cl Ds (1s 2) (Ls sey 2), A), 39s Bs ed sen Ris clearly a subset of N XN and hence a relation on N. (1.2) €Rsinee I divides 2 ener since 2 does not divide 1. example. Let A= (1, 2} and B = (3, 4} qhen A X B= (1,3), (1, 4), 2,3), @, 4)} 1 R=(35A20}. 7 “then R AX Band hence R is a relation from A to B. 1R3since (1,3) ER. 2 1 R 4since (1,4) ER. pomain of R = {1,2}. (¢ @TU.B.C.A-12006) . ‘Arslation R on a set A is called a reflexive relation if, x) €R forall x EA ie. if for every x E R. : : ae Example. Let A = { 1, 2}. mm Then AX A= (C1, , 0.) @ D.2D}- . : i= { (1, 1), (22), (1,2)}- Then R © A x A and so R is a relation on the set A. Since (x, x), E.R W x © A, so R is a reflexive relation on A. nple. For a, b & N, the set of natural numbers, define a R b if a divides b Then R= (1, 1), (1, DowiZs 2), Qs Mond Then R © N x N and so R is a relation on N. Since for’any natural number x, x dts, sox Rx Wx EN, Therefore R is a reflexive rel mple. We define a relation S on the set of real numbers R by aS 6 if is less than & 4,5 ER. Itis not a reflexive relation since for any ‘a € R, a is not less then a and (Ga¢s,” Mole: The relation R defined on set af lines by 1 Dive, since every life is paxallel to itself” ‘ RI, if, is parallel to /, is © scanned with OKEN ScannerSPECTRUM DISCRETE. MATHEMAT Cg fe bers aR bifa> The relation R defined on set of natural num! bist tk : “ @> ais not true. ‘Ast Symmettic Relation A relation R on a set A is called a symmetric een ifaRboy Ray BEA. ie, if(a, b) ER > (b, a) ER where a, bE mh Example. Let A= { 1,2, 3) Then AXA= { (1,4), (1,2), (153), 2, 1, 2 2 2 3), B,D, GB, 2), 0, 3} Let R= ((1,),(1,3),@, D} and Ri= { (1,2), (1.3) Bel) } Then RRSAXA™ Therefore R and R, are both relations on A Since (x, y) € R > (y, x) € R, therefore R is a symmetric relation on A, Since (1,2) € R, but (2,1) €.R,, therefore Ge, ¥) © Ri * 0x) ER, does Mot hl Ry always, ". Ry is not a symmetric relation. Example, For a, b & N, the set of natural numbers define a relation R by aRbitgc Then R= {(1, 2), (1, 3)ys(2,3)s 2, Arnone Since R ¢,N x N, so R is azelation on N. (1, 2) € R since 1 is less than 2: But (2, 1) ¢ R since 2 is not ess than 1. Therefore R is not a symmetric relation on N. Example : Relation R defined on set of lines by 1, R ly if symmetric if hh then) 1h. ED rransiv Relation a relation R on a set A is called a transitive relation if is perpendicular to | aRb, Re = aReVabcSAa ie, if@ HER ae and (6,c)ER > (@)ERwhereab cE A, Example. Let A= {1, 2,3) Then A A= {(1, 1),(1,2)(1, 3),2, 1), 2,2), let R=(,2,200,9,2,3,0, 1) Let = {C.2),2,9,@,1)) ‘Then R and R, are both subsets of A x Ai, ‘Therefore, R and Rj ate both relations on A, “Also (a, b) ER and (6, DERZ 6} 23,8,0,8,2.6,9). of 8 Ts is ane rea © scanned with OKEN Scannernn aTions ‘i earthen, (1.2) and (2,3) Ry, but (1a) Ay on 4 hus Ry bi not a transitive rotation, apaanples Por a 0 Ns the set of natuenl numbers, detine a R HED 1 # A= 10 Te onal wusber a bantyngtheeaion 2+ = 0 a en ANDER ae Abe Oa Abed and ber le RELA BO), 4), Ch, 29) : since (3 A) ER and (A oe and (4, 2) © R but (1, 2) A, Therefore Ris wot a transitive lt —_ Relation a (P1U, BCA. 2006) ha A relation Bon a set A is called an antissymmottle relation Ifa Reh and implies that a= a fey 1) E Rand (ha) E Re qeb, OR “Arelation Rona set A is called anti-symmettie If a,b GA (a 6) and GDER & OER Je. Let A be the set ofall Hines tn a plane, Lt Ly 1 pA by Ly R ba HL | by des Lys pall tt Tine Lay amd Ly stich that Lyf] La ad Lf ty ut La Ly # Ly therefore R is not an antisymmetric relation, imple. Let A= (1,2, 3358 ‘phen Re {C11}, (1.2), 2,1) ts a rotation om the set A: ince (1,2) € R and (21) € R but 1 #2, therefore R fs not antsymmetic relation But Ry © (3, 3)} is an anti-symmetric relation on A N the set of natural numbers dofine aR > 1 GA, We dofine a relation Since in any plane there exist wv Lyles be Rb and LR imple, For a, bE itasb Leta, b EN such that aR band bRa , * asbundbsa - aed, — Ris.an antisymmetric relation. jon ¢ Relation R defined on A by Re (yxy VrE Ad Notes Identity relation on a set {Js symmetric as wll as antisymmetric, imple: A= (1, 2,3) then identity relation (i) = (CIs 1 _ hich is symmetri as well a8 a ), (2,2) @, 3) é jesymmettic. 4 % © scanned with OKEN Scanner‘SPECTRUM DISCRETE MATHEMATICS (py 29, Equivalence Relation & PTU.BCAG A relation R ona set A is called an equivalence relation if R is reflexive, sym and transitive, , Example. Let X be the set of all triangles in a plane. For any two triangles Ay and Ap in X define Ay R As yf As and dare cong triangles. Then (@ Ris Refexive, Since each triangle is congruent to itself, 30 A B A for cay inx, (Ris Symmetric. Let A and Ay € X such that Ay R As, Then Ap and 4; ‘congruent triangles. Hence A R Aj. (iii) R is Transitive, Let A, , Ay, As © X such that A; R Az and A) R A, A; , Ap are congruent tfiahgles and so are A, and Ay, This implies that the Ay and 4, ay also congruent triangles. Hence A; RAs. So, R is reflexive, symmetric and transitive. ‘Therefore, R is an equivalence relation on X. }. Inverse of A Relation The inverse of a relation R, denoted by Ris obtained from R by interchanging the first and second components of each ordered pair of.” Therefore, R™ = {(a,b) : (b, a. ER}. IER is a relation from a set A to set B, then R" is relation from the set B 10 the set A. Domain of R= Range of R. And range of R= domain of R. mangle, —~COSS Let R=((1,2),(1,3),@, 3), G2). ‘Then R is a relation on the set A, since RC A x A. R'=(BVG.NG2.89) Art-9. Void Relation in a set Since ¢ isa subset of A x-A, therefore the null set ¢ is also a relation in A, called the void relations in a set A, Void relation ¢ is symmetric and transitive but not reflexive. Universal relation in a set : Let A be any set and R be the set A x A. Then Ri. lled the universal relation in A. > ompatible Relation : A relation R in A is said to be compatible slaton ft : f symmetric, 40. Partial Order Relation A relation R’on a set X is said to be a partial order relation if it “following three conditions : O.4Rx, for every x © X (reflexivity) (i) xRyand yRx ® x= (antisymmetry) (ii) Ry and yRz > xRz (vansitivity), x,y,2€X © scanned with OKEN Scanner| order relation spe only equivalence rel ri Tee oy relati ion ona jpihe entity relation Ix., that is, the relalon un i s also a pa fined by x RY iff mposition of Relations bean relation from a set A toa set B and S bea relation from set B to a set Cc (fe a sition relation d ‘ o lenoted by SoR is a relation from a set A to a set C defined 1 he com * : goR = {(@ 6) 3B EB for which (a, 4) ER, 6.965} be any non- Riso if A beieny nonempty set ; Mon of Rand S denoted by SoR ricci any two relations on A Then go {(@.6) 98 E A for which (0,8) €R, (6,9) pet A= (1, 2,3,4,5,6, 7} R= {(, 2), 2.5), G,6), (,4)} $= {(1,4), 7, 5), 3,7), (4, 3} : relations on a set A . ple. and ‘pe two rgren SOR = {(7,3)} RoS = {3.49} R! = £02, 16,2634, D} gs! ={40,6.00,39.6,9} From above example it is clear that RoS # SoR. ss some theorems on composition of relations. Now we discus: ‘Ato B, and S is a relation from B to 142, Let A, B and C be sets, R is relation from Then prove that (SoR)? = R08". dl ees tletcEC anda GA then = (AE (SoRY? iff (a 6) & SoR Now (a, ) € SoR which fmeans there exist bE B suchthat (a6)ER and OES : @.geER! and @ DES (Hest and OE RK’ (aeRO st 4 (sory! =R'0 s* é te 3. Let A, B,C, D be sets. Suppose Ris relation from A 10 B, — cin isarelatio tt yw that ; d T is a relation ee oe TS : wlotecas, sa (RoS)oT = RotS0 ‘ © scanned with OKEN Scannerspecrnu DISCRETE MATHEMATIcg 194 Proof : Let (a, d) € (RoS)oT Then there exists some ¢ € C such that (ac) E Ro and (o) eT Since (ae) € RoS, so there exist in Bsi (a BER and (5,0) ES uch that Now (b,c) ES and (4 DET > (0d) € SoT again (a, 6) ER and (6,4) > (a,b) E Ro(SoT) (RoS), TC RSOT) y Similarly, Ro(SoT) C (RoS)o T “ uf From equations (1) and (2) Ro(SoT) = (RoS)o T. Art-14, Let R be a relation from X to Y and Xi, Xs @ XiSX > RO%)SRO%) GREK UX) = RO%) U RO) (iif) RON) SRK) RO) Proof: (i) Let b € R(X,) Since b E R(X) -. there exist a € Xi such that (a, 6) € ROX) But X;SX “. aX as aX; > BERK) R(X) S RX) (i) Let 6 E R(X, UX) there exist some a € X, U Xp st. (@,8) R(X, UX) Now a€X,UX * a€X, or a€X, If a€X, > bER(X) Similarly if aE X, > bER(%) so BER(K)) URO%) RK UX) S RK) UR) 0) Also we know X;X; UX and X; © X, UX, Bypart() R(X) SRK, UX,) ROG) SRO UK) > REX)URK) SRK UX) o €SoT be two subsets of X then © scanned with OKEN Scannerions, i mci) and 2) Je R(X U X2) = ROG) U R(X). gust be RN X) there exist some @ © X, 9X, (a,b) ER NX) aEXiOX % a&X, and aex, bERM) and BERK) b ERK) ORO) {RO %) S ROG) NRO) _gs. Equivalence Class be an equivalence relati “ui crf ened) stederaonss ™ j= (EXbRa}. Let A={1,2,3}. R= {(1, 1), 2, 1), (1, 2), (2,2), 3, 3)} [1 ]= {1,2} since orily 1 and 2 are related to 1 igniisty, (21> 42,1} and(3]=€3) We observe that any two equivalence classes are either disjoint or identical. The jeinc euivatence classes are ( 1 ] and (3). aso AHE1]U (Jan (1] [3] = ‘Then R= ( (11), 22), 8,3), (1,2), 2D} is an equivalence relation on A. 146, Suppose that R is an equivalence relation on a set X. Then @ a€[a]VaeX. (i) a€ [5] ifand only if[ a] = [5] Vb EX. (i) [a] = [8] or fa] Nb 1=9V a,b E X Le, any two equivalenes classes are int or identical. (PbiU,, BCA. 112007) +() Since R is an equivalence relation on X. Ris reflexive. + aRaVaex. _*? a€la]¥aeX, © (i) Leta, bE X such that a [b] wl) aRb : bRa, since R is equivalence relation wef) _ Now we show that [a]=[2]- _ Le t pela]. os pRa eon : i © Scanned with OKEN Scannerpe[d). ; SopEta] = pE[b}. Therefore[ a} SI) Now letg € | 6} Rb. Also b Ra (From (2)). qRaand hence g €[ a]. [o1¢[a) Hence [a]=[b] Conversely let [ a] = [b] for some a, b X. From (i), a € [a]. @©[b}, since [ a] =[ 5}. Gif) Let a,b eX. If[@] N[b] =¢, then we have nothing to prove. Ifa] M [5] ¢, then there exists p € X such that p © [a] M[ 4]. p&[a]and pE[ 4) = [p]=[a] and [p] = [6], [From (iy = [al=[5) Art-17, The distinct equivalence classes of an equivalence relation on a set fom Partition of that set. (Pbi.U,, B.C.A. 1,209 Proof : Let R be an equivalence relation on a set X. Therefore R is also a reflexie relation. aRaWaeXx. a€[a]VaeX., ll) where [a] denotes the equivalence class of a. We prove that X= U [a]. aexX Let aeXx, Then = @€[a] {From ( . fen x aex a] a Since [a]={bEX:bRa}, therefore [a]CXVaex uy [a] xX 0) aexX © scanned with OKEN ScannersATIONS i From (2) and (3), we get x = x [7] Ie delete the repetitions from this pe | rion, we Bet X as union of distinct ree of X under R. Now we prove that any two distinct equivalence classes are disjoint, Let [a] and [ 5] be any two distinct equivalence classes where a, b © X We want to prove that [a] N[b)=¢, Ifpossible, let fa] 0 [2] x . | on Sx@Xsuch thats efayapyy, oan x€[a Jandx (5), (on xRaandxRd. @ |» aRxand bRx. 0) Now we prove that [ @] = [6], Let p€fa}. pRa.AlsoaRx (From (5)) pRx. AlsoxRb (From (4)) PR (Since R is an equivalence relation) pels) {a]S[6] Nowletg [5] qRb. Also bRx (From (5)) qR-x. (Since R is equivalence relation) Also xRa (From (4)) qRa = géla) (4) ¢ [a] Hence [ a] = [6]. But this is against our supposition that [a] and [8] are distinct equivalence classes. 0, our supposition that [a] 7 [6] # @ is wrong. Thus [a] N[b]=¢. ion of distinct equivalence classes and any two distinct E Hence the set of distinct equivalence classes of R forms a partition of X. drs, For any partition of X, there is an equivalence relation on X whose equivalence are the sets in the partition. © scanned with OKEN ScannernuM DISCRETE MATHEMAy 198 Src 28h, we have Proof, Let {A;}ieq be a partition of X- Therefore @ X= UA dew wen. i = pita # where A and Nome mamas bare in the same A,. For a, b © X, define a R b ifand only if Then for any a, b, ¢, € A, we have : @ Ris reflexive Leta eX. by@ae % ‘A, so that a€ A, for some € A. Therefore aR a. @ Ris symmetric LetaRo. aand b belong to A, for same a A. > band abelong to same A,. > bRa. i Leta RbandbRe, a and b belong to same A, for some a € A and b, ¢ belong to same Ay somef € A. bE A, and Ay both ie, BEA, M Ay. > a=f,Forifa #8, thenby (i) A, NAy=9. a and c belong to same A,. aRe. Therefore R is reflexive, symmetric as well as transitive relation on X. Hence Ri an equivalence relation on X. Now we prove that each equivalence class of X is equal to A,. Let [ a } denote the equivalence of a for any a X. Then [a]={bEX:bRa}, =[b EX: band aare in the same A, for some A © A}. =A, Equivalence class of X is equal to A,. Conversely we prove that each A, Consider any A, Take any a © A, Such an a exist, since A, is non-empty ‘We prove that A, =[a] {sequal to some equivalence of X. eRe © scanned with OKEN ScannerpeLATIONS 199 (Let 6 € Ax Then aand b belong to same A, bRaand hence b € [ a] ny DEA EA, i 2 ASlal Now, let x €[a] xRaand hence x, a belong to same A, ButaGA, - xEA, x€[a] * x€A, 2 (cA 7 Hence A: = [a] w {Ai} ea is the set of all equivalence classes under the relation R. ILLUSTRATIVE EXAMPLES ample 1, How many relations are posible fom a set Avo elements 1 another set B ‘nelements? Why? | + @ TU. B.C°K-1 2006; Pbi: U. B.C.A. 2012) J, Number of elements in A = m. I E k —2 ‘Number of elements in B =n number of elements in Ax B=m xn ‘We know that number of subsets of any set,with m elements is number of subsets of A x’B = 2" Since every subset of A x Bisa relation from A to B, therefore 2" relations are ible from A to B. R={@&)!2EN, VEN, ax+y oes Find the domain and a of this relation R. Also verify whether R is (Pbi, U. B.C.A. 2012) 1-2(1)=41-2=39, y=41-2@)=41-4937 y=41-2G) 241-635 1-8=33 yaal- y=41-2(19)=41-38=3 y=41-220)=41-40 1 yaa -2Q1)=41-a2=r €N © scanned with OKEN Scanner7A) A un DISCRETE MATHEMATI¢y SPECTR domain of| and range'of R= (1,3; (@ Nowlenbut(l, WER Ris not reflexive (i) A,39) ER WEI, DER Ris not symmetric” Gi) 20,1), (1, 39) ER but (20, 39) ER Ris not transitive, 7 ExampletaGive an example-of a relation which is anti-symmetric and tae, neither reflexive nor symmetric. “ Sol. Let A= {1,2,3}. Then AX A= {(1, 1), (1,2 (1,3 @ Ds 223) BD, G,2),,3) Let R= {(1,2), (2,3), (1, 3)}- . Risa relation on the set Aas RCA X A. ~ Risnot reflexive since 3 € A and (3,3) €R. Ris not symmetric since (1,2) € R but 2, 1) ER. Ris transitive since (a, b) ER, (b,c) ER > (ac)ER. ~ Ris anti-symmetrie since for no (a, 8) ER, We have (b, a) ER. Example 4,GRe an example of relation which is transitive but neither reflexive wy symmetri€ nor anti-symmetric. ames Sok Let A={1,2,3} Then AX A= {(1, 1), (1,2), (1,3) 1, 2,2), 2, 3) BD, B,2),,3)}- Let R= (1D), @2), (1,2), Vs (bs 22, 3)}. Then R is transitive since (a, 5) ER, (6,2) ER >(adER. . Ris not reflexive since 3 € A but (3, 3) € R. R is not symmetric since (1, 3) € R but @, 1) € R. Also R is not anti-symmetric since (1,2) € R and (2, 1) ER but 1# 2, Example 5. Give example of relation R on A = {1, 2, 3} which is both symmetric a! antisymmetric and R is neither symmetric nor antisymmetric. BCA) Sol. A={1, 2,3} R= {, 0, @ 2% G, 3) is a relation which i ti ana is a relation which is both syran if G@YER = OER “for Ris symnetl also GNER (NER = xay te ig antisyonnel @_R={G,Y, 2, 2),8,3),1,2),@, 1,2, 3) ee 1 © scanned with OKEN Scanner201 R Q@I)ER but G,2ER isnot antisymmetric > (1,2)ER,Q,1VER but 122 5. Give an ex ; i ane. ° © an example of relation which is both an equivalence relation and partial order (P-T.U. B.C.A.-1 2006; Pbi.U., B.C.A.II, 2008, 2009) gan Ut AT (1203) Define Ron A by R= {1,22}, 8,3) ie xRy iff x=y Now Ris reflexive as 1R1,2R2,3R3 Ris symmetricas W Ry, yRx Ris antisymmetric as xRy,yRx > x=y Ris transitive. So R is an equivalence as well as partial order relation. 1,2, 3} having the stated property : [psample 7. Give an example of relation R on R is neither symmetric nor antisymmetric, : and R is transitive but R{U Ris not Ee (PbiU., B.C.A-Il 2007) gol. A= (1,2, 3} Fo R-MLDADAD gwen & WMEF Ris not symmetric + @3) ER But GER, E Ris not antisymmetric. (1,2 ER, 1) ERbut #2. i) R={(1,2), 2,3) 0,3) Ris transitive as (a, 5), R1=42,0,6,2.-D} RURT= {(1,2), (2,3) (1,3) @ Ds 2G, DE As (1, 2) and (2, 1)€RU. R" But (1, 1)@RUR™ a RUR’ is not transitive. Sxample 8, Consider the following five relation on set A= { R= ((1, 1), (1,213.8 3D} ‘ $= ((1,1,, (1,2 2, 22) 5) (1, 1) (2,2) (1,2) 2 3} = Empty Relation AXA = Universal Relation JER > (JER 1,2,3) © scanned with OKEN Scanner202 Sol. im DISCRETE MATHEMATy SPECTR! CS ay nA Determine whether or not each of above relations 0! (i) Reflexive (i) Symmetric (ii) Trans (iv) Antisymmetric R= {1.1.0.2 01,3) B39} Ris not reflexive + (2,2) €R eR but 2, ER (,aeRzanb eR Ris not Symmetric as (1, 2) R is antisymmetric as (a, 8) ER, Ris Transitive as (a,b) ER, (b,) ER? @ S={()0,IAZVG96 3} | | S is Reflexive, Symmetric and Transitive but not antisymmetric because (1, ») & a (2,1) ES but 1 #2. T= 1), 2,2), (1,2), 2 3)} T is not Reflexive as (3, 3) ¢T T is not Symmetric as (1, 2) € T But (2, 1) €T T is not Transitive as (1, 2) ET, 2, 3) ET but (1, 3) @T Tis Antisymmetric = Empty Relation Empty Relation is not reflexive but it is Symmetric, anti symmetric and Transit, AX A= Universal Relation : Universal Relation is reflexive, Symmetric, & Transitive but not Antisymmetrc. Example 9. Let A= {a, b} and B= {1, 2, 3}. Represent A x B graphically. What is| A x B|? Sol. A x B= {(a, 1), (a,2), (a, 3), (b, 1), (6, 2), (6, 3)} Graphically A x B is shown below : n a 6 |AXB| =|A].|B|=2.3=6 © scanned with OKEN Scannerpastors 203 Let X be set x Ie 10. With 6 elements, H at elaions on Xa reeive ? low many relations can be there on A? How (PbI.U,, B.C.A. 11 2007) ‘gol, We know relation on A is subset of A x A n(A x A)=n(A).n (A) =6.6=36 ‘Number of subsets of A X A = 236 so different relations on A= 256 For relation to b reflexive we know.x Rx W x © A so relation must contain at least 6 elements. The remaining 30 elements may or may not be taken so number of reflexive sations = 2°° mple 11. Let X= {1,23 4, 5, 6,7, 8,9, 10}. The family 1, 4, 8}, 3, 5, 9}, (2, 7}, (6, 103} is a partition of X. Determine the equivalence ion corresponding to the above partition. Here X = {1,23 4, 5, 6, 7, 8, 9, 10} Let F= {{1,4, 8}, (3,5, 9), (2,7), {6, 10}} is apa Let R be the equivalence relation corresponding this partition F of X, then F should “constitute the distinct equivalence classes of X under R. “+ the distinct equivalence classes of X wart. R will be (1,4, 8}, 3, 5,9}, (2, Ths (6, 10} ‘Since each element a belongs to equivalence class of a [= (1,4,8)= (I RL4RL BR [3]= (3, 5,9} = GR3,5R3,9R3) (2]= (2, 7} = (2R2,7R2} [6] = (6, 10} = {6 R6, 10R 6} Also R is symmetric and transitive, wé find that R= {(1, 152,295,344; 6-5 6,9 (1 Ds B89 (99 (1019) (1.4), (1,8), 2, 16,5409) 4; Ds 6:34 6,104 (729 D.C, 3) (10, 6)} Rand § are symmetric relations on a set A. Show that RN Sis { ion of X Example 12. Suppose symmetric. Sol. Since Rand S are symmetric relation on 4 set A oO if @, ER > (WHER and if @, ES > (NES “@ © scanned with OKEN Scanner204 JERS be any cleme F WHER and (NES Fn E Rand (yy ES t = (yNERNS WHERAS F (VNERNS RA Sis symmetric. Example 13, R is a relation on set of positive integers s.t. R= {(@, 5): a~b is odd integer} Is Ran equivalence relation ? R= (@,b):a- R is equivalence iff R is reflexive, symmetric and transitive, g dd integer} @_ Reflexive : Let a be any positive integers then aR a iff a~ais odd integer ie, Ois odd integer which is not true. So R is not equivalence as R is not reflexive. Example 14. Given a set $= {1, 2, 3,4, 5}, find the equivalence relation on S whig, (P-T.U. B.C.A. 12005, 2199 Sol. Let R= {(1, 1), (2,2), (3,3), (4,4), (5, 5)} Clearly R is reflexive, symmetric and transitive, So R is equivalence. Now we find equivalence classes generated by R TU2 U3 UFUses and all equivalence classes are pairwise disjoint, So R generates partition (7, 3,3, 7, 3), © scanned with OKEN Scanner© @ = aislet R be a relation defined on the set of real numbers by a R b.ifa = px ere Bare real number. Then R is a partial order relation. feu) Ris teflesive since a < a for any real number a and henoe a R a (i Ris anti-symmetric. Let a and 6 be two real numbers such that a R 6 and pRa. . asb and ba. 2 a=b 2 Risanti-symmetric (i) Ris transitive, Let a, b, c be any real numbers such that aR b and b Rc. asband bse 2 ascie,aRe Ris transitive. Ris reflexive, anti-symmetric and transitive, 2 Risa partial order relation on the set of real numbers. Frample 16. For any a, 5 EN, the set of natural numbers, define @ R 6.if and only if a divides 6. Then R is a partial order relation. Or Prove that relation of divisibility is partial order relation on N. ~~ — (PbLU.B.C.A. April 2011) Sol. Let a, b, c € N. Then () aRasince a= 1. a implies that a divides a, Therefore R is reflexive (i) Let aR band bRa “+ adivides b and b divides a a=b - Ris anti-symmetric (ii) LetaR band bRe a divides 6 and b divides ¢ > adivides ¢ @ aRe © scanned with OKEN Scanner06, SrecrRUM DISCRETE MATHEMATIOg py ——————— ve SE R is transitiy Ris reflexive, anti-symmetric and transitive, R is a partial order relation on N Example 17, Prove that relation of divisibility is not a partial order relation On ep integers. % POU BCAA Apia Sol. Let a € Z (integers) i) then a divides a is true. <. relation is reflexive. Leta, bEZ then a divides b and b divides a does not mean that a= 6 eg. a=5, b=-5 Here a divides b and b divides a. But aed ‘So relation is not anti-symmetric and hence not partial order relation, Example 18. If R is the relation in N x N defined by (a, 6) R (c, d) if and only a+d=b +c, show that R is equivalence relation. - Sol. Here (a, 8)R (Gd) @ atd=b+e, @Now (a, 8)R (a, 8) ifa+b=b+ a, which is true. relation R is reflexive. @) Now (a, d)R(o, d) = atd=b+e > dta=ctb > ctb=dta = ©AR@S) © + relation R is symmetric, (il) Now (a, 6) R (c, d) and (c, d) R(e,f) > atd=btcandetf=dte 2 Gtdt+(C+/)=(b+0d+(dt+e) eatf=bte = @DRES) : + relation R is transitive, \ Now Ris reflexive, symmetric and transitive relation R is an equivalence relation, Netample 19. InN X N, show that the relation defined by (a, Ro, dif ad=bes™ equivalence relation, Sol. Here (a, 5) R (6, d) # ad= be (i) Now (a, 6) R (a,b) ifab=b a, which is te relation R is reflexive. © scanned with j OKEN Scannerat Www (a AR (ed) 207 ‘i ae O dzbe : » gaseb © cbedg relation R is symmetric, * (ARO, now) ROG A and, DR Ge, py adebeand cf=de % (aq ° | adefebede * (af) (dem afcbe * ORES) relation Ris transitive yow RIS reflexive, symmetric and transitive relation R isan equivalence relation, ; ie <,~eQ- ; yope0t FOC 5» 7 © Q-the se of relational numbers, define = RS itand ont j= Show that Rs an equivalence eaon on Bg "meow a£t : pa fF a D)=(be) (0) ede) € Qarbitrarly, then a sie $ €Q therefore, a b are integers, b= ba, since multiplication is commutative in : L 6 b Ris reflexive. oR @) ta? RS ond SRE 3 qa ay ad=be and of=de (ad) (cf )=(be)(de) * (cd) (af)=(ed)(be), ” sing commutative and associative laws of multiplication in Z. . © scanned with OKEN Scanner——————————— isCRETE MATHEMA . 208 srt ~ruM D) US, = af=be = SRE ow Risiransitve: oof “Thus R is an equivalence relation ival Example 21, Define the relation and an equival a show that Rl on y defined by (a, b) € R if and only HFS divides : (Pbi. U. aot relation. . ’ “Ady ice relation have already been given i ; vale Sol. Definition of relation and equiv ye Ritand ony if5 divides 5g ion RN x Nis defined bY (% The relation RS speapeeines f ity Si by This means that R is a relation 0” N defined only if'S divides b- a. ‘Let a,b, cbelongs oN. Then Ren ( a-a=0=5.0. 2. Sdivides aa. = (@@eER. 2 Risreflesive ) Let@neR 1. Sdivides a-—b. a-b=5n forsomen EN. = b-a=SCn) Sdividesb-a =H ER 2 Ris symmetric (dip Let (4, 6) and (b, ) ER. S$ divides a~b and b—c both a-b= (a-b)+(b-c)=Smtim = a-c=5 (m+n) nm, and b-c=5m, for some n, and nm, EN = 5 divides a-c = (ac)ER ++ Reis transitive relation in N. Example 22. If R is an equivalence relation on a set A, then so is R™ Sol. Let a, b ¢ © A. Then @ @ a) E R, since R being equivalence relation is also a reflexive relation = (@aeERt By. ‘definition of = RM isreflexive © scanned with OKEN Scanner(a,b) ER, since R is symmetric (aeER He : (@dER' & (bayer, 4,8" isalso symmetric inlet (a, b)and (6, JER" (6,4), (6 DYER. (6). a ER. (ca) ER, since R is transitive @oeR — R’lis also transitive. i Ris an equivalence relation. re anne _ : we) can — the inverse relation R"' by ga let R= {(6,a):4,b G Ast. (a,b) ER} Firstly, let R be symmetric relation tt GER & &QER @ @HER' * R=R? secondly let R™'= R, To show that R is symmetric Let (4,1) ER @ (4,,)ER! (2 R=R) © &aER (by def.) «. Rissymmetric. fuample 24, For a, b € Z, the set of integers, define a = b (mod 2) iff 2 divides a b. ‘Tien = is an equivalence relation on Z. Find the equivalence classes of O and 1. Further ow thatthe equivalence class of any integer is equal to equivalence class of 0 or 1. Sole a © Z arbitrarily, then 2 divides a— a0. a= a(mod2), = is areflexive relation Leta bE Zsuch that a = b(mod 2). Then 2| a~b and hence 2|b—@ _ Therefore, b = a(mod2), . & is a symmetric relation Leta, be © Z, such that a= b (mod 2) and b= ¢ (mod?) 2|a—band2|b-¢. i © scanned with OKEN Scannera= c(mod 2) isa transitive relation: nsitive relation on Z, So is reflexive, symmetric as well as Ira" Hence isan equivalence ration on Z Let fn} denotes the equivalence class of integer Now [0] = (n €Z:n = 0(mod2) } =(nEZ:2|n-070} = (nEZin=2kwhere ke Z} = (0,42, 44, £6,000) [1] ={n€ Zine | (mod 2)} ={n€Z:2|r-1} n@ Zin —1=2kwhere ke Z} in Z:n=1+2kwherek EZ} = (£123,245, 000) We observe that [ 0] M[ 1 ]=¢ ie, [0 ]and [1 ] are disjoint Also = Z=[0) U[I] Now let n © Z arbitrarily Then n=2 kor m= 2 k-+ | for some integer m acorig as mis divisible by 2 or not, Now [2k] ={meZ (mod 2)} ={mEZ:2|(m-2k)} ={mEZ:m-2k =2/where/EZ} ={mEZ:m=2k+2¢ where k, CE Z} m ©Z: mis an even integer} 0,2, #4} =[0] 2A =[0] Next e+] =(n€Z:n=2k+1 (mod2)). ={n@Z:2|n-(2k+1)}. ={n Zin ~(2k+ 1)=21 for some ¢ EZ }. =({nELin=26+(2k+1)}, ={nEZin=2(t+k) +1), ={" &Z: nis an odd integer), «P11, 23,450), =[1] ‘ x © scanned with OKEN Scanner‘RELATIONS 21 f epammoNs ey Bk+i=(1] Since n=2kor2k+1and[2k=[0],[2k+ 1 =E 3 [n)=[0Ja[1) | gxample 25. Find x and y if (x +2, 4)=(5,2x4,y), (Pbi.U,, B.C.A. 112007) © go G42) = 2x49) Comparing x+2=5, we x52 2 (x: 2xtyn4 2 2@)ty=4 > y=4-6 = yr? ymple 26. Let R be a relation on the set of all positive integers such that {(@, 6) | ¢— 6 is an odd positive integer}. Is R reflexive, symmetric, antisymmetric, sitive, an equivalence relation ? (Pbi. U. M.Sc. 2011) R= {(a, 6) | a—b is an odd positive integer} Let Z' denote set ofall positive integers. eta GZ 0, which is not odd positive integer. then a—a “So Ris notreflexive / Symmetric : Let a, b € Z” such that aRb “> a—bis odd positive integer. “ then 5~ a is negative integer. Ris not symmetric. + Antisymmetric : Let a, 6 €.2" | Now if a—bis odd positive integer then b— a is definitely not odd positive integer. So Ris antisymmetric. ince R is not reflexive, quivalence : So itis not an equivalence relation. EXERCISE 5 (a) j: “IER and R’ are reflexive relations on a set then so are RU R’ and RR’. ‘Show that the union of two symmetric relations on a set is again a symmetric relation on that set. i © scanned with OKEN Scannerrau DISCRETE MATHEMA TIO, ut 24 SPEC P; t | ANSWERS 5, Neither reflexive nor transitive 4 No . 10. No 1 R= {1 1,2),8,3s 44s (2) 2. R= (C1, 1).2.2) 3) 4A SD (102 2. @No (Yes) No_(@NO (1,32, 142,348, 0),8,2y (2,1), 4, 5), (5, 4)} Art-19, Adjacency Matrix (Matrix of a Relation) R bea relation from A to B. Then Sit R Let A and B be two finite sets and ey matin oF MAK of re ‘ . : « represented by a matrix Ma called the a Boolean matrix of R. seine mute = -cuiby) be two finite sets of order TEA {0 dvs») and B= {Bp ay nnby) be 10 fit and Rho area ons Ate. Then the adjacency matrix Mr is defined as Lif a, RB, Ma= (nm where ue Oita, R , Mind, IfB =A, then Mg is a square matrix called the matrix of relation R in the set Art-20. Boolean Arithmetic + Boolean arithmetic is the arithmetic defined on the set {0, 1} using the rule Multiplication of Boolean Matrices IA = (ay)nxnand B= (b,i)»xpbe two Boolean matrices where each ay, butt either 0 or 1. Then AB is the product of matrices A and B defined as AB = (Chi)nxp Where 2 cus DL@jj-bj,) for 1 Sism sksp, fA - Art-21. Composition of Relation ‘Using Matrices Let R and S are two relations on set A and ; let associated adjacency matrices * M, and Mg respectively. Then matrix of compositi ee ion Msop is given by Mgor =Mg "Mg © scanned with OKEN Scanner= U5 TE aot TO ind RP, RY, agin We use adjnceney matrix Myr” MaMa Mas” Mia “Mp and soon, | ead (Another proof of ar-t3) y : | yer P is arelation from A t0 3, Q isn relation fh ry ne | tat prove that Ro (Qo?) = (Rode? lon from 1 to C and R is relation from Let Mp» Ma»Mg._ be the matrices associated to relations P, Q and R respectively ‘then Mpogor) = Moor * My =(Mp.Mg). Ma = Mp ‘(Mg * Mp) [Matrix multiplication is associative] = Mp : Mrog = Merogur > Ro(QoP) = (RoQ)oP. _|ILLUSTRATIVE EXAMPLES! nple 1. IFR is relation “less than" from A.= (I, 2,3, 4, 5} to B= {1, 4, 5}. Write n the adjacency matrix. . Here R= {(x,y):x G A,y © B, s.t. x Sy). Then R= {(1, 4), (1, 3) 24s (2s 5), 3,4) Gs 5) 4.5)} +, the adjacency matrix, Mp is given by hota Ns _ fa ta ts Ma=| 51 "32-133 Tn) ty tn Made where ry Jig (xy) R © scanned with OKEN Scanneralso write matrix of rek Mn= 3 1 | 1 ' 1 ! 1 1 of, 0 Or te Or Wo mf coe ool- oe — fa 73 Example 2, Let A = (2, 3 5, 8}, B= (4,6, 16}, C= (114, 5, 7). LetR = a, and S = {(b, ©): b = c} be relations from A to B and B to C. Find the composig SOR. If Mssx, Mp, Ms be the adjacency matrix of SOR, R and S respectively, ry, that Msox = MgMs, Sol, Here R = {(a, b: a/b} = {(2,4), (2, 6), (2, 16), (3, 6), (8, 16)} and $= {(b, c): bs c} ={(4, 4), (4, 5), 4, 7) (6, D} SOR = {(a,c):3 bEBst. (a) ER, (6,0) ES} ={(2,4.2,9,27,6,0} my a oe 1 on 00 00 coos £ t coos aon = eer oli) =|0 001 0000 lad BU o1ii oll o10 ooo1 Ne - = ra ORES 6 o,0]|0 8! 0.0 0 0M oo1 0000 Example 3. Let A= (1, 2, 3}. Determine whether the relation R whose matrices Me given isan equivalence relation, 1000 fro. @Me=}0 11) 6) M=|0 1 0 0 EAE 100 © scanned with OKEN ScannerRELATIONS att en 0 © gol. (a) Since Mp = 1 1 oon ee R= {0 1), 2,2),2,3),G,2),, 39} (Since (2,0) ERV AEA, Hence R is an equivalence relation. Ris reflexive. I (i) Since (a,b) ER > (ba)ERWVabEA E Ris Symmetric Ben si f (iii) Since (@, 6) ER, (b,c) ER > (a,c) ER forall a,b,cEA E Ristransitive E On (® Since Me=} 0 1 0 100 — ow R={0,D, 0,3), 22,6, D} | Since (3,3) @R -. Ris not reflexive | Hence Ris not an equivalence relation on A. Example 4. Given A= {1, 2, 3, 4} and B= x, y,2}. Let R be the relation from A to B : R= (9), 4,2), 4,2)} (a) Determine matrix of relation. (® Determine domain and range of relation. (Pbi.U., B.C.A-II 2007) |Sol. (a) Matrix of relation 0: 4&1 0 0 0 Mr"ly 1 0 | 101 | © Domain of R={1, 3,4} Range of R= (y42)- © scanned with OKEN Scanner218 SPECTRUM DISCRETE MATHEMAT cg 1 0 4 1 Example 8, Find the relation R if Mr= | ; 5 1 (PLU. BCAA An. AcIl Atay, Sol. Let given set A = {a, b, c} then from Ma i) R = {(a.a), (b, Bh (b, 0), (6 9s (6 OY} o n -one i Example 6, Determine whether the relation represented by zero-one matrix 0 0 is an Equivalence relation o- 1 1 o 10 0 © 1 0 (Poi. U. BCAA Apy 2 Sol, Let A= {1,2,3,4} Then given relation is R= {(1, D, 2,2), G, 3), 4,4), (1, 3), 2 4), G, 1s (4, 2)} Ris reflexive as (x,x) ER,WxEA + Ris symmetric as (x,y) ER > (yx) ER Ris transitive as (r,y) ER > (y,2)ER > (AER so R is an equivalence relation, EXERCISE 5 (b) 1, Let A = Set of all positive divisors of 6 ie, A= {1, 2, 3, 6}. Define the relat R by aR biff a/b, Find adjacency matrix on A. 2, Let A= {2,3, 5}, B= (4, 6, 16}, and R, = two relation from A to B. Find the M, andM, . {(@, 8) : ab}, Re = {(a, 6): a {a} fc} g wee Shen |a~b|=1} and S = {(a, 6): a— bis even} are two relations (@ Find matrices of R and S (i Draw diagraphs of R and S (ii) Using matrices of R and S, find the relation RS (jv) Show that R?= S? A={I,2, 3,4} R= {(a,8):1a-5|=1} ={(1, 2), 2, 1), 2, 3), G, 2) G, 4), (4, 3). 0 10 0 ee" =|! is EZ oO. S= {(a,b): a— bis even} ={(1, 3), B,D, 2 4) 4,2) (LD, @ 2G, 3) 4, 4} 1010 wale 2 Oo 1) is mattix of § 1010 0101 Diagraph of R © scanned with OKEN Scannerrecut DISCRETE MATHEMATICS, x a_i DRT Diagraph of S o1o0o0;f1 010 o10)1 ' 1o1ojjo1orj_j1o10 GOMN=)) po if{1 010] jorot oo1ojforo1} [1010 which is matrix of RS. RS= {(1, 2), (1,4), @ Ds 2, 3) B, 2) GB, 4), 4, Ds 4, 3)} o100 o100 1010 101 0;/}/1010 o101 ivy) M?=MM= I » o1ro1jjo101] j1o10 oo10 oo10 o101 R= {(1, 1), (1,3), 2,2), 2 4), G1), G, 3), 4, Ds 4,4} 1010 1010 1010 ol1o01 o10dl1 o101 1o1o0}}/1 010} J1010 LO. 0 1ff0 101] jo1o01 $= {(, 1), (1,3), 22), 2.4), @, D, G3), 4, 2), (4, 4)} R=), Example 3. Let A = {0, 1, 2, 3, 4} find equival i i R= (0,0), 0,4), (1, 1), (1, 3), 2,2), 1.3), 0) 3} imate Draw diagraph of Rand write down partition of A induced by R. N=NN= : (POiLU,, B.C.ALL 2008 Sol. Equivalence classes are given below [0] = {0,4} (1) = (1,3) _RI=Q) [3] = {1,3} [4] = (0, 4} © scanned with OKEN Scanneriagraph of R is shown below : QF Partition of A induced by R is P = {{0, 4}, {1,3}, (2}}. ple 4. Let B= {2, 3, 4, 6, 12, 36, 48} and S be the relation/”divide” on B. Draw diagram of S. (PTU, B.C.A. I 2005) Hasse diagram is 36) 48 12 4 6 a 3 Example 5, Let x= {I, 2, 3, 4}, R= (>| > y}- Draw the graph of R and also ive its matrix, LL R= ((2, 1), 3, 1), 3,2), 4, Ds G2) 4, 3D} Graph of R aes © scanned with OKEN Scanner226 SPECTRUM DISCRETE MATHEMATI¢g 1 1 0 0 1 1 10 Example 6. Write all possible relations from A = {0} to B = (1, 2}. (TU, B.C.A. 1209 Sol. A x B= {(0,1),(0,2)} n(Ax B)=2 Total number of relations = 2? = 4 which are Ry =¢ R= {@ D} Rs ={@,2} Ry ={0,),0,2)} Example 7. Let R be a Relation whose Graph is Given, Find all paths of length 3. oie © scanned with OKEN Scanner| Length of Path is the number Sol polo : of edges in the Path, The various Paths of length 3 are Path of Length 3 1. (a,c) (c, ) (ef) 2. (a, €) (c,d) (db) 3.4) (DS, d) (, ) (Kd) (de) LG@OdeN (Gd) 2. (c,d) (d, b) (b,f) 1.(d, bY (SVG) 2. (d, 0) (c,€) (ef) Le) (ha) (do) 2. Sd) a,b) LGLDGHIOEN| 2.(f,d)(d,0) (0) EXERCISE 5 (4) (2,2), 2,4), 3, 2)5 Bs 4) (4s Ds 4 3D} Given relation is R= {(1,2), in A= (1, 2, 3, 4}. Draw its graph. Give an example of a non-empty set and a relation on the set that satisfies each f the relation. of the following properties. Draw a digraph o (reflexive (if) symmetric (iif) anti-symmettic (iv) transitive. If X= (1, 2,3,4, 5} and © R= (1,1), (1,2), 2 3B 5) 4), 4, 5)} Determine () R? GDR” Let X= (1,2, 3,4} and R= (9) 1977) Draw the diagraph and matrix of R- © scanned with OKEN ScannerSPECTRUM DISCRETE MATHEM,, 228 Teg hey ANSWESS 3 © (0,1,0,2,01,3.@ 55248, 5} w@ (G1, 0,2) (1,3), (94,599 29 2 5), 34 8,5), 45 © scanned with OKEN Scanner