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 a∼b 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.
- One subgraphs: 1
- Two subgraphs: 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 a≼b or b ≼ a b \preccurlyeq a b≼a. 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