离散数学杨争锋ch075.pptxVIP

(b) Example -2 (“congruence modulo 4”, 　　　　　　　　　 模4同余) a and b are related 4 divides a-b (a and b have the same remainder (余 　　　　　数) when divided by 4) this relation reflexive, symmetric, and transitive all integers(splitted by this relation) 4 different parts 牛牛文库文档分享 2. Equivalence Relations (等价关系) (1) Definition 1 (page 508) A relation on a set A is called an equivalence relation if it is reflexive, symmetric and transitive. Remark: Two elements that are related by an equivalent relation is called equivalent. 牛牛文库文档分享 (2) Examples (a) Suppose that R is the relation on the set of strings of English letters such that a R b if and only if l(a)=l(b), where l(x) is the length of the string x. Is R an equivalence relation? Solution: reflexive??? symmetric??? transitive??? 牛牛文库文档分享 (b) Example 2 (page 508) Let R be the relation on the set of integers such that a R b if and only if a=b or a=-b. Is R an equivalence relation? Solution: (a,b)∈R iff |a|=|b| reflexive??? symmetric??? transitive??? 牛牛文库文档分享 (c) Example 2 Let R be the relation on the set of real numbers such that a R b if and only if a-b is an integer. Show that R is an equivalence relation? Proof: See blackboard or book. 牛牛文库文档分享 (3) Example 3 (Congruence Modulo m, 模m同余) Let m be a positive integer with m1. Show that the relation R={ (a,b) | a≡b (mod m) } is an equivalence relation. Proof: See blackboard or book. Example 4-7 牛牛文库文档分享 3. Equivalence Classes (1) Definition 2 (page 509) Let R be an equivalence relation on a set A. The set of all elememts 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. In other words, [a]R={ s | (a,s)∈R } 牛牛文库文档分享 (2) Examples (a) Examp