172.69.70.241 at 19:57, 28 January 2018

2018-01-28T19:57:05Z

172.69.70.241 at 19:56, 28 January 2018

2018-01-28T19:56:37Z

Brian: /* Wellorder */

2011-03-18T21:07:34Z

‎Wellorder

Brian: Created page with "''This article aims to provide an introduction to partial orders suitable for programmers. It is not intended to be a comprehensive overview of the mathematical theory. Changes t..."

2011-03-18T21:05:04Z

Created page with "''This article aims to provide an introduction to partial orders suitable for programmers. It is not intended to be a comprehensive overview of the mathematical theory. Changes t..."

New page

''This article aims to provide an introduction to partial orders suitable for programmers. It is not intended to be a comprehensive overview of the mathematical theory. Changes to this should be discussed on the [[Talk:Partial order|talk page]]''.

A '''partial order''' or '''partial ordering''' is a structure imposed on a set, which may imply that some elements are ''smaller'', ''less'', or ''before'' other elements, in some sense of these words. It generalizes the familiar notion of ''less than or equal to'' on numbers and is represented by the symbol ≤.

==Definition and properties==
Formally, a partial order satisfies the following three properties:
* ''Reflexivity'': <math>a \leq a</math> for any element <math>a</math>.
* ''Antisymmetry'': If <math>a \leq b</math> and <math>b \leq a</math>, then <math>a = b</math>.
* ''Transitivity'': If <math>a \leq b</math> and <math>b \leq c</math>, then <math>a \leq c</math>.
The first property tells us that an element is always less than or equal to itself. The second tells us that two elements cannot each be strictly less than the other. The third generalizes the familiar property of "chaining together" comparisons (the property that allows us to write <math>a \leq b \leq c</math> and so on).

Two elements <math>a, b</math> are said to be '''comparable''' under the partial order <math>\leq</math> if and only if ''either'' <math>a \leq b</math> or <math>b \leq a</math>. Otherwise they are '''incomparable'''. A subset in which every pair of elements is comparable is known as a '''chain'''.

A set, taken together with a partial order on that set, is known as a '''partially ordered set''' or '''poset'''. Any subset of a poset is itself a poset under the same relation ≤.

A '''strict partial order''' is similar to a partial order, but instead defines a relation, usually denoted <, which satisfies the following three properties:
* ''Irreflexivity'': <math>a \nless a</math> for any element <math>a</math>.
* ''Antisymmetry'': If <math>a < b</math>, then <math>b \nless a</math>.
* ''Transitivity'': If <math>a < b</math> and <math>b < c</math>, then <math>a < c</math>.
We can convert a partial order into a strict partial order and ''vice versa'' by toggling reflexivity.

==Examples of partially ordered sets==
The following (and all their subsets) are (non-strict) posets:
* The set of all subsets of a given set, where <math>a \leq b</math> if and only if <math>a \subseteq b</math>.
* The set of all subgraphs of a given graph, where <math>a \leq b</math> if and only if <math>a</math> is a subgraph of <math>b</math>.
* The set of all strings on a given alphabet, where <math>a \leq b</math> if and only if <math>a</math> is a substring of <math>b</math>.
* The real numbers.
* The complex numbers, where <math>a+bi \leq c+di</math> if and only if <math>a \leq c</math> and <math>b \leq d</math>.
* The integers, where <math>a \leq b</math> if and only if <math>a \mid b</math>. (Note that this is not the familiar sense of "less than or equal to" on integers.)
* The Cartesian product of any number of posets, using the [[lexicographic ordering]].

The following are strictly partially ordered sets:
* The set of human beings, where <math>a < b</math> if and only if <math>a</math> is an ancestor of <math>b</math>.
* The set of employees in a corporate hierarchy, where <math>a < b</math> if and only if <math>a</math> supervises <math>b</math>
* The set of courses in a university curriculum, where <math>a < b</math> if and only if <math>a</math> is a prerequisite for <math>b</math>
* The set of all subsets of a given set, where <math>a < b</math> if and only if <math>a \subsetneq b</math>.
* The set of all subgraphs of a given graph, where <math>a < b</math> if and only if <math>a</math> is a proper subgraph of <math>b</math>.
* The set of all substrings of a given string, where <math>a < b</math> if and only if <math>a</math> is a proper substring of <math>b</math>.
* The real numbers.
* The integers, where <math>a < b</math> if and only if <math>a</math> is a proper divisor of <math>b</math>.

(The fact that some examples appear in one list but not the other does not suggest that some sets are non-strictly partially ordered but not strictly partially ordered, or ''vice versa''; it just implies that the conversion is not meaningful.)

The following are ''not'' posets.
* The set of human beings, where <math>a < b</math> if and only if <math>a</math> is <math>b</math>'s parent. This fails to be transitive.
* The set of human beings, where <math>a \leq b</math> if and only if <math>a</math> and <math>b</math> are siblings. (This is actually an [[equivalence relation]].) This fails to be antisymmetric.
* The complex numbers, where <math>a \leq b</math> if and only if <math>\|a\| \leq \|b\|</math>. This fails to be antisymmetric.

==Representation as DAG==
A cyclic relationship cannot exist among elements of a strict poset: if <math>a_1 < a_2 < ... < a_n < a_1</math>, then, by transitivity, we obtain <math>a_1 < a_1</math>, which violates irreflexivity. Therefore, if we now let each element of a poset correspond to a vertex in a digraph, with a path existing from <math>u</math> to <math>v</math> only if <math>a < b</math>, we obtain a [[directed acyclic graph]] (DAG). (The fact that reachability is transitive is really what allows this correspondence to exist.) Note that this does not necessarily specify where the ''edges'' are in the DAG. If there are not enough edges, then the DAG will not fully represent the equivalence relation, because some paths might not exist between pairs of nodes even if they correspond to comparable elements. But there also cannot be too many; we must ensure that we do not add edges that cause a path to exist from <math>a</math> to <math>b</math> where <math>b \leq a</math> or <math>a</math> and <math>b</math> are not comparable. Still, there may be many DAGs that correspond to, and uniquely specify, a given partial order; if edges <math>(a,b)</math> and <math>(b,c)</math> already exist, for example, then the edge <math>(a,c)</math> would be redundant by transitivity (''i.e'', it would not alter the reachability properties of the DAG). Given the family of DAGs corresponding to and uniquely specifying a given partial order, the one with no redundant edges, that is, the least number of edges possible, is called the [[transitive reduction]], and the one with all possible redundant edges, that is, the greatest number of edges possible, is called the [[transitive closure]]. A path in a the transitive closure of a DAG corresponds to a chain in the poset.

==Total order==
A '''totally ordered set''' is a partially ordered set in which every pair of elements is comparable, or, equivalently, the entire set is a chain. The structure is known as a '''total order''' or '''total ordering'''. Examples of totally ordered sets are the following, and subsets thereof:
* The real numbers.
* The complex numbers, where <math>a+bi \leq c+di</math> if and only if either <math>a < c</math> or <math>a = c</math> and <math>b \leq d</math>.
* The words in a dictionary, where <math>a < b</math> if and only if <math>a</math> precedes <math>b</math> in the dictionary. (Note that <math>a</math> and <math>b</math> represent words, not the literal strings '''a''' and '''b'''.)
* The Cartesian product of any number of totally ordered sets, using the [[lexicographic ordering]].
* The people in a queue, where <math>a < b</math> if and only if <math>a</math> is ahead of <math>b</math>.

The following are ''not'' totally ordered:
* The set of all subsets of a given set, where <math>a \leq b</math> if and only if <math>a \subseteq b</math>.
* The set of all subgraphs of a given graph, where <math>a \leq b</math> if and only if <math>a</math> is a subgraph of <math>b</math>.
* The set of all strings on a given alphabet, where <math>a \leq b</math> if and only if <math>a</math> is a substring of <math>b</math>.
* The complex numbers, using the usual <math>\leq</math> relation — this is not defined on <math>\mathbb{C}</math>.
* The integers, where <math>a \leq b</math> if and only if <math>a \mid b</math>.
* The set of human beings, where <math>a < b</math> if and only if <math>a</math> is an ancestor of <math>b</math>.
* The set of employees in a corporate hierarchy, where <math>a < b</math> if and only if <math>a</math> supervises <math>b</math>.
* The set of courses in a university curriculum, where <math>a < b</math> if and only if <math>a</math> is a prerequisite for <math>b</math>.

The transitive closure of a DAG corresponding to a total order looks like the complete graph, but with each edge oriented in the appropriate direction. The transitive reduction consists of a single path that contains all vertices.

===Wellorder===
A '''wellordered set''' (sometimes written with an intervening space or hyphen) is a totally ordered set with the property that every nonempty subset has a unique least element. The natural numbers are wellordered, as are the integers in any bounded interval, and the characters of the [[ASCII]] character set. We can also construct wellorderings on Cartesian products of wellordered sets using the lexicographic ordering. The reals are ''not'' wellordered using the usual relation <math>\leq</math>; consider for example the set of positive real numbers, which has no least element. Only elements of wellordered sets may be used to index [[arrays]]. (This explains why, for example, Pascal will allow integers, characters, and enumerated types as array indices, but not reals.)

← Older revision		Revision as of 21:07, 18 March 2011
Line 71:		Line 71:

	===Wellorder===		===Wellorder===
−	A '''wellordered set''' (sometimes written with an intervening space or hyphen) is a totally ordered set with the property that every nonempty subset has a unique least element. The natural numbers are wellordered, as are the integers in any bounded interval, and the characters of the [[ASCII]] character set. We can also construct wellorderings on Cartesian products of wellordered sets using the lexicographic ordering. The reals are ''not'' wellordered using the usual relation <math>\leq</math>; consider for example the set of positive real numbers, which has no least element. Only elements of wellordered sets may be used to index [[~~arrays~~]]. (This explains why, for example, Pascal will allow integers, characters, and enumerated types as array indices, but not reals.)	+	A '''wellordered set''' (sometimes written with an intervening space or hyphen) is a totally ordered set with the property that every nonempty subset has a unique least element. The natural numbers are wellordered, as are the integers in any bounded interval, and the characters of the [[ASCII]] character set. We can also construct wellorderings on Cartesian products of wellordered sets using the lexicographic ordering. The reals are ''not'' wellordered using the usual relation <math>\leq</math>; consider for example the set of positive real numbers, which has no least element. Only elements of wellordered sets may be used to index [[array]]s. (This explains why, for example, Pascal will allow integers, characters, and enumerated types as array indices, but not reals.)

@@ Line 16: / Line 16: @@
 A '''strict partial order''' is similar to a partial order, but instead defines a relation, usually denoted <, which satisfies the following three properties:
 * ''Irreflexivity'': <math>a \nless a</math> for any element <math>a</math>.
-* ''Assymmetry'': If <math>a < b</math>, then <math>b \nless a</math>.
+* ''Asymmetry'': If <math>a < b</math>, then <math>b \nless a</math>.
 * ''Transitivity'': If <math>a < b</math> and <math>b < c</math>, then <math>a < c</math>.
 We can convert a partial order into a strict partial order and ''vice versa'' by toggling reflexivity.

Partial order - Revision history

172.69.70.241 at 19:57, 28 January 2018

172.69.70.241 at 19:56, 28 January 2018

Brian: /* Wellorder */

Brian: Created page with "''This article aims to provide an introduction to partial orders suitable for programmers. It is not intended to be a comprehensive overview of the mathematical theory. Changes t..."