Let be the relation defined in the set by : both and are either odd or even . Show that is an equivalence relation. Further, show that all the elements of the subset are related to each other and all the elements of the subset are related to each other, but no element of the subset is related to any element of the subset . Solution Given any element in A, both and must be either odd or even, so that . Further, both and must be either odd or even . Similarly, and all elements , must be either even or odd simultaneously . Hence, is an equivalence relation. Further, all the elements of are related to each other, as all the elements of this subset are odd. Similarly, all the elements of the subset are related to each other, as all of them are even. Also, no element of the subset can be related to any element of , as elements of are odd, while elements of are even.
Answer: The relation R is an equivalence relation because it is reflexive, symmetric, and transitive. All elements within the subset are related to each other (as they are all odd), and all elements within the subset are related to each other (as they are all even). However, no element from is related to any element from because they have different parities.
Step-by-step solution
Step 1: Check for Reflexivity
A relation is reflexive if every element is related to itself. For any element in set , both and are either odd or even (they are the same number). Therefore, satisfies the condition for relation , meaning is reflexive.
Step 2: Check for Symmetry
A relation is symmetric if whenever is in , then is also in . If , it means both and are either odd or even. This condition is symmetrical, meaning if and are both odd/even, then and are also both odd/even. Hence, , and is symmetric.
Step 3: Check for Transitivity
A relation is transitive if whenever is in and is in , then is also in . If , then and are both odd or both even. If , then and are both odd or both even. Combining these, it implies that , , and must all be either odd or all even. Therefore, must also satisfy the condition (both and are either odd or even), so . Thus, is transitive.
Step 4: Conclusion for Equivalence Relation
Since the relation satisfies all three properties: reflexivity, symmetry, and transitivity, it is an equivalence relation.
Step 5: Analyze Subsets
Consider the subset . All elements in are odd. According to the definition of , any two elements from will be related to each other because they are both odd. Similarly, for the subset , all elements are even. Thus, any two elements from will be related to each other because they are both even.
Step 6: Analyze Relation Between Subsets
If we take an element from (which is odd) and an element from (which is even), then and are not both odd or both even. One is odd and the other is even. Therefore, does not satisfy the condition for relation , meaning no element from is related to any element from .
More from this chapter
- Show that an onto function f:1,2,3 →1,2,3 is always one-one.
- Let A=-2,-1,0,1,2,3. Define a relation R on A by xRy if and only if y=max(x,1). If l is the number of elements in R, and m and n are the minimum numbers of orde
- 32. Show that f: R -> R defined as f(x) = x / sqrt(1 + x²) is one-one but not onto. (function, one-one, onto, real numbers, domain, codomain, range)
- Let A be the set of all students of a boys school. Show that the relation R in A given by R=(a, b): a is sister of b is the empty relation and R^()=(a, b): the
- Consider the identity function I_N: N → N defined as I_N(x)=x x N. Show that although I_N is onto but I_N+I_N: N → N defined as (I_N+I_N)(x)=I_N(x)+I_N(x)=x+x=2
- Prove that the relation R in the set A = 1, 2, 3, 4, 5 given by R = (a, b): |a - b| is even is an equivalence relation.
- Let f(x) = log_e x and g(x) = (x^4 - 2x³ + 3x² - 2x + 2)/(2x² - 2x + 1). Then the domain of f ° g is
- Let the domain of the function f(x) = cos^(-1) ( (4x + 5)/(3x - 7)) be [α, β] and the domain of g(x) = log_2(2 - 6log_7(2x + 5)) be [, ]. Then |7(α + β) + 4( +)