You are on page 1of 9

Suggested practice problem

Chapter 9 Relations

Problem: 2.1:

Problem: 2.2:

1|P a ge
Problem: 2.3:

Problem: 2.4:

Problem: 2.5:

Determine which of these relations are symmetric.

2|P a ge
Problem: 2.5:

Determine which of these relations are symmetric.

Problem: 2.6:

Determine which of these relations are Antisymmetric.

3|P a ge
Problem: 2.7:

Determine which of these relations are Antisymmetric.

Problem: 2.8:
Is the “divides” relation on the set of positive integers symmetric? Is it antisymmetric?

Problem: 2.9:

Determine which of these relations are Transitive.

4|P a ge
Problem: 2.10:

Determine which of these relations are Transitive.

Problem: 2.11:

Problem: 2.12:

5|P a ge
Problem: 2.13:

Problem: 2.14:
Determine whether the relations for the directed graphs shown in the following figure are
reflexive, symmetric, antisymmetric, and/or transitive.

6|P a ge
Problem: 2.15:

Problem: 2.16:
The relation {(1, 1), (1, 2), (2, 2), (2, 3), (3, 1), (3, 2)} on {1, 2, 3} is not symmetric. How
can we produce a symmetric relation that is as small as possible and contains R?

To do this, we need only add (2, 1) and (1, 3), because these are the only pairs of the form (b,
a) with (a, b) ∈ R that are not in R. This new relation is symmetric and contains R. Furthermore,
any symmetric relation that contains R must contain this new relation, because a symmetric
relation that contains R must contain (2, 1) and (1, 3). Consequently, this new relation is called
the symmetric closure of R.

Problem: 2.17:

7|P a ge
Problem: 2.18:

Problem: 2.19:

8|P a ge
Problem: 2.20:

End of Practice Problems of Chapter 9: Relations

9|P a ge

You might also like