0 introduction 1 Orders are everywhere in Mathematics order often discussed in primary seh " og is ss than 3”, 108 greater thang _ shee Order on the natural numbers oF instructive cONeept ent be extended je ordasied mcintegers and the real set of numbers. tn othoy se ninment or specialization, Abstract} od For example the subset order on 2 i set of dogs are both subsets of the sot Of animals, constitutes a subset of the other. Those orders like the * exists incomparable elements are called elements is comparable are total ‘orders, Order theory captures the intuition of Orders that issues from such examples in a ral setting, This is achieved by specified properties that atelation < must have to a mathematical order. This More abstract approach makes mucl derive numerous theorem in the general setting, particular order. 1.LRelations and their Properties N other oi Y, this 5 ints to the subset Collection Of sets : throu, igh the set of birds and neither the birds Nor the dogs : ‘subset of ” relation for which there Partial orders; orders for which every pair of h sense, because one can without focusing on the details of any 1.1 Definition (Relation) : Let A and B be two non-empty sets, we define A. x B, the cartesion product of A and B to be the set AXB={(ab):aGA,bEB} Any subset of A x B is called a relation from A to B. Such a retation is called a binary relation. In this book, we shall be concerned only with binary relations, hence by arelation, we shall always mean a binary relation. IfR is a relation from A to B ie,, RS,A x Band if (a, 6) ER, = " write p : : i ay a and say that a is R-related to 6 anid if (a, 6) ¢ R, then we write a R 6 and say Retelated to b. IfB = A, then we say'R (R & A X A) is a relation in A. an Then there are 2 t B has n elements. Remark : A has m elements and the se diet ‘erent i" - a ‘Ato B, Since A x B. which has mn elements, has Telations from " Se ee ee -Arelation R is ina set A is said to be reflexive if (a, a) ER, foray ie i = fen 1.1.3 Definition (Symmetric Relation) 2 : A relation R in a set A is said to be Symmetric. If whenever (q 5) ER imps, @aER. R imple, 1.1.4 Definition (Anti Symmetric Relation) A relation R in a set A is said to be antisymmetric if (a, 5) €R and ( aie implies a= b ‘Thus R is anti symmetric, if a + b then possibly (a, b) © R or possibly (6, ER but never occur both. B In other words, a relation R in a set A is not antisymmetric if there exist elem a,b € A, a # b such that (a, 5) € Rand (6, a) ER. 1.1.5 Definition (Transi e Relation) Arelation R in a set A is said to be transitive if (a, 6) € Roand (b, c) © R implies (a,c) ER. e 1.1.6 Definition (Equivalence Relation) Let R be a relation in a set A. Then R is an equivalence relation in A if and only if ( Ris reflexive, ic, (a, d) ER, for all ae A @) Ris symmetric, ic, (a,b) ER = (b, a) ER, foralla, bEA Gi) Ris transitive, ie, (a,b) € Rand (b,c) ER > (a,c) ER, forall a,b, cEA Example 1. Let I be the set of all integers. Let R be the relation in T such that (a, 6) Rif and only if a — b is divisible by m, where a, 6 € I and m € I’. Then R is an equivalence Telation in I. paane 2. Let R be the relation in the real numbers defined by ‘‘a = 6”, where aba ‘eal numbers. Then R is an equivalence relation in the set of real numbers. i We now define the principal object of study in this section. “17 Definition Partial order (or just an ordered) Relation) Let ion is Hi - R be a relation in a set A. Then R is called a partial order relation in A # (@, a) ER, forallae A. ti heey a a 4e, if(a, 6) E Rand (b, a) ER> a= 6, forall abE* mele. if (4,8) ER and (b, c) ER > (a,c) ER for all a, WCE* CO) = set ofall subsets of X ie. Power set of X, then SB?‘example 2. Let N be the set of natural numbers, then usual = is.a partial order relation inN. - je. R= {(m, 2) im, n EN such that m a=, where a,b€P (iii) Transitive: IfaRb, bRe > aRe forall ab,ceP ‘A poset is generally denoted by (P, R). Remark : For convenience, we generally use the symbol < in place of R. Thus whenever wwe say that P is a poset, it would be understood that < is the relation defined on P, unless another symbol is mentioned. We read << as less than or equal to (although it may have nothing to do with usual less than or equal to that we are familiar with). Thus (P, =) is @ poset. Sometime, we also write the post (P, <) by (P, b=a'l and c= b? where 1), 7 are positive integers. Now c= b= («")" ai? c= a" where r= rr, isa positive integer. a (Z’,S)is transitive. Hence (Z'*, ) is a POSET. ample 3. Draw the Hasse diagram of (P (A), G), where. A= {a,b} (i) A= {a,b,c} SU) Here A= (a, 6) P(A)= {0 {a}, {6}, (a, 5}} Since and {a, b} are comparable with every element of P (A) also {a}, {} are "s*comparable elements(ii) Here A= {a, b, c} P(A) (5 (a), (0), {6}, (2, 8}, {a,c}, (2,0, (4,5, 0}} The elements ¢, {a, b, c} are comparable with every elements of P (A). {a}, {0} are non comparable {a}, {b, c} are non comparable {b}, {a, c} are non comparable {c}, {a, b} are non comparable {6}, {c} are non comparable {c}, {a} are non comparable. {a, b}, {a,c} are non comparable {a, 6}, {6, c} are non comparable {a, c}, {b,c} are non comparable all other sets are comparable The Hasse diagram of (P.(A), C) is {a, b,c} fa, 6} iS <] {b, ch {a} Xe} % 3 Example 4. Draw the Hasse diagram of (Dy , divide) for n = 6, 16, 24, 100 where Dy denote the set of positive divisors of n, Sol. Let D, = Set of all positive divisors of n (i) Here De= {1, 2, 3, 6} In (Ds, divide). The following elements are comparable and non: comparable ‘The element 1 is comparable with every elements of D, 2 and 6 are comparable 3 and 6 are comparable ‘rigs: 2 and 3 are comnarahleCES. oye Hasse dingram of (Dy divide) ig 2 1 ji) Here Dis = {1, 2, 4, 8, 16} 1 is comparable with every elements of Dig 7 is comparable with 4, 8, 16 4is comparable with 8, 16 8 is comparable with 16 The Hasse diagram of (D,., divide) is 16 8 4 2 1 (iy Here Das= {1, 2,3, 4, 5, 6,8, 12,24) 1 is comparable with every elements of Day 2is comparable with 4, 6, 8, 12, 24 3 is comparable with 6, 12, 24 4s comparable with 8, 12, 24 6 is comparable with 12, 24 12 is comparable with 24 2, 3 are non comparable 3,4 are non comparable 4, 6 are non comparable 8, 12 are non comparable. The Hasse diagram of (Day , divide) isSPECTRUM BOOLEAN ALGEBRA 10 (ix) Here yoo? {1s 2s 4,5, 25, 50, 100} 1 is comparable with every elements of Dioo 2s comparable with 4 10,20; 5, 100 4 js comparable with 20, 100 + is comparable with 10, 20,25, 50, 100 10 is comparable with 20, 50, 100 20 is comparable with 100 25 is comparable with 50, 100 50 is comparable with 100 2, 5 ;2,25 are non comparable 4,554, 10; 4, 25 54, 50 are non comparable 10, 25 are non comparable 20,25 ; 20, 50 are non comparable. The Hasse diagram of (Diop, divide) is 100 ample 5, Let (A, R) and (B, R’) be Pt x isa mple 5. Let ( , e POSETS. Then : B, R’ a prove that : (A Yi ‘with partial order R'’ defined by (a, b) R'"(a', b') ifaRa’ eanioe oa B. inB. euexive so aRa and R' is reflexive sob R' b inAand bR'binB (@, b)R" (a,b) is reflexive, sy pase Let (a,b), (c, d) © A x B such that a, VR" (c,d) and (6, d) R" (a,b) ¢, bR'd and cRa, dR'bCES. io uw aRecRa inAand Rg aR a=cand b=q : (a, b)= (c,d) " (+ Rand R’ are anti-symmetric) a = R'’isalso anti-symmetric, Let (a, b), (c, a), CEAxB > (@B)R" (6d) and (6, aR” Transitive Gf) = a Ro bRd and cReariy = aRoeRe and bRd,aRy 2 aReé and BR's = (@b)R' (ef) R'" is transitive, [+ Rand R’ are transitive] Hence (A x B, R") is a poset, Example 6. Let Dao = {1, 2, 3, 5, 6, 10, 15, 30} and let the relation divides be a partial ordering on D9. Determine Lub, and .L.b. of 10 and 15. Sol, Since relation is divides So lub. {a,b} =Lom. {a, 5} g.lb. {a,b} =g.d. {a, b} 1u.b.{10, 15}, = Lem. (10, 15} =30 gb. {10, 15} = g.c.d. £10, 1S}=5 Example 7. Identify the supermum, infimum, when ever they exist, MRS) @ A=@ER;x20} (i) A=(@,b)=(eER: a f(x) 52/0) V xxyeEP (i) order embedding if x<, y f(x) <2 f0) V xy EP IF f:P + Qisan order embedding, we say that P can be order embedded, or simply embedded in Q and write f:P + Qor just P+ Q. (id) order isomorphism : iff: P > Q is bijective order embedding then / is an order isomorphism, we write f:P » Qor first P = Q. Note : That every order embedding map is injective. 1.2.2 Remarks : Note that if f: P > Q is an order-preserving bijective map, then the inverse map f~! : Q-> P need not be an order-preserving. Example 1. Consider the Posets (P,<,) and (Q,$,) withthe following Hasse diagrams fine the map : f:P > Qby f(a)=x, f(6)=y, f(0) is easy to check that f isan order preserving map. : F@=t It ‘the inverse map f-! ; Q > P is not an order Preserving, for 8, 7I9Q > J") 208; b= F71(y) in, 2, et(P, <) bea poset. Then the map: P-» P (P) defined by 4 (a)= ee P- fer embedding of P into P (P) th Lean E We power set of P. thus P can b F er set P (P), van be order embedded in as binP, then $= {xEP:x (4) S90) inB (py tience # is an order preserving, The converse of this is also true je. if ab E Psuch that $ (a) & 9 (8), then {xEPix Sa} C (rEPix spy 2 asb. Tusa s binP & $(a) CG) in PP) 0, ¢ is an order embedding, 4.2.3 Theorem : Let (P, $,),(Q,s,) and (R, S,) be ordered sets and let f: P > Qand gia7R be order preserving maps. Then the map g of: P > Ris also order preserving. proofs Let Pj» P, &Pwith p, <, p,. since /:P > Q is order preserving S(D)Sy (Py) ‘Also g:Q~ Ris order preserving (f(a) $3 (4 (2) ie (80 /)(P)S; (GOS) (p,)- Thus g of is order preserving. 1.24 Theorem : Let (P,<,) and (Q,<,) be ordered sets. Then f: P > Q is an order isomorphism iff fis bijective and both fand f~! order preserving. Proof : Let f: P > Qis order isomorphism. Therefore fis order embedding and bijective QP isalso map. Thus /: P > Q is order preserving. We only need to show that _f~ order preserving. Let 4,4) © Q such that 4g,

Pis order preserving. 125 Proposition : Let P, Q, R be ordered sets and f: P > Q and g: Q > R be order ‘somorphism, Then g of: P > R is an order isomorphism. Proof: Simple exercise.EXERCISE 1() 1, Prove that an arbitrary intersection ofa famil ly Of order relatic set P is an order relation, ins ona . 2. Provethat if a, $a, $a, N defined by (x)= 13 seven, x if xisodd 4 Give an example of a bijective finetion J: P - Q such ty a PY is equivalent to (x) Sq f(y) and yet fis not an isomorphism, 5. For two ordered sets (P, Sp) and (Q, gl{ab}=a 3 asy Now a V b=lub {a,b} =5 anb=a * aVb=b Again suppose aVb=6 > lub{a,b}=b = aexbandesd b asglb{aVbaVc} = as(@Vb)A@VO)- (1) Again bs aVvb and esave 2) bAcS(aVb) AV O- From (1) and (2), we get (av 8) A (a V 6) is an upper bound of {a 5 > hblabAc}S(aV ACV OD’ le aVv(bAc) S$(aV BAY Ac} aaTo prove the second part, we have anbsa and aAcsa, aisan upper bound of a A band ac = hb{anbahcsa = (@AbV(aQhdsa. Again aAbsb and aNese . (@ABV(@AdSbVE 4 From (3) and (4), we get WY (a. 6) V (a Ao) isa lower bound of {a,b Vc} = (@Ab)V(adc)sglb{abV c} ie (@ABV(aNd SaAQVE). Example 12. Show that idempotent law follows from the absorption law. Sol. We have by absorption law a A (a V 6)=a and aV (aA b)=a Take b=a A b in the first result we set an(av(aad))=a = ana=0 Similarly in the second result Take b=a V b, we get aVv(QA@veb)=a mae e=a (Using first result) idempotent law follows from the absorption law. (P, <) bea lattice in which A and v denote the operation of meet and join abeEP. anb=a avb=5, * and uniqueness of supemum and . Infim ae era 1um of any two elements in 8 inary composition (operations) in the lattice. This flavour to the structure of a lattice and we can define a latticeences )! ith 138 i a b cen Ty composition (operations) avi eo © & P, the following condition holds. dempotency: @Na=a $ aVang ito form a lattice if for all a, 1. I 1 commutativity S28 “BAGS aVo=b yg 5 associativity? NOAA Ac; avbVdmlaV BV 3 ath 3 Absorption: (AV =a; av(anty=g We sal show that a partial ordered relation < properties of the operations A and v, on P follows as a consequences of 1) Since aN =a > asa , Sisreflexive @ Wf asbihen aA b= aand if b a=b < is commutative () ifasband bScToprove ascie,ahcna Now ab + aAb=a andbsc 5A Alo aAc=(aAb)Ac=ar(bAc)=ahb=a ie, aAc=a 3ase . S is associative similarly, we can show that then partial ordered relation = on P follows from the operation V. 14Some Special Lattices 1A Definitioin (Distributive Lattice) Lat, V, A) be a lattice (under =). Then ( ‘ud only if distributive laws holds P, V, A) is called a distributive lattice if ie, forall a, b,c € P, we have av(bAc)=(aV 8) A (aV cand aN(bVc)= Otherwise (P, V, A) is called non- (under &) is a distributive le, (@Ad)V@AO. Since for any A, B, C. P (X), we have AUBNC)=(AUB)NAUCand AMC ‘om the distributive law in set theory. BUC)=(ANB)U(ANC).6 SPECTRUM BooLeay, Avene, it is not distributive Lattice * But Since 2,3,4 EL we have 2VQGAS=2VI=2 ' But (2 V3) A (2 V 5)=30 A 30=30 This 2VGAS)#QV3)AQVS). Example 3. Prove that every chain is distributive Lattice, Sol. Let (P, <) be a chain, We define V and A by aV b=lub {a, b} ah b=glb {a,b} Since in a chain every elements are comparable also if a x=y. Hence the complement of any element in a bounded distributive Lattice if ie unique 1.4.6 Definition (Complemented Lattice) AA bounded Lattice (P, V, A, 0, 1) is said to be a complemented Latice element of P has atleast one complement. 1.4.7 Theorem If(L, V, A) is a complemented distributive Lattice, then (av b)'=a' AB! and (a A 8)! =a' Vb’ hold foralla, BEL Proof. To show (a V 6)'= a" A b', we show that a’ A 6’ is complement of @ v ie, @VA)VQ@' AS) =[aVb)VaJA [av sv by th =[(aV a) VB) V [av Vb) ih =[1VO)AfaV J=[1 A1=1 in and (@VB)A(a' AB) =[AAG@' AB) V [BAC AB) =[Qra)Ab]VIGAB) A] =[0 A b'] Vv [0A a']=[0 v a]=0 By uniqueness of the complement in a distributive lattice, we have vif (avby =a'v bi i | The other follows dually. Example 1. Let X % @ be a finite set and P(X) be a power set of X. Then P00, U, 1,9, X) isa complemented Lattice, We know that (P(x), S) form a Lattice with least element g and greatest element X 0, for any sets A, B,C © P(X), we have AAB=ANB and AVB=AUB i ANK-A)=AN(K-a)=g 4 a V(X-A)=AaU (X-A)=x Ais complement of A, P (X) is complemented Lattice.31 yee that X ~ A is th Js0, we notice the only complement of A in P (X). ent Bis any other complement of A, then AAB=@=ANB and AVB=X=AUB _ANB=AN(X-A) AUB=AU(X-A) 2 BexX-A thus X- Ais the unique complement of A. ive Hence (P(X), U, 9, @, X) is a complemented Lattice. sample 2. Give an example of bounded Lattice which is not complemented lattice. B gob Let Da = {1, 2, 3, 4, 6, 12} be the set of divisors of 12. Then Dz is a lattice under ail elation. ho 31, 12 € Dpsuch that 1 $x < 12 forall x € Dyz Djis a bounded lattice. But it is not complemented Lattice under the algebraic system (Diz, V, A) where a V b= [ub {a,b} =Lem (a,b) and aA b=glb {a,b} =g.cd (a, 6} c.d {3,4} =1 and Lem {3, 4} = 12. Since 3 and 4 are complement of each other ~- put for the divisor 2 of 12, there is no element x in Dp of which ged{2,x}=1 and Lem {2, x} = 12. ‘Thus complement of 2 does not exist in D2. Frample 3. Let Y be a vector space write S(V) = the set of all subspace of V, (S(V), €) isaposet, when C is the set inclusion. For U and W € S(V), we write U A W=UN WandU vV W=U+W. Then (S(V), V, A) is a complemented lattice. Sol, Clearly S(V) # @ as V is a subspace of V and so V & S(V). LetU, WE S(V), then U A W=UN W, isa subspace of V UAWES(V) : Also U V W=U + W= be the smallest subspace of V generated by uw, Uv Wes(v) Thus 8(V) is closed under the operation of join and meet. V itself is the Moreover, the subspace (0) is the smallest element and the subspace ‘8st element of S(V). : a if W is a complement o i =V. Thus the complement of a subspace of Vis its comp! then WN U = {0} and f a subspace U in V, # lementary subspace in V. Hence (S(V), a, v) is a complemented lattice.ple 4. Show that De-Morgan’s Laws, given by (av 6) =a' AB’ and (a A b)' =a" Vor ii hold in a complemented, distributive Lattice, | "°""*' Sol, Let(P, A, V, 0, 1) bea complemented dist tive lati (@) (av b)'=a' Ab! and “Then ne @) @Ab) =a vb io F9r @ We have wath @V BV (AB) =[@A b)V.a'] A [av 4) v6] =[@va)vaJa lavevey =[1Va}Afaviy =LAl =1 also @VbAG@ Ab) =[ava' Ady] Vv [BAC A oy) =[@nayab]v[Orsyna] =[0AB]V[0 Aa] =0Vv0 =0 Thus by definition of complement, we find that a’ Ab" isthe complement of a Vb de, (aVby=a' Ab! For (ii) We have GADVG@' vb) =[avaa'yv b)) A [ov a’ v By] =[@va)volaloveyva'] =UVbéJAtl va’ =IAl =1 also GAIN VE) =[an rai} v [ans rb] “lena rdlv (Orb) ral =(0A 6] Vv [0A a)fe cm et crusty defition oF OMPLement, we Find gy a V 6 isthe complement’of'a a 5 jen NBN nav jen ich oeudanin pence the De-Morgan’s Laws holds in complemented distributive latice.A sg sulatiees :Let(Ly V, , yas el ee fe ee he a lattice and let S.C L be a non-empty subset of L. ea oa same Ser eee, if (S, V, A) isa lattice in itself. In other 1 le ice i eet Es 2 Pescara, lattice if and only if $ is closed under both uote EY lattice isa sublattice of itself, The lattice is (D,, <)is a sublattice of (N, <) where < is the relation of sample 2 qisility- ple 3. Show that the subset S = {a, bef 1} of the lattice L= (0, a b 6 &.f, 1) Exam . ‘ ; jasse diagram is not a sublattice of L where as the subset T = (0, a, 6, c} is @ whose H ablattice of L. 1 - sf | wt \, 0 Sol. The subset S of the Lattice L has Hasse diagram 1 i\ a b34 Clearly, S is not a sublattice of L, since a A b ‘The subset T of the Lattice L has the Hasse diagram: 0 Clearly, T is a sublattice of Lasa A b=0€ Tanda v b=cerT, Example 4. Let be discrete topology on the non-empty set X. Then (2, y i late in which join and meet are union of open sets and intersestion of gyo St respectively. = Let Dy be a topology on a subst Y of X i.e. (Y, Dy) be subspace of topologic space (X, D). Then (Dy, V, A) is a sublattice of (D, Vv, A) Biel Proof. Clearly Dy = {AM Y:WA © D} be acollection of subsets of Y., Let Ayo Yand A, 9 Y be any two members of Dy. Then (ALN Y)a (Ay VY) = (A, 442) OY EA Dyas Ay AA,ED and (AYN Y)V(AD NY) = (Ay V A2) YEA Dyas AVASED Hence (Dy, V, A) is a sublattice of (D, v, A) Example 5. Show that intersection of two sublattices of a lattice is a sublattice where as union of two sublattices need not be a sublattice. Sol. Let S and T be two sublattices of the lattice (L, V, A). __ Then by definition, (S, V, A) and (T, V, A) are lattices in itself. Let x,y SMT be any element, then -&yES andy yeT AVY xXAYES and xVyxAyET xVy, xAYESNTomomorphism of Lattices 1 Definition Let (Ly,¥.4,)€nd:(L.,v9,A,)be two lattices. A mapping f:Ly—>L called: (p Ajpimhomomorphism, if f(ev,»)= /0Qv, £69) (i) Amect-homomorphism, if (20, 9)= F0)Aq £0) (iii) An order homomorphsim, ifx < y > f(x) < f(y) hold for all x, y € Ly () The function fis said to be a homomorphism (or Lattice homomorphism), if js both a join-homorphism and a meet-homomorphism., (9) _ Injective, surjective, or bijective (Lattice) homomorphism are called (Lattice), sonomorphism, epimorphism, or isomorphism respectively. 162 Remark : () If f is homomorphism from L, toL,, then f(L,)is called a momorphic image of L, (i If there is an isomorphism from L, toL.,, then we say that L, and L,, are rphic and we denote it by L, = Ly. 63 Theorem. If f:L,—>L, be a lattice homomorphism, then the homomorphic image (L,)isa sublattice of Ly. yf. Let (Lys¥ps,)and (LysV2sAp) be two lattices and f:L1->L, be a Lattice smomorphism. Let x,y€f(L,)be any clement, then 3 x,y, €L,such that f(%)=x, (1)= yp. Since L, isa lattice, therefore, x, v, y, and x, a, y, exits in Ly Now %yV2Vq = FH)2LO)= FEY WELL) also Hy AgVp = SO)AQLOD)= SOA MELE Therefore, forall x,y, ¢/(Ly)- We have x, V2 Yo» %222€S (Li) Thus f(L,)isa lattice. Hence f(L,) isa sublattice of L. 1.64 Theorem. Every join (or meet)-homomorphism is an order homomorphism. roof, Firstly, let f LL, be joint-homomorphism. Let x,yeL, such thatx sy xv) Y= . S@v,y) =f0) Fv, £0) =f0) £@) $0)Hence fis an order homomorphism. secondly, let f:L, —>L, be meet-homomorphism, Lot x,yeL, such thaty Sy x Ay yay = I (xa) = SL) = LALO) “SO = S@) $f/0) Thus xsy 2f@) Sf) Hence fis an order homomorphism. 1.6.5 Remark. The converse of Theorem 1.5.4 need not be true. Example 1. Give an example of an order homomorphism which is (a) _ Nota joint-homomorphism (4) Not a mect-homomorphism. (©) Neither a joint homomorphism nor a meet-homomorphism. Sol. Consider be Jattics L,L, and L, given in figure i) h Pay *3 0 Lattice-La Lattice-L3 yl, by £0)=F(x) =F04) = 03, FA)=b- ler homomorphism. My) = £04) = 1, but FOR) vy F()= 94 ¥2 % *» ¥ SO) VSO) n-homomorphism., nats, Py he function ny Define 1 Phy by 2(0,)=0,, ett) ale) eae ly carly. is an onder homomorphism, ‘ a Ay Jy) > RCO) soe SEATS BG" Oy bu ake ROD Haag heal rs £041) # BeAr BO) ence gis pot ameet-homomorphism, «Bete He Fon REL ry by BONA, Ha) ACH I ripe leary, Ais an order homomorphism, sow AURAL) = AO) =0, bat Ate) 45 405) = 2545 7) == Adaya Hy) FACE) ny AO) Thus k is nat a joint-homomerphism. Abo A(x ¥, YY = AC) = Ly but AG), AL) = ay Vy I = Ty Alt,¥y 4) # ACRDV; AG) Thus iris not a meet-homomorphism. Frample 2, Let A = {a, &} and P(A) = (8, {@), (6), {a 5H. Then show that the lattices (ai Shand (Dg, +) are isomorphic. Sal. Define the map _f :Dg—> PCA) by L)= 6 K2)= (0). £3) > tO} £06) = 143) Ciearly, fis bijective mapping and we note thal I2e Sia} © (ESA) 26 * fa} S {a, 4) @ f(2) S/(6) and soon. Hence f is isomorphism. 6 ta.) {é)nA 1.5.6 Remark, The relationship between different types of homomorphism rea Bi § a below : ; i Isomorphism ——r ey Monomorphism Epimorphism oN Homomorphism po Join-homomorphism Meet-homomorphism — order-homomorphism a EXEKCISE 1(D) 1, Draw Hasse diagram of all lattices with upto five elements 2. Show that a lattice with three or fewer elements is a chain. 3. Show that the poset with Hasse diagram given below is not a lattice. de oo OF all positive divisiors of n, 1f D(a) isa lattice unde Dility and divide n, then show that Dim) isa sublatie of D> a lattice and a, bc EL. If g Sbse, (ii) then show that @OVONO=AaVEA@VE) ) be two lattices. Draw the Hasse d s iagram of D, x Dy: 5! a39 + 8) under the partial order whose Hasse 8 C 7 ‘ s et Consider the subset B = {1,2} and C= (3, 4 5) of A. Find (p. Allthe lower and upper bounds of B and C. (ip sib (B), lub (B), glb (C) and tub (C) Consider the lattice L = {0, a, 6, c, 1}, where Hasse diagram is given below 1 $ Show that itis a distributive lattice. 10. Consider the diamond lattice L and the pentagon lattice M as shown below 1 1 ¢ o a 6 a 0 0 Diamond Lattice Pentagon Lattice Show that the Lattices L and M are non-distributive lattices. Hint: In, aV(bAc=aetl=(aVb)A(aV ° InM, av (6A d=atc=(aV AVA40 - a SPECTRUM Booey; 174994354 4,45,1} given below : (i) Is La distributive lattice ? 11. Consider the lattice L= {0,4 (ii) What are two complements of a and ay? 12. ‘Show tat the lattice Dis complemented, but D3, is not complemented Lattice, 13. Show that the lattice (L?,<,) of 3 tuples of O and 1 is complemented. 14. Prove that the direct Product of two distributive lattices is a distributive lattice. 15. Let Dg={1,2,3,6}, the set of divisors of 6. Then show that D 6 i8 isomorphic ty B, = {00, 01, 10, 11) Hint: Define :D, > B, by f(1) = 00, (2) = 10,73) =01,f=11 16. Show that homomorphic image of a distributive lattice is a distributive lattice. 17. Let S be any set and L be a lattice. Let T be the set of all functions from S to L. Define a relation < on T bys g@ f(x) < g(x) Vx ES, g ET. Prove tit > $) form a poset. Show that (T, <) is a lattice, 38, Let L= (P ({abc}), N, U) and M IO)=), f ({a})= 2, ¢ ({5}) =3, ({4, c}) = 10 and f(a, = (D(30), ged, Jem). Define f :L>Mby SUH) = 5 F(a, b})=6, F({o, eH) =15 5, €)) = 30. Verify that fis lattice isomorphism. we Hasse diagram of the product of two lattices L and M whose Hast. J M1 hat Do is not a complemented Lattice,| Ped 6 (1,2,3,6, 12}, {1,2,3, 6, 12, 24}, (1,2, 6, 12,24}, (1, 3,6, 12, 24} + .d 8; lower bounds of B none Upper bounds of B are 3, 4, 5, 6, 7 an‘ glb(B) none, Jub (B) = 3 Upper bounds of C are 6, 7, and 8; lower bounds of Care 1, 2and 3 lb (C)=3, lub (C)=3 uy (© Lisnot a distributive lattice (complement of a,and a, and 4,and respectively.SPECTRUN, - Booty A Bu2*10=2(# 1)2V10= 19 “+ 2" does not exist. Pao = (14,4, 55, 10,20) is not 4 complemented lattice,