## Hasse DiagramsIt is a useful tool, which completely describes the associated partial order. Therefore, it is also called an ordering diagram. It is very easy to convert a directed graph of a relation on a set A to an equivalent Hasse diagram. Therefore, while drawing a Hasse diagram following points must be remembered. - The vertices in the Hasse diagram are denoted by points rather than by circles.
- Since a partial order is reflexive, hence each vertex of A must be related to itself, so the edges from a vertex to itself are deleted in Hasse diagram.
- Since a partial order is transitive, hence whenever aRb, bRc, we have aRc. Eliminate all edges that are implied by the transitive property in Hasse diagram, i.e., Delete edge from a to c but retain the other two edges.
- If a vertex 'a' is connected to vertex 'b' by an edge, i.e., aRb, then the vertex 'b' appears above vertex 'a'. Therefore, the arrow may be omitted from the edges in the Hasse diagram.
The Hasse diagram is much simpler than the directed graph of the partial order.
R = {{4, 5}, {4, 6}, {4, 7}, {5, 6}, {5, 7}, {6, 7}, {4, 4}, {5, 5}, {6, 6}, {7, 7}} The directed graph of the relation R is as shown in fig: To draw the Hasse diagram of partial order, apply the following points: - Delete all edges implied by reflexive property i.e.
(4, 4), (5, 5), (6, 6), (7, 7) - Delete all edges implied by transitive property i.e.
(4, 7), (5, 7), (4, 6) - Replace the circles representing the vertices by dots.
- Omit the arrows.
The Hasse diagram is as shown in fig:
The lower bounds of B are a and b because a and b are '≤' every elements of B. ## Least Upper Bound (SUPREMUM):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 (INFIMUM):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)
The greatest lower bound is k. Next TopicLattices |