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.
Lattice theory studies partially ordered sets in which every pair has a greatest lower bound and a least upper bound, called its meet and join . These operations encode the order: exactly when .
The power set of a set, ordered by inclusion, forms a lattice with intersection as meet and union as join. Positive integers ordered by divisibility form another lattice: meet is the greatest common divisor and join is the least common multiple. Thus the join of two and three is six, while neither number precedes the other in this order. Lattice theory compares such structures through their algebraic identities and order properties.
Articles by others on the same topic
Order theory is a branch of mathematical logic and discrete mathematics dealing with the concepts of order and arrangement. It studies various types of ordered structures and how they relate to one another.