Scribd
Upload
401 views9 pages

Topic: Hasse Diagrams of Partially Ordered Sets: Group Name & Admission Number

The document discusses Hasse diagrams and partially ordered sets (posets). It provides an example of a partial order defined on a set of partitions P of another set S. The partial order relates partitions Pi and Pj such that Pi ≤ Pj if the elements of Pi are subsets of the elements of Pj. It expresses this relationship as a Hasse diagram and determines that the partial order presented forms a lattice since it has both a greatest lower bound and a least upper bound.

Uploaded by

Satyam Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
401 views9 pages

Topic: Hasse Diagrams of Partially Ordered Sets: Group Name & Admission Number

The document discusses Hasse diagrams and partially ordered sets (posets). It provides an example of a partial order defined on a set of partitions P of another set S. The partial order relates partitions Pi and Pj such that Pi ≤ Pj if the elements of Pi are subsets of the elements of Pj. It expresses this relationship as a Hasse diagram and determines that the partial order presented forms a lattice since it has both a greatest lower bound and a least upper bound.

Uploaded by

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

School of Computing Science and Engineering

Course Code : BBS01T1009 Course Name: Discrete Mathematics

TOPIC: HASSE DIAGRAMS OF PARTIALLY ORDERED


SETS

Vivek Agrahari 20SCSE1010857

Group Name
Shivang Singh 20SCSE1290081
& Admission
Number
Satyam Singh 20SCSE1010853

Shivangi Jadon 20SCSE1050014

Program Name:B.Tech(CSE)
INTRODUCTION
Equivalence Class

Let R be an equivalence relation on a set A, and


Partial Order Relation
let a ∈ A. The equivalence class of a is called the A relation R on a set S is called
set of all elements of A which are equivalent to a. a partial ordering or a partial
order of S if R is reflexive,
The equivalence class of an element x is denoted
antisymmetric, and transitive.
by [x]. A set S together with a partial
ordering R is called a partially
Partition ordered set or poset.
A partition of set X is a set P of cells or blocks that
are subsets of X.

Program Name: B.Tech (CSE)


EXAMPL
E
Related Terms
Hasse Diagram and Posset

A Hasse diagram is a graphical representation of the


Lattice
relation of elements of a partially ordered set (poset) with A lattice is an abstract structure studied in the
an implied upward orientation. A point is drawn for each
mathematical subdisciplines of order theory and
element of the partially ordered set (poset) and joined
abstract algebra. It consists of a partially ordered
with the line segment according to the following rules: - 
set in which every two elements have a unique
 If p<q in the poset, then the point corresponding to p

appears lower in the drawing than the point supremum (also called a least upper bound or

corresponding to q. join) and a unique infimum (also called a greatest

The two points p and q will be joined by line segment iff lower bound or meet).
p is related to q.
Let us move on our question
.
Question1

Set S= { a, b, c, d, e} and P be the set of partitions of S such that

P={P1,P2,P3,P4}, where P1={{ a, b, c},{ d, e}},P2={{ a, b},{ c, d, e}},P3={{a, b, c,

d, e}} and P4= {{a},{b},{c},{d},{e}} A partial order is defined on P such that Pi ≤ Pj,

if and only if all the elements of Pi are subsets of elements of Pj.

(a) Express the partial order using a Hasse diagram.

(b) Check whether it is a lattice. Explain your answer.


Solution
Given, Set S = { a, b, c, d , e}
P be the set of partitions , P= { P1, P2, P3, P4 }
where P1= { { a, b, c}, { d, e}} , P2={ { a, b}, { d, e}} , P3={ { a, b, c, d, e} }
P4 ={{a}, {b}, {c}, {d}, {e} }
So, for Partial order relation, relation should be reflexive , anti-symmetric, transitive .
Here, partial order is defined for Pi ≤ Pj if Pi ⊆ Pj .
Now, Let R be the Partial order relation,
R= { { P1, P1}, {P1, P3}, { P2, P2}, { P2, P3}, { P3, P3}, { P4, P1}, { P4, P2},
{ P4, P3}, { P4, P4} }
Here, { P1, P3} means P1 is a subset of P3 ( i.e. i=1 & j =3) and it is similar for all

sets of R.

Thus, above relation R is reflexive , anti-symmetric and transitive & hence R is

partial order relation,

a) Hasse Diagram
for partial order
relation R
b)
Lattice

A poset or partial order relation is


called Lattice if it is both MSL & JSL.
Where MSL = Meet- Semi Lattice
( Greatest Lower Bound)
Hence, the given partial order
relation R is Lattice because it has
JSL = Joint-Semi Lattice
both MSL(∧) as well as JSL(V).
( Least Upper Bound

You might also like