Discrete Structures

Lecture 16

Combining relations

Combining relations
Definition: Let A and B be sets. A binary relation from A to B is
a subset of a Cartesian product A x B.
Let R A x B means R is a set of ordered pairs of the form (a,b)
where a A and b B.
Combining Relations
Relations are sets combinations via set operations
Set operations of: union, intersection, difference and
symmetric difference.

CS 441 Discrete mathematics for CS

M. Hauskrecht

Combining relations
Example:
Let A = {1,2,3} and B = {u,v} and
R1 = {(1,u), (2,u), (2,v), (3,u)}
R2 = {(1,v),(3,u),(3,v)}
What is:
R1 R2 = ?

CS 441 Discrete mathematics for CS

M. Hauskrecht

Combining relations
Example:
Let A = {1,2,3} and B = {u,v} and
R1 = {(1,u), (2,u), (2,v), (3,u)}
R2 = {(1,v),(3,u),(3,v)}
What is:
R1 R2 = {(1,u),(1,v),(2,u),(2,v),(3,u),(3,v)}
R1 R2 = ?

CS 441 Discrete mathematics for CS

M. Hauskrecht

Combining relations
Example:
Let A = {1,2,3} and B = {u,v} and
R1 = {(1,u), (2,u), (2,v), (3,u)}
R2 = {(1,v),(3,u),(3,v)}
What is:
R1 R2 = {(1,u),(1,v),(2,u),(2,v),(3,u),(3,v)}
R1 R2 = {(3,u)}
R1 - R2 = ?

CS 441 Discrete mathematics for CS

M. Hauskrecht

Combining relations
Example:
Let A = {1,2,3} and B = {u,v} and
R1 = {(1,u), (2,u), (2,v), (3,u)}
R2 = {(1,v),(3,u),(3,v)}
What is:
R1 R2 = {(1,u),(1,v),(2,u),(2,v),(3,u),(3,v)}
R1 R2 = {(3,u)}
R1 - R2 = {(1,u),(2,u),(2,v)}
R2 - R1 = ?

CS 441 Discrete mathematics for CS

M. Hauskrecht

Combining relations
Example:
Let A = {1,2,3} and B = {u,v} and
R1 = {(1,u), (2,u), (2,v), (3,u)}
R2 = {(1,v),(3,u),(3,v)}
What is:
R1 R2 = {(1,u),(1,v),(2,u),(2,v),(3,u),(3,v)}
R1 R2 = {(3,u)}
R1 - R2 = {(1,u),(2,u),(2,v)}
R2 - R1 = {(1,v),(3,v)}

CS 441 Discrete mathematics for CS

M. Hauskrecht

Combination of relations
Can the relation formed by taking the union or intersection or
composition of two relations R1 and R2 represented in terms of
matrix operations? Yes

CS 441 Discrete mathematics for CS

M. Hauskrecht

Combination of relations: implementation

Definition. The join, denoted by , of two m-by-n matrices (aij)
and (bij) of 0s and 1s is an m-by-n matrix (mij) where
mij =
aij bij
for all i,j
= pairwise or (disjunction)

Example:
Let A = {1,2,3} and B = {u,v} and
R1 = {(1,u), (2,u), (2,v), (3,u)}
R2 = {(1,v),(3,u),(3,v)}

MR1 =1
1
1

0
1
0

MR2 = 0
0
1

1
0
1

M(R1 R2)= 1
1
1

CS 441 Discrete mathematics for CS

1
1
1
M. Hauskrecht

Combination of relations: implementation

Definition. The meet, denoted by , of two m-by-n matrices (aij)
and (bij) of 0s and 1s is an m-by-n matrix (mij) where
mij =
aij bij for all i,j
= pairwise and (conjunction)

Example:
Let A = {1,2,3} and B = {u,v} and
R1 = {(1,u), (2,u), (2,v), (3,u)}
R2 = {(1,v),(3,u),(3,v)}

MR1 =1
1
1

0
1
0

MR2 = 0
0
1

1
0
1

MR1 MR2= 0
0
1

CS 441 Discrete mathematics for CS

0
0
0
M. Hauskrecht

Composite of relations
Definition: 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 the ordered pairs (a,c) where a A and c
C, and for which there is a b B such that (a,b) R and (b,c)
S. We denote the composite of R and S by S o R.
Examples:
Let A = {1,2,3}, B = {0,1,2} and C = {a,b}.
R = {(1,0), (1,2), (3,1),(3,2)}
S = {(0,b),(1,a),(2,b)}
SoR=?
CS 441 Discrete mathematics for CS

M. Hauskrecht

Composite of relations
Definition: 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 the ordered pairs (a,c) where a A and c
C, and for which there is a b B such that (a,b) R and (b,c)
S. We denote the composite of R and S by S o R.
Examples:
Let A = {1,2,3}, B = {0,1,2} and C = {a,b}.
R = {(1,0), (1,2), (3,1),(3,2)}
S = {(0,b),(1,a),(2,b)}
S o R = {(1,b),(3,a),(3,b)}
CS 441 Discrete mathematics for CS

M. Hauskrecht

Composite of relations
Definition: 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 the ordered pairs (a,c) where a A and c
C, and for which there is a b B such that (a,b) R and (b,c)
S. We denote the composite of R and S by S o R.
Examples:
Let A = {1,2,3}, B = {0,1,2} and C = {a,b}.
R = {(1,0), (1,2), (3,1),(3,2)}
S = {(0,b),(1,a),(2,b)}
S o R = {(1,b),(3,a),(3,b)}
CS 441 Discrete mathematics for CS

M. Hauskrecht

Implementation of composite
Definition. The Boolean product, denoted by ~, of an m-by-n
matrix (aij) and n-by-p matrix (bjk) of 0s and 1s is an m-by-p
matrix (mik) where
mik =
1, if aij = 1 and bjk = 1 for some k=1,2,...,n
0, otherwise
Examples:
Let A = {1,2,3}, B = {0,1,2} and C = {a,b}.
R = {(1,0), (1,2), (3,1),(3,2)}
S = {(0,b),(1,a),(2,b)}
S o R = {(1,b),(3,a),(3,b)}

CS 441 Discrete mathematics for CS

M. Hauskrecht

Implementation of composite
Definition. The Boolean product,denoted by
, of an m-byn matrix (aij) and n-by-p matrix (bjk) of 0s and 1s is an m-byp matrix (mik) where
mik =
1, if aij = 1 and bjk = 1 for some k=1,2,...,n
0, otherwise
Examples:
Let A = {1,2}, B = {1,2,3} and C = {a,b}
R = {(1,2),(1,3),(2,1)} is a relation from A to B
S = {(1,a),(3,b),(3,a)} is a relation from B to C.
S o R = {(1,b),(1,a),(2,a)}

CS 441 Discrete mathematics for CS

M. Hauskrecht

Implementation of composite
Examples:
Let A = {1,2}, B = {1,2,3} and C = {a,b}
R = {(1,2),(1,3),(2,1)} is a relation from A to B
S = {(1,a),(3,b),(3,a)} is a relation from B to C.
S o R = {(1,b),(1,a),(2,a)}
0
1
1
1
0
MR = 1
0
0
MS
=
0
0
1
1
MR

MS

CS 441 Discrete mathematics for CS

M. Hauskrecht

Implementation of composite
Examples:
Let A = {1,2}, B ={1,2,3} and C = {a,b}
R = {(1,2),(1,3),(2,1)} is a relation from A to B
S = {(1,a),(3,b),(3,a)} is a relation from B to C.
S o R = {(1,b),(1,a),(2,a)}
0
MR = 1
MR

MS

1
0

1
0

MS

x
x

x
x

1
0
1

0
0
1

CS 441 Discrete mathematics for CS

M. Hauskrecht

Implementation of composite
Examples:
Let A = {1,2}, B = {1,2,3} and C = {a,b}
R = {(1,2),(1,3),(2,1)} is a relation from A to B
S = {(1,a),(3,b),(3,a)} is a relation from B to C.
S o R = {(1,b),(1,a),(2,a)}
0
1
1
1
0
MR = 1
0
0
MS
=
0
0
1
1
MR

MS

1
x

x
x

CS 441 Discrete mathematics for CS

M. Hauskrecht

Implementation of composite
Examples:
Let A = {1,2}, B = {1,2,3} and C = {a,b}
R = {(1,2),(1,3),(2,1)} is a relation from A to B
S = {(1,a),(3,b),(3,a)} is a relation from B to C.
S o R = {(1,b),(1,a),(2,a)}
0
1
1
1
0
MR = 1
0
0
MS
=
0
0
1
1
MR

MS

1
x

0
x

CS 441 Discrete mathematics for CS

M. Hauskrecht

Implementation of composite
Examples:
Let A = {1,2}, B = {1,2,3} and C = {a,b}
R = {(1,2),(1,3),(2,1)} is a relation from A to B
S = {(1,a),(3,b),(3,a)} is a relation from B to C.
S o R = {(1,b),(1,a),(2,a)}
0
1
1
1
0
MR = 1
0
0
MS
=
0
0
1
1
MR

MS

1
1

0
x

CS 441 Discrete mathematics for CS

M. Hauskrecht

Implementation of composite
Examples:
Let A = {1,2}, B = {1,2,3} and C = {a,b}
R = {(1,2),(1,3),(2,1)} is a relation from A to B
S = {(1,a),(3,b),(3,a)} is a relation from B to C.
S o R = {(1,b),(1,a),(2,a)}
0
1
1
1
0
MR = 1
0
0
MS
=
0
0
1
1
MR
MS

MS

1
1

1
0

?
CS 441 Discrete mathematics for CS

M. Hauskrecht

Implementation of composite
Examples:
Let A = {1,2}, B = {1,2,3} and C = {a,b}
R = {(1,2),(1,3),(2,1)} is a relation from A to B
S = {(1,a),(3,b),(3,a)} is a relation from B to C.
S o R = {(1,b),(1,a),(2,a)}
0
1
1
1
0
MR = 1
0
0
MS
=
0
0
1
1
MR
MS

MS

1
1

1
0

1
1

1
0

CS 441 Discrete mathematics for CS

M. Hauskrecht

Composite of relations
Definition: Let R be a relation on a set A. The powers Rn, n =
1,2,3,... is defined inductively by
R1 = R and Rn+1 = Rn o R.
Examples
R = {(1,2),(2,3),(2,4), (3,3)} is a relation on A = {1,2,3,4}.
R 1= ?

CS 441 Discrete mathematics for CS

M. Hauskrecht

Composite of relations
Definition: Let R be a relation on a set A. The powers Rn, n =
1,2,3,... is defined inductively by
R1 = R and Rn+1 = Rn o R.
Examples
R = {(1,2),(2,3),(2,4), (3,3)} is a relation on A = {1,2,3,4}.
R 1 = R = {(1,2),(2,3),(2,4), (3,3)}
R2=?

CS 441 Discrete mathematics for CS

M. Hauskrecht

Composite of relations
Definition: Let R be a relation on a set A. The powers Rn, n =
1,2,3,... is defined inductively by
R1 = R and Rn+1 = Rn o R.
Examples
R = {(1,2),(2,3),(2,4), (3,3)} is a relation on A = {1,2,3,4}.
R 1 = R = {(1,2),(2,3),(2,4), (3,3)}
R 2 = {(1,3), (1,4), (2,3), (3,3)}
R3=?

CS 441 Discrete mathematics for CS

M. Hauskrecht

Composite of relations
Definition: Let R be a relation on a set A. The powers Rn, n =
1,2,3,... is defined inductively by
R1 = R and Rn+1 = Rn o R.
Examples
R = {(1,2),(2,3),(2,4), (3,3)} is a relation on A = {1,2,3,4}.
R 1 = R = {(1,2),(2,3),(2,4), (3,3)}
R 2 = {(1,3), (1,4), (2,3), (3,3)}
R 3 = {(1,3), (2,3), (3,3)}
R4=?

CS 441 Discrete mathematics for CS

M. Hauskrecht

Composite of relations
Definition: Let R be a relation on a set A. The powers Rn, n =
1,2,3,... is defined inductively by
R1 = R and Rn+1 = Rn o R.
Examples
R = {(1,2),(2,3),(2,4), (3,3)} is a relation on A = {1,2,3,4}.
R 1 = R = {(1,2),(2,3),(2,4), (3,3)}
R 2 = {(1,3), (1,4), (2,3), (3,3)}
R 3 = {(1,3), (2,3), (3,3)}
R 4 = {(1,3), (2,3), (3,3)}
R k = ? , k > 3.

CS 441 Discrete mathematics for CS

M. Hauskrecht

Composite of relations
Definition: Let R be a relation on a set A. The powers Rn, n =
1,2,3,... is defined inductively by
R1 = R and Rn+1 = Rn o R.
Examples
R = {(1,2),(2,3),(2,4), (3,3)} is a relation on A = {1,2,3,4}.
R 1 = R = {(1,2),(2,3),(2,4), (3,3)}
R 2 = {(1,3), (1,4), (2,3), (3,3)}
R 3 = {(1,3), (2,3), (3,3)}
R 4 = {(1,3), (2,3), (3,3)}
R k = R 3, k > 3.

CS 441 Discrete mathematics for CS

M. Hauskrecht

Transitive relation
Definition (transitive relation): A relation R on a set A is called
transitive if
[(a,b) R and (b,c) R] (a,c) R for all a, b, c A.

Example 1:
Rdiv ={(a b), if a |b} on A = {1,2,3,4}
Rdiv = {(1,1), (1,2), (1,3), (1,4), (2,2), (2,4), (3,3), (4,4)}
Is Rdiv transitive?
Answer: ?

CS 441 Discrete mathematics for CS

M. Hauskrecht

Transitive relation
Definition (transitive relation): A relation R on a set A is called
transitive if
[(a,b) R and (b,c) R] (a,c) R for all a, b, c A.

Example 1:
Rdiv ={(a b), if a |b} on A = {1,2,3,4}
Rdiv = {(1,1), (1,2), (1,3), (1,4), (2,2), (2,4), (3,3), (4,4)}
Is Rdiv transitive?
Answer: Yes.

CS 441 Discrete mathematics for CS

M. Hauskrecht

Connection to Rn
Theorem: The relation R on a set A is transitive if and only if Rn
R for n = 1,2,3,... .
Proof: biconditional (if and only if)
Suppose Rn R, for n =1,2,3,... .
Let (a,b) R and (b,c) R
by the definition of R o R, (a,c) R o R R
R is transitive.

CS 441 Discrete mathematics for CS

M. Hauskrecht

Connection to Rn
Theorem: The relation R on a set A is transitive if and only if Rn
R for n = 1,2,3,... .
Proof: biconditional (if and only if)
Suppose R is transitive. Show Rn R, for n =1,2,3,... .
Let P(n) : Rn R. Math induction.
Basis Step: P(1) says R1 = R so, R1 R is true.
Inductive Step: show P(n) P(n+1)
Want to show if Rn R then Rn+1 R.
Let (a,b) Rn+1 then by the definition of Rn+1 = Rnn o R there is
an element x A so that (a,x) R and (x,b) R R
(inductive hypothesis). In addition to (a,x) R and (x,b) R, R
is transitive; so (a,b) R.
Therefore, Rn+1 R.
CS 441 Discrete mathematics for CS

M. Hauskrecht

Representing binary relations with graphs

We can graphically represent a binary relation R from A to B as
follows:
if a R b then draw an arrow from a to b.
ab
Example:
Relation Rdiv (from previous lectures) on A={1,2,3,4}
Rdiv = {(1,1), (1,2), (1,3), (1,4), (2,2), (2,4), (3,3), (4,4)}
1

3
4

3
4
M. Hauskrecht

CS 441 Discrete mathematics for CS

Representing relations on a set with digraphs

Definition: A directed graph or digraph consists of a set of
vertices (or nodes) together with a set E of ordered pairs of
elements of V valled edges (or arcs). The vertex a is called the
initial vertex of the edge (a,b) and vertex b is the terminal vertex
of this edge. An edge of the form (a,a) is called a loop.
Example
Relation Rdiv ={(1,1), (1,2), (1,3), (1,4), (2,2), (2,4), (3,3), (4,4)}
1

3
4

3
4

digraph

CS 441 Discrete mathematics for CS

M. Hauskrecht