Hasse diagram (in lattice theory)

E207316

A Hasse diagram is a simplified graphical representation of a finite partially ordered set that shows the order relations by connecting elements with upward lines without drawing implied transitive relations.

All labels observed (1)

Label Occurrences
Hasse diagram (in lattice theory) canonical 1

How this entity was disambiguated

Statements (47)

Predicate Object
instanceOf graphical representation
mathematical diagram
appliedIn algebra
computer science
domain theory
formal concept analysis
logic
assumes finite poset
basedOn covering relation in a poset
canRepresent Boolean lattice
divisibility poset
finite lattice
subset inclusion poset
characteristic edges drawn upward
edges represent cover relations
maximal elements at top
minimal elements at bottom
omits transitive edges
vertices represent elements of the poset
contrastsWith full directed acyclic graph of the order relation
domain combinatorics
discrete mathematics
universal algebra
field lattice theory
order theory
namedAfter Helmut Hasse
property encodes the same order as the underlying poset
not unique up to isomorphism of drawings
relatedTo Hasse diagram of a lattice
cover graph
distributive lattice
lattice
partial order
poset diagram
total order
transitive reduction
represents finite partially ordered set
poset
usedFor depicting covering relations
illustrating order relations
reasoning about posets
teaching lattice theory
visualizing lattices
visualizing partial orders
visualConvention higher points represent greater elements
no arrows when vertical direction indicates order
planar drawing preferred when possible

How these facts were elicited

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Helmut Hasse notableWork Hasse diagram (in lattice theory)