Relations课程.pptVIP

Relations and Digraphs Relations and Digraphs Cartesian Product Relations Matrix of Relation Digraph Paths in Digraph Ordered Pair and Cartesian Product Ordered pairs: (a,b) (a,b) = (c,d) iff a = c and b = d For any sets A,B A?B = {(a,b)|a?A, b?B} is called Cartesian Product of A and B Example： {1,2,3}?{a,b} = {(1,a), (2,a), (3,a), (1,b),(2,b), (3,b)} For finite A，B， |A?B|= |A|?|B| Generalized Cartesian Product Cartesian product of m nonempty sets: A1?A2?...?Am={(a1,a2,...,am) |ai?Ai,i=1,2...,m } What does Cartesian product bring us? Describing the attributes of objects using Cartesian product: Properties of Cartesian Product A??=??A=? A?B=B?A?A=B ? A=? ? B=? :Proof ? Note that for any set S, S??={(x,y)|x?S,y??}, since no such y exists, so A??=?, and ??S=? as well. ? If A?B and A??, we can prove that B=? by contradiction. Assume that A??, since A?B, let a?A, but a?B; let b is any element in B(may be in A or not), then (a,b)?A?B, but (a,b)?B?A, contradiction. Properties of Cartesian Product Strictly speaking: A?(B?C) =? (A?B)?C A?(B?C) = {(a,(b,c))|a?A, b?B and c?C} (A?B)?C = {((a,b),c)|a?A, b?B and c?C} (A?C) ? (B?D) ? A?B ? C?D Proof: for any (a,b)?A?B, a?A and b?B, so, a?C and b?D, so, (a,b)?C?D However, ? doesn’t hold. Counterexample: one of A, B is empty set. Properties of Cartesian Product Partitions Partition of set A: or quotient set Set Set of sets s1,s2,…sn si ?A si ∩sj = ? How about and Relation as a Set Let A and B be nonempty sets. A relation R from A to B is a subset of A?B. If a?A, b?B, then “a is related to b by R” is written as: (a,b)?R, or, aRb R is a relation on A, if R?A?A , =,…. Some Relations as Examples A={1,2,3}, B={r,s}, R={(1,r),(2,s),(3,r)}, then R is a relation from A to B. A={1,2,3,4}, R={(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)} then R is a relation on A, i.e. less than. Let A be real set. Define the following relation: x R y iff x2/4+y2/9 =1 What is this relation? Prog