离散数学英文讲义：7-4 Closures of Relations.pptVIP

§7.4: Closures of Relations For any property X, the “X closure” of a set A is defined as the “smallest” superset of A that has property X. More specifically, The reflexive closure of a relation R on A is the smallest superset of R that is reflexive. The symmetric closure of R is the smallest superset of R that is symmetric The transitive closure of R is the smallest superset of R that is transitive Calculating closures The reflexive closure of a relation R on A is obtained by “adding” (a,a) to R for each a?A. I.e., it is R ? IA (Check that this is the r.c.) The symmetric closure of R is obtained by “adding” (b,a) to R for each (a,b) in R. I.e., it is R ? R?1 (Check that this is the s.c.) The transitive closure of Ris obtained by “repeatedly” adding (a,c) to R for each (a,b),(b,c) in R … Calculating closures Adore={(a,b),(b,c),(c,c)} Detest={(b,d),(c,a),(c,b)} The symmetric closure of ... ... Adore={(a,b),(b,c),(c,c),(b,a), (c,b)} ... Detest={(b,d),(c,a),(c,b), (d,b), (a,c),(b,c)} Calculating closures Adore={(a,b),(b,c),(c,c)} Detest={(b,d),(c,a),(c,b)} The transitive closure of ... ... Adore={(a,b),(b,c),(c,c),(a,c)} ... Detest={(b,d),(c,a),(c,b),(c,d)} Example 1 What is the reflexive closure of the relation R = { (a,b) | a b } on the set of integers? Solution: The reflexive closure of R is R U ? = { (a,b) | ab } U { (a,a) | a ? Z } = {(a,b) | a≤b } Example 2 What is the symmetric closure of the relation R = { (a,b) | ab } on the set of positive integers? Solution: The symmetric of closure of R is the relation R U R^-1 = { (a,b) | ab } U { (b,a) | ba} = { (a,b) | a≠b } Definition 2 Let R be a relation on a set A. The connectivity relation R* consists of the pairs (a,b) such that there is a path of length at the least one from a to b in R. R* How would you formally define R*? Here’s a safe bet R* How would you formally define R*? Here’s a finite variant, where n = |A|(proof in book that n is large enou