**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Concept# Product order

Summary

In mathematics, given a partial order and on a set and , respectively, the product order (also called the coordinatewise order or componentwise order) is a partial ordering on the Cartesian product Given two pairs and in declare that if and
Another possible ordering on is the lexicographical order, which is a total ordering. However the product order of two total orders is not in general total; for example, the pairs and are incomparable in the product order of the ordering 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.
The Cartesian product with the product order is the categorical product in the 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 preorders. The product order is also the categorical product in a number of richer categories, including lattices and Boolean algebras.

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related courses (2)

Related concepts (13)

MATH-661: Advanced Scientific Programming in Python

This seminar teaches the participants to use advanced Python concepts for writing easier to read, more flexible and faster code.
It teaches concepts in a hands-on and tangible fashion, providing examp

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a

Product order

In mathematics, given a partial order and on a set and , respectively, the product order (also called the coordinatewise order or componentwise order) is a partial ordering on the Cartesian product Given two pairs and in declare that if and Another possible ordering on is the lexicographical order, which is a total ordering. However the product order of two total orders is not in general total; for example, the pairs and are incomparable in the product order of the ordering with itself.

Linear extension

In order theory, a branch of mathematics, a linear extension of a partial order is a total order (or linear order) that is compatible with the partial order. As a classic example, the lexicographic order of totally ordered sets is a linear extension of their product order. A partial order is a reflexive, transitive and antisymmetric relation.

Lexicographic 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 totally ordered set. There are several variants and generalizations of the lexicographical ordering. One variant applies to sequences of different lengths by comparing the lengths of the sequences before considering their elements.

Related lectures (20)

Introduction to Real Analysis

Covers the basics of real function analysis, including important proofs and concepts, with an introduction to complex numbers.

Entropy: Examples and PropertiesCS-119(a): Information, Computation, CommunicationMOOC: Information, Calcul, Communication: Introduction à la pensée informatique

Explores examples of guessing letters, origins of entropy, and properties in information theory.

Equivalence Relations and Partial OrderingsCS-101: Advanced information, computation, communication I

Introduces equivalence relations, partitions, partial orderings, and total ordering concepts with examples and definitions.