Total Order
A total order (or “totally ordered set,” or “linearly ordered set”) is a set plus a relation on the set (called a total order) that satisfies the conditions for a partial order plus an additional condition known as the comparability condition. A relation <= is a total order on a set S (“<= totally orders S”) if the following properties hold.
-
Reflexivity: a<=a for all a in S.
-
Antisymmetry: a<=b and b<=a implies a=b.
-
Transitivity: a<=b and b<=c implies a<=c.
-
Comparability (trichotomy law): For any a,b in S, either a<=b or b<=a.
The first three are the axioms of a partial order, while addition of the trichotomy law defines a total order.
Every finite totally ordered set is well ordered. Any two totally ordered sets with k elements (for k a nonnegative integer) are order isomorphic, and therefore have the same order type (which is also an ordinal number).
本文深入探讨了完全有序集的概念,即在集合上定义的关系,满足自反性、反对称性和传递性的偏序条件,以及可比性条件,确保任意两个元素都可以进行比较。文章还提到了所有有限的完全有序集都是良序的,并且任何两个具有相同元素数量的完全有序集都是序同构的。

被折叠的 条评论
为什么被折叠?



