Partial Orders and Lattices A partial order is a relation that is reflexive and transitive. In other words, for any elements a and b in the set, the foll...
A partial order is a relation that is reflexive and transitive. In other words, for any elements a and b in the set, the following conditions hold:
a < b implies b < a
a > b implies b > a
Additionally, the relation must be antisymmetric, meaning that a < b implies b < a.
Partial orders can be represented by directed acyclic graphs (DAGs). A graph is a DAG if it has a directed edge from node a to node b if and only if a > b.
A lattice is a partially ordered set that is also algebraic, meaning it has a group operation (addition) that is compatible with the partial order. This means that the following conditions hold:
(a + b) ≤ (c + d) if a < b and c < d
a + (b + c) = (a + b) + c
Lattices are a very important class of partially ordered sets, as they are closely related to topological spaces (such as Euclidean spaces). In particular, a topological space is a lattice if and only if it is connected.
Here are some examples of partial orders and lattices:
The natural order on the set of real numbers is a partial order, but it is not a lattice.
The set of days of the week is a partial order, but it is not a lattice.
The set of ordered pairs of natural numbers is a lattice under the partial order defined by (a, b) < (c, d) if a < b and c > d.
The set of all finite strings under the partial order induced by the string comparison is a lattice.
Additional Notes:
A lattice is called a Boolean lattice if it is a lattice under the partial order induced by the logical AND operator.
A lattice is called a partial Boolean algebra (PBA) if it is a lattice under the partial order induced by the logical OR operator.
Lattices are used in a wide variety of applications, including topology, cryptography, and computer science