Purchase Solution

Sets and Binary Relations

Not what you're looking for?

Ask Custom Question

2. 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.

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).

Purchase this Solution
Solution Summary

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

Solution Preview

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 ...

Purchase this Solution
Free BrainMass Quizzes
Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Probability Quiz

Some questions on probability

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

View More Free Quizzes
Related BrainMass Solutions

  • Discrete Math: Binary Relations

    Binary relations are defined and graphs are drawn to explain them. The ordered pairs of sets are determined.

  • Set Relations Binary Relations

    622012 Set Relations Binary Relations Relations 1. Let C = {2, 3, 4, 5} and D = {3, 4} and define a binary relation S from C to D as follows: for all (x, y)  C  D, (x, y)  S  x  y. a) Write S as a set of ordered pairs. b) Is 2 S 4?

  • Relations on Set {0,1} : Binary, Reflexive and Symmetric

    23670 Relations on Set {0,1} : Binary, Reflexive and Symmetric I have done several examples but these I cannot get right, I am not sure where I have made the mistake and I am confusing myself. a. List all the binary relations on the set {0,1}.

  • A Discussion On Binary Relations : Reflexive, Symmetric, Antisymmetric, and/or Transitive

    18401 A Discussion On Binary Relations : Reflexive, Symmetric, Antisymmetric, and/or Transitive Determine whether the binary relation R on Z, where aRb means a^2 = b^2, is reflexive, symmetric, antisymmetric, and/or transitive. aRb if and only if a^2=

  • Relations

    22607 Test Binary Relations Test the binary relations on S for reflexivity, symmetry ,antisymmetry, and transitivity A) S = Q X p Y <-> ABS(X) <= ABS(Y) B) S = Z X p Y <-> x -y is an integral multiple of 3 C) S = N X P Y <-> X is odd

  • Heaps, Binary Files and Bit Sets

    (f) From the above diagram, all indices at level 4 are: 7, 8, 9, 10, 11, 12, 13 ,14 Heaps, binary files and bit sets are examined.

  • Relations

    22606 Relations for Symmetric Transitive Closures S = {0, 1, 2, 4, 6} Test the binary relations on S for reflexivity, symmetry ,antisymmetry, and transitivity. Also find the reflexive, symmetric and transitive closure of each relations.

  • Discrete Math: Binary Relations

    Since and can not be both true. Thus and can not be both in the relation. is transitive. Since if and , then we have and . Thus we have . Therefore, we get . Binary relations are graphed and their properties determined.

  • Gaussian prime factorizations and binary operations on sets

    This shows how to complete Gaussian prime factorizations of given numbers and work with binary operations on sets.

View More Related Solutions