Module-1 Ser THEorY 1.1.1, Basic Concept of Sets The concept of set is fundamental in all branches of mathematics. (A well defined collection of distinct objects is defined to be a set when the objects of collection are independent of the order of their arrangemen? By a well-defined collection we mean that there exists a defirfte rule with the help of which it is possible to tell whether a particular object belongs to the collection or not. The objects constituting the set are called elements or members of the set. We shall denote the sets by capital letter A, B, C, X, Y, Z, P, ete. and their elements by small letters a, b, Ct.¥» z, p, qete. If an object a is a member of a set A, then we write a€A which may be read as ‘a belongs to A’ or ‘a is an element of A’. On the other hand, if a is not a member of a set A, then we write 2 Illustration. (i) “The collection of BCA- 1st year students of your college” is well defined, because given a student of your college, we see if he (or she) is a student of BCA-1st year or not. If the answer is ‘yes’, he or she belongs to the collection, otherwise not. r ‘ ‘s UG) Let 4={1,8,3.2}, B= {4.4.5.1}. Here Bis not a set but A is i) The set of vowels of English alphabet can be represented as X= {a,e,i,0,u} or {e,0,u,i, a}. hb (uber dow Gy) pz={x: xis a positive even enteat less than 10} which ri P={2,4,6,8) | can also be written as P = { é any TA Br (v) X ={I,3,5,7,--+} is a set of all positive odd integers. A set can be expressed in two forms, one is tabular form where the elements are within brackets {} separated by commas as Ex (ii) and (iii). E.M4-1——— gf wot 94 MY ty. and ENGINERRING MATHEMATICS ~ Ty A dtr +a, phe = aw ea ee SET THRORY =" ein gg ne Sad ‘set-builder form 1s firet _ eee ee SeTeomcing ofthe elemente x such that (2) When A is a proper subset of B, then we denote this natiadien | within the brackets. The notation by ACB. Obviously the null set @ is a proper subset of every x for “wuch that ~ void et @ itself. Acsiberng weston nt cael get ovo fond fon : If B= {a,b,c}, then all the subsets of B are ee ee 6 {ehh Le.)reh{eve} fa.d.c} and ¢. Pv» 7 Satake Metaton Let Ao feor 42 -0and coal) IES ‘Theorem 1. If Ac Band Bc Athen A=. - ‘Since there is no real number which stisfies the equation Proof. If A CB, then every element of A is an element of B caesar Also if B.S A, then every clement of B is an element of A. poy horn ge ‘Combining these two, we can say that 4=B. ct aga set 2} is a singleton Ctra iti (A set having finite number of elements in it is called a finite OCA ee mekadse set Otherwise a set is dnfinite) Ex (ii), (i) isa finite set whereas Proof. Letx bé'ain arbitrary element of the set A. Since A S B, Ex (v) as infinite set, 60 reA=xreB. But BS C (given). Therefore «e8=>xsC. ‘Two mts A and B are said to be equal if every element of A ‘Thus x 24x €C. Hence by definition of subset ASC” sean len Band se every clement of Bin an lament of 1.1.3,_Power Set 3 wewrite 4=2. Symbolically, 4=8 if reAores. i i - BitxeAcred. If Sis any set, then the set of all the subsets of S is called ee eae which a power set of S and is denoted by /(S)Pbviously ¢ and S Seeshacdtoman are both the elements of (5). ae Zor =the st ofall integers _Mustration . If $= {1.2.3} then Q= the set of all rs apiehaes PCS) ={4, {the {2}. (3b {1,2 (25h {3 hel 2 3} R= the set of all real numbers | Aicorem. If a finite set $ has n elements, then its power set (C= the set of all complex numbers. has 2" elements. 112 Subnet Proof. Since the finite set Shas n elements, #0 there are °C, IA, B are two sets such subsets consisting of r elements where r= 0,1;2,--.". Hence the leimeat of B. Ratitedeten gee ke ene Ht tatal number of subset of S i.e. the total number of elements this relation in donot * of bolically "Cato magne, COLD oe vata oe 7 ring AB andi Foad an Risa i i Gee etal aes eA Contained in B’ > — 1. versal i oT (0 From the defines ‘ aaah ar subset ‘A non: which all the seto under consideratic muboet of itself ie. A Samet nee every subset of A. Any other id to be a 4 ; be y ot subset of A is said to be a proper subset ACB wis te pipo~ what fuel ocean waned in py wohtch tm WS te, Utfustration (i) All the people in the world constitute the universal set in any study of human population. | si is called the Universal set and 1» denoted by7 \4 ENGINEERING MATHEMATICS . Gi) Tf Um {0242 t30f Be (13,5 C= (246) the, U is the Universal set for B and C. 1.1.6. Venn-Euler Diagram dJohn-Venn, an English logician (1834-1923) invented th, diagram to present pictorial representation of sets and the operations on sets also. These pictures consist of rectangle ang closed curves. These combinations of rectangles and closeq regions are called Venn-Euler diagram or simply Venn-diagram, In Venn-diagram we shall denote the universal set U by q large rectangle and we write the letter ‘U’ in one corner of that rectangle. Also we denote any subset A of the Universal set by by circle or closed curve and write the letter A within the circle, code f= ZB 1.1.6. Set Operations Union of Sets The union of two sets A and B is the set of all elements which are in the set A or in B or in both. This set is denoted by AUB. Thus AUB={x:xEA orx eB}. The union of two sets A and B is shown with shaded area in the adjoining Venn diagram.SET THEORY 1-5 ————————— An general the union of n sets A\, Ay,**, 4, is denoted by aa Np Les, Ua, and Ee eee | UA, ={x:x eA, for some value of i, 1 $i< n} vl . Using the Venn diagram the following properties can be easily verified : | ee @) AVA=A ‘idempotent property) (ii) AUO= A . : Gil) AUB=BUA (commutative property) (iv) If ASB, then AUB=B. (v) ACAUB, BcAUB (vi) (AU . AU(BUC), (associative property) Illustration (i) If A= {l, 34,6}, B= e. 3,4}, then * AvB={1,2, 3,46}, @UD> 37523 ii) If P={x:xisa Positive integer less ibe and O={x: x isan integer and 5< x <15} then eee 1 6}, Q={x: x isan integer and ~3 -3} PAQ={6,7,8, 9,10 --+} Also, Q' = {--,-6,-5,-4, 11, 12,13--} ={x :x is an integer and x < —4 and x > 11} 2, PUQ'={-,-6,-5,-4, 6, 7, 8, 10, +} 2 (PUQ)A(PUQ’)={6,7,8,9,--} =P. Ex. 3. If A={J, 3, 5}, B={J, 3, 8}, then find @ AxB (ii) Bx A (iii) (Ax B)-(Bx A) (iv) AAB (v) also verify that A AB= (A UB)-(ANB) 4“ Ax B={(l, i, (1, 3}. (48), (3,1), (3,3). (3,8) (5,1),(5, 3).(5,8)} ” & Bx A={(l, », (1.3), (1, 5), (3,1), (3, 3)s (3, 5)s(8s1)s (8, 3), (8, 5)} Gil) (Ax B)-(Bx A) ={(148).8.8.(5.1) (5,3) 6.8)} (iv) A-B={5}, B-A={8} = AA B=(A-B)U(B-A)={5, 8}7 a eNGINEERING MATHEMATIC F 4 () Now 40 B= {1.35.8}, 408 {L3)} (40 B)~ (4B) = {5,8} Hence 4A B=(4UB)-(AN4) J 4, In an examination, out of 90 a oe naseattea in / Physics and 50 passed in Mathematics and 39 passed in by Physics and Mathematics. i) How many students passed in exactly one of the ty sf bjects e ; 8 ey A (ii) How many students failed in both the subjects ? Let U =No. of all students, P= No. of students of Physic, M = No. of students of Mathematics. - Here U =90, P=65, M=50 and PAM =35. So the number of students who passed in Physics only j, P-(PO M) =65-35=30 and the no. of students who passeq in Mathematics only is M-(P M)=50-35=15. (i) Thus the total number of students who passed in exactly one of the two subjects is 30 + 15 = 45. (ii) Hence the number of students who failed in both the subjects is 99— (No. of students who passed in only one Subject + No. of students who passed in both the subjects) =90-(45+35)=10, Note : Using Venn-Diagram, the above problem can be Solved easily as shown in the following figureset THEORY 113 eee nD Ex. 5 [fA and Bare seta, then prove that A~B, ANB and B-A are pairwise disjoint Firat we #hall prove that 4— 8 and AGB ie, (A B)O(ANB)@ 4g, are digjoint If possible, let x be any arbitrary element of (A= B)A(AB) qpren x €(4-8)O(An 8) 5 ve(A-B) and x e(Ana) (xe Aandx¢B) and (veAandyeR). But there is no element x which satisfies both «eB and «#8. Hence there is no element in the set (4— B)A(AnB) je. (4- B)A(ANB)= 6. Similarly we can prove that B= 4 and AAB isjoint i o' anger OB are disjoint i.e., Finally we shall prove that (4- 8)(B- A)=. If possible, let y be any arbitrary element of (A-B)q(B- A). Then y e(A-B)O(B- A) => yeA-B and yeB-4 5 = (yeAand y¢B) and (y eBandy¢ A) But there is no element y which satisfies both y¢4 and y¢A or which satisfies both y<¢B and y¢B. Hence there is no element in the set (4- B)A(B- 4) ie., (A-B)A(B-4)=$. Thus the sets A—B, ANB and B-A are pairwise disjoint. Ex. 6. A, B, C are subsets of a Universal set U. Prove that A-(BUC)=(A-B)n(4-C). Let x be any arbitrary element of the set A-(BUC) Then x ¢A-(BUC) exeAand x¢(BUC) exeA and {x ¢B andx ¢C} aq ea ENGINEERING MATHEMATIC, ; {xed andx@B} and {xe and x @C} ere(4-B) and xe(4-C) ex e(A-B)A(A=C) Hence 4-(BUC)=(4-B)n(4-C) 1 If AUB= AUC and ANB= ANC, prove that Bao om e B= BO(BUA), by absorptive property =BO(AvB), by commutative property =BO(AUC), given AUB= AUC =(BO A)U(BOC), by distributive property =(ANB)U(BNC), given AN B= ANC =(Cn A)U(COB) =Can(AUB) 3CA(AUC) =Cn(CvU 4) =C, by absorptive property. e 8. If AUB= AUC and A'UB=A'UC, prove that B=c We have 4UB=AUC q) ‘© . and A‘'UB=A4'UC (2) -. From (1) and (2), (AVB)(4'UB)=(AUC)A(4'UC) or, (BUA)N(BU A)=(CUA)A(CUA'), by commutative property ‘ or, BU(ANA')=CU(AN A’), by distributive property or, BUd=CUd B=C, Ex. 9. Let P, Q, R be subsets of a Universal set U. Prove that §)-Fx(On8)=(PxO\n( Pak) Gi) (P~9)x R= (Px R)-(Qx R) .SET THEORY 1-15 _—_— —nrhkr —rereE=ee————— (i) Let (x.¥) be any arbitrary element of the set Px(Q7R). Then, (x.y) €PX(QNR) o> xe P and yeQaR eo xreP and (y Qand y €R) eo (xe Pandy €Q)and(x © P and y « R) eo (xy) Px @ and (x,y) ePxR eo (xy) (PX QVO(P x R) ~ Px(QAR)=(PxQ)n(P xR) (ji) Let (x,y) be any arbitrary element of the set (P-Q)xR. Then (x, ») €(P-O)x Ree x e(P-Q) and yeR eo(xePand x ¢Q) and yeR e>(x ¢Pand y R) and (x ¢Qand y eR) e(x,y)ePxR and (x,y) ¢OxR (x,y) €(P«R)-(Q%R) s. (P-Q)xR=(PxR)-(Qx R) yo Ex. 0. Prove that (Ax B) (Cx D) =(ANC)x(BOD) Let (x, y) be any arbitrary element of (4x B)A(CxD) Then (x, y) €(Ax B) (Cx D) © (x,y)¢AxB and (x,y)eCxD ——— @ (x Aand y ©B) and (x eC and y ANB=o (ANC)U(BNC) =o ANC=6 and BNC’ => Now BnC'=9=3 BSC [If xeB>xeC' >xeC} = AMBES Anc 2ANB <> [v Anc=4] => ANB=6 Lier ‘N ENGINEERING MATHEMAT;¢, 1-16 how that ‘ y h sets A, . 8 " Ex. 12. For any t a mo 4 A Let x be any arbitrary element of the set A -(B-c), Then xe 4-(B-C) xed and x ¢B-C eoxved and (xeB or x €C) © (x eAand x ¢8) or (x eA and x €C) eA-B orxednc © xe(A-B)U(ANC) © xed- ‘ . A-(B-C)=(4-B)U(ANC) x. 13, Using Venn diagram, prove that (4-C)U(B-C)=(AvB)-C. Fig. 1 Fig. 2 In Fig.1, the shaded region with the vertical lines is the se (A-C)U(B-C). In Fig. 2, the shaded region with horizontal lines is the se (AvVB)-c. Hence from Fig.1 and Fig. 2, the result is proved. 1.1.9. Relations Definition Let A and B be two non-empty sets. A relation between two sets-A and B is a subset of Ax B and is denoted by R (or P). Thus R © AxB, When R ¢ Axd, then R is said to bea relation on the set ANY aSET THEORY 1-17 ie (q,4) 21 then obviously (a,b) @AxB and we wi and read as ‘a is related to 6’. Again if (a, b)eR then we write g(~R)b or aR b and read ag, @ is not related to b. ” We may described a relation R in the set builder notation as R={(a,b): aed, bap], Ayfh 49 chem He. + d. Illustration. (i) If 4= {2,3}, B= (1, 2,3,4}, then + 4 aa mots, Ax B={(2,1),(2,2),(2,3),(2,4),(3,1),(3, 2).(3, 3),(3,4)}. eR i Then ¥={(2,?), » (258). (2,4), (3,3),(3.4)}, a subset of AxB bea relation between two set sets A and B which can also be written as R={(a,b):a€A,b eBandq bRa. _Mlustration (viii) Let A={1,2,3,4}: Then R= {(1,2), (1, 3). (3,3), (2,1), (3 1)} is symmetric but R={(1,2), (1,3), (3,3), (3,1)} is not symmetric, as (2,1) €X though (1,2) eR. Transitive Relation Let Rbe a relation on a set A. Then Ris said to be a transitive relation. if (a,b) €R and (b,c) R= (a,c ER; ie, Pa Rb and bRe= Illustration (ix) Let N be the set of all natural numbers and Jet Rbe the relation in N defined by “x is less or equal to y” ) ie., R={(x,y):x,y €N and xs) Let (a,6),(b,c) ER. Then aa(a,c)eR. ay a), Hence Ris transitive relation. Bee a” sastenee ‘ oh Anti Symmetric Relation ae Let R be a relation on a set_4. Then R is said to be a anti- etric relation if (a,b) ¢ R,(b,a)eR=>a=b Le., aRbandbRa=> = In illustration (ix), (a,b) ER, (bha)ER =>asb, bSas>a=b So the relation RF in (ix) is anti-symmetric. ———_ 1.1.10. Equivalence Relations (ist R be a relation on a set A. Then R is said to bean equivalence relation if Ris reflexive, symmetric and transitive’ ieENGINEERING MATHEMATIC, j i Let A be the set of all triangles in g a Dla Ne nd R be the relation in A defined as x Ry if x is congruent) to y, v x,y 4. Then since every triangle ig Bim,” to itself, so x Rx Vx eA. So Ris reflexive. Now if a triangle, iy similar to a triangle y, then y is similar to x. ; So xRy>yRxV x,yeA. Hence R is symmetric. Again ; it triangle x is similar to a triangle y and y is similar to a trang z, then x must be similar to z ' ie., xRy and yRz>xRzVx,y,2€4. So, Ris transitive Thus R is an equivalence relation in A. a\ Yorutvanésice class or Equivalence set Let R be an equivalence relation on a non-empty set 4 and, be an arbitrary element of A. Then the elements x € A Satisfy; xRa constitute a subset of A. This subset is calleq an quivalence class or equivalence set and is denoted by [a] ora or cla) or or A,. Thus [a]={x:x € Aand x Ra}. lustration In illustration (x), the equivalence class [a] is the set of all triangles of A which are similar to the triangle ‘a’. Thus if <|a], then the triangle b is similar to the triangle a. Theorem. Let A be a non-empty set and R be an equivalence relation in A. Then for all a,b eA. (i) a €[a] (i) If 6 €[a], then [a]=[6] (ii) [a] =[5) iff aRb (iv) Either [a]=[6] or [aln[o]=6 i.e., two equivalence classes are either disjoint or identical. (v) A=(Ufa] , the union all equivalence classes is the set A. Proof: Beyond the scope of the book.THEORY Partitions. A ( Lat A be & non-empty set, Then a set P={4), 4, dys non-empty subsets of A will be called a partition of A > @ Ud = 4 and (ii) 4,4 6 for iv.’ Iljustration. Tet A oa A= {a,| be c, dye, f) then A ={{a,ch {},{d,e, if) P, = {{a}.{b. f},{e,d,e}} ete are partitions of A. Fundamental Theorem on Equivalence Relations. An equivalence relation R on a non-empty set A determines \ a partition of A and-conversely,-a partition’ of A defines an equivalence relation on A. Proof. Beyond the scope of the book. 1.1.1k Illustrative Examples.” ©1. Give an example of relation which is reflexive but is neither symmetric nor transitive. Let A={I,2,3} and R be the relation defined as R={(1,1), (1,2), (2,2), (2,3),(3,3)} . Then R is reflexive as (x,x)eRVx eA but is not symmetric as (1,2) eR and (2,1)¢R. Again (1,2)¢R and (2,3)eR but (1, 3)¢R . Hence R is not transitive. So the relation R is reflexive but is neither symmetric nor transitive. ‘ Ex. 2. Give an example of a relation which is reflexive and transitive but not symmetric. ——— Yet Nbe the set of all natural numbers and R be the relation defined as R= {(x, y):x,y Nand x isa divisor of y} As x is a divisor of x, so (x,x) eR. Therefore Ris reflexive. ; Again, if x is a divisor of y, then y cannot be a divisor of x. Thus (x,y) eR>(y,x) ER Vx,yEN. Hence R is not symmetric.— ENGINEERING MATHEMATICS Finally x is a divisor of y and y is a divisor of 2 implies y |” Aivisor of 2. Thus(x, y) © R,(1.2) ER (x2) R - Therefore Ris transitive : Bx. 8. Let R be a relation in the set of integers Z defined , “XR Y if xy is divisible by 5 for all x.y €Z he. R={(x,y):x, ye Zand x - y is divisible by 5} Prove that R is an equivalence relation. Find all the distin., equivalence classes of R. Let x ez. Then x-x=0 and 0 is divisible by 5 So. (x.x)€R Vx eZ. Thus Ris reflexive. Again let x,y eZ and (x,y) eR Then (x.y) ¢R=>(x- y)is divisible by 5 = -(v-x) is divisible by 5 =(y-x) is divisible by 5 =(y.x)eR Therefore R is symmetric Finally let x,y,z €Z and (x, y)eR , (y.z)e2 (x.y)eR and (y,z)eR=(x-y) and (y--) both are divisible by 5 = {(x-y)+(y-2)} is divisible by 5= (x -z) is divisible by 5 =(x.z)eR. Hence R is transitive. Thus R is an equivalence relation. For this relation, the equivalence classes are Z, ={r45n:me7} and r=0,1,2,34. Thus all the distinet equivalence classes are Zo = {0, +5,+10,+15,---}={-----15,-10,-5,0,5,10,15-- Z, = {11451210} ={---9,-4,1,611--} Zy = {0+ 2,2£5,2410,--}SET THEORY 1-23 —— Zeb AAAS AHI} f= 25,813, } Zeb MAES ALO =f, 6-149, 14} Note. (1) The above relation R is said to be the relation of congruence (mod 5). Thus, if (a,h)eR, then a is said to be congruent to b(mods) and is expressed as a=h(mod5). e.g 29 « 4{mod 5), 16 Imod 5). eee es (2) The above distinct classes 2),Z,,Z;,2,,2, are also called she classes of Residues of Z (mod 5). va On the set Z of integers, define a binary relation p by 2 pb if and only if a+b be even. Show that p is an equivalence relation. Here the relation p in the set Zis defined as p={(a,b):a+biseven¥.a,b eZ}. As at+a=2a be even ¥ aeZ, s0 apavaeZ. Therefore p is reflexive Let a,b eZ and apb. Then a+b is even and s0 b+a is even. Hence bpa. apb=>bpavabeZ . p issymmetric. Next let a,b,c eZ and apb, bpe a+b and bte are even. = at+2b+c iseven = atc iseven. > ape ape and bpc=ape V abceZ P is transitive. Hence p is an equivalence relation. Exe 5. A relation p on the set of integers Z is defined by (2,0):a,b €Zand|a-<5}. Is the relation r&fistive, symmetric and transitive ? [ W.B.U.T. 2007}ite (NEERING MATHEMATICS Let Then |e _aj=0<5 rofore apa holds v So p in reflexive. , Next let a,b 62 and (a) ep Then ja - ds $=|b-asS>(halep © is symmetric. Again let a,b,c eZ and (a,b) ep. (b,c) €P Then |a-4s5 and |b-4<5 Now, |a-c]={a-6)+(b-c)sla-d+[b-dS5+5=10 la~q $$ does not hold always. (2,6) €9, (5,c) ep do not always imply (a,c)

ba>0>5Ra. So Ris symmetric. Again let a,b,c20 andaRb, bRe Then ab 20, bc 20=> (ab)-(bc)20 => ac-b?>0 => ac20, provided 57 #0 ie, b#0 Ze ifa 3,then ab=1-0=020, bc=0-(-3)=020 bi ut ac =1- Hence, ab20, 6c20 do not always imply ac>0. So R is not transitive. Ex. 7. Siow that the following relation R on Zis an equivalence relation : R= {(a,):4,b€Z and a* +-b* is a multiple of 2} [ W.B.U.T, 2008]SET THEORY 1-25 =” Let a eZ. Then a’ +a’ = 2a° which is a multiple of 2. Therefore (a,a) €R,Va eZ R is reflexive. Again let ab eZ and (a,b) eR Then a° +b" is a multiple of 2-5 5? 4 4? is a multiple of ga(baeR 4 is symmetric. Lastly let a,b,c eZ and (a,b) eR, (b,c) eR Then a* +b* and b* +c? both are multiple of 2 = (2° +b*)+(b" +c’) isa multiple of 2 . = (a°+c*)+20? is a multiple of 2 = gi4¢ isa multiple of 2 /> (acleR ( (a,b) ER, (b,c) R>(a,c)eR R is transitive. Hence Ris an equivalence relation. (BX 8, et R be a relation defined on Z2-by “,b) R(6.d)" if only ifa+d=b+c for(a,b),(c,d)(a,b)R(ab) V (a,b) eZxZ Risreflexive. = ~~ Again let (a,b),(c,d)€ZxZ and (a,b)R (c,d) Then a+d=b+e=c+b=d+a-(c,d)R(a,b) R is symmetric. Lastly let (a,8),(c,d),(mn) €2xZ and (a,b)R(c,d), (c,d) R(m,n) Then a+d=b+c andctn=d+m = (a+d) +(c+n)=(b+e)+(d +m)ENGINEERING MATHEMATICS — yy > (aemelerdye(bem)s(crd) > asm dames (a,b)R(m,") fe. D)R(ecd) and (c,d) R(m.n) => (a, b)R(m. m1) R 1s transitive Hence Ris an equivalence relation. Ex. 6 Show that the intersection of two equivalence relation, ghiso an equivalence relation < yn R, and R, be two equivalence relations on the set A. Ther, (e.a) eR. (a.a)eR, Vaed =(a,a)eR OR VaEA RR; is reflexive Again let a,b¢ A and (a,b) eR, OR: Then (a.)R, and (a,b) €R: = (b.a) eR, and (b,a)eR) [ +: Ry, R are symmetric } => (b.a)ER OR (a,b) ER, OR, > (b,a) ER OR, R,OR, is symmetric Lastly let a,b,c €A and (a,b) eR) OR, (b,c) ER OR2- Then {(a.5) €R, and (a,b) €R,} and {(b,c) eR and (b,c) € Ry} = {(a.5) €R, and (b,c) ER} and {(a,6) eR, and (b,c) € Ry} = (a,c) eR, and (a,c) eR» [ 7 RR, are transitive | S(a.c)ER OR, R, OR; is transitive. Hence R, OR, is an equivalence relation 1,1.12. Partial Ordering Relation. / Let Sbe anon empty set and < be a relation in S. is called a ‘partially order’ if the following three axioms are satisfied: @) For any ain Swe have a < a (Reflexive) fi) Ifa~ b and b» 2 ‘The set S with the pagtially order < is called a Partially \ordered Set of AQ we) pedgbion We write 8, <) is aPO set in short form. Note. (1) In the above definition we say < defines a partially 2 of 8. %) As discussed above every two elements of S may not be related 1y <, Because of this, the word fpartial’ is used. 6) The symbol for partial order relation '<' is often replaced by the symbol < “precedes & Succeeds’ Ina PO set (S, <) if for two elements a and ba < bwe say ‘a precedes b’ and‘b succeeds a.’ IfaXb and a+b we say astrictly precedes b' and ‘b strictly succeeds a’, These are written as a) apb and bpa imply b=a" and a=5" (where n,7) are \ Positive integers). This imply 6” = b” Since r,r, are positive integers sor, = 1, r =1 apb and bpa=> b=a.HINEERL © epddpc-b=a'.c=b' (7, 8 are positive integers) a” > ape (-; rs is a positive integer) Thus 9 js a partially order and (Z.p) is a PO set. Gi Let Z be set of all integers and ‘/’ be a relation defined ;, Such a way that a /b means 6 is divisible by a. (e.g. 5/ 60). Then we see @ @4 for allainZ b) 3) -3 and -3/3 but 34-3, ie. the relation ‘/ ’is Dot antisymmetric. So (Z,) is not a PO set. , [W.B.U.T. 2006) Dysi'ef a PO set agb aad Let (S. eye a pee Let us define an another relation + 2'on S by "a> if and only if 5a=bVa,beS, [~ ¢ is antisymmetric] so 62a and a2b >a=b Va,beS => 2 is antisymmetric. i) a $b and bSc=ascva,b,ceS [ -- < is transitive] c2b and b2a>c2a Y 16,0 ES =>2 is transitive. Thus the (5,2) is a posetspt THEORY 1-29 eee Comparable and Non-comparable elements in a PO set. ‘Two elements a and b in a PO set(S, < ) are said to be comparable if either{e< b or basb and ba=b — *P isantisymmetric. Lastly apb and bpc =asb and bse, =>aSe- 7 >ape “.p is transitive. cythe relation p is partial order 7 a \ anes i: * (Bx) 5=41,2,3}, then draw the Hasse diagram of the poset fal P(S),c) where P(S) is the power setof 5 [W.B. U.T.2014 1] Solution: Here P(S) = {6441} .{2} {3}. {0,2} {2,3} {13} {1,2,3}}- since the null set ¢ is the subject of all elements of P(S), 80 ¢ is the lowest point of the Hasse diagram. Again {1,2,3} is the super set of all sets is P(S), 80 it is the highest point of the Hasse diagram,SS os ERING MATHEMATICS, Thus the Hasse diagram of P(S) is drawn below (2.4) {L3}, {1} * Show that the set of all rational numbers with usual orde, PO set. Is it totally ordered ? Prove that no element in thi, set has an immediate successor or an immediate predecessor Solution. Let Q = set of all rational numbers. Obviously ‘<’ is reflexive, antisymmtric and transitive. So firs, part is obvious, For any two rational numbersaand beither a <) isa PO set where (a, b) < (a’, by faa’ and b or || between each of the following two elements of N x N : @ 6,5 4,5) 67,916 x00,9 La, (a) (4, >, 2) 67a, 10) A, otha » Solution, Since asa and b 7 2 ( = Ne $ Ex& Desw the Hasse ding-ux of tine poset (5, 2) where 5, 5 owe sec of alll positive deessors of 3 amd 2 u: the relamon downer Soberson Bere 5) = 2 ~ The Hasse diagram af the puset Mle 4= feb cd e} Decermme the reigns ores “eee ares So We 1S 3.SET THEORY e, 1-35 Solution. If R be the relation then & is a subset of Ax A and, R= {(a,b),(b,e).(b, d), (c,e), (a, e)} ie. bRd hold ete. me Ex, 16, Let A=(V, V.,V3,V,,V;} This set is ordered by the following Hasse diagram “If L(A) is the collection of totally ordered subset of A with 2 or more elements. Find L(A). Draw the Hasse diagram of the PO set (L(A), ©) Solution. L(A) = {{V,,V2,V.}.{Vi,Ve,Vs}, (Vi.Va, V5} (Vi. Vo}. {Va Val {Vis Vas {ViVi} {Ve, Va} (Vas Ve). (Vas Ve} (Note that {V;, V,} is not totally ordered) The Hasse diagram of (L(A), c) is shown below: {HsYasVa} H.Ve.%e} {Vso ¥s} HN} Wath Hn} tan} Mvhyn} wg Hasse diagram of L (A) The set {V,,V,} {Vo,V,} {V;, Vp}, .. are all minimal element : the sets {V,,V,,Vy}, {VVo.Vs}, {V,Va,V5} are maximal ind whether Dy is a PO set w.r.t the relation p where apb means a divides b. Draw the Hasse diagram of the PO set (Djo,p).. Solution, Dj, = {1,2,4,5,8,10, 20, 40}. Now a divides a, so apa, so p is reflexive. Since Dy contains only positive integers so apb and bpa imply u=b.1-38 ENGINEERING MATHEMATICS _ Thus © antisymmetric Ifa divides 6 and b divides c then a divides.c. Soap and dpe imply epey Le. 9 1s transitive. So (Dy. p) is a PO set. The Hasse diagram of D,, is drawn in the given figure. / i 1.15, Function or Mapping Hasse diagram of Dy, Let A and B be two non-empty sets. If there exists , correspondence i.e. a rule, denoted by 7, which associates to each, element of A a_unigue element of B, then fis called a functio, from A to B and is denoted by “f :A+B or by ALB. The set A is called the Domain of f and Bis called the Co. + domain of f. Let x € 4 be an element which is associated with an elemen: » €B by the mapping f. Then y is called the image of x under ¢ and is denoted by f(x). Also x is called the pre-image of » ie. aan —<—. of f(x). It should be noted that each element of A has a unique infage and more than one element may have the same image but each element of B may not be the image of an element of 4 (as shown in the following fig.) — os SSS A B The set of all images under f is called the Range set or J/mage set and is denoted by (4). Thus (4) ={f(x):x €4) and f(4) cB.SET THEORY 1-37 _——oo Function or Mapping can also be defined as sets of ordered pairs as follows :_~ Let A and B be two non-empty sets, Then a sub-set fof AB is called @ a mapping from A to B if, toGach}lement aA there exists an ¢ Velement 8 such that the ordered pair (a,b) ef. Illustration (1 Let 4= {ah Ch B= {xy,2z,w}, Then (i) f= {(@.).(b,w),(a,2),(c, 2)} is not a function, as the LoL err ==> same element a of A has different image x and z. ww f={(2.)(c.2).(@.y)} is not a function on A. as the element b has no image. Gi)’ f = {(2.).(6,2),(c.y)} is a function as each element of A has‘a unique image. Here f(a) =x, f(b)=z, f(c)=y. The domain of fis the set A and the range set of f. ie Mle}, od Oi alae ) Let f:Z R be defined by f(x) = VieeZe Fe Then fis nota function as /(-1)= ae oa ay }) Let f:N—R be defined by f(x) = ha eNisa function since f(x) €R ve EN. Here f(N) R: Into function : : A function f:A-B is said to be an into / function if the range set f(A) is a proper subset of the co- domain Bice. if f(4) N be defined by f(x) =3x, x ¢V. Then fisan into function as the range set /(N) (the set of all integers multiple of 3) is a proper subset of the ca- domain N. nto or Surjective Function. A function f:4— 8 is said to be an onto function if the range set /(4) is equal to the domain Bie. every clement of B is an image of some element of A and we say that f maps A onto B. heuasauctelBRING MATHEMATICS - py ENG 1 Tiustration. Let / 7 7 be defined by pee fixjexedhreZ smren fis an onto function af S( = (x)aae ; A+B One-to-One or Injective Function. A fone aon dor differen said to be one-to-one if different element’ ’ umages in Bie. if 1 #2 > 2 flue fx) - or, in otherwords f(s) sf(njone Hiustration. The function f= 722 defin one-to-one, as f(n)=fln)> 43203 24% Bijective Function. A function f: 4B is said to be Dilective if fis one-to-one and onto, (Tj eek ve E Sweetie) “ Mmustration The function f:2->Z defined by f(x)=*+3 is bijective, as f is one-to-one and onto. Adentity Function : A function f:4-4 is seid to be an / identity funetion if f(x)=x ¥x€4. We denote this i Ilpstration. Let 4={1,2,3,4}. Then J = {(1,1),(2.2),(3,3),(4,4)} is an identity function of A. “ Constant Funetion : A function f:A7B is said to be a congtant function if the image of every element of A is same he JS(x)=¢ (constant) V x€ A. Mlustration. Let f:R->R be defined by f(x)=6v x eR. Then {is a constant function. VmmeA, 1) ed by fl2)=*+3 ig a omy Vinh €Z function by J,. Composite of Function. Let f and g be two functions such that J: 4->B and g:B-+C. Then the composite of the function f and g denoted by (gf) is a function given by (g2 f):4>C such that (f° f)(x)=g(/(x)) Ved.Hyatration. Let {RR be defined by f(x) =sinx, x eR we and g RYR be defined by fc), ek Then the composite function (go f) RR is defined as (go) = (0) = x(sin.x) = sin? x, eR Théorem. If f:4 > B and g:B-+C be both bijective function then the composite function go / 4» C is bijective Proof, Beyond the scope of the book. (> f\ ; Je) Inverse Function. ¥ os ¢ f:4— B bea bijective function. Then the function from 1o A which associates to each element b Z defined by f(z) =| z| is neither one-to-one nor onto and hence is not bijective. So this function does not have an inverse. (2) A function which possesses an inverse is said to be invertible. Illustration. As the function f: 7+ Z definded by f(r) = x ~ is one-to-one and onto (shown in a a previous Example) so it is invertible ae ee ae sa % bade3 7 ie, f'Q)=y-3 ie. f'(x)ax- 4 xeZ, (the co-domain of /-') Theorem. If f:4B and g:B->C be two one-to-one and onto function, then the composite function ge f:4-»C is invertible and (gof)'= fog’. : Proof. Beyond the scope of the book.Bx) Show that the peti * »Z, (the set of aly , iewers) defined by fre 2,JeZ, fs injective bur , surjective Tet x, and x) be any two elements In Z, Then f(x)= f(x;) 32m = 24) = Therefore fis injective. (ie., one-to-one), Let y be any arbitrary element in the co-domain set Z, y Then we have =5 €Z, VveZ,such that S(s)= 25 => 5 i S - So each element in the co-domain Z, has not pre-Image Unde: y, Therefore fis not surjective (i.e. onto) ~ EG Bstou that the following function g is neither surjectiy, n ective : < — y g: RR defined by o(x)=x° x eR. Let x, and x, be any two elements in R. (eyo. D Then g(x,)=9(x2) x7 =x} > x, = 4 Therefore, g(x,) = (x2) does not imply x, = x2 ) & is not injective. Let y be any arbitrary element in the co-domain R. en we have x=+,y ¢R, for negative real number y in R prinegative!teallnumber/y1 co-domain), such that f(x)=(+y) =y. So each element in the co-domain set R had no pre-image under /, g is not surjective. Show that the function y:x-{(3\-on defined by .x#V2 is surjective but not injective.Let, and x) be any two elements in & {v2} Then iS am ee fn) = fee Eons (nr +2)= 0.94) = m2 : = ae. 8 A Ae -2%) Dw my » Therefore we cannot say f(x,) = f(x) implies x, = x). fis not injective, 2 ' Let y be any arbitrary element in the co-domain set R. -=>, If y=0 then we get x=0 in Rfor which f(x) =y. (4% It ae FAO" ee-{sB] as yveR such ced that f(x)=y- 7 ~ So each element in the co-domain set R has a pre-image under f. ..f is surjective. Ex. ‘ow that the function ie R defined by f(x)=3x +5, ER is bijective. Let x,and x, be any two elements in R. Then If y#0, then we have x= termine f-'. el mEne [ace S (x1) = f(22) = 3x, +5 = 3x) +5 xy = ay <. f is one-to one. Let y be any arbitrary element in R. 5 Now y=3x+5> x= eRas yeR such that f(x) =3°~+5=y So each element in the co-domain set F has a pre-image under f. f is onto. Hence fis a bijective function. Therefore f has an inverse function f~' . R +R. Since each y y-5 in the co-domain set R has a unique pre-image in the domain R,\ pap indefined by f '(") 1S : ; ‘| and ¥=[-1.1]. Show that the funcy, ve, '(Q) JreR Bx. 6. Let XI 1X -+¥ defined by f(x)=sinx (xe X) is one-to-one and on, Find the inverse function f-':Y +X Let x, and x; be any two different real numbers inX. sink, #sinx), as any two different real numberg in x -[-3 5| have not the same sine. x) # xy =3siny, # sinx, > f(n)# (m2) f is one-to-one. Let y be any arbitrary real number in ¥=[-1,1]- Then there exist a real number x in XY -[-£.4| such that sinx = y. So each element of the co-domain set Y has a pre-image in X under f. Therefore f is onto. Hence f is a bijective function. So f has an inverse function SVX. Let y be the image of x under f. Then y= f(x)=sinx ». x=sin"'y. Thus f':Y +X is defined by f(y) = sin" y Cf '(x)=sin'x, xeY is the definition of f-. 6. Let A={a,b,c} and let soa, g: AA be given. by 1:Q->b, b+re,c-a ; gaa, boceb, Evaluating fog and) gef, show that fogeges. —- deme tr (fed) KH: agkT THEORY 1-43 Now (fea) = F(8(a)) = f(a) =b (foaXt)= (8(0))= fle)=a (feaXed= Ma= M)=¢ Also (8°14) = s( f(a) = 9(0) = ¢ (go £0) = a f(0))= ee) =5 (eo Mo= 8 (0) = s(a)= Hence, fog#gof- pe 7. Let £:R->R and g:R-R be defined by f(x)=x° +3, Ga)ext6, Then’ find the composite fg and ge f. Now, (f °g)(x)= J" io S(x+6)=(x+6)) +3227 + 12x+39 and (g° f\x)=8(f(x))= 9x? +3)=27 4346227 +9. ar 8. Find the ut of definition of S where — a =o) heey i ae ) has real value if (3x-1)(7-x)20 |. | oF ie .if 3r-120 and 7-x20 ie. if xt and <7 Es 1 ie, if gSxs7 or, if 3x-1<0 and 7-x<0 ie. if xs ; and x>7 which is impossible. So, the domain of f(x) is [; a. * 9. Find the domain of f(x)=V4+x+V9-x Let f(x) has real value if 44x20 and 9-x20 ie. if x>-4and x$9 ie. if x €[-4,«0) and x e(-»,9] Now [-4,00)(-~,9] =[-4,9] » The domain of f(x)is [4,9].lag 5 Ey/10. Pind the domain of the function £() = 3 rere 2 +640 Let /(x) has real value when x7 ~5x+6 #2 Le. when (x—3)(x-2)#0 i.e. when x#3 oF, ¥ The domain is (-,)~ {3,2} x Ex. 11. Find the domain of the function Vet 5x46 function has real value if x° -5x +6>0 the denominator should not be 0 or, if x7~3x-2x+6>0 or, if x(x-3)-2(x-3)>0 or, if (x3) (v-2)>0 ie. if x-3>0and x-9, e. if x>3and x>2 ieifx>3 (> F)q or, if x-30 ieiftebjand 2>h{/ ive. 1cycrand 22 onlyDegree = C Ss a) “y THEORY ae ie ifx?2 < Sor, x<-2 ive. if x€(--2)U(2,0) w Now (2) holds if |x| #2 ie xed (5) From (3), (4) and (6) we get the co as ) 0 ae of [-JO(,-2) (2,00) ae Find the domain of the haa v xSif, be ‘5 domain ai: ‘\ = ‘iomain of f(x)is (0, 1] é o 7 0€ v o0 and 2x-5>0and 2x-541 (1) is valid if x*-5x+2x-10>0 inition of f(x) why ; 7 RERING MATHEMATI¢g or, fx~5)+2(x-5)>0 or, (x5) (x+2)>0 if x-5>0 and x+2>0 ie. if x>Sand x>-2 ie. if x>5 or,if x-S> and x+3 weit re(} 9 aida the required domain is thy common part of (3) and (4) which is (5%) Ex. 1g¢Find the range or image set of the function Zz ( 1 a £3) “tose 2 1 since f(*)= Te < or, cos4x = 2-cos4x Since, -1 Owe get -/(x)<2 f(x)-1< f(x) 1 z ql) From the Ist part, 3f(x)21 or, se)2 From the 2nd part f(x)<1 atk « Range of f(x)is [] Taking fle) <0, we gt from (1) ~f(a)22,f(2)-12 fl) From the Ist part, 3 f(x)<1_ or, f(x) 4 “As fQ)st. From the 2nd part, f(x)21 which is impossible. Bx 8rFind the range ofthe function f(x)=—*— x Let y= >— cy tysx on, yx?=x+y=0. aa ye ty=x OF yx —xty xhas real value if its discriminant 20 i.e. (-1)’-4-y-y20 or, 1-4 y? >0 -. the range is [4sa) OY RENE v2 Let yehe me asx + 3¥2 v2 sin.x e0s.x + ¥2 or, 2 = 2 [ame gpomee| 3 or, msm) x)o3 or, 2 -a-sin(s-2) Now, ten{eg}s -1$2"-3<1 or. 252 or, 2'<2” <2? Isys2_ [the base 2>1] _ the range is [1, 2] Bx 21. Find the inverse function of f(x)=x7,x20 Let y=x° or, x=tyy. = To make it single valued we consider x=,/y (we may tak — ee tenon ve consider x= yy (we may ¢ 'y also). . the inverse function s~'(x)=Vx,x20. = Vy also). Ex. 22. Find the inverse of the function {_. faz) f(x) = log x+ Vx? +1) Let y= log (x+yx7 or, x+vi' +l or, Vx" + re” or, x +l=e +x or, 1=e"” —2xe” or, x= Interchanging x and y we get the inverse function f Va f = =e" — or. f'(x) ~ —eT THEORY 1-49 ! px, 8. IF Mex Land Mx) cap find the formula of the J ranction def. fofand find of (3). Let (0) = H/()} ai” : art (oo 0) (ref) (0) = S(F (9) = A(x= 1) = (x-1)-1=x- (fef)(x)=x-2 (e nf (3) 413 ))- 43-1)- Gk I. Short Answer Questions 1. (a) If A={1,2,3,4,5,6, 7,8, 9}, B= {2,3,4,5}, C={2,4,6,8} and Exdrcise 1 D={4,5,6, 7}, find () BUC Gi) BAD (iii) verify that (BUC)U(AUD)= (iv) verify the distributive law 4n(BUC)=(AnB)U(ANC) (v) verify the De-Morgan’s law A-(BUC)=(A-B)A(A-C) A-(BNC)=(A-B)U(A-C) (b) If U ={-1,-2,0,3,5,10, 12, 13,16}, P={-2,3,5,12}, = {-1,~2,0,5,12,13} then verify (Pag) = PUG". () If U={x:x eZand1 A=B. 12. Prove (AAB). =(A'UB)A(AUB’) 13. Prove that (AU B)OB' = Aif and only if ANB=6. 14. Prove that (AUB)A(AAB)= Ane 15. Let P, Q, R be subsets of a universal set Sand PAQ=R. Prove that (i) P=QAR, (ii) O=RAPseT THEORY 151 16. Prove that (4-8) = 4UB 17. Verify (4- B)U(ANB)= 4 18. Verify 4-(BUC)=(4- B)n(4—c) 19, Simplify the following set = 4° BUCA BAC) 20. Define the cartesian product of two sets and give an example 21. If the relation R is defined on the set of real numbers by the ale a Rb hold if |a-4 < then prove that R is not equivalence relation. 22. If A, B, C are sets, prove algebraically that Ax(BOC)=(4x B)a(4xC) 28. Define a relation on a set and give an example. 24, If R is the relation from 4 ={I,2,3,4}to B= {2,345}, find the elements in R defined by a R 6, ifa and b are both odd. Write also the domain and range of R. 25. Give an example of a relation that is both symmetric and anti-symmetric. 26. Inthe set S = {0,1,2,3,4,5, 15} the relation R is defined by 2x+3y=30 where x,yS. Find whether R is transitive, reflexive, symmetric and anti-symmetric. 27, Give an example of a relation that is symmetric and transitive but not reflexive. 28. (a) If A= {1,2,3,4}{1,2,3,4} and the relation R is defined on A by (a,b) R (c,d) if g4b=c+d, verify that R is an equivalence relation on A. (b) Determine the nature of the following relations on the set 4={1,2,3} (i) R={(3,3)}, Gi) R= {(1,2), (2,2)} (iii) R= {(1,1), (1,2), (2,3), (2,2), (3. 3).(2,1). (3, 2)}iil MATHEMATIcg | 12 ‘ ENG \ relation R on the set of integers such th, ‘N 29, Show that the " at Rbaifand only if a= or a= —b is equivalence relation 4 30. If the relation R is defined on set of oe such that a bh t R is equiy, b hold af a) -even integer, then show tha 4 Ale, 4 ty relation, 31. Prove that uniion and intersection of two symmetric Telatin, 1s symmetric 32, Find whether the relation R defiined on the set of real TUmbe,, as a Rb hold iff |a| > |d| 1s equivalence relation. 88. Find whether the relation "a is a multiple of 6" define on the set of natural number is an equivalence relation. 34. Give an example with reasons of a relation which is (i) reflexive, symmetric but not transitive, (i) symmetric, transitive but not reflexive. [W.B. U.T.2007 35. Show that the following relation R defined on Z is symmetric. transitive but not reflexive: R= {(a,b):a,.b €Z and ab > o} 36. Show that the relation "is perpendicular" to on the set of all straight lines in the plann is symmetric but neither reflexive nor transitive. 37. Is the relation “ is brother of” an equivalence relation on a set of human beings ? Why ? (Hints : Let x be a female human bein; x and hence x Rx. Thus the relatio1 relation is not symmetric] ig. So x is not a brother of n is not reflexive. Also the 38. Determine the nature of the followit ing relations R on the set Z a) R={(a,b):a,b eZ anda sb} Gi) R={(a,6):4,b €Z and 2a + 3is divisible by 5} 39. Let R be the relation in NxN which is defined by (4,b)R(c.d) if and only if ad=bc Prove that R is an equivalence relation,skT THEORY 1-63 TT 40, Examine the nature of the following relation Kon the set @ Re {abla eQanda—hisaninteyer} — (W.B.U.Tech. 2006) 41, A relation pis defined on the set Z by voy if yey ¥yeZ. Show that p 18 hot an equivalence relation. 42. Examine whether the following define a function () A= {RbAS} B= {2.4.89} and I(3)=2. A(l=4, f(4)=9, A=8 f(S)=2. i) 4= {1.234}, B= {14,916} and s(x)= x? where xed Git) V= {86.8}, P= {2,0,1,4} and F={(5.0),(6,1),(8,1)}. 48. If f:x > highest prime factor of x and the domain of f is {18, 13, 21, 15, 16, 17}, find the range set of / 44. Show that the function f is injective but not surjective (@) f :NAN defined by f(x)=x+1xeN Gi) f:Z>Q defined by f(x)=2, vez. 45. Discuss the nature of the following function : () f:R—R defined by /(x)=x°-x,xeR (ii) f:RR defined by f(x)=|x[\xeR (iii) f: RR defined by f(x)=sinx, reR. 46. Determine whether the following function is one-to-one and/ or onto f:RR given by f(x)=3x3-x, 47.Given that 4={I,2,3,4} and B={x,y, f: AB satisfy f(\)=x ? =}, how many functions t 48. fF: RoR is given by A) =X+> g:RR, is given by Sx)=sinx then find gofand f>g, and hence show that fogegos,ENGINEERING MATHEMATIcg ty “ 1 sos st x+x? and 49. If 1g R-» R where f(x) = arth. x(x) (x A(x) = 9x? - 9x +3, find the values of a and b. 50. Determine whether the function f: RR defined by f=tixy):y= x) is invertible and if so, determine / ' 51. Define partially ordered set. Illustrate with an example, 52. Prove that the set of integers is a PO set wort th " relation >- 53. Which of the following are PO sets a (Z. >). Gi) (Z, #)s ii) (Z,=) where Z is set of all intege,, 54. Write down all possible partial order relation of the 4, {a, b}. 55. Prove that the set Y = {1, 2,3, 4,6, 9} forms a PO set w.r.t the ‘divide’ relation. Draw the Hasse diagram for each. 56. Draw the Hasse diagram for the PO set (4, /) where / stand for divisibility and (i) A = {2,3,6,12,24,36} [ W.B.U.T. 2006) (ii) A = {3,6,12, 24, 48} 57. Let X={a,b,c,d,e}. Determine the relation represented by the following Hasse diagram @ Gai) 58. Find whether the following PO sets are totally ordered : (i) (N, /) where N is set of all positive integers and a/b meat b is divisible by a. (ii) The power set P(A) of a set A with two or more elements respect to C.sET THEORY 1-55 59. Draw the Hasse diagram of the PO set {P(S).c se{ny g0. Draw the Hasse diagram of the PO set {A./} where A= {81.27.9381} 61. Draw the Hasse Diagram for the divisibility relation on the set A= {2.3,6,12, 24, 36} 62. In the following PO set (P(4), <) where A = {0,1,2} find two non-coniparable elements, Answers 1. @) @) BUC={2,3,4,5,6,8} (i) Bn D= {4,5} (0) (35. 74-68, LO}, {3,4,5, 6,7,8, 10} 0 {(.22,3.8.4) (43.64.29 Gi (2.2)8.3), 8.2} 3. {4,8} 4. {1,2,3,4,5,7,8} 1G) {(1.2)(3),(2,2).(2,3).(104),(2.4)} Gi {(1.2),(2,3)} 19. A'UB'UC' 24. {(1,3),(1.5),(3,3),(3,5)}; dom (2) = {1,3}, Range (R) = {3,5} 25. {(11),(2,2)} on {1,2} 26. anti-symmetric 21. {(LL1), (2,2), (1,3), (3,1)} on {1,2,3} 28, (b) (i) symmetric, transitive but not reflexive (i) transitive but neither reflexive nor symmetric (ii) reflexive, symmetric but not transitive 32. not equivalence 83. not symmetric, i.e., not-equivalence 34. (i) Let 4={1,2,3} and the relation is R= {(1,1),(2,2),(3,3),(2,3)s(3,2),(1,2),(2, Dp. (i) Let 4= {a,b,c} and the relation is R={(a, a), (b,b), (a,6),(0,a)}. 81, No,16 NEERING —— \) 38. (\) reflexive, transitive but not symmetric (n) Equivalence relation. 40. Equivalence relation 42. (1) No, (it) byective, (iii) one-to-one, 1n 48. (3. 13, 7, 5, 2, 17} 45. (i) onto but not one-to-one (1) Neither one-to-one nor onto (im) Neither one-to-one nor onto 46. onto but not one-to-one 48. (7 ox) =sinx +39 x) = cosx, vx ER to 47. 27 1 so. yes: f (x)=? 49. a=3,b=-1 or, a=-3,b=2 53. (i) no (ii) no, (iii) yes 6 54. aRa, bRb, aRa, bRb, aRb; aRa, bRb, Ra 4 9 55. Maximal elements are 4, 6, 9, miniml elements are 1; 1.b is 1, no u,b, no Sup, Infis1 — ?\ /3 4 36 48 t 56. (i) 12 Gi) 24 12 6 6 2 3 3 57. (i) (a,c),(b,0),(e,d),(d,e) (ii) (a,b),(b,c),(c,d),(d.e) 58. (i) Not totally ordered (ii) Not totally ordered. (x,9,2) 59. (x,y) ck KP 62. {0} and {1}ght THEORY 1-67 IL Long Answer Questions 1 AB C are subsets of a Universal Set U. then show that () (4 CU(B=C) = (408) Gi) (4 (B-C)=(49 8) Gi) 4(B-C) = (49.B)-(ancy 2, Prove that (4- B)U(B- 4)=(4UB)-(AnB) 3, Prove that 4UB=(47B)A(4 AB) 4, Using Venn-diagram prove that () 49(BLC)=(A9B)U(AnC) (ii) (4-BU(B- A) =(40.B)-(Ana) 5. Using the set theory, show that H.C.F and L.C.M. of the numbers 18, 27 are 9 and 54 repectively. [Hints : H.C.F.= Largest element of 4p where A, B are set of factors of the given two numbers. L.C.M. = Least element of ST where S,T are set of multiples of the given two numbers] 6. Ina class there are 100 students. Of them 41 can speak in English, 53 can speak in Bengali and 45 can speak in Hindi. Also 16 can speak in both English and Bengali, 17 can speak in both Bengali and Hindi, 12 can speak in both English and Hindi and 5 can speak in all the three languages. (i) How many persons cannot speak in any of the three languages ? (ii) How many persons can speak in exactly one of the three languages ? (ii) How many persons can speak in exactly two of the three languages ? 7. Ina survey of 320 persons, number of persons taking tea is 210, taking milk 100 and coffee is 70. Number of persons who take tea and milk is 50, milk and coffee is 30, tea and coffee is 50. The number of persons taking all the three together is 20. Find the number of persons who take neither tea nor milk nor Coffee,‘es ENGINEERING MATHEMATICS ng the amoking habits of consume, was found that 55% amoke cigarette A, 50% amoke cigarett, : 42% amoke C, 28% smoke A and B, 20% smoke A and C, Ix smoke B and C and 10% emoke all the three cigarattes. 4 (1) What percentage do not amoke ? (n) What percentage smoke exactly 2 brands of cigarettes ? 9. If R be an equivalence relation in a set A, then show thay & In a survey concern ® ' 1s also an equivalence relation. 10. Prove that a relation defined on a set A is an equivalen,, relation if and only if p be reflexive and such that ap5 an bpc imply cpaforall a.b,ced. LL. Let &: RR be defined by x)=|x|+20 and k: RR by fined by H(x)=|x|-x,¥x eR. Find hek and koh. Show that /:R-(3}>R-{) givenby flx)=2—2 isa x-3 tive and find its inverse. 13. Show that the mapping / is bijective . Determine f~'. (i) f:R-+R defined by f(x)=x°, x eR (ii) £:00@ defined by f(x) =Sx+2,x eR. 14. If f(x)=x+Sand g(x)=x°-3 find @ fg Gi) eof (iii) gog ) (iv) (f -S)(-5) (y) (geg) (2) 15. If f(x) =4x-5, efx)= x? and #)=4 find the formula for the composite functions : @ree Gi) Oe fog Gi) gOS 16. Find the inverse of the following functions @) s(x) = 5 (ii) S(s)=sin'5.-3Sx83 Gi) fay (iv) (x)= sine -1)rit spt THEORY 159 @) FOYE FEEZO (WI) F(a (itd £0) (veto (iil) f(y) 9 17. Find w hich of the following are Partial order set «o (Z.p)when ap means | a} <4) (ii) (Zp) When ap) means Ja-b|st (iii) (Z.p) When apb means a—p<9 Gv) (2.0) when apb means a+b is an even integer. 18. Let 4={c,b.c.d} and consider the relation R={(2.a).(a.b), (a.c).(,), (¢.5).(c,e).(d,b),(d,c), (a.d)}. show that R is a PO relation. Draw its Hasse diagram. 19. Prove that the sets X = {2,3,5,30, 60, 120, 180, 360} forms a PO set w.r.t the ‘divide’ relation, Draw the Hasse diagram for each. Find the maximal and minimal element; greatest and least element; u.b., [.b. Supremum and Infimum of each of the set X. 20. Let X = {24, 18,12, 9, 8, 6, 4,3, 2,1} be ordered by the relation ‘rdivides »’. Find the Hasse diagram. 21. (a) Draw the Hasse diagram for the P.O.Set (4,/) where / stand divisibility (i) 4 =set of all factors of 30 (including 1 and 30) (ii) 4 =set of all factors of 17 (b) Let A= {2,3,5,30,60,120,180,360} . Prove that (4, /) is a PO set. Is it well ordered ? Find the () Successors of 30 (ii) Immediate successor of 120 (iii) Predecessors of 180 (iv) Immediate predecessor of 5160 }INEERING MATHEMATIC, In the BT course we say 4- # ifthe paper A my, , for studing paper Bln the B.Tech course there are eight pay. Ch on Mathematics. The paper codes and their prerequisities ay Riven below Mio1 M201 M260 M261 M340 M341 M450 Mpo9, «None M10L M101 M250 MZ01 M340 M201, M250 M450, 4p, Construct a PO set regarding this problem and draw a Has, diagram 23. Find whether the following set is a PO set w.r.t the Telation mentioned : (\,/) where \ = set of all positive integers and : - means a divides b. 4. Let Dy. be the set of all positive divisors of 36. Show that p, sa PO set w.r.t the relation ‘divisor’. Draw the Hasse diagram oj this PO set. Find (i) the Supremum and Infimum of the set {4,9} Answers 6. @) 1, Gi) 64, (iii) 30 7. 50, 8. 3, 30 11. (k-h)(x)=0 VxeR (ackXx)=20 if xa0 =-2x+20 if x<0. 12. £'()= 2238, vee RA} l-x 13.) S)=VereR Gi) M6)-*, ceo 14. @) x42 (ii) (ge A)(x) = 7 410x422 (iii) x* ~6x" +6 (iv) 5 (v)-2 4 1 2 15. G) 5-5 we i (GS) 16. (i) f "(x)= x!*(x>0) Gi) "(x)= 3sinx¢ THEORY 161 Pile a 6 OTT Gv) 1 '(x) iesin* 3 w f Vx) ye-beel (wi) \(x)=Veot ai) ¢(xeve-br20 Vie canes wi : (viii) f '@)=5 (I+ /l+ 40g x) 17. (i) no, (it) no, (iti) yes (iv) no (pis not antisymmetric)y THEORY 161 se iy) 'G)- Ww) fade yrcteet (vi) (x)= Vent (1+ Jrean | 2 (wit) f')=Vr-Lx20 (viii) 1" 17. (i) no, (i) no, (iit) ves (iv) no (pis not antisymmetric)] io ENGINEERING MATHEMAT Qy Multiple Choice Questions VL. The cet {x x @ Nand xn? where Isms 5} is (a) {4.9.16} (b) {1.4,9,16} fe) {1.4,9,16,25} (d) none 2. If {1.2,3,4,5,6,7} be universal set and A = {4 Kooy then (4U B) «= (ah {5.7} (b) {1.3.7} fe) {1,3,5,6,7} (d) none 8. If {1,2,3.4,5.6,7} be universal set and 4 = {4,3,2.1}, B= B56 then (478) = (a) {1.2.5.6} (®) {1,2,5,6,7} (©) {1,2,5} (@) none 4. If {1,2,3,4,5,6,7} be universal set and X = {2.4.6}, Y= {3.4,5.6, then (x-y)' = (a) {1,3,4,5,6} ) {1,3.4.5.6,7} © {1,2} (d) none 5. The set S={x:x+7=7} is a null set (a) Yes (b) No 6. Which of the following is a member of the set {{2.3}, {2.4}. 3.4}} (a) 2 ) 3 ©4 (d) none 7. The set {2,1} is equal to the set (a) {x: 27-3142 =0} (b) {x x -1+2=0} (c) {x:27-x-2=0} (@) nonegeT THEORY 143 aif Vis universal set and 41 then which of the following as not correct “th —— (a) And'=e 4 0) AUareu [@’ (@ y-4=4-U" @) Anu=4 . os alt A={e O3} then sug- (a) {x:x>-1} () {x:x2-I} (©) {x:x=-I} (@) null set 1. If aN ={av: x €N} then qvq3y= (@) {20.21,42,63,.0..f (b) {42,63.. © {21,42,63,.....} (d) none 12, Which of the following statements is not true regarding the twosets A and B. (a) A-BCA (b) 4-g=4 (© (A-B)UA=A (@) 4-(ANB)=4AnB 13. 4UB={I,3,5,7,9} implies (@) 3c (b) 3eB (©) 3 eboth of Aand B (d) 3 cat least one of A and B. 14. If 4= {2,3} then which of the following statement is not true (a) {2} P(4) () {2} (4) (© {2,3} P(A) @) ¢€P(A) 15. Number of elements in the power set of {a,b,c,d} is (a) 4 (b) 16 ©8 (d) 44 Lea ENGINEERING MATHEMA¢4 16, On the set 3} the relation R« {( 2.03, »} 7 Ris hy (a) symmetric (b) reflexive (c) transitive (d) not a relation at all 17. On the set {1.2.3}, R= {(3,3)} ; then 2 is (a) symmetric relation (b) transitive relation (©) reflexive relation (d) not a relation at all 18. The relation ‘<’ on the set of all integers is (a) reflexive (b) symmetric (c) transitive (d) none 19. The relation ‘<' on the set of integers is (a) reflexive (b) symmetric (c) transitive (d) none 20. The relation pis defined on the set 4 = {1,2,3.....20} by the rule apb hold if "b is three times a", Find which of the following does not belong to p (a) (9,3) (b) (6,18) (c) (1,3) (a)’ (4,12) 21. On the set {I,3,5,7} a relation R= {(1,3), (3,5), (5,3 defined. Then R is ft aaa a . (a) reflexive (b) symmetric (c) transitive (d) none 22. On the set {I,3,5} the relation R= {(1,3).(5,3),(5,1)} then Rie (a) {(1,3). (5,3), (1,5)} (b) {(3.1), (3.5), (1,5)} (c) {B.1), G5), (5.1)} (d) none of these