In
mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
, given two
preordered set
In mathematics, especially in order theory, a preorder or quasiorder is a binary relation that is reflexive relation, reflexive and Transitive relation, transitive. Preorders are more general than equivalence relations and (non-strict) partia ...
s
and
the product order
(also called the coordinatewise order
[Davey & Priestley, '']Introduction to Lattices and Order
''Introduction to Lattices and Order'' is a mathematical textbook on order theory by Brian A. Davey and Hilary Priestley. It was published by the Cambridge University Press in their Cambridge Mathematical Textbooks series in 1990, with a second e ...
'' (Second Edition), 2002, p. 18 or componentwise order
) is a partial ordering on the
Cartesian product
In mathematics, specifically set theory, the Cartesian product of two sets ''A'' and ''B'', denoted ''A''×''B'', is the set of all ordered pairs where ''a'' is in ''A'' and ''b'' is in ''B''. In terms of set-builder notation, that is
: A\ti ...
Given two pairs
and
in
declare that
if and only if and
Another possible ordering on
is the
lexicographical order
In mathematics, the lexicographic or lexicographical order (also known as lexical order, or dictionary order) is a generalization of the alphabetical order of the dictionaries to sequences of ordered symbols or, more generally, of elements of a ...
, which is a
total ordering. However the product order of two
totally ordered sets is not in general total; for example, the pairs
and
are incomparable in the product order of the ordering
with itself. The lexicographic order of totally ordered sets 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 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 ordering of subsets of
The notion applies equally well to
preorder
In mathematics, especially in order theory, a preorder or quasiorder is a binary relation that is reflexive and transitive. Preorders are more general than equivalence relations and (non-strict) partial orders, both of which are special c ...
s. The product order is also the categorical product in a number of richer categories, including
lattices and
Boolean algebras.
References
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
In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary ...
of partial orders
*
{{math-stub
Order theory