北京邮电大学计算机学院 离散数学 9.4-relations.pptVIP

* * College of Computer Science Technology, BUPT Proof of Part 2) Easy from the definition of R? * * College of Computer Science Technology, BUPT Proof of Part 3) Now suppose S is any transitive relation that contains R, show S contains R? (that is R? is the smallest such relation). R ? S so R2 ? S2 ? S since S is transitive Therefore Rn ? Sn ? S for all n. (why?) Hence S must contain R? since it must also contain the union of all the powers of R. Q. E. D. In fact, we need only consider paths of length n or less. * * College of Computer Science Technology, BUPT Example Let A={1, 2, 3, 4} R={(1, 2), (2, 3), (3, 4), (2, 1)} Find the transitive closure of R. 2 4 3 1 * * College of Computer Science Technology, BUPT Example * * College of Computer Science Technology, BUPT Theorem Let A be a set with |A|=n, and let R be a relation on A. Then * * College of Computer Science Technology, BUPT Proof The equality will hold, if, for k?nm, we have Rm ? Rk (a, b) ? Rm ? (a, b) ? Rk * * College of Computer Science Technology, BUPT Proof Let a and b be A and suppose that a, x1, x2, …, xm-1, b is a path of length m from a to b in R (a, x1) ?R (x1, x2) ?R … (xm-1, b) ?R * * College of Computer Science Technology, BUPT Proof There are m+1 elements in the path, but we have only n distinct elements in A. So, there must be some same vertex in the path, say xi = xj = c, ij (a, x1) ?R (x1, x2) ?R … (xi-1, xi) ?R (xi, xi+!) ?R … (xj-1, xj) ?R (xj, xj+1) ?R … (xm-1, b) ?R The red edges form a cycle in the path, we get a new path by deleting the cycle * * College of Computer Science Technology, BUPT Proof A new path from a to b by deleting the cycle (a, x1) ?R (x1, x2) ?R … (xi-1, xi) ?R (xj, xj+1) ?R … (xm-1, b) ?R * * College of Computer Science Technology, BUPT Proof A path from a to b (xi = xj = c) a, x1, x2,…, xi-1, c, xj+1,…, xm-1, b The length is k = m - j + i. The process can continue until k?n, so we have Rm ? Rk ?m (mn ?(a, b) ? Rm ? ?k (k?n ?(a, b) ? Rk ))