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 to when covers . This means that and no satisfies . Then exactly when one can go from to 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 under is the picture of a cube.
Explanations
L1 human
A Hasse diagram is a minimal picture of an order. For the divisors of under divisibility, put at the bottom and at the top. Draw a line from to and from to . Do not draw a line from to , because the path through 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
- Web https://en.wikipedia.org/wiki/Hasse_diagram, lead section
What links here
No node links to this node yet.