GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Main page
  • Contents
  • Current events
  • Random article
  • About Wikipedia
  • Contact us
  • Help
  • Learn to edit
  • Community portal
  • Recent changes
  • Upload file
  • Special pages
  • Search
  • Donate

This view

  • Original page
  • New address

GeezerVison is showing en.wikipedia.org — Product order - Wikipedia

For the business concept, see purchase order.
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 product preorder 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

  • Direct product of binary relations
  • Examples of partial orders
  • Star product, a different way of combining partial orders
  • Orders on the Cartesian product of totally ordered sets
  • Ordinal sum of partial orders
  • Ordered vector space – Vector space with a partial order

References

  1. ↑ Neggers, J.; Kim, Hee Sik (1998), "4.2 Product Order and Lexicographic Order", Basic Posets, World Scientific, pp. 64–78, ISBN 9789810235895
  2. 1 2 Sudhir R. Ghorpade; Balmohan V. Limaye (2010). A Course in Multivariable Calculus and Analysis. Springer. p. 5. ISBN 978-1-4419-1621-1.
  3. 1 2 3 Egbert Harzheim (2006). Ordered Sets. Springer. pp. 86–88. ISBN 978-0-387-24222-4.
  4. 1 2 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. 1 2 3 Paul Taylor (1999). Practical Foundations of Mathematics. Cambridge University Press. pp. 144–145 and 216. ISBN 978-0-521-63107-5.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Product_order&oldid=1385107077"
Category:
  • Order theory
Hidden categories:
  • Articles with short description
  • Short description matches Wikidata
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.