Question

In: Advanced Math

Let S = {1,2,3,4} and let A = SxS Define a relation R on A by...

Let S = {1,2,3,4} and let A = SxS
Define a relation R on A by (a,b)R(c,d) iff ad = bc

Write out each equivalence class (by "write out" I mean tell me explicitly which elements of A are in each equivalence class)

Hint: |A| = 16 and there are 11 equivalence classes, so there are several equivalence classes that consist of a single element of A.

Solutions

Expert Solution


Related Solutions

Define a relation S from R to R by saying that  if and only if (a) List...
Define a relation S from R to R by saying that  if and only if (a) List five different elements of S. (b) Prove that S is not a function.
Let A = R x R, and let a relation S be defined as: “(x​1,​ y​1)​...
Let A = R x R, and let a relation S be defined as: “(x​1,​ y​1)​ S (x​2,​ y​2)​ ⬄ points (x​1,​ y​1)​ and (x​2,​ y​2)​are 5 units apart.” Determine whether S is reflexive, symmetric, or transitive. If the answer is “yes,” give a justification (full proof is not needed); if the answer is “no” you ​must​ give a counterexample.
Let S = {2 k : k ∈ Z}. Let R be a relation defined on...
Let S = {2 k : k ∈ Z}. Let R be a relation defined on Q− {0} by x R y if x y ∈ S. Prove that R is an equivalence relation. Determine the equivalence class
1)Let S be the set of all students at a college. Define a relation on the...
1)Let S be the set of all students at a college. Define a relation on the set S by the rule that two people are related if they live less than 2 miles apart. Is this relation an equivalence relation on S? Justify your answer. 2) Define another relation on the set S from problem 5 by defining two people as related if they have the same classification (freshman, sophomore, junior, senior or graduate student). Is this an equivalence relation...
1)Let S be the set of all students at a college. Define a relation on the...
1)Let S be the set of all students at a college. Define a relation on the set S by the rule that two people are related if they live less than 2 miles apart. Is this relation an equivalence relation on S? Justify your answer. 2) Define another relation on the set S from problem 5 by defining two people as related if they have the same classification (freshman, sophomore, junior, senior or graduate student). Is this an equivalence relation...
Let p and q be any two distinct prime numbers and define the relation a R...
Let p and q be any two distinct prime numbers and define the relation a R b on integers a,b by: a R b iff b-a is divisible by both p and q. For this relation R: Prove that R is an equivalence relation. you may use the following lemma: If p is prime and p|mn, then p|m or p|n. Indicate in your proof the step(s) for which you invoke this lemma.
For each part below, find a binary relation on the set S = {1,2,3,4} that satisfies...
For each part below, find a binary relation on the set S = {1,2,3,4} that satisfies the given combination of properties a) reflexive, symmetric, and transitive b) not reflexive, but symmetric and transitive c) not symmetric, but reflexive and transitive d) not transitive, but reflexive and symmetric e) neither reflexive nor symmetric, but transitive f) neither reflexive nor transitive, but symmetric g) neither symmetric not transitive, but reflexive h) not reflexive, not symmetric, and not transitive
On the set S of all real numbers, define a relation R = {(a, b):a ≤ b}. Show that R is transitive.
On the set S of all real numbers, define a relation R = {(a, b):a ≤ b}. Show that R is transitive.
Question 1. Equivalence Relation 1 Define a relation R on by iff . Prove that R...
Question 1. Equivalence Relation 1 Define a relation R on by iff . Prove that R is an equivalence relation, that is, prove that it is reflexive, symmetric, and transitive. Determine the equivalence classes of this relation. What members are in the class [2]? How many members do the equivalence classes have? Do they all have the same number of members? How many equivalence classes are there? Question 2. Equivalence Relation 2 Consider the relation from last week defined as:...
Let x be a set and let R be a relation on x such x is...
Let x be a set and let R be a relation on x such x is simultaneously reflexive, symmetric, and antisymmetric. Prove equivalence relation.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT