Product order

From testwiki
Jump to navigation Jump to search

Template:Short description Template:For

Hasse diagram of the product order on ℕ×ℕ

In mathematics, given partial orders ⪯ and ⊑ on sets A and B, respectively, the product order[1][2][3][4] (also called the coordinatewise order[5][3][6] or componentwise order[2][7]) is a partial order ≤ on the Cartesian product A×B. Given two pairs (a1,b1) and (a2,b2) in A×B, declare that (a1,b1)≤(a2,b2) if a1⪯a2 and b1⊑b2.

Another possible order on A×B is the lexicographical order. It is a total order 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 order 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.[3]

The Cartesian product with the product order is the categorical product in the category of partially ordered sets with monotone functions.[7]

The product order generalizes to arbitrary (possibly infinitary) Cartesian products. Suppose A≠∅ is a set and for every a∈A, (Ia,≤) is a preordered set. Then the Template:Em on ∏a∈AIa is defined by declaring for any i∙=(ia)a∈A and j∙=(ja)a∈A in ∏a∈AIa, that

i∙≤j∙ if and only if ia≤ja for every a∈A.

If every (Ia,≤) is a partial order then so is the product preorder.

Furthermore, given a set A, the product order over the Cartesian product ∏a∈A{0,1} can be identified with the inclusion order of subsets of A.[4]

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.[7]

See also

References

Template:Reflist

Template:Order theory


Template:Math-stub