Scribd
Upload
28 views2 pages

chapter9 4打印版

Uploaded by

15985720860
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
28 views2 pages

chapter9 4打印版

Uploaded by

15985720860
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

(2) Example 4 (page 600)

Let R be the relation on the set of all


people in the world that contains (a,b) if
a has met b. What is Rn, where n is a
positive integer greater than one? What
is R*?
Answer:
(a) The relation R2 contains (a,b) if there
is a person c such that (a,c)∈ ∈R and
(c,b)∈
∈R, that is, if there is a person c
such that a has met c and c has met b.

(b) Similarly, Rn consists of those pairs


(3) Theorem 2 (page 601)
(a,b) such that there are people x1, x2,
… , xn-1 such that a has met x1, x1 has The transitive closure of a relation R
met x2, … , and xn-1 has met b. equals the connectivity relation R*.
Proof:
(c) The relation R* contains (a,b) if there 1) R* contains R by definition.
is a sequence of people, starting with a 2) We show that R* is transitive. If (a,b) ∈
and ending with b, such that each R* and (b,c) ∈ R*, then there are paths
person in the sequence has met the from a to b and from b to c in R. We
next person in the sequence. obtain a path from a to c by starting
with the path from a to b and following
it with the path from b to c. Hence, (a, c)
∈ R*, namely R* is transitive.
(4) Lemma 1 (page 601)
Let A be a set with n elements, and R
be a relation on A. If there is a path of
3) Now suppose that S is a transitive
length at least one in R from a to b,
relation containing R, R ⊆ S. Because S
then there is a path with length not
is transitive, Sn⊆⊆ S (by Theorem 1 of
exceeding n.
Section 9.1). It follows that S*⊆
⊆S. From R
⊆ S, R*⊆⊆ S*, because any path in R is
also a path in S. Consequently, R*⊆ ⊆ S*
⊆ S.

Moreover, when a≠b, if there is a path of From Lemma 1, we see that the transitive
at least one in R from a to b, then there closure of R is the union of R, R2, R3,
is such a path with length not …, Rn.
exceeding n-1. R*=R ∪∪R2 ∪∪R3 ∪∪… ∪∪Rn

You might also like