Product order
Construction in order theory

In mathematics, given partial orders and
on sets
and
, respectively, the product order (also called the coordinatewise order or componentwise order) is a partial order
on the Cartesian product
Given two pairs
and
in
declare that
if
and
Another possible order on is the lexicographical order. It is a total order if both
and
are totally ordered. However the product order of two total orders is not in general total; for example, the pairs
and
are incomparable in the product order of the order
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
is a preordered set.
Then the product preorder on
is defined by declaring for any
and
in
that
if and only if
for every
If every is a partial order then so is the product preorder.
Furthermore, given a set the product order over the Cartesian product
can be identified with the inclusion order of subsets of
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.
Sources and credits
This article is adapted from the Wikipedia article “Product order”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.
Images, from Wikimedia Commons:
- N-Quadrat, gedreht.svg by Mini-floh, CC0
Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.