A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.
A partial order is reflexive, antisymmetric, and transitive, generalizing the notion of ordering without requiring all pairs be comparable. Partial orders structure posets and lattices, used in hierarchies and data structures.
You already know that a binary relation R on a set A is a subset of A × A, and that different combinations of reflexivity, symmetry, antisymmetry, and transitivity define different types of relations. A partial order is a binary relation that is reflexive (every element is related to itself: a ≤ a), antisymmetric (if a ≤ b and b ≤ a then a = b), and transitive (if a ≤ b and b ≤ c then a ≤ c). A set equipped with a partial order is called a partially ordered set or poset.
The ordinary ≤ relation on ℝ satisfies all three conditions and is the prototypical order. But the word "partial" signals the key difference from this familiar example: in a partial order, not every pair of elements needs to be comparable. Two elements a and b are comparable if a ≤ b or b ≤ a; in a partial order, there may be pairs where neither holds. The subset relation ⊆ on a family of sets illustrates this perfectly: {1, 2} and {2, 3} are neither a subset of each other nor supersets, so they are incomparable in the partial order.
Another vivid example is divisibility on the positive integers: write m ≤ n to mean "m divides n." Then 2 | 4 and 2 | 6, but 4 and 6 are incomparable because neither divides the other. The partial order captures the divisibility hierarchy — 1 is below everything, primes are just above 1, composites are above their factors — without forcing a total ranking of all integers. A partial order where every pair is comparable is a total order (or linear order), which is the special case ≤ on ℝ.
Partial orders are most naturally visualized with a Hasse diagram: draw each element as a dot, and draw an upward edge from a to b whenever a < b (i.e., a ≤ b and a ≠ b) and there is no element c strictly between them. This gives a compact picture of the ordering structure. Beyond visualization, partial orders appear whenever you need to encode precedence or dependency without full comparability: task scheduling (some tasks must precede others, but many are independent), version control (commits form a partial order under ancestry), and type theory (subtyping is a partial order on types). Recognizing these structures lets you apply the theory of posets — including bounds, chains, antichains, and lattices — to reason about them precisely.