Product order

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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 a1a2 and b1b2. This ordering is called the product order,[1][2][3][4] or alternatively the coordinatewise order,[5][3][6] or even the componentwise order.[2][7]

Another possible ordering on A × B is the lexicographical order. Unlike the latter, the product order of two totally ordered sets is not total. For example, the pairs (0, 1) and (1, 0) are incomparable in the product order of 0 < 1 with itself. The lexicographic order of totally ordered sets is however a linear extension of their product order. In general, the product order is a subrelation of the lexicographic order.[3]

The Cartesian product with 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. Furthermore, given a set A, the product order over the Cartesian product A{0, 1} can be identified with the inclusion ordering 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]


  1. ^ Neggers, J.; Kim, Hee Sik (1998), "4.2 Product Order and Lexicographic Order", Basic Posets, World Scientific, pp. 64–78, ISBN 9789810235895 
  2. ^ a b Sudhir R. Ghorpade; Balmohan V. Limaye (2010). A Course in Multivariable Calculus and Analysis. Springer. p. 5. ISBN 978-1-4419-1621-1. 
  3. ^ a b c Egbert Harzheim (2006). Ordered Sets. Springer. pp. 86–88. ISBN 978-0-387-24222-4. 
  4. ^ a b Victor W. Marek (2009). Introduction to Mathematics of Satisfiability. CRC Press. p. 17. ISBN 978-1-4398-0174-1. 
  5. ^ Davey & Priestley, Introduction to Lattices and Order (Second Edition), 2002, p. 18
  6. ^ Alexander Shen; Nikolai Konstantinovich Vereshchagin (2002). Basic Set Theory. American Mathematical Soc. p. 43. ISBN 978-0-8218-2731-4. 
  7. ^ a b c Paul Taylor (1999). Practical Foundations of Mathematics. Cambridge University Press. pp. 144–145 and 216. ISBN 978-0-521-63107-5. 

See also[edit]