Islamic University of Gaza Faculty of Engineering Department of Computer Engineering Fall 2011 ECOM 2311: Discrete Mathematics Eng.

Ahmed Abumarasa

Discrete Mathematics Chapter 8

Relations

8.1: Relations and there prosperities:

Definitions: 1. Let A and B be sets. A binary relation from A to B is a subset of A x B. 2. A relation on the set A is a relation from A to A. 3. A relation R on a set A is called reflexive if (a, a) R for every element a A. 4. A relation R on the set A is irreftexive if for every a A, (a, a) R. 5. A relation R on a set A is called symmetric if (b, a) R whenever (a, b) R, for all a, b A. A relation R on a set A such that for all a, b A, if (a, b) R and (b, a) R, then a = b is called antisymmetric. 6. A relation R on a set A is called transitive if whenever (a, b) R and (b, c) R, then (a, c) R, for all a, b, c A. 7. Let R be a relation from a set A to a set B and S a relation from B to a set C. The composite of R and S is the relation consisting of ordered pairs (a, c), where a A, c

C, and for which there exists an element b B such that (a, b) R and (b, c) S.
We denote the composite of R and S by S o R.

Exercises

1. 8.1.3 For each of these relations on the set {1, 2, 3,4}, decide whether it is reflexive, whether it is symmetric, whether it is antisymmetric, and whether it is transitive. a. {(2, 2), (2, 3), (2, 4), (3, 2), (3, 3), (3, 4)} b. {(I, 1), (1, 2), (2,1), (2, 2), (3, 3), (4,4)} c. {(2, 4), (4, 2)} d. {(I, 2), (2, 3), (3,4)} e. {(I, 1),(2,2),(3,3),(4,4)} f. {(I, 3), (1,4), (2, 3), (2,4), (3,1), (3, 4)} Solution:

reflexive a b c d e f
false

irreflexive
false false

symmetric
false

antisymmetric
false false false

asymmetric
false false false

true
false false

true true
false

true true
false

transitive true true

false false

true
false

true
false

true true
false

true
false false

true
false

true

2. 8.1.30 Let R be the relation {(1, 2), (1, 3), (2, 3), (2, 4), (3,1)}, and let S be the relation {(2, 1), (3, 1), (3, 2), (4, 2)}. Find So R.
Solution:

1 1 1 2 2 2 3

2 3 3 3 3 4 1

1 1 2 1 2 2

The result contain S o R = {(1, 1), (1, 2), (2, 1), (2, 2)}

8.3: Representing Relations:

The relation R can be represented by the matrix MR = [mij], where

A directed graph, or digraph, consists of a set V of vertices (or nodes) together with a set E of ordered pairs of elements of V called edges (or arcs). The vertex a is called the initial vertex of the edge (a, b), and the vertex b is called the terminal vertex of this edge.

 Exercises 1. 8.3.4 List the ordered pairs in the relations on {I, 2, 3, 41 corresponding to these matrices (where the rows and columns correspond to the integers listed in increasing order).

Solution:

a) {(1,1), (1,2), (1,4), (2,1), (2,3), (3,2), (3,3), (3,4), (4,1), (4,3), (4,4)} b) {(1,1), (1,2), (1,3), (2,2), (3,3), (3,4), (4,1), (4,4)}

reflexive a b
false

irreflexive
false false

symmetric true
false

antisymmetric
false

true

true

2. 8.3.23-26 List the ordered pairs in the relations represented by the directed graphs.

Solution:

1. {(a, c), (a, b), (b, c), (c, b) } 2. {(a, a), (a, b), (b, b), (b, a), (c, c) , (c, a), (c, d), (d, d) }

reflexive a b
false

irreflexive true
false

symmetric
false false

antisymmetric
false false

true

 8.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 the given property The reflexive closure of a relation R on A is obtained by adding (a, a) to R for each aA. I.e., it is R IA The symmetric closure of R is obtained by adding (b, a) to R for each (a, b) in R. I.e., it is R R1 The transitive closure or connectivity relation of R is obtained by repeatedly adding (a, c) to R for each (a, b), (b, c) in R.

A path of length n1 from a to a is called a circuit or a cycle. There exists a path of length n from a to b in R if and only if (a,b)Rn.

Exercises

1. Let R be the relation on the set {0, 1, 2, 3} containing the ordered pairs (0, 1), (1, 1), (1,2), (2,0), (2, 2), and (3,0). Find the a. Reflexive closure of R. b. Symmetric closure of R.

Solution:

a. Reflexive closure of R = R IA = R IA = {(0, 1), (1, 1), (1,2), (2,0), (2, 2), (3,0)} {(0, 0), (1, 1), (2, 2), (3, 3)} = {(0, 0), (0, 1), (1, 1), (1,2), (2,0), (2, 2), (3,0), (3, 3)} a. Symmetric closure of R= R R1 R R1 = {(0, 1), (1, 1), (1, 2), (2, 0), (2, 2), (3,0)} {(1, 0), (1, 1), (2, 1), (0,2), (2, 2), (0,3)} = {(0, 1), (1, 0), (1, 1), (1, 2), (2, 1), (2, 0), (0, 2), (2, 2), (3,0), (0, 3)}

 8.5: Equivalence Relations: An equivalence relation (e.r.) on a set A is simply any binary relation on A that is reflexive, symmetric, and transitive. 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 respect to R is denoted by [a]R. When only one relation is under consideration, we can delete the subscript R and write [a] for this equivalence class. A partition of a set A is the set of all the equivalence classes {A1, A2, } for some e.r. on A.

Exercises

1. 8.5.1 Which of these relations on {0, 1, 2, 3} are equivalence relations? Determine the properties of an equivalence relation that the others lack.

a. b. c. d. e.

{(O, 0), (1,1), (2, 2), (3, 3)} {(O, 0), (0, 2), (2, 0), (2, 2), (2, 3), (3, 2), (3, 3)} {(O, 0), (1,1), (1, 2), (2,1), (2, 2), (3, 3)} {(O, 0), (1,1), (1, 3), (2, 2), (2, 3), (3,1), (3, 2), (3, 3)} {(O, 0), (0,1), (0, 2), (1, 0), (1,1), (1, 2), (2, 0), (2, 2), (3, 3)}

Solution:

a b c d e

Equivalence Relation True False True False false

Comment not reflexive, (1,1) not exist Not transitive, (1,3) and (3,2) but no (1,2) Not symmetric, (1,2) but no (2,1)