Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
248 views

Hasse Diagram AND Lattice

This report discusses solving a problem involving discrete mathematics concepts. The problem involves a set S with partitions P defined on it. The report defines key concepts needed to solve the problem like partial order relations, Hasse diagrams, lower/upper bounds, least/greatest bounds, and lattices. It presents the problem statement, provides explanations of these concepts, draws the Hasse diagram for the given partial order, and determines that it is a lattice since it contains least upper and greatest lower bounds for all subsets.

Uploaded by

Aman Agrawal
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
248 views

Hasse Diagram AND Lattice

This report discusses solving a problem involving discrete mathematics concepts. The problem involves a set S with partitions P defined on it. The report defines key concepts needed to solve the problem like partial order relations, Hasse diagrams, lower/upper bounds, least/greatest bounds, and lattices. It presents the problem statement, provides explanations of these concepts, draws the Hasse diagram for the given partial order, and determines that it is a lattice since it contains least upper and greatest lower bounds for all subsets.

Uploaded by

Aman Agrawal
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 10

HASSE DIAGRAM

AND
LATTICE

CAT-III Problem Based Activity Report


Submitted

By
Aman Mittal, Manav Behal, Animesh Kumar
(Enroll. No: 20SCSE1010518, 20SCSE1010176, 20SCSE1010563)

to the
DIVISION OF CHEMISTRY
GALGOTIAS UNIVERSITY
GREATER NOIDA - 201310, INDIA
JULY, 2021
CONTENTS

1. Abstract

2. Introduction

3. Problem Statement
Clearly define the problem that will be discussed in the report.

4. Discussion

5. Conclusion

6. References
ABSTRACT
Math is an important part of all programming. Discrete
mathematics is the study of mathematical structures that are
unique (aka discrete). Think integers, graphs, and logical
statements—things we use a lot in programming. Discrete math
can be used for software design specifications, analysis of
algorithms, and other practical applications, but it's really a great
tool to develop as a programmer. Put simply, it's a building
block for logical thinking. Here we will be solving a question of
discrete mathematics to explain few important topics which will
be used in solving the question are Partial order relations,
POSET/Hasse diagram, Lower bound, Upper bound, Lattice,
etc.
INTRODUCTION
The basic introduction about discrete mathematics is that it
involves distinct values; i.e. between any two points, there are a
countable number of points. For example, if we have a finite set
of objects, the function can be defined as a list of ordered pairs
having these objects, and can be presented as a complete list of
those pairs. In this report we will be telling that what are partial
order relations, how we can draw hasse diagram for any partial
order relation, whether the relation is lattice or not and few more
small but important things which will help us in solving the
question and also in increasing our logical understanding. In
short the relations which are reflexive, antisymmetric and
transitive are known as partial order relations. Now, the 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. And finally the lattice is an
abstract structure studied in the mathematical subdisciplines of
order theory and abstract algebra.
PROBLEM STATEMENT
The problem about which the report is
“ 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. ”
So in this problem, there is a universal set S = {a,b,c,d,e} is give
and a set of partitions of S such that P={P1,P2,P3,P4} is given,
in which 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}}. The partial
order is defined on P such that Pi is subset of Pj.
Now for this given data, we have to draw the hasse diagram of
the partial order and check whether it is lattice or not.
DISCUSSION
At first we will learn what is the required knowledge to solve the
question. For that we should know about partial order relations,
hasse diagram, lower bound, upper bound, least lower bound,
greatest upper bound, and lattice.
1. 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.
Ex. A={(1,1),(1,2),(1,3),(1,4),(2,2),(2,3),(2,4),(3,3),(3,4),
(4,4)}
2. 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:
a. If x<y in the poset, then the point corresponding to x
appears lower in the drawing than the point corresponding
to y.
b. 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.

Ex.
3. 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.
Ex. In the above diagram the lower bound for ({x},{y})
will be { }.
4. 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.
Ex. In the above diagram the upper bound for ({x},{y})
will be {x,y}.
5. 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.
Ex. In the above diagram the greatest lower bound for ({x},
{y}) will be { }.
6. 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.
Ex. In the above diagram the least upper bound for ({x},
{y}) will be {x,y}.
7. 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).
Ex. The partial order shown above is lattice as it contains
LUB, GLB for all the possible sets in Hasse diagram.
Solution Of The Question :
CONCLUSION

As the conclusion we can say that we have solved the


question and the handwritten solution to the question is
provided.

REFERENCES

1. Rosen Discrete Mathematics And Its Applications 7th


edition .

You might also like