A Hasse diagram draws a finite partially ordered set using one point for each element and an upward line from to for each cover relation . It omits reflexive loops and comparisons already implied by paths. Line crossings are not additional elements. In a finite partially ordered set, following upward paths recovers exactly the original comparisons. The diagram is named after Helmut Hasse.
