# Discrete Mathematics | Hasse Diagrams

A **Hasse diagram** is a *graphical representation* of the relation of elements of a **partially ordered set (poset)** with an implied *upward orientation*. A point is drawn for each element of the partially ordered set (poset) and joined with the line segment according to the following rules:

- If
*p<q*in the poset, then the point corresponding to*p appears lower*in the drawing than the point corresponding to q. - The two points p and q will be joined by line segment
*iff p is related to q*.

To draw a Hasse diagram, provided set must be a poset.

A poset or partially ordered set A is a pair, ( B, ) of a set B whose elements are called the vertices of A and obeys following rules:

- Reflexivity → p p p B
- Anti-symmetric → p q and q p iff p=q
- Transitivity → if p q and q r then p r

**Example-1:** Draw Hasse diagram for ({3, 4, 12, 24, 48, 72}, /)

**Explanation –** According to above given question first, we have to find the poset for the divisibility.

Let the set is A.

A={(3 12), (3 24), (3 48), (3 72), (4 12), (4 24), (4 48), (4 72), (12 24), (12 48), (12 72), (24 48), (24 72)}

So, now the Hasse diagram will be:

In above 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 not joined.

We can see transitivity in our diagram as the level is increasing.

**Example-2:** Draw Hasse diagram for (D, /)

**Explanation –** Here, D means set of positive integers divisors of 12.

So, D={1, 2, 3, 4, 6, 12}

poset A = {(1 2), (1 3), (1 4), (1 6), (1

12), (2 4), (2 6), (2 12), (3 6), (3 12), (4 12), (6 12)}

So, now the Hasse diagram will be-

In above diagram, 1 is the only element that divides all other elements and smallest. Hence, it is placed at the bottom. Then the elements in our set are 2 and 3 which do not divide each other hence they are placed at same level separately but divisible by 1 (both joined by 1). 4 is divisible by 1 and 2 while 6 is divisible by 1, 2 and 3 hence, 4 is joined by 2 and 6 is joined by 2 and 3. 12 is divisible by all the elements hence, joined by 4 and 6 not by all elements because we have already joined 4 and 6 with smaller elements accordingly.

For regular Hasse Diagram:

**Maximal elements**are those which are not succeeded by another element.**Minimal elements**are those which are not preceded by another element.**Greatest element**(if it exists) is the element succeeding all other elements.**Least element**is the element that precedes all other elements.

**Note –** Greatest and Least element in Hasse diagram are only one.

*In E0xample-1, *

Maximal elements are 48 and 72 since they are succeeding all the elements.

Minimal elements are 3 and 4 since they are preceding all the elements.

Greatest element does not exist since there is no any one element that succeeds all the elements.

Least element does not exist since there is no any one element that precedes all the elements.

*In Example-2, *

Maximal and Greatest element is 12 and Minimal and Least element is 1.

## Recommended Posts:

- Discrete Mathematics | Representing Relations
- Last Minute Notes – Discrete Mathematics
- PDNF and PCNF in Discrete Mathematics
- Discrete Mathematics | Types of Recurrence Relations - Set 2
- Weak Entity Set in ER diagrams
- Recursive Relationships in ER diagrams
- Unified Modeling Language (UML) | Class Diagrams
- Discrete SeekBar in Kotlin
- Discrete Maths | Generating Functions-Introduction and Prerequisites
- Mathematics | Generalized PnC Set 2
- Mathematics | Generalized PnC Set 1
- Mathematics | Probability
- Mathematics | Predicates and Quantifiers | Set 2
- Mathematics | Rules of Inference
- Mathematics | Generating Functions - Set 2

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.