离散数学五章.pptVIP

Equivalence Class And Partitions Partition of a set S is a collection of disjoint nonempty subsets of S that have S as their Union. Ai≠⊙ Ai ∩ Aj =⊙ ∪ Ai=S Examples 7 Equivalence Class And Partitions Theorem1 Let R be an equivalence relation on a set A. These statements are equivalent: a R b [a]=[b] [a] ∩ [b] ≠⊙ Equivalence Class And Partitions Theorem2 Let R be an equivalence relation on a set S. Then the equivalence classes of R form a partition of S. Conversely, given a partition {Ai|i∈I} of the set S, there is an equivalence relation R that has the set Ai , i∈I, as its equivalence classes. Examples8 Examples9 Chapter 5 Relations 5.1 RELATIONS AND THEIR PROPERTIES 5.5 EQUIVALENCE RELATIONS Outline 1.Relations a binary relation from A to B a relation on the set A 2.Properties of relations reflexive antireflexive symmetric antisymmetric transtivity Outline 3.Combinning Relations 4. Composite Relations 5. The powers of relations 7.1 RELATIONS AND THEIR PROPERTIES DEF: Cartesian product Let A and B be sets. The Cartesian product of A and B, denoted by A×B, is the set of all ordered pairs (a,b) where a∈A and b ∈B. hence A×B={(a,b) ∣ a∈A ∧ b ∈B} 5.1 RELATIONS AND THEIR PROPERTIES DEF: Binary Relation Let A and B be sets. A binary relation from A to B is a subset of A×B. The notation a R b means that (a,b)?R. E.g., a b means (a,b)? . Example 5.1.1: (a,b) where a is a student entolled in course b. Example 5.1.2 (a,b) belosngs to R if city a is in province b e.g. (shenzhen, Guangdong) ∈R (chengdu, Guangdong) MORE EXAMPLES Example 5.1.3: E(·, ·) eats domain = A ? A, where A = animal . For instance, E(wolves, rabbits). Example 5.1.4: The relation Q from the set {1, 2, 3} to the set {A,B,C}, with the ordered- pairs model Q = {(1,A), (1,B), (2, C), (3,A), (3, C)} has the lists-of-relatives model 1 : A,B 2 : C 3 : A,C and the matrix model Functions as relations Function :let A and B be sets. A fun