In mathematics, given a partial order \preceq and \sqsubseteq on a set A and B, respectively, the product order (also called the coordinatewise order or componentwise order ) is a partial ordering \leq on the Cartesian product A \times B. Given two pairs and in A \times B, declare that if and Another possible ordering on A \times B is the lexicographical order. It is a total ordering if both A and B are totally ordered. However the product order of two total orders is not in general total; for example, the pairs (0, 1) and (1, 0) are incomparable in the product order of the ordering 0 < 1 with itself. The lexicographic combination of two total orders is a linear extension of their product order, and thus the product order is a subrelation of the lexicographic order. The Cartesian product with the product order is the categorical product in the category of partially ordered sets with monotone functions. The product order generalizes to arbitrary (possibly infinitary) Cartesian products. Suppose is a set and for every a \in A, is a preordered set. Then the on is defined by declaring for any and in that If every is a partial order then so is the product preorder. Furthermore, given a set A, the product order over the Cartesian product can be identified with the inclusion ordering of subsets of A. The notion applies equally well to preorders. The product order is also the categorical product in a number of richer categories, including lattices and Boolean algebras.