Order theory Created 2026-10-20 Updated 2026-11-05
Order theory studies binary relations describing precedence or comparison. A partial order is reflexive, antisymmetric and transitive; a total order additionally compares every pair. A partially ordered set records a set together with its chosen order.
Set inclusion gives a partial order on the subsets of . The subsets and are incomparable, while their least upper bound is their union. The usual order on the real numbers is total. Distinguishing a maximum from a merely maximal element is useful whenever incomparable alternatives occur, including dependencies, divisibility and optimization.