a b

• •

ex6/ c • •d
a b
• •

ex7/ c • •d
10/
if example 2 is reflexive then, we have all of ZxZ of all so it is symmetric
as well
11/
ex5/

a b
• •

c• •d

1
 a b
• •

c• •d

ex6/

a b
• •

c• •d

ex7/
12/ MR ∨In denotes that matrix’s diagonal has only 1s so it is a reflexive
closure
13/ if M[ i][j] =1 then the transpose of it M[ j][i] = 1 therefore MR ∨
M[ R]T =1 which is a symmetric closure 14/ set A is a closure of R on
set S, then A is a subset of every subset of AxA containg S with R then
definitely A is in the intersections
15/ When R is irreflexive which means it is itself.
27

2
after doing 4 steps, we have: a/
 
1 1 1 1
1 1 1 1


 
1 1 1 1
1 1 1 1

b/  
0 0 0 0
1 0 1 1


 
1 0 1 1
1 0 1 1

c/  
0 1 1 1
0 0 1 1
 
 
0 0 0 1
0 0 0 0

d/  
1 1 1 1
1 1 1 1
 
 
1 1 1 1
1 1 1 1

26/
after doing 5 steps, we have a/
 
1 0 1 0 0
0 1 0 1 0
 
1 0 1 0 0
 
 
0 1 0 1 0
0 1 0 1 0

3
b/  
0 0 0 0 0
0 1 1 0 1
 
1 1 1 0 1
 
 
1 0 0 0 0
0 1 1 0 1

c/  
1 1 1 1 1
1 1 1 1 1
 
1 1 1 1 1
 
 
1 1 1 1 1
1 1 1 1 1

d/  
1 1 1 1 1
1 1 1 1 1
 
1 1 1 1 1
 
 
1 1 1 1 1
1 1 1 1 1

29/
a/ reflexive and transitive
Rr+ = {(1, 2), (1, 4), (3, 3), (4, 1), (1, 1), (2, 2), (4, 4)}
Rt+ = {(1, 2), (1, 4), (3, 3), (4, 1), (4, 2), (1, 1), (2, 2), (4, 4)}
Rr+ ∪ Rt+ = {(1, 2), (1, 4), (3, 3), (4, 1), (4, 2), (1, 1), (2, 2), (4, 4)}
b/ symmetric and transitive
Rs+ = {(1, 2), (2, 1), (1, 4), (4, 1), (3, 3)}
Rt+ = {(1, 2), (1, 4), (3, 3), (4, 1), (4, 2), (1, 1), (2, 2), (4, 4)}
Rr+ ∪ Rt+ = {(1, 2), (1, 4), (4, 1), (3, 3), (2, 1), (4, 2), (1, 1), (2, 2), (4, 4)}
c/ reflexive, symmetric, transitive
Rr+ ∪Rt+ ∪Rs+ = {(1, 2), (1, 4), (4, 1), (3, 3), (2, 1), (4, 2), (1, 1), (2, 2), (4, 4), (2, 2)}

4
33/ use algorithm 1 we have: A := A ∨ In and loops from i=2 to n-1 as
In displays that the first and last rows’ elements are 1s.
34/ by doing A:=A∨In after carrying out Warshall’s algorithm to fing
transitive closure,we can have the reflexive of the transitive closure
35/a/ as R is reflexive so the irreflexive closure can’t exist
b/ if we write relations containing R with odd elements, then none of
them are the subsets of the others with is contrary to the definition
36/ Let’s take R={(a, b), (a, c)} then a reflexive closure of a transitive
one{(a, a), (a, b), (b, b), (c, c), (a, c)} → a symmetric of reflexive closure of
a transitive one {(a, a), (a, b), (b, b), (c, c), (a, c), (b, a), (c, a)} is not tran-
sitive as we have (c, a), (a, b) but not (c, b)
Section 9.5
7/ we have a definition that “The compound propositions p and q are
called logically equivalent if p ↔ q is a tautology. The notation p ≡ q
denotes that p and q are logically equivalent.” which mean all the entries
of p and q in the truth table are the same.
+ R is reflexive then p and q have the same truth table
+ R is symmetric if p→q has the same truth tables with q→p
+ R is transitive if p and q has the same truth tables, q and r has the
same truth tables, r and p has the same truth value.
8/ show R is an equivalence relation.
- S and T have the same cardinality ony if there is a bijection from S to
T or inverse. Each set all has the same cardinality as itself so they are
reflexive. Then if g is a bijection from S to T then f−1 is a bijection from
T to S, so R is symmetric. Besides if f is a bijection from T to E then g◦
f is a bijection from S to E
9/
a/ + reflexive: we always have f(x)=f(x) so R is reflexive
+ symmetric: if f(x)=f(y) then f(y)=f(x) is always true so R is symmet-
ric
+ transitive: if f(x)=f(y) and f(y)=f(z) then f(x)=f(z) is true so R is

5
equivalence relation
b/ the equivalence classes of R: y in the range of x
10/ f(x)=[x]R takes x from domain A and send it to the equivalence class
11/ + reflexive: x always agree with its first three bits so R is reflexive
+ symmetric: if first three bits of x agrees with y then y definitely agrees
with x so R is symmetric
+transitive: if x and y agree with first 3 bits, y and z agree with first 3
bits then x and z agree with the first 3 bits
13/ + reflexive: x always agree with its first and third bits so R is re-
flexive
+ symmetric: if first and third bits of x agrees with y then y definitely
agrees with x so R is symmetric
+transitive: if x and y agree with first and third bits, y and z agree with
first and third bits then x and z agree with the first and third bits so R
is transitive
14/ + reflexive: so x always has the same strings with itself so R is
reflexive
+ symmetric: if the nth character in x is the same with y’s then nth
character in y is the same with x’s so R is always true
+ transitive: if x has the same nth character with y, y has the same nth
character with z then x and x has the same nth character so R is always
true
15/+ reflexive: with (a, b), (a, b), we have a+b=b+a
+symmetric: with (a, b), (c, d), we have a+d=b+c and c+b=a+c as well
so R is symmetric
+transitive: with (a, b), (c, d), (e, f ) we have a+d=b+c, c+e=d+f then
a+d+c+e=b+c+d+f → a+e=b+f which means it is true with (a, b), (e, f )
so R is transitive
16/ + reflexive: with (a, b), then we always have ab=ab so R is reflexive
+ symmetric: with (a, b), (c, d), we have ab=cd (it is changeable) so R is
symmetric

6
+ transitive: with (a, b), (c, d), (e, f ), we have ab=cd and cd=ef then
ab=ef is true so R is transitive
19/+ reflexive: web page at x is always the same with itself so R is
reflexive
+symmetric: web page at x the same with web page at y then web page
at y is the same with web page at x is true so R is symmetric
+ transitive: web page at x the same with web page at y and web page
at y is the same with web page at z so web page at x is the same with
web page ay z is true so R is transitive
20/+ reflexive: person x followed the same set of links starting with this
Web page the same with himself or herself so R is reflexive
+ symmetric: the same set of links starting with this Web page are fol-
lowed by both x and y then it is true with both y and x so R is symmetric
+transitive:the same set of links starting with this Web page are followed
by both x and y and by both y and z then it is true with both x and z
so R is transitive
27/ a/set of people with the same age
b/ set of people have the same parents
c,d,e don’t ensure the transitive relation