部分有序集（Partially Ordered Set，简称Poset）是数学中一种形式化和推广了集合元素顺序的概念。它由一个集合及其上的二元关系组成，该关系表明集合内某些元素在排序中前于其他元素。不同于全序，部分有序集允许存在不可比较的元素对。部分有序集可以用哈斯图来直观表示，其中箭头方向表示元素之间的前后关系。博客详细讨论了部分有序集的定义、关系类型、衍生概念以及在不同领域的应用。
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 relation indicating that, for certain pairs of elements in the set, one of the elements precedes the other in the ordering. The relation itself is called a “partial order.”
The word partial in the names “partial order” and “partially ordered set” is used as an indication that not every pair of elements needs to be comparable. That is, there may be pairs of elements for which neither element precedes the other in the poset. Partial orders thus generalize total orders, in which every pair is comparable.
Fig.1 The Hasse diagram of the set of all subsets of a three-element set {\displaystyle {x,y,z},}{\displaystyle {x,y,z},} ordered by inclusion. Sets connected by an upward path, like {\displaystyle \emptyset }\emptyset and {\displaystyle {x,y}}{x,y}, are comparable, while e.g. {\displaystyle {x}}{x} and {\displaystyle {y}}{y} are not.
Contents
1 Informal definition
A partial order defines a notion of comparison. Two elements x and y may stand in any of four mutually exclusive relationships to each other: either x < y, or x = y, or x > y, or x and y are incomparable.[1][2]
A set with a partial order is called a partially ordered set (also called a poset). The term ordered set is sometimes also used, as long as it is clear from the context that no other kind of order is meant. In particular, totally ordered sets can also be referred to as “ordered sets”, especially in areas where these structures are more common than posets.
A poset can be visualized through its Hasse diagram, which depicts the ordering relation.[3]
扫一扫
1324
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
