Poset

A poset (partially ordered set) is a set equipped with a relation that is reflexive, antisymmetric, and transitive—allowing us to compare some elements but not necessarily all. Unlike a total order (where every pair is comparable), a poset tolerates incomparability: elements may coexist without either being "greater than" or "less than" the other.

Posets appear everywhere. The divisibility relation on integers forms one. A file system's folder hierarchy is another. The power set of any collection, ordered by subset inclusion, becomes a poset—and if it satisfies certain closure properties, a lattice.

They're essential in computer science for modeling dependencies, program analysis, and scheduling problems. In mathematics, posets generalize Boolean algebra and appear across combinatorics, topology, and category theory.

A Hasse diagram visualizes a poset by drawing elements as points and connecting related ones with lines, omitting redundant comparisons. This reveals structural beauty: chains (totally ordered sequences), antichains (mutually incomparable elements), and the "shape" of the ordering itself.

Related

Lattice (order theory), Total order, Hasse diagram, Set theory, Transitive relation