Math 2.0

concept

Hasse diagram

Summary

A Hasse diagram is a drawing of a finite partially ordered set. Each element is a point, and there is a line upward from aa to bb when bb covers aa. This means that a<ba < b and no cc satisfies a<c<ba < c < b. Then a≤ba \le b exactly when one can go from aa to bb by a path that goes only upward.

Remarks

The diagram does not draw the loops of reflexivity or the lines that transitivity implies. The Hasse diagram of the power set of {1,2,3}\{1, 2, 3\} under ⊆\subseteq is the picture of a cube.

Explanations

L1 human

A Hasse diagram is a minimal picture of an order. For the divisors of 1212 under divisibility, put 11 at the bottom and 1212 at the top. Draw a line from 22 to 44 and from 22 to 66. Do not draw a line from 22 to 1212, because the path through 44 already shows it.

What this node needs for W2
  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Hasse_diagram, lead section