- Product order
-
In mathematics, given two ordered sets A and B, one can induce a partial ordering on the Cartesian product A × B. Given two pairs (a1,b1) and (a2,b2) in A × B, one sets
- (a1,b1) ≤ (a2,b2)
if and only if a1 ≤ a2 and b1 ≤ b2.
This ordering is called the product order. Another possible ordering on A × B is the lexicographical order.
The Cartesian product with product order is the categorical product in the category of partially ordered sets with monotone functions.
See also
- direct product of binary relations
- examples of partial orders
- orders on the Cartesian product of totally ordered sets
Categories:- Mathematics stubs
- Order theory
Wikimedia Foundation. 2010.