Hasse Diagram Example. This is the hasse diagram. Draw hasse diagram for d explanation here d means set of positive integers divisors of 12.
The hasse diagram of a finite poset is a useful tool for finding maximal and minimal elements. The resulting graph looks far simpler and is called a hasse diagram named after the german mathematician helmut hasse 1898 1979. In order theory a hasse diagram ˈ h æ s ə.
An element in is called a minimal element in if there exist no such that.
Consider the set a 4 5 6 7. Fig 1 helmut hasse 1898 1979 as an example consider the divisibility relation a b on the set. 1 2 3 4 6 8 12 mathcal p a b c subseteq the other benefit of hasse diagrams is that it is easier to pick out certain special elements. If x y then in the graph x appears lower to y.
