Mathematics Homework Solutions
#22606
Relations
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.
A)
P = {(0,0), (1,1), (2,2), (4,4), (6,6), (0,1), (1,2), (2,4), (4,6) }
B)
P {(0,1), (1,0), (2,4), (4,2), (4,6), (6,4)}
C)
P ((0,0), (1,1), (2,2), 4,4), (6,6), (4,6), (6,4)}
D)
P = everything not equal to 0
This is a test with binary relations for reflexivity, symmetry ,antisymmetry, and transitivity; and the reflexive, symmetric and transitive closure of each relations.
What is this?
By OTA - Overall OTA Rating
Changping Wang, MA - 4.9/5
Purchase Cost Now
$2.19 CAD (was ~$11.97)
Included in Download
- Plain text response
- Attached file(s):
- discrete.doc
Why you can trust BrainMass.com
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- 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) ...
- Decide which ones of the three properties of reflexivity, symmetry, and transitivity are true for each of the following relations in the set of all positive integers: m ≤ n, m < n, m divides n. Are any of these equivalence relations? - Topology Sets and Functions (XLVIII) Functions Deci ...
- Relations - For each case, think of a set S and a binary relation p on S for - A. p is reflexive and symmetric but not transitive b. p is reflexive and transitive but not symmetric c. p is reflexive bu ...
- Generating Permutations and Combinations - a.Consider the partial order less than or equal to(<=) on the set X of positive integers given by "is a divisor of." Let a and b be two integers. Let c be the largest integer such that c<=a and c<=b a ...
- Prove the equivalence of the standard definition of equivalence relation on a group and the given alternative definition (of equivalence relation on a group). - Show that the following are equivalent: (a) ~ is an equivalence relation on a group G (b) ~ is reflexive and, for all elements a, b, c of G: if a ~ b and b ~ c, then c ~ a.
