离散数学英文讲义：7-1 Relations and Theirs Properties.pptVIP

* Transitivity relatives What about these examples: “x is an ancestor of y” “x likes y” “x is located within 1 mile of y” “x +1 =y” “x beat y in the tournament” “x is stronger than y” * Transitivity relatives What about these examples: “is an ancestor of” is transitive. “likes” is neither trans nor intrans. “is located within 1 mile of” is neither trans nor intrans “x +1 =y” is intransitive “x beat y in the tournament” is neither trans nor intrans “x is stronger than y” is transitive. * * Combining Relations * Composite Relations Let R:A×B, and S:B×C. Then the composite S?R of R and S is defined as: S?R = {(a,c) | ?b: aRb ? bSc} Does this remind you of something? * Composite Relations Let R:A×B, and S:B×C. Then the composite S?R of R and S is defined as: S?R = {(a,c) | ?b: aRb ? bSc} Does this remind you of something? Function composition ... ... except that S?R accommodates the fact that S and R may not be functional * Composite Relations Let R:A×B, and S:B×C. Then the composite S?R of R and S is defined as: S?R = {(a,c) | ?b: aRb ? bSc} Function composition is a special case of relation composition: Suppose S and R are functional. Then we have (using the definition above, then switching to function notation) S?R(a,c) iff ?b: aRb ? bSc iff R(a)=b and S(b)=c iff S(R(a))=c * Example R = {(1,1),(1,4),(2,3),(3,1),(3,4)} S = {(1,0),(2,0),(3,1),(3,2),(4,1)} S?R = {(1,0),(1,1),(2,1),(2,2),(3,0),(3,1)} R={(1,1),(2,1),(3,2),(4,3)} R^2 = R ? R ={(1,1),(2,1),(3,1),(4,2)} R^3 = R ? R ? R ={(1,1),(2,1),(3,1),(4,1)} R^n = R ? R ? R ={(1,1),(2,1),(3,1),(4,1)} n≥3 * Theorem 1 The relation R on a set A is transitive if and only if R^n ? R for n = 1,2,3… Proof. (a,b) ?R and (b,c) ?R then (a,c) ?R^2 and (a,c) ?R. …… Use mathematical induction * Composite Relations Let’s see what happens when we compose R with itself Exercise: Prove that R:A×A is transitive iff R?R = R. * Composite relations The nth power Rn of a relation R on a set