any transitive relation that contains R
must also contain R. Therefore, R is
the transitive closure of R. Now that we
know that the transitive closure equals
the connectivity relation, we turn our
att
the relation on the set of ordered pairs
of positive integers such that (a, b), (c,
d) R if and only if a + d = b + c. Show
that R is an equivalence relation. 16.
Let R be the relation on the set of
o
rest of this section develops algorithms
for constructing transitive closures. As
will be shown later in this section, the
transitive closure of a relation can be
found by adding new ordered pairs
tha
integers in this class are those divisible
by 4. Hence, the equivalence class of 0
for this relation is [0]=cfw_., 8, 4, 0, 4,
8,.. P1: 1 CH09-7T Rosen-2311T
MHIA017-Rosen-v5.cls May 13, 2011
15:29 9.
contains all ordered pairs of positive
integers where the first element is
greater than the second element and
R1 contains all ordered pairs of
positive integers where the first
element is less than t
classes of R? 59. Let R be the relation
on the set of all colorings of the 2 2
checkerboard where each of the four
squares is colored either red or blue so
that (C1, C2), where C1 and C2 are 2 2
check
closure of the reflexive closure of the
transitive closure of a relation? 65.
Suppose we use Theorem 2 to form a
partition P from an equivalence
relation R. What is the equivalence
relation R that res
Moreover, an edge in a directed graph
can occur more than once in a path.
EXAMPLE 3 Which of the following are
paths in the directed graph shown in
Figure 1: a, b, e, d; a, e, c, d, b; b, a, c, b,
a,
length 16 formed by equivalence
classes of bit strings that agree on the
last eight bits is a refinement of the
partition formed from the equivalence
classes of bit strings that agree on the
last four
that two identifiers are considered the
same when they are related by the
relation R31 in Example 5. Using
Example 5, we know that R31, on the
set of all identifiers in Standard C, is an
equivalence r
this in mind, we define a new relation.
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 least one
from a to
relation. DEFINITION 3 Let R be an
equivalence relation on a set A. The set
of all elements that are related to an
element a of A is called the equivalence
class of a. The equivalence class of a
with
removed from a graph, without
removing endpoints of any remaining
edges, a smaller graph is obtained.
Such a graph is called a subgraph of the
original graph. DEFINITION 7 A
subgraph of a graph G = (V
Exercise 11? a) 010 b) 1011 c) 11111
d) 01010101 31. What are the
equivalence classes of the bit strings in
Exercise 30 for the equivalence
relation from Exercise 12? 32. What
are the equivalence clas
relation R = cfw_(1, 1), (1, 2), (2, 1), (3, 2)
on the set A = cfw_1, 2, 3 is not reflexive.
How can we produce a reflexive
relation containing R that is as small as
possible? This can be done by addi
R1 and R2 are equivalence relations on
a set A. Let P1 and P2 be the partitions
that correspond to R1 and R2,
respectively. Show that R1 R2 if and
only if P1 is a refinement of P2. 55.
Find the smalle
strings with respect to the equivalence
relation in Exercise 14? a) No b) Yes c)
Help 39. a) What is the equivalence
class of (1, 2) with respect to the
equivalence relation in Exercise 15? b)
Give an
same three bits.) Solution: The bit
strings equivalent to 0111 are the bit
strings with at least three bits that
begin with 011. These are the bit
strings 011, 0110, 0111, 01100, 01101,
01110, 01111,
Number_of_named_tropical_storms. An
identifier is equivalent to the
Number_of_named_tropical_storms_in_
the_Atlantic_in_ 2005 if and only if it
begins with its first 31 characters.
Because these chara
and the president of Mongolia as the
second element? We will use graphs to
model this application in Chapter 10.)
P1: 1 CH09-7T Rosen-2311T
MHIA017-Rosen-v5.cls May 13, 2011
15:29 9.4 Closures of Rel
transitivity, because aRc and cRb, we
have aRb. Because (i) implies (ii), (ii)
implies (iii), and (iii) implies (i), the
three statements, (i), (ii), and (iii), are
equivalent. We are now in a positio
numbers, cfw_0, the positive real
numbers b) the set of irrational
numbers, the set of rational numbers
c) the set of intervals [k, k + 1], k = .,
2, 1, 0, 1, 2,. d) the set of intervals
(k, k + 1), k
00, the set of bit strings that contain
the string 01, the set of bit strings that
contain the string 10, and the set of bit
strings that contain the string 11 c) the
set of bit strings that end with
one or more telephone lines from one
center to another? Because not all
links are direct, such as the link from
Boston to Denver that goes through
Detroit, R cannot be used directly to
answer this. In
b and that m>n, so that m n + 1. By
the pigeonhole principle, because
there are n vertices in A, among the m
vertices x0, x1,.,xm1, at least two are
equal (see Figure 2). Suppose that xi =
xj with 0 i
x1, x2,.,xn1, b with (a, x1) R, (x1,
x2) R,. , and (xn1, b) R. Theorem
1 can be obtained from the definition
of a path in a relation. THEOREM 1 Let
R be a relation on a set A. There is a
path of lengt
We now provide an example of a
partition of the set of all strings arising
from an equivalence relation on this
set. EXAMPLE 15 Let R3 be the relation
from Example 5. What are the sets in
the partitio
we know that this relation is not
symmetric (for instance, 2 | 4 but 4| 2).
We conclude that the divides relation
on the set of positive integers is not an
equivalence relation. EXAMPLE 7 Let
R be the
representing R, how many nonzero
entries are there in MR, the matrix
representing R, the complement of R?
18. Draw the directed graphs
representing each of the relations from
Exercise 1. 19. Draw the
(0) = g(0) or f (1) = g(1) c) cfw_(f, g) | f (x)
g(x) = 1 for all x Z d) cfw_(f, g) | for
some C Z, for all x Z, f (x) g(x) =
C e) cfw_(f, g) | f (0) = g(1) and f (1) =
g(0) 4. Define three equivalen