Scribd
Upload
26 views14 pages

CSE208 DMS Mod2 L6 Poset

The document defines key concepts related to partial orders and posets, including: - A poset is a set together with a relation that is reflexive, antisymmetric, and transitive. - Hasse diagrams provide a graphical way to represent posets by removing transitive and redundant edges from a digraph. - Maximal and minimal elements are elements in a subset that are not smaller or larger than other elements. Least upper and greatest lower bounds refer to the smallest upper or largest lower bounds of a subset.

Uploaded by

Rock V2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
26 views14 pages

CSE208 DMS Mod2 L6 Poset

The document defines key concepts related to partial orders and posets, including: - A poset is a set together with a relation that is reflexive, antisymmetric, and transitive. - Hasse diagrams provide a graphical way to represent posets by removing transitive and redundant edges from a digraph. - Maximal and minimal elements are elements in a subset that are not smaller or larger than other elements. Least upper and greatest lower bounds refer to the smallest upper or largest lower bounds of a subset.

Uploaded by

Rock V2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 14

Amity School of Engineering Technology

Poset
A relation R on a set S is called a partial order if it is
• Reflexive
• Antisymmetric
• Transitive

Notation:
a b, when (a,b) R

1
Amity School of Engineering Technology

Example
• Let R ={1,2,3} identify the relation RxR is
poset or not.
• RxR ={(1,1),(1,2)(1,3),(2,1),(2,2),(2,3),
(3,1),(3,2),(3,3)}
• The 3 condition for poset are:
– Reflexive : {(a,a) should belongs to R for
Every element of set}
– In our case it is true hence it is refelxive
2
Amity School of Engineering Technology

– Anitsymmetric: if(a,b)ϵ R then (b,a) not


belongs to R unless a=b.
– In our case antisymmetric property doesnot
hold good. As Cartesian product always
results in all possible element.
– Therefore the RxR is not a poset.

3
Amity School of Engineering Technology

Hasse Diagrams
• Patrial order set have conventional graphical
representation called Hasse diagram.
• Hasse diagram can be drawn from digraph
of the relation
• Remove all self loops
• Remove all transitive edges
• Remove directions on edges assuming that
they are oriented upwards

4
Amity School of Engineering Technology

Example
• Convert the following Digraph to Hasse
Diagram.

5
Amity School of Engineering Technology

Hasse Diagram

6
Amity School of Engineering Technology

• Draw Hasse diagram for ({3, 4, 12, 24,


48, 72}, /)

In the diagram, 3 and 4 are at same


level because they are not related to
each other and they are smaller than
other elements in the set. The next
succeeding element for 3 and 4 is 12
i.e, 12 is divisible by both 3 and 4.
Then 24 is divisible by 3, 4 and 12.
Hence, it is placed above 12. 24
divides both 48 and 72 but 48 does
not divide 72. Hence 48 and 72 are 7
not joined.
Amity School of Engineering Technology

Maximal and Minimal Element


• A maximal element of a subset S of
some partially ordered set (poset) is
an element of S that is not smaller than
any other element in S.
• A minimal element of a subset S of
some partially ordered set is defined
dually as an element of S that is not
greater than any other
8
Amity School of Engineering Technology

Maximum and minimum


Element
• Maximum element: if it is maximal and
every element is related to it.
• Minimum element: If it is minimal and it
is every element of poset.

9
Amity School of Engineering Technology

Example
In the figure, we have 3 minimal
elements (2,3,5)
And 3 maximal elements (10,15,24)

No Minimum element
No maximum element

10
Amity School of Engineering Technology

Least upper bound (LUB)


• It is also called as supremum.
• It is also called as join.
• It is denoted (a v b)

11
Amity School of Engineering Technology

Upper bound and lower bound


• Upper bound:Let B be a subset of a set
A. An element xϵ A is in upper bound of
B if (y,x) ϵ poset forevery yϵB.
• Lower Bound:An element xϵ A is in
upper bound of B if (x,y) ϵ poset
forevery yϵB.

12
Amity School of Engineering Technology

Least upper bound and


Greatest lower bound

If a is an upper bound for S which is


related to all other upper bounds then it
is the least upper bound, denoted lub(S).
Similarly for the greatest lower bound,
glb(S).

13
Amity School of Engineering Technology

Example
In the poset above {a, b, c} is the greatest
element.
Ø is the least element.

14

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy