School of Computing Science and Engineering

Course Code : BBS01T1009    Name: Discrete Mathematics

CAT – 3 Presentation
Of 
Discrete Mathematics

Enrollment Number: 20SCSE1010518, 20SCSE1010176, 20SCSE1010563

Name: Aman Mittal, Manav Behal, Animesh Kumar
Group Number: 17
Section: 5

Program Name:B.Tech(CSE)
 Question number 1
Question. Let 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.

To solve the question the pre-required knowledge is as follows - 

Program Name: B.Tech (CSE)

 Prerequisite Knowledge
• Partial order relations :  A relation R on a set A is called a partial
order relation if it satisfies the following three properties:
     Relation R is Reflexive, i.e. aRa ∀ a∈A.
     Relation R is Antisymmetric, i.e., aRb and bRa ⟹ a = b.
     Relation R is transitive, i.e., aRb and bRc ⟹ aRc.
• Hasse/POSET diagram : A Hasse diagram is a graphical rendering of
a partially ordered set displayed via the cover relation of the
partially ordered set with an implied upward orientation. A point is
drawn for each element of the poset, and line segments are drawn
between these points according to the following two rules:
Program Name: B.Tech (CSE)
 Prerequisite Knowledge
1. If x<y in the poset, then the point corresponding to x appears lower
in the drawing than the point corresponding to y.
2. The line segment between the points corresponding to any two
elements x and y of the poset is included in the drawing iff x covers
y or y covers x.

• Upper Bound: Consider B be a subset of a partially ordered set A. An

element x ∈ A is called an upper bound of B if y ≤ x for every y ∈ B.
• Lower Bound: Consider B be a subset of a partially ordered set A. An
element z ∈ A is called a lower bound of B if z ≤ x for every x ∈ B
Program Name: B.Tech (CSE)
 Prerequisite Knowledge
• Least upper bound :Let A be a subset of a partially ordered set S. An
element M in S is called an upper bound of A if M succeeds every element
of A, i.e. if, for every x in A, we have x <=M
If an upper bound of A precedes every other upper bound of A, then it is
called the supremum of A and is denoted by Sup (A)
• Greatest  lower bound: An element m in a poset S is called a lower bound
of a subset A of S if m precedes every element of A, i.e. if, for every y in A,
we have m <=y
If a lower bound of A succeeds every other lower bound of A, then it is called
the infimum of A and is denoted by Inf (A)

Program Name: B.Tech (CSE)

 Prerequisite Knowledge
• Lattice :  A lattice is an abstract structure studied in the mathematical
subdisciplines of order theory and abstract algebra. It consists of a partially
ordered set in which every two elements have a unique supremum (also
called a least upper bound or join) and a unique infimum (also called a
greatest lower bound or meet).

Now, here is the handwritten solution of the question which we have solved
using this knowledge.
Program Name: B.Tech (CSE)
SOLUTION OF QUESTION 1

Program Name: B.Tech (CSE)