0% found this document useful (0 votes)
133 views52 pages

Poset Lattice

From Discrete Maths by Pulak Kundu

Uploaded by

writabratacse26
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
133 views52 pages

Poset Lattice

From Discrete Maths by Pulak Kundu

Uploaded by

writabratacse26
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 52
3.1 Introduction . This chapter deals with partially ordered relation which is defined on a set called partially ordered set or poset. The concept of poset is extended to an important algebraic system called lattice which is also the topic of interest of this chapter. Lattices have important applications in many areas of Applied Mathematics, applied Physics, Engineering and especially in the theory of design of computers. 2 Before going to the main topic, let us recapitulate basic ideas of relation. 3.1.1. Preliminaries Relation is a basic concept in mathematics and is considered to be an act of comparing objects which are related to one another. In many problems concerning discrete objects, we are often confronted with some kind of relationship among the objects. If A and B are two non-empty sets then a relation between A and B is a rule that associates some or all of the elements of A with elements of B. For example,"is the mother of" is a relation between the set L of all ladies strolling and ®ossiping in a park and the set C of children playing in that Park. If we denote the above relation by p then for xeZ and — YC, we sayxpy if "xis the mother of y" which may be lenoted by ordered pair (x, 9). Thus P is aset of ordered pairs elements from xC. In this case p is a proper subset of xC, ie, PC LxC- This is 50, because there exist for some *'eL and somey’ €C satisfying the negated realtion" x" is |"0t the mother of y'", 80 that (x', »’)€ p. R amiliar examples of arithmetical relations defind on the set of Natural numbers are "greater than", "less than or equal tornig divisible by" etc. Let S be a set of computer programs. We might say that two programs p, and p, from Sare related they share some common data. iw ia Posets AnD LatTICES & 230 DISCRETE Mariemario, All these examples are relatons between two objects and usually called binary relations. The relation among parent and their child, the coincidence of three straight lines, a poi 7 lying between two points on a straight line, three Programs Py» Py» Ps sharing some common data are relations amo three objects and are called ternary relations. Similar examples exist for relations among four or more objects. Here we Considey only binary reletions. Binary Relation | A binary relation p from a non-empty set A toa non. empty set Bis a subset of Ax B,ie., pC AxB. f Ifthe ordered pair (a, b)

(b, a)ep (i.e. apb => bpa) for any two elements a,be A. . Illustration The relation p on the set Zof all integers defined by p={(x,y)¢ZxZ: x+y > 5} is asymmetric relation since x + " y =y +x for any two integers x, y. III. Antisymmetric relation: A relation p on a non-empty set A is said to be antisymmetric ifap band bpa=>a=b for a,beA. Illustrations (i) The relation p on the set R of real numbers defined by "xpycxusy" forx,y,zeR is antisymmetric. Gi) Let S be a non-empty set. The relation pdefined on P(S) by"Ap Bo Ac B" for A, BEP(S) is antisymmetric, P(S) being the power set of S. IV. Transitive relation: A relation pon a non-empty set A is said to be transitive if apb and bpe => ape for any there elements a,b,ceA. cx. 234 Disc (DHEMATICS Mlustrations (i) The relation p on R defined by" x pyeoe7 7" is transitive. Similarly the relation p; on R defined by" * P19 = < y" is transitive. Gi) Let L be the set of all straight line, on a plane. Then the relation p on L defined by * ip l, <2 his parallel to fp" for LL, €L istransitive. (ii) The relation p on the set Nof all natural numbers, defined by" xp yo x|y "is transitive. V. Equivalence relation: A relation p on a non-empty set ‘Aig said to be an equivalence relation if it is reflexive, ‘symmetric and transitive. Illustrations Consider the relation p on Zdefined by"x py x-y is divisible by 3." (ie."x p ¥ @ 3| (e-y)") for x, ye Z Then pis reflexive as xp x,VxeZ (as 31(x—x)); pis symmnetric as yeZ (because, if 3|(x-y) then xpy=ypx, for x, xpzfor 31(-x)) and p is transitive as =PyA9P2> x,9,.z€D (because, if 3-9) and 3|(y-2) then (x-y)=94 and (y—z)= ky for some integers fy, ky, which shows that (x—z) =3(y +2), Le. B | (e-z) a8 hy, hy are integers). Hence p is an enquivalence relation on Z- Matrix Representation of Relation Let p be a relation from a non-empty finite set A to a nov empty finite set B, Let A={4,02r-dq} and B = {by Daresdal 0 that [A|=m and |=". ‘Then p ean be represented by an mxn matrix Mp defined by My =[™i}qun WHF 1 if (4:5) €P Mi = 10 if (a:b) #P = POSEng anD LATTICES . for i=1(I)m and j=1(1)n. Mlustration (@ Let p bea relation on A ={I,2,3,4} defined by p= {(ts¥)(0,2).(2,3)(2,2)48,2),2,3),(8, 4), (4,2)(4,4)} 1 af ‘Then M,=5 ; alo Been oorce Mr ooe defined by (i) Let p be a relation from A = {1,2,3} toB={p,4,r,5} = {(1, pL. a)(tr)(2.9)(2,5)8 Pd48.9)8.7)} Hoe PTF fli 1, ‘ThenM,= 2/0 1 0 al 1 150 3.2 Poset ‘A relation p on a nonempty set S is said to be a partial order relation if p is reflexive, antisymmetric and transitive, ‘A partial order relation is often denoted by =. For example, the relation p on the set R of all real numbers dofined by" py ifand only if x sy "for % y €R,isa partial order relation. This is so because, o xsxVxeR =p is reflexive: Ue Fors, “ER, x5 y,and ySx92= y= isantisymmetnc transitive, 4 For #2ER, esy,and yS2oeSz08 a _ ee a aa DISCRETE MATHEMATICS ‘A nonempty set S together with a partial order relation = on Sis called a poset or a partially ordered set and is denoted by (S.3)- . Illustration (1) (R, <) is a poset where the relation ‘<’ on R defined by “x S= T= js antisymmetric. « For RS, Te P(A), RcS and SoT> RET>GCI8 transitive. Since c is reflexive, antisymmetric and transitive, it is a partial order relation P(A). (3) CN, |) isa poset where the relation N of natural numbers is defined by =|, x,y eN to mean ‘x divides y'is a partial order relation which is justified as follows. is defined on the set © vxeN,x|x ='l’is reflexive. is antisymmetric « For x y€N,xlyand ylx=>x=y = « For x €N,xly and ylz=9 2/2 =9'|"is transitive. Since the relation ‘|’is reflexive, antisymmetric and transitive, it is a partial order relation on N- i Remark 1. The symbol < for partial order relation is often replaced by the generic symbol ‘s’ (less than or equal to! symbol). : —_— POSETS anp LATTICES 237 Dual of a Poset Let (5.2) be a poset. We define'a relation >" on $ by “arb ifand only if ba" for a,b 8. Then (S; and is called the dual of the poset (S,-). ‘The statement “(S,>) is a poset" can be justified as follows. « VaeS,axa (+(S,2) isa poset) -ara,vaeS. | =) is a poset 2. is reflexive. « For a,beS, arb and bra >b+aanda a= b ( is antisymmetric. © For a;b,ceS,a > band b > e=bXuande c is reflexive, antisymmetricand transitive. Hence it is a partial order relation on S. Cor isa poset. m 5. Coomeomntly (S22) 3.2.1. Comparability, Ordered Set and Chain Two elements a and b of a poset (S.3) are said to be comparable if either a < b orb (5 $1 52. At Sa te) ACS2 Si 1.0 be X0t) = (5, $52.0 82 41 51) ACh So te A te 32h) = (=) AG=4) : Ls ~; is antisymmetric on Sand +, is antisymmetric on 7] = (64) S (6a»4)- Hence ~ is antisymmetric on Sx T. © For (5154)s(S2»t2)-(s» 4s) € Sx? (Coit) Got) & (6ata) $ (6t) = (41%) A (24) 4 (G51) 0 (2524)) = ((sisi%2) A (62214) A ((:s22) (25) = (6215) (424s) x is transitive on'S and ~, is transitive on nN = (64) 3 (6%). Hence < is transitive on SxT. ‘Thus < isreflexive, antisymmetric and transitive on Sx. _< is a partial order rélation on Sx 7, Consequently; (Sx7,4) is. poset. (Proved) graphic Order Lexicor ) and (T, 42) be two posets, Let (S; 1058284 ces 241 ‘Then the relation < on Sx T defined by “(6s4)°S (Carte)if and only (5 =% and t,~,t,)” for (81, t;), (st) €S«T, is called a lexicographic order relation on SxT and the set $x T on which the lexicographic order relation < is defined for every pair of elements of Sx T is called lexicographic ordered set. ‘Theorem 3.2: Let (S,=,) and (T,,+,)be two posets. Then (SxT, 3) is a poset where ~ is the lexicographic order relation defined on Sx T. Proof. Similar to the proof of Theorem 3.1 and is left to the reader as an exercise. Illustrative Examples + if either 5% 0r Problem 1. Let p be a relation on the set Z of all integers defined by “for x, 7 €Z, xpy ifand only if x* = y” for some positive integer n. Show that (Z,p) isa poset.” Solution, We first show that p is a partial order relation on Z. © VxeZ, * Px since x' =x and 1is a positive integer. Hence p is reflexive on Z. ) © For x,y €Z, xpyAypx = x*=y andy" =x forsome Positive integers m and n. 1 => x"=y and y= 1 => x" = x" which holds only when n=1and m= Las m,n are positive integers. ‘Thus for x, ye Z, xpy and ypx>x=y- Hence p is antisymmetric on Z. Y he ™ il 5 poseTs AND LarricES 243, ee 2 < cand b < d)and( se andd < b) Sa < cande < e) and (b < dandd < f) Y 218 DISCRETE Matitessaticg «For x,9,26Z,2py and ypz = x" =y and y" =z for some positive integers mn, 2 =yand y=2". maseandbsf => (a+ib) p (e+if) Hence p is transitive on C. , b,c, d, e, f are real numbers] ome =) #02 ince mnis a positive integer. ‘Asp is reflexive, antisymmetric and transitive, itis a partial Hence p is transitive on Z.. ander relation on C. Consequénty, (C, p) is a poset. Since p is reflexive, antisymmetric and transitive on Z, i is a partial order relation on Z. Consequently, (Zp) isa poset. Problem 3. Let (S,,~)s (Sp ~2)s (Sts e)s--1 (Syn) ben posts, Then show that (S, xS,xS,x..xS,, 4) is a poset where = isa relation on S, x S, x S,x...xS, defined by a) X (b,,bgs-4b,) if and only if a 4, b on yy Sy by OM Sy.” Problem 2. Let p be a relation on the set C of all complex numbers defined by “(a+ib) p (c+id) ifand only if ase and bsa’ for (a+ib), (c+id) eC. Show that (C, p ) is a poset. Solution. We first show that = isa partial order relation Solution. We first show that p is a partially ordered relation J 0 T where T = S, x S, x S; x... « S,. on C. © Vain pny) @, (44, 035s a) P(A 2 a; X; a; as X; is reflexive oni'S; and a; €S;, j= 1)n. @,) since * V(a+ib) eC, (a+ib) p(a+ib) since asa and bsb. Hence p reflexive on C. «© For (a+ib),(c+id)eC, (a+ib) p(c+id) and (c+ id) p(a+id) =(@ s candb < d)and(c < aandd < b) =(a is reflexive on T. For(0,095-- Gy), (dba nby) Ts 5p) & (Bs Bay nr By) A Bs ayo ba) & (Ors 2s = ((y 51 by) 4 (a2 =a 2) A A (Gn Sn On)) A((G $1 1) (0 Ha 02) A (bn Sn On)) 3 (a 44) 0G 5) 4((e 5 82) 40: a) Aan (On 5a JAC 5 2H) (4,4, hx 244 S, are antisymmetric on , Sts Stroy Sy Fespectively 7 (4,4 wos Og) = (By Ba ve Be) Hence ~ is antisymmetric on T. vs a (Ba Bass Ba (ys 6) ©, (240 a, 4) $ Bass By) © Br Bas 9 By) $ (C4 ay) = (4 5.) (42 Ha by) 0 A(y Sn On) B(OH 41) (Be Ho 6) Am (Py Sp 6)) = (1B) AQ 5 4) A((2e =a ba) Ae =a )) a. ((@n Sn Pn) (On Sn &)) © For (aja, 3 (61 $1) A(2e a 6a) = (Oy 6s) [+ 1,9), are transitive on S,, S., &n) S, respectively] (4, 0,0 q) ¥ (C4, €0, Hence = is transitive on T. Thus ~ is reflexive, antisymmetric and transitive on 7. Hence < is a partial order relation on T. Consequently, (7, +) ie., (S,xS,xS,x...xS,, 4) isa poset. (Proved) Short Test 1 1. Let A= {1,2,3, 4} and p isa relation on A defined by P= {C2 0, (4,2), (1,8), (2, 2), (3, 2), (8, 8), (4,2), (4,3) (44) Show that (A, p) is a poset . Ly poseTs: a ICES 245, Show that (S,|) is a poset where S = {3, 6, 12, 24, 48} and +|" is the relation on S defined by “x |", x, 7 ¢S to mean “x divides y". Show that the relation p ={(a, 6) « Z x Z: a divides b} on Z is not a partial order relation, Z being the set of all integers. . Show that (P(S), ¢) isa poset where P(S) is the power set of Sand S={a, b,c, d}. Is P(S) is a totally ordered set? Justify your answer. Let S={1, 2,8, 4, 5} and p is a relation on S defined by e={(11), (2), (43), (1 4), (1.5), (2,2), (2,3), (2,5), (3,3), (3,5), (4, 4), (4,5), (5, 5)}. Show that (S, p) is a poset. Is it totally ordered ? Justify your answer. Find chains and antichains of this poset. Answers 4. P(S) is not totally ordered. (Justification: None of the elements {o}, {8}. {c}.{d} of P(S) ia a subset of the other.] 5.(S, p) is not totally ordered. {1, 2, 3, 5}, {1, 2, 3}, {14,5} and U} are chains and {2,4}, {3,4} are antichains, 3.2.8, Covering Relations and Hasse Diagrams Let (S, “xy ifand only if 5 y but x4 y”, x,y €S. The element x 'S said to covery if # is the subset of all sets, it is the lowest point of the diagram. Again S = {a, b, c} is the superset of all sets in P{S) it is the highest point in the diagram. Fig, 3.2. Hasse diagramm of the poset (P(S),<) where S = {a,b,c} LA 3.2.4 Special Elements in Posets Greatest and Least Elements in a Poset A poset (S,2) can have at most one element ! which satisfies lax, VxeS. This is so, because if there exists another element [' eS for which I' 1. An element fa i called the least upper bound (lub) or supremum A if * xis an upper bound for A and yr a. A 250 DISCRETE MATHEMATICS -_———Wx“—__ Serre * xy for every upper bound y for A. Similarly, an element x is said to be the greatest lower bound (glb) or infimum for A if © x isa lower bound for A, and © y Xx for every lower bound y for A. ‘The lub or supremum of any two elements a, b of S for the poset (Sx), denoted by av b (read as‘ a join b*) is an element le such that ¢ axltandb <1 and if ce is an upper bound of S then! = ¢. The glb or infimum of any two elements a, b of S for the poset (S,) denoted by ab (read as «a meet b:) is an element g¢S such that «© gXaandg T be a one-to-one mapping from S onto T. Then the function fis called an isomorphism from the poset (S, <;)to(T’, =) if for any a, be A, a,b < f(a) 4 f(b). If f:S—> T is an isomorphism then the posets (S, (T, xp) are called isomorphic posets. 4) and Illustration Consider the rolation =, on the set Z* of all positive integers defined by “a <,b ifand only ifa < b” for a,beZ*. Also let <2 be a relation on the set Z° of all positive even integers defined by “x =, y ifand only if x < y” for = y €Z®. Define a function f:Z*+ > Z° by f(a) = 2c. Then fis one- to-one since for a,b ¢Z*, f(a) = f(b) => 2a=2b=>a=b. Again, domain of f = Z*, so fis everywhere defined. Finally, for an arbitrary ceZ°, we have ¢=2a for some aeZ*. “= f(a). It follows that fis onto. ‘Thus fis one-to-one and onto. Now a,6¢Z* and a=, 6 mash = 2as2b => f(a) 32 f(b) A [+ 2a, 2b ¢Z?] 252 DISCRETE MATHEMATICS ——<$§$_— —— Ow—X—rnv"—=™_ Hence fis an isomorphisn from Z* to Z®, Consequently, the posets (e 3 ) and (2, +2) are isomorphic posets. Theorem 3.8. Let (S,=,) and (T, 32) be isomorphic posets under the isomorphism /:S—> T. Then (@ Ifa isa maximal (minimal) element of (S, =) , then {(a) is a maximal (minimal) element of (T', Gis a divisor of y) and (y is'a divisor of x) = (9 = ms for some positive integer m) and (x= ny for some Positive integer n) [-- =, y are positive integers} => y=mny = mn=1(- 9 #0) =>m=landn=1 Seay m,n are positive integers). a: mater’ yeS.7 Seay Se m= < js antisymmetric on S. For x25, xiyays =s (vis a divisor of y) and is a divisor of 2) = (y= hy for some positive integer Ay)a(z= kay for some positive integer Ft) == hykox = x isa divisor of = exit =. is transitive on S. ‘Thus < is reflexive, antisymmetric and transitive on S. Hence < isa partial order relation on S. Consequently (S, <) is a poset. Hasse diagram of the poset (S, =) is shown in Fig 3.3. 1 is the minimal element and 72 is the maximal 4¢ element of the poset (S, 3) Ans.) Let a, be S be arbitrary. Let d= ged(a,b)-Then dla and d{b- Fig 3.3 Ifp be any other common divigrotaand b, then pid ( since every common divisor of a, b divides ged (a, b)) (.d 44,430) and (p3e, psb)apsd POSETS avo 288 Thus, (dis a lower bound of the pair a, 6) and (p is a lower pound of the pair a, b) apnad Consequently, d=anb. It follows that glb of every pair of elements a,beS is gcd(a, b). For example, 29 =1, 308 =1, 6A12=72, 9A12=3 etc. Let a,beS be arbitrary and 1=1em(a,b). Then al and b|i_Iéq be any other common multiple of a and b then Iq (Ginee lem(a,b) divides every common multiple of «, 6). (aS1,b31) and (a44,b49)>13a- ‘Thus, (1 is an upper bound of the pair a, 6) and (q is an upper bound of the pair a, b) =>1 a= b. p is antisymmetric on S. (1,2) ep and (2, 2) _p => (1,2) €p (1,1) ep and (1,2) ep => (1,2) €9 (1,2) ep and (2,4) ep =>(1, 4) ep (41) ¢p and (1,3) €p=9(1,3) ep (2,2) ep and (2,4) ep =>(2. 4) ep (4 ep and (1,4) ep > (L.A) ep (0,8) ep and (3, 8) ep > (1.3) €9 (1,3) ep and (8, 4) ep =>(1. 4) ep (2,4) ep and (4,4) ep>(24) ep (1,4) ep and (4, 4) ep >(1.4) ep (8.4) ep and (4,4) ep (3,4) Ep. Hence p is transitive on S. + ‘Thus p is reflexive, antisymmetric and transitive. Therefor p isa partial order relation on S. Consequently. (S, o) post ns. Hasse diagram of this poset is shown is i Fig 3.4. 1 is the minimal as woll as the least 3 element of the poset (S.)- 0 fig the maximal as well as the greatest celoment of the poset (S:P) - 4 we POSETS AND LATTICES 257 a () Here § ={a,b,¢,¢,¢}. We observe that, vee, (xz)ep. 1p is reflexive on S. For x,y €S, wo obsorve that if (x,y) ep then (y, x) «p: ‘Thus, for(z, ye S, (=,y) ep and (y, x) ep x=. 2. is a antisymmetric on S. ‘Also we observe that, for x,y, 26S, (x9) €p and (3. .p is transitive on S. pa(uaer. a e Since p is reflexive, antisymmetric e and transitive, it is a partial order relation on S. Consequently (S,p) is poset. ‘The Hasse dingram of the poset (S,p) is shown is Fig 3.5. Fig. 8.5 Minimabelement of (S, p) area, band its maximal elements are d, ¢. The poset (S,p) has neither greatest element nor least element. Problem 3. Determine the poset 6 fe 4 whee Hasse diagram is as given in ‘ig. 3.6, 3 Solution. The required poset is (Sx) where S={12.3,4,5,6} and * Figs : aR ie 258 Discrerg tATICS © 4={0. 228,344, 4,06, 8),6,6), (1.2), (3.4),(8.5),(8.6).(1.4).(1.5),(1.6),(24),(2.5),(2,6) Note that, nodes 1 and 4 are connected via node 3. Hence along with the pairs (1, 3) and (3, 4), the pair (1, 4) must bein <. With similar arguments (1, 5),(1, 6),(2, 4),(2, 5),(2, 6) are included in <. Problem 4. Show that if A be a finite non-empty set and bea partial order defined on A, then the poset (A, =) has atleast one maximal element and has at least minimal element, Solution. Let a be any element of the finite nonempty set A. If a is not a maximal element of the poset (A, 3), then we can find an element a, ¢A such that a

You might also like