【离散数学】 SEU - 16 - 2021/04/28 - Partial Orderings

最新推荐文章于 2022-11-07 13:18:46 发布

Teddy van Jerry

最新推荐文章于 2022-11-07 13:18:46 发布

阅读量290

点赞数

分类专栏：【离散数学】文章标签：离散数学 Mathematics 数学

本文链接：https://blog.csdn.net/weixin_50012998/article/details/116226561

版权

【离散数学】专栏收录该内容

43 篇文章 6 订阅

订阅专栏

Discrete Mathematics and its Applications (8th Edition)
2021/04/28 - Partial Orderings

9 Relations

9.6 Partial Orderings

9.6.3 Hasse Diagrams

In order theory, a Hasse diagram (/ˈhæsə/; German: [ˈhasə]) is a type of mathematical diagram used to represent a finite partially ordered set, in the form of a drawing of its transitive reduction. Concretely, for a partially ordered set $\preccurlyeq)$ one represents each element of $S$ as a vertex in the plane and draws a line segment or curve that goes upward from $x$ to $y$ whenever $y$ covers $x$ (that is, whenever $\preccurlyeq y$ and there is no $z$ such that $\preccurlyeq z \preccurlyeq y$ ). These curves may cross each other but must not touch any vertices other than their endpoints. Such a diagram, with labeled vertices, uniquely determines its partial order. (From Wikipedia)

The construction of Hasse diagram

9.6.4 Maximal and Minimal Elements

Elements of posets that have certain extremal properties are important for many applications. An element of a poset is called maximal if it is not less than any element of the poset. That is, $a$ is maximal in the poset $\preccurlyeq)$ if there is no $\preccurlyeq S$ such that $\prec b$ . Similarly, an element of a poset is called minimal if it is not greater than any element of the poset. That is, a is minimal if there is no element $\in S$ such that $\prec a$ . Maximal and minimal elements are easy to spot using a Hasse diagram. They are the “top” and “bottom” elements in the diagram.

Sometimes there is an element in a poset that is greater than every other element. Such an element is called the greatest element. That is, a is the greatest element of the poset $\preccurlyeq)$ if $\prec a$ for all $b\in S$ . The greatest element is unique when it exists [see Exercise 40(a)]. Likewise, an element is called the least element if it is less than all the other elements in the poset. That is, a is the least element of $\preccurlyeq)$ if $a\preccurlyeq b$ for all $b\in S$ . The least element is unique when it exists [see Exercise 40(b)].

Sometimes it is possible to find an element that is greater than or equal to all the elements in a subset $A$ of a poset $\preccurlyeq)$ . If u is an element of $S$ such that $\preccurlyeq u$ for all elements $\in A$ , then $u$ is called an upper bound of $A$ . Likewise, there may be an element less than or equal to all the elements in A. If l is an element of S such that $l\preccurlyeq a$ for all elements $a\in A$ , then l is called a lower bound of $A$ .