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 a relation that is reflexive, antisymmetric (a ≤ b and b ≤ a imply a = b), and transitive. Partial orders generalize familiar orderings like ≤ on numbers and ⊆ on sets. Unlike total orders, not every pair of elements need be comparable, reflecting real hierarchical structures in mathematics.
From your study of relations, you know that a binary relation on a set A is any subset of A × A — a collection of pairs indicating which elements "stand in relation to" which. Most relations are structureless. A partial order is a relation with just enough extra structure to formalize the idea of *ranking* or *hierarchy*: some things come before others, but we don't insist that every pair is comparable.
The three defining properties each capture something essential. Reflexivity (a ≤ a for all a) says every element is at least as large as itself — nothing ranks below itself. Antisymmetry (if a ≤ b and b ≤ a then a = b) says that if two elements each dominate the other, they must be the same — no two distinct elements can be tied. Transitivity (if a ≤ b and b ≤ c then a ≤ c) says the ordering is coherent: if a comes before b and b before c, then a comes before c. These three properties together define a partially ordered set (or poset).
The word "partial" is the critical modifier. In the usual ≤ ordering on ℝ, any two real numbers can be compared: for any x, y ∈ ℝ, either x ≤ y or y ≤ x. This is called a total order or linear order, and it's the most familiar kind. But many natural orderings are only partial. Consider the subset relation ⊆ on the power set of {1, 2, 3}: we have {1} ⊆ {1, 2} and {1} ⊆ {1, 3}, but neither {1, 2} ⊆ {1, 3} nor {1, 3} ⊆ {1, 2}. These two sets are incomparable — neither comes before the other. Any two sets that are incomparable under ⊆ demonstrate why subset inclusion is only a partial order.
Partial orders appear throughout mathematics: divisibility on integers (3 divides 6, but 3 and 4 are incomparable), implication between logical propositions, refinement of partitions, and the ordering of mathematical structures by strength. A key concept in posets is the Hasse diagram, a visual representation where elements are drawn as nodes and each covering relation (b covers a when a < b with nothing in between) is drawn as an upward edge. Understanding partial orders builds direct intuition for lattices, order theory, and the hierarchical thinking that pervades abstract algebra and topology.