(a) Show that R is reflexive.
(b) Show that R is symmetric.
(c)Show that R is transitive.

3. Let A be the set {1,2,3,4,5,6} and let F be the class of subsets of A defined by:

[{1,6}, {2,3,5}, {4}]

(a) Show that F is a partition of A.
(b) Find the equivalence on A determined by F.
(c) Draw the directed graph of the equivalence relation found in part (2).

Please see the attached file for the complete solution.

Let A be the set {1,2,3,4,5,6} and R be a binary relation on A defined as : {(1,1), (1,3), (1,5), (2,2), (2,6), (3,1), (3,3), (3,5), (4,4), (5,1), (5,3), (5,5), (6,2), (6,6)}

(a) Show that R is reflexive.
(b) Show that R is symmetric.
(c) Show that R is transitive.

(a) Reflexive: or if x is in A then (x,x) is in R
We check to see if (1,1)...(6,6) are all members of R. Visual inspection confirms that all 6 are members, therefore R is reflexive.

(b) Symmetric: or if (x,y) is in R, then so must (y,x)
We check ...

Solution Summary

Sets and binary relations are investigated. The solution is detailed and well presented.

... Explain. A binary relation on N is a set of pairs (n, m) in N x N. The empty set has NO elements that are NOT of the form (n, m) in N x N, so this condition is ...

... 4. Define a binary relation S from R to R as follows: for all (x, y) R x R, x S ... S? Is (4, 2) S? Is (2, 2) S? Is (-2) S (-8). b) Find the set of all ...

1. Create a Binary Relation between X and Y that contains at least 6 Ordered Pairs, given that X and Y are the following: Let the set X = {Bill Smith, Amos ...

... Recall that a (binary) relation S on a set B is transitive if, for all elements x, y, and z of B: if (x, y) and (y, z) are elements of S, then (x, z) is also ...

... diagram for this relation on page 601 for a particular set S of ... Determine whether or not the given binary relation is reflexive, symmetric, transitive, or none ...

... equivalence relation": A given binary relation ~ on a set A is said to be an equivalence relation if, and only if, it is reflexive, symmetric and transitive. ...