partially ordered set

A partially ordered set captures the idea of ‘some things come before others, but not everything is comparable’. Divisibility among integers is a perfect picture: 2 divides 6 and 3 divides 6, but 2 and 3 are not comparable — neither divides the other. The word partial is the whole point: unlike the number line, where any two numbers can be ranked, here some pairs are simply left unordered.

Formally, a partially ordered set (poset) is a pair (P, ≤) where ≤ is a binary relation on P that is reflexive (a ≤ a), antisymmetric (a ≤ b and b ≤ a imply a = b) and transitive (a ≤ b and b ≤ c imply a ≤ c). Elements a, b are comparable if a ≤ b or b ≤ a; if every pair is comparable, the order is total (a chain). Two elements with no element below both except possibly a common one, and similar configurations, give rise to the notions of meet, join, bounds, maximal and least elements.

Posets are the ambient setting for an enormous range of mathematics: subsets of a set ordered by inclusion, subgroups of a group, ideals of a ring, open sets of a topological space, and logical implication between statements are all posets. When meets and joins always exist they become lattices, and the order-theoretic vocabulary — upper bounds, suprema, monotone maps, Galois connections — organizes structure across algebra, topology and logic alike.