【离散数学】 SEU - 15 - 2021/04/23 - Equivalence Relations

最新推荐文章于 2023-01-04 16:35:43 发布

Teddy van Jerry

最新推荐文章于 2023-01-04 16:35:43 发布

阅读量406

点赞数

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

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

版权

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

43 篇文章 6 订阅

订阅专栏

Discrete Mathematics and its Applications (8th Edition)
2021/04/23 - Equivalence Relations

9 Relations

9.5 Equivalence Relations

9.5.2 Equivalence Relations

A relation on a set $A$ is called equivalence relation if it is reflexive, symmetric, and transitive.

Two elements $a$ and $b$ that are related by an equivalence relation are called equivalent. The notation $a\sim b$ is often used to denote that $a$ and $b$ are equivalent with respect to a particular equivalence relation.

Example:
$A=\{1,2,3\}$ , how many different equivalence relations on $A$ can be constructed?
Solution.

One subgraphs: 1
Two subgraphs: 3
Three subgraphs: 1

The answer is 5.

9.5.3 Equivalence Classes

Let $R$ be an equivalence relation on a set $A$ . The set of all elements that are related to an element a of $A$ is called the equivalence class of $a$ . The equivalence class of a with respect to $R$ is denoted by $a]_R$ . When only one relation is under consideration, we can delete the subscript $R$ and write $[a]$ for this equivalence class.

9.5.4 Equivalence Classes and Partitions

9.6 Partial Orderings

A relation on a set $A$ is called a partial ordering, or a partial order if it is reflexive, antisymmetric, and transitive.

A set $S$ together with a partial ordering $R$ is called a particular ordered set, or poset, and is denoted by $(S, R)$ . Members of $S$ are called elements of the poset.

The elements $a$ and $b$ of a poset $\preccurlyeq)$ are called comparable if either $a\preccurlyeq b$ or $\preccurlyeq a$ . Otherwise incomparable.