北京邮电大学计算机学院 离散数学 9.5-relations.pptVIP

College of Computer Science Technology, BUPT Yang Juan yangjuan@bupt.edu.cn College of Computer Science Technology Beijing University of Posts Telecommunications 9.5 Equivalence Relations * * College of Computer Science Technology, BUPT Definition A relation R on a set A is an equivalence relation (等价关系) iff R is reflexive symmetric transitive It is easy to recognize equivalence relations using digraphs. * * College of Computer Science Technology, BUPT Equivalence relations The subset of all elements related to a particular element forms a universal relation (contains all possible arcs) on that subset. The (sub)digraph representing the subset is called a complete (sub)digraph. All arcs are present. The number of such subsets is called the rank of the equivalence relation. * * College of Computer Science Technology, BUPT Examples: A has 3 elements 2 3 1 2 3 1 2 3 1 * * College of Computer Science Technology, BUPT Equivalence class Each of the subsets is called an equivalence class. A bracket around an element means the equivalence class in which the element lies. [x] = {y | (x, y) is in R} The element in the bracket is called a representative (代表元) of the equivalence class. We could have chosen any one. * * College of Computer Science Technology, BUPT Example Let A be the set of all triangles in the plane and let R be the relation on A defined as follows: R = {(a, b) ? A ? A | a is congruent to b}. It is easy to see that R is an equivalence relation. * * College of Computer Science Technology, BUPT An interesting counting problem Count the number of equivalence relations on a set A with n elements. Can you find a recurrence relation? The answers are 1 for n = 1 2 for n = 2 5 for n = 3 How many for n = 4? * * College of Computer Science Technology, BUPT Example Let A = Z and let R = {(a, b) ? A x A | a and b yield the same remainder when divided by 2}. Show congruence mod 2 is an equivalence relation note 2 is called the modulus a ? b (mod 2) “a