Question 3: Let R be a relation on A such that R is reflexive and transitive. Define a new relation G on A as: $xGy \iff xRy \land yRx$. a) Show that G is an equivalence relation. b) If R is the relation on Z defined by: $xRy \iff x|y$. Find the definition of G and its set of equivalence classes.
Added by Monique G.
Close
Step 1
Step 1: To show that G is an equivalence relation, we need to prove that it is reflexive, symmetric, and transitive. Show more…
Show all steps
Your feedback will help us improve your experience
Sri K and 74 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
For each of the following relations R: (i) Determine which of the three properties (reflexive, symmetric, transitive) R satisfies. Justify your responses. (ii) If R is an equivalence relation, determine the equivalence classes of R. (a) R = {(x,y) ∈ ℝ × ℝ | |x − y| ≤ 1} (b) R = {(a,b) ∈ ℤ × ℤ | a ≡₃ b}
Sri K.
Prove or disprove: If a relation is symmetric and transitive, then it is also reflexive. Define a relation ~ on Z as x ~ y if and only if |x- y| ≤ 1. Say whether ~ is reflexive. Is it symmetric? Transitive? There are two different equivalence relations on the set A = {a,b}. Describe them. Diagrams will suffice. Define a relation R on Z as xRy if and only if x" + y" is even. Prove R is an equivalence relation. Describe its equivalence classes. Let A be a finite set with |A| = n ≥ 1. (a) Show that R = A A is an equivalence relation on A. How many equivalence classes does R define in A? (b) Show that S={(a, a)|a∈A} is an equivalence relation on A. How many equivalence classes does S define in A? (c) Prove or disprove: T=∅⊆A A an equivalence relation on A.
Vincenzo Z.
Let ~ and ≈ be relations on ℤ defined as follows: (i) For a, b ∈ ℤ, a ~ b if and only if 2 divides a² + b² (ii) For a, b ∈ ℤ, a ≈ b if and only if 3 divides a + 2b (a) Is ~ an equivalence relation on ℤ? If so, prove it, determine the number of distinct equivalence classes, and use set builder notation (without using ~) to give the equivalence classes explicitly. If not, is ~ reflexive, symmetric, or transitive? (b) Is ≈ an equivalence relation on ℤ? If so, prove it, determine the number of distinct equivalence classes, and use set builder notation (without using ≈) to give the equivalence classes explicitly. If not, is ≈ reflexive, symmetric, or transitive?
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD