Partial order

A partial order is a reflexive, antisymmetric, and transitive relation on a set. It can leave some pairs incomparable, unlike a total order.

Binary relation: A relation between elements of sets, represented as a set of ordered pairs. A partial order is a binary relation restricted by three axioms.
Hasse diagram: A diagram representing a finite partially ordered set by its cover relations. It omits reflexive and transitive edges to expose the order's structure.
Topological sorting: A linear ordering of a directed acyclic graph's vertices that places each source before its targets. It extends precedence constraints represented by a partial order into a usable sequence.
Total order: A partial order in which every pair of elements is comparable. It adds comparability, the condition a general partial order may lack.
Garrett Birkhoff: An American mathematician known for foundational work in lattice theory and abstract algebra. His 1940 book helped establish order theory as a systematic field.
Reflexive relation: A relation in which every element is related to itself. Reflexivity requires every element to be related to itself.
Cover relation: A relation in which one element immediately precedes another, with no intermediate element between them. Cover relations are the edges retained in a Hasse diagram.
Dependency graph: A graph whose edges record that one task or component depends on another. Acyclic dependencies induce a partial order of required precedence.
Preorder: A reflexive and transitive relation that need not be antisymmetric. It drops antisymmetry, allowing distinct elements to relate in both directions.
Order theory: The branch of mathematics that studies ordered structures and relations. Partial orders are a central structure studied throughout this field.

Linked from 28 pages