strict weak order 是 STL 中一个相当重要的概念

strict weak order 是 STL 中一个相当重要的概念，查了好多资料才把它弄清楚，看来咱们离散课学的东西太少了。

基本思路是这样的。

1.关系。这个不说了。

2.二元关系=关系+二元性。

3.二元关系集=集合+定义在这个集合上的二元关系。

4.严格偏序集=二元关系集+二元关系的反自反性+二元关系的传递性＋二元关系的反对称性。

5.strict weak order=严格偏序集+二元关系的transitivity of equivalence（资料上写的，我不知道怎么翻译）。

transitivity of equivalence：对于任意x,y,z属于关系R,，x(不R)y,y(不R)z->x(不R)z，就称R具有transitivity of equivalence 。

 

其实仔细想想就是这样一个关系集：

1 2 3 (3.x 3.y 3.z 3.a 3.b 3.c) 4 5 7 9 (9.x 9.y 9.z 9.a) 11 12……

通俗地说就是，我自己觉得是这样的，没有证明过，不过直觉上是相当正确的，如果有一个关系集<C,R>，设R'是C的笛卡尔积上R的补集，如果R'是C上一个等价关系，且R'决定的C的划分中的任意两部分C1,C2中的任意两元素x,y(x属于c1,y属于c2),都有xRy成立，那么这个关系集<C,R>就是一个 strict weak order。

 

原文是这样的：

Strict weak ordering

 

Strict weak ordering

view original wikipedia article report problems w/this page

 

Please let us know what is wrong with this page:

Cancel

 

In this article:

Locations

Images

From the web:

Images

Videos

 

Strict weak ordering

 

 

The 13 possible strict weak orderings on a set of three elements {a, b, c}. The only partially ordered sets are coloured, while totally ordered ones are in black. Two orderings are shown as connected by an edge if they differ by the presence or absence of a single pair in the relations defining the orderings.

In mathematics, especially order theory, a strict weak ordering is a binary relation < on a set S that is a strict partial order (a transitive relation that is irreflexive, or equivalently, that is asymmetric) in which the relation "neither a < b nor b < a" is transitive.

The equivalence classes of this "incomparability relation" partition the elements of S, and are totally ordered by <. Conversely, any total order on a partition of S gives rise to a strict weak ordering in which x < y if and only if there exists sets A and B in the partition with x in A, y in B, and A < B in the total order. Strict weak orders are often used in microeconomics to model preferences.

As a non-example, consider the partial order in the set {a, b, c} defined by the relationship b < c. The pairs a,b and a,c are incomparable but b and c are related, so incomparability does not form an equivalence relation and this example is not a strict weak ordering.

Properties

A strict weak ordering has the following properties. For all x and y in S,

• For all x, it is not the case that x < x (irreflexivity).
• For all x ≠ y, if x < y then it is not the case that y < x (asymmetric).
• For all x, y, and z, if x < y and y < z then x < z (transitivity).
• For all x, y, and z, if x is incomparable with y, and y is incomparable with z, then x is incomparable with z (transitivity of equivalence).

Note that this list of properties is somewhat redundant, as asymmetry follows readily from irreflexivity and transitivity. Transitivity of equivalence can also be stated in the following simpler form:

• If x < y, then for all z either x < z or z < y (or both).