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

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 A A is called equivalence relation if it is reflexive, symmetric, and transitive.

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

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

  1. One subgraphs: 1
  2. Two subgraphs: 3
  3. Three subgraphs: 1

The answer is 5.

9.5.3 Equivalence Classes

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

9.5.4 Equivalence Classes and Partitions

9.6 Partial Orderings

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

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

The elements a a a and b b b of a poset ( S , ≼ ) (S, \preccurlyeq) (S,) are called comparable if either a ≼ b a\preccurlyeq b ab or b ≼ a b \preccurlyeq a ba. Otherwise incomparable.

Related Notes

Note for MIT 6.042J - Lecture 8 Minimum Spanning Tree


ALL RIGHTS RESERVED © 2021 Teddy van Jerry
This blog is licensed under the CC 4.0 Licence.


See also

Teddy van Jerry’s CSDN Homepage
Teddy van Jerry’s GitHub Homepage

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值