离散数学课件(英文版)Equivalence(II)课程.pptVIP

Equivalence Equivalence Properties of Relation Reflexivity Symmetry Transitivity Equivalence Equivalence and Partition Reflexivity Relation R on A is Reflexive if for all a?A, (a,a)?R Irreflexive if for all a?A, (a,a)?R Visualized Reflexivity Symmetry Relation R on A is Symmetric if whenever (a,b)?R, then (b,a)?R Antisymmetric if whenever (a,b)?R and (b,a)?R then a=b. Asymmetric if whenever (a,b)?R then (b,a)?R (Note: neither anti- nor a-symmetry is the negative of symmetry) Symmetry Let A={1,2,3}, R?A?A {(1,1),(1,2),(1,3),(2,1),(3,1),(3,3)} symmetric. {(1,2),(2,3),(2,2),(3,1)} antisymmetric. {(1,2),(2,3),(3,1)} antisymmetric and asymmetric. {(11),(2,2)} symmetric and antisymmetric. ? symmetric and antisymmetric, and asymmetric! Visualized Symmetry Visualized Antisymmetry Visualized Asymmetry Transitivity Relation R on A is Transitivity if whenever (a,b)?R, (b,c)?R, then (a,c) ?R Let A={1,2,3}, R?A?A {(1,1),(1,2),(1,3),(2,1),(2,2),(2,3),(3,3)} is transitive {(1,2),(2,3),(3,1)} is not transitive. {(1,3)} ? ? ? Visualized Transitivity What’s Wrong? A wrong proof: if R is a symmetric and transitive relation on A, then R must be reflexive. Proof: For any a,b?A, if (a,b)?R, by the symmetry of R, (b,a)?R; since R is transitive, (a,a)?R. So, R is reflexive. Equivalence Relation Relation R on A is an equivalence relation if and only if it is reflexible, symmetric and transitive. “Equality” is a special case of equivalence relation. An example: R?Z?Z, (x,y)?R if and only if is integer, i.e. x?y (mod 3) 3: modulus, a is congruent to b mod 3 Equivalence Relation Let A = {1,2,3,4,5,6} R:{1,1,2,2,…6,6,1,4,2,5, 3,6,…,6,3} R(1), R(2), R(3), R(4), R(5), R(6)? R: +3 How about +3 in Z? R(100)? Partition Generated by Equivalence Equivalence class: Let R is a equivalence relation on A, then given a?A, R(a) is a equivalence class induced by R. Quotient set: Q={R(x)|x?A, and R is a equivalence on A} Quotient set is a partition: For any a?A, a?R(a) (remem