Poset Lattice
Poset Lattice
(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 _ eea
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 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) =>1You might also like