or bound no

17 4. have
15 May bound
Da is 2o upperuniversal
Fig.
Ex.
3.6.4(b)and -
MU upper
lower 5
of Dp complement.
Structures
Theory
(MU) D, Complement Universal
Dgo isand
universal
30 in 1=
4A5 in 2 1= 2A52
=
2A4 5 115
2A 1 1 1
each
element niversal 10 = = = and = = =
10 5 A4 lattice. 15 5 10
and
Graph A 30 6A 10 A ahas lattice.
and and 2A 10 10 Dg0, 1. A
is iselement
complemented 3
3.6.5(a),
20 5 2 3.6.5(b),
element 15 15 5 10 Da0 complemented
Fig. ofComplement element
3.6.4(a)
Ex. 1.
because.
complements
iselement i4s elements is is is is of
3 element
10 10
least30 2ofComplement
5 6
20 of of 30 of 30 ofComplement
Discrete Ex. Complement20 10 4 10 20
Ex. greatest Complement
30 Complement
20 the greatest
.InFig. leastv5
=
the
= = =
10 v5 v4
=
5v10 v4 not Fig. orbound
=
15
= 5= 10=
every
1
Similarly 15 a
Find v 2 10 is 2v 6v v v is
or
4 But 2 2 D20 In or 10
3 So Dgo
Soln.:
OR (b)
: :
andcalled
Posets A
boundedLattice
Latica is. ise set the have l8 < complemented
13
TechKnowl
7PubIlcatiedg
a b the under D¡o =1,Shown
is 16
this
lattice. of of May May
is complement
complement be we of D30 lattice,
distributive
L Complemented
it complement.
complemented D, lattice diagram
12, -MU
if complemented of
Dgo May
lattice. 20, have
let whether
each
is
and =
complement a we diagram-MU
Hasse
3.6.3(a)
Ex.
Fig. .:. :. a. complemented 3.6.3(b)
Ex. is ifn 30,
Fig. integer
ahas D.
a
and Then The =
on n Hasse bounded
Examples
inelement
is
bare
a
I positive Thus If
n. 20}. 3.6,4(a).Determine unique
that I= bAc has
bvc0= of divisibility, The
ofc element a divisors 10,
I 0
is a its
Show = is 5, Ex. 30).
Lattice
L vc AC
=
Complement
lattice be in exists
ifevery3.6.3(A) n
3.6.4:Let
4, 15,
10,
3.6.4(b),
Ex,
Fig. that
3.6.3:
Ex. a a
EveryAbove positive 2, Fig.
of (1, Showcomplement
in 6,
and relation 5,
= 3,
shown lattice.
Soln.: all
Ex, of Dzo OR
3-32
 Posets and Lattice
Ex. 3.6.5 :
Or not Check if the Fig. Ex, 3.6.5 is a Distributive lattice
MU Dec. 19

Fig. Ex. 3.6.5

Soln.:
a vb = I, a nb = 0
Complement of a is b :. Complement of bis a
a vc = I,
Complement of a is c .. Complement of cis a
Every element has a complement. So above lattice
is complemented.
Ex. 3.6.6 : Consider the
Fig. Ex. 3.6.6. Give the complemented lattice shown in
complements of each element.
d

Fig. Ex. 3.6.6

Soln.: In the given Fig. Ex. 3.6.6 is the
greatest
element or universal upper bound and a is the least
element or universal lower bound.
bvc = e bAC = a
dve = e dAc = a
Complement of b is c Complement of d is c
Complement of c are 'b' and 'd'
Ex. 3.6.7 : Show that in a bounded distributivelattice, if a
complement exists, it is unique.
MU- May16
Soln.:fe
Let a'and a" be complements of the element,
ae L, Then
Btava' = I a va" = I

Tech Knowledge
Pu
 Theory (MU)
Graph
Structures and
Discrete a^a= 0
aa 0
weobtain
distributive laws,
Using the
a' v(ana")
a'= a' v0 = va")
(a' va)A(a'
va'A (a' va")
(a =

= Ia(a' va")
= a'va"

Also, a" = a" v0

= a'v(aa a')
va')
= (a" va)a (a"
= (a va") A (a' va")
= IA(a' va")
= a' Va"

Hence, a' = a"

3-39
Ex,
3.6,17: Find the complement of each Posets andin Lattice
element Dg:
Soln.: First we have to MUDec. 14
The set of
draw Hasse diagram of lDe
numbers
{1, 2, 3, 6, 7, 14, which divide 42 is
21, 42)
Partial order relation of
set. divisibility on the above
R = (1, 1), (1,2),
(1,3), (1,
(1, 21), (1, 42), (2, 2), (2, 6), (1, 7), (1, 14),
6), (2, 14),
(2, 42), (3, 6), (3, 6), (3, 21),
(6, 6), (6, 42), (7, 7), (7, 14), (7,(3, 42),
(7, 42), (14, 14), (14, 42), 21),
(21, 42), (42, 42))
(21, 21),
Matrix for the above relation.
1 2 3 6 7 14 21 42
1 1 1 1 1 1 1 1 1
2 1 0 1 0 1 1
3 0 0 1 1 0 1 1
M¡= 6 0 0 0 1 0 1
7 0 0 0 1 1 1 1
14 0 0 0 0 0 1 1
21 0 0 0 0 1 1
42 0 0 0 0 0 0 1

Digraph

42

Fig. Ex. 3.6.17(a)

diagram.
To convert this digraph into Hasse

Tech Knouwledge
PublÍCattons
 Discrete Structuresand Graph
Theory (MU)
3-40

In the above Hasse diagram

poset
greatest
s and Lat l
cycles and least element is
1. element :
Step 1:Remove 1v42 = 42, 1 42 = 1

42 v 1 = 42 :.Complementtof lis 42
42 ^1 = 1
21
2v 21 = 42
Complement ofR4)2is1
2A11 = 1

21 A 2Compl
= 1 ement of 2
21 v 2 = 42
is21
:.Complement of 21
3 v 14 = 42 3A 14 = 1 is2
14 v3 = 42
Complement oof 3is 14
14 a3 = 1

7v6 = 42
:.Complement of 14 is3
7A6 = 1
Fig. Ex. 3.6.1 7(b)

Step 2: Remove transitive edges: (1, 14), (1, 6), 6v7 = 42

:.Complement of 7isg
6A7 = 1
(1, 42), (1, 21), (2, 42), (3, 42), (7, 42),
:.
42 Complement
lattice, then for
of 6is 1
Ex. 3.6.18: Let L be a every a, be
that Lprove
() a vb=b ifand only if a <b
(ii) a ab=a if and only if a <b
(ii) aab=a if and only if a v b=b
Proof:
(i) Suppose that a vb=b. since a savb=b,
we have asb
Conversely, if a sb then, since b sb, b is an upper
bound of a and b, so by definition of least
upper bound we have a v b <b.
Since a vbis an upper bound, b <b, so a vb=b
(ii) The proof is analogous to the proof of part (i)
Fig. Ex. 3.6.17(c) (iii) The proof follows from parts (i) and (ii)
Step 3: All edges are pointing upward
Ex. 3.6.19: For a given set A consider the relation.
Remove all arrows from edges
R= x, y)¬ p(A), and xy)
Replace circles by dots. Where P (A) denotes. power set of A.
42
(i) Show that R is a partial ordering
relation
(i) What is the length of the longest chain in the
14 21 partially ordered. set {P (A), R}
Soln.:
(i) xcx for all xE P (A)
Property of sets.
.. x Rx for all xe P (A)
Definition of R.
.:. (x, x)e Rfor all xe P A)
Fig. Ex. 3.6.17(d) .:. Ris reflexive.

BG Tech Knowledge
 Discrele Structures and
Graph Theory(MU) 3-41
Consider
ra pair, (x, y) and (y,z) e R
Posets and Lattice
xCy & ycz ((a1, b2), (bi, d,), ((a1, b,), (b,
from defnition ofR, ba),
from property of sets ((a1, ca), (a1, ca)), ((a, ca), (a,,
d,)),
xRz or (x, z) e R (a,, c), (b;, c), ((a, C2), (bi, d,),
Given>
xRy andlyRzwe have definition of R (aj, de), (aj, d,)), (a,, dz), (b1,
dy),
,RZ for allx, y, zE P(A) ((b, a2), (bË, a2)), ((b, az), (b,
b,)),
Ris transitive, ((b1, a2), (b, ca), (b, ag), (bË, da),
Let (x, y) e R ((b1, b), (bË, b), ((b1, b2), (b;, dz),
and let (y, x) e R
X y and
((b, cz), (bË,c)), (bi, C2), (b;, d,),
yS x. (b, de), (bË, dz)))
then X = y
Digraph for the above relation
m.s98 when x *y, x Ry
true.
implies that y R x is not (b.d)
Ris anti - symnmetric
.R is partial ordering
relation as it is reflexive, (a1d2)
anti-symmetric and transitive.
(ü) Let the length of the longest chain in the
ordered set (p (A)) = n + 1 where A partially = n is (a,.b)
number of elements in A=n. ((a4.o2)

Ey 3.6.20: Let L and L2 be the lattices shown below. (a,a2)

Draw the Hasse diagram of L x L with the product partial
order. MU - Dec. 13 Fig. Ex. 3.6.20(b)
To convert this digraph into Hasse diagram
Step 1: Remove cycles
Step 2 : Remove transitive edges
((aj, a,), (aj, d,)), ((aj, a), (b1, b)), ((a,, b2),
(b, dY), (a, ap), (b,, de), (a, a,), (bi, c)),
(a,, cz), (b, d2), ((b1, az), (bË, de))
a (b1,d,)

Ly

Fig. Ex. 3.6.20(a) ((d,.d2) (b,b)

Soln:
For Lattice LË R = (a, a,), (bË, b;), (aj, b)) ((a,bg)) ((b,a))
For Lattice Lz (a,.c2)
R = ((a, a,), (bz,b2), (Cz, C2), (dg, da), (az, da), (a,ag)
(ag, b2), (az, b,), (a2, c), (bg, d,), (Cz, dz)) Fig. Ex. 3.6.20(c)
For LË x Lwith product partial order Step 3 :All edges are pointing upwards. Now remove
R= ((aj, a), (a,, a,)), ((a, a), (a1, ba), arrows from edges, replace circles by dots.
(aj, a), (a,, c2)), ((a, a,), (a, d,),
((a,, a), (b,,ag), (a,, a9), (b,, b.),
((aj, az), (b,,c), ((a, ag), (b,,d,)), R TechKnowledge
(a,, d,),
((a,, ba), (a,, b2)), (a, b¡),
catieas
PuDCa
 Discrete Structures and Graph Theory (MU)
Hasse diagram
bd,

b,b b,,Cz

a,,b, ba a,,oz

Fig. Ex. 3.6.20(d)

Ex. 3.3.33 Consider the chains of divisors of 4 and 9 L.e.
L = (1, 2, 4) and L =(1,3, 9}. Find partial ordering relation
of divisíon on L and Lo. Drawlattice of L Lo
MU- May 12, Dec 12, May 14, Dec. 15
Soln.: Partialordering relation of
division on LË is
RË = ((1, 1), (1, 2), (1, 4), (2,
2), (2, 4), (4, 4)}
Partialordering relation of division on L,
is
R = {(1, 1), (1, 3), (1,
9), (3, 3), (3, 9), (9, 9)}
3-48 Product partial order relation on Ly Ly is posels and Latli Discrete Structures and
Graph Theory
edges. (M)
:Remove transitive
2
(1, 1))((1,, 1), (1, 3), (1,
R, = ((1, 1),
Step
((1, 1), (1, 9)), ((1, 1), 3-49

,),()2,,(1,9)9),, ((1, 1), (4, 1),, ((1,, (2, 3), (1,

(1, 1), (2, 1 D), (1, 1), (2, 3), ((1,
1), (4, 3),
(1, ), (4, )),(1, 1), (44, 3), ((1, ((1, 3),, (2, 9), ((1,:3),
(1, 9), (4, 9),, (2, 1),(4,3), ,1),2,9),
(1, 1), (4, 9),
,((1,33)),),(,(24(4,,9,9)3),,), ((1,31),), (4,9),
1. 3), (1, 3)), ((1, 3), (1, 9)), (1
((1, 3), (2, 9),((1,,3), (4, 3)), ((2, 1), (4, 9)),
All
(2,9 ), (2,
((2,3),(4, 9), (4,3), (4, 1),
edges are pointing
(1, 9), (1, 9),(1, 9), (2, 9)), ((1 Step 3 : (4,9), pa

((2, 1), (2, 1),

), ((2, 1), (2, 3), ((2,
((2, 1),(4, 1), ((2, 1), (4, 3)), ((2,
((2, 3), (2, 3), (2,3),
: (2, 9)), ((2, ,
,9)1),(,4((2,4,9,9)),9),
1),
(2,9)
(4,9)
upward,. Ex

((2,93)),,((4,4,3)9),, (4,3) (
((2, 3), (4, 9), ((2,,9), (2, 9), (2,3) (
((4, 1), (4,1)), ((4, 1), (4, 3), ((4, 1), (1,9)
(4, 3), (4, 3),(4,,3), (4, 9), ((4, 9), (
Digraph of this
relation set is 9) ((4,4,9), (1,3)
(4,1)
Fig. Ex. 3.6.33(a),
(4,9)
shown in (2,1)
(1,1)
Fig.Ex. 3.6.33(c)
(4,3)
Now remove arrows from
circles by dots. Hasse edges and replace
Fig. Ex. 3.6.33(c) diagram is shown in
(2,3) (2,9)
(4,1)
3.6.34: Determine whether the
Justify your answer.relation
Ex. Ris a
(x) A= z and apartial
the set A.
orderon
a: Rb if
and onlyif = 2 b, (y) A=: and a Rbif and only if a =b for
(1,9) Some ke z.

(2,1) Soln.: (x) Ris not a partial order

relation on set Aas
transitive i.e. say.
itis not
(a. b) e Ri.e. a = 2b and
(b,c) e Ri.e. b= 2 c
but (a, c) Ri.e. a # 2 c
Fig. Ex. 3.6.33(a)
Also it is not relfexive as a Ratae A.
Toconvert this digraph into Hasse diagram (v) The relation is reflexive as a Raaez
Step l: Remove cycles where a =b and k=1
(4,9) The relation is anti-symmetric
as if aRb i.e. a = b*kez
(2,9) (4,3) bRawhere a #b
i.e. we cannot have b= a where k e 2
(4,1) The relation is transitive as say
((1.9) (2,3)
a Rb and b Rci.e. a = bkl and b= c?
k, k,e z then we have
,3) ( (2,1)) a = (ck2)k1
a = ck2ki

(1,1) a = ck3

Fig. Ex. 3.6.33(b)

Tech Knouwledge
Publ|cations
 and
Discrete Structures Graph Theory (MU) Posets and Lattice
3-51
Show that the sel of all
3.6.40
divisors of 70
forms a
EX.
1attice. May 15of
soln.: Let A be the set of all integers of all divisors
MU -

70.
A= (1, 2, 5, 7, 10, 14, 35, 70)
order relation of
Partial divisibility
on set Ais
R= ((1, ). (1, 2), (1, 5), (1, 7), (1,, 10), (1,
(1,335), (1, 70), (2, 2),, (2, 10), (2, 14),
14),
(5, 5), (5, 10), (5, 35), (5, 70), (7, 7),
(2, 70),
(7,
(7. 35), (7, 70), (10, 10), (10, 70), (14. 14) 14),
(14. 70), (35, 35), (35, 70), (70, 70)
Matrixfor the above relation is,
1 2 5 7 10 14 35 70
1 1 1 1 1 1 1 Fig. Ex. 3.6.40(b)
1 1
1 0 0 upwards. Now remove
Step 3: All edges are pointing
2 1 1 0 1
dots.
5 1 0 1 0 1 1 arrows from edges, and replace circles by
0 1 0 70
7 1 1 1
10 0 0 0 01 0 0 1
14 0 0 0 0 H
1 1 14
10
0 0 0 35
35 0 1 1
70 0 0 0 0 1
Diagraph for the above matrix is

Fig. Ex. 3.6.40(c)

LUB
10
1 2 5 7 10 14 35 70

1 2 5 7 10 14 35 70
1
2 2 2 10 14 10 14 35 70

5 5 10 5 35 10 70 35 70

7 7 14 35 7 70 14 35 70

10 10 10 10 70 10 70 70 70

14 14 14 70 14 70 14 70 70

Fig. Ex. 3.6.40(a) 35 35 35 35 35 70 70 35 70

To convert this digraph into Hasse diagram 70 70 70 70 70 70 70 70 70

GLB
Step 1 :Remove cycles
1 2 5 7 10 14 35 70
Step 2 :Remove transitive edges (1, 10), (1, 70), (1, 35),
1 1 1 1 1 1 1 1
(1, 14), (2, 70), (5, 70), (7, 70),
2 1 2 1 1 2 2 1 2
5 1 1 5 1 5 1 5 5
1 1 1 7 1 7 7 7

B Tech Knowledge
 Discrete Structures and Graph
Theory (MU) 3-52
10 1 2 5 1 10 2 5 10
14 1 2 1 7 2 14 1 14
35 1 1 5 7 5 1 35 35
70 1 2 5 7 10 14 35 70
Every pair of elements has a least upper
and a greatest lower bound. So this Hasse bound
poset is a lattice. diagram or