Show that the Relation R Defined by (A, B)R(C,D) ⇒ a + D = B + C on the a X a , Where a = {1, 2,3,...,10} is an Equivalence Relation.
Advertisements
Advertisements
Question
Show that the relation R defined by (a, b)R(c,d) ⇒ a + d = b + c on the A x A , where A = {1, 2,3,...,10} is an equivalence relation. Hence write the equivalence class [(3, 4)]; a, b, c,d ∈ A.
Advertisements
Solution
Here (a, b)R(c,d) ⇒ a + d = b + c on A x A, where A = {1, 2,3,...,10} .
Reflexivity: Let (a, b) be an arbitrary element of A x A. Then, (a,b) ∈ A x A `forall` a, b ∈ A.
So, a + b = b + a
⇒ (a,b) R (a,b).
Thus, (a,b) R (a,b) `forall` (a,b) ∈ A x A.
Hence R is reflexive.
Symmetry: Let (a,b), (c,d) ∈ A x A be such that (a,b) R (c,d).
Then, a + d = b + c
⇒ c + b = d + a
⇒ (c,d ) R (a,b).
Thus, (a,b) R (c,d)
⇒ (c,d) R (a,b) `forall` (a,b), (c,d) ∈ A x A.
Hence R is symmetric.
Transitivity: Let (a,b),(c,d),(e,f) ∈ A x A be such that (a,b) R (c,d) R (e,f).
Then, a + d = b + c and c + f = d + e
⇒ (a+d) + (c+f)
= (b + c) + (d+e)
⇒ a + f = b + e
⇒ (a, b) R (e,f).
That is (a,b) R (c,d) and (c,d) R (e,f)
⇒ (a,b) R (e,f) `forall` (a,b), (c,d), (e,f) ∈ A x A.
Hence R is transitive.
Since R is reflexive, symmetric and transitive so, R is an equivalence relation as well.
For the equivalence class of [(3, 4)], we need to find (a,b) s.t. (a,b) R (3,4)
⇒ a + 4 = b + 3
⇒ b - a = 1.
So, [(3,4)] = {(1,2),(2,3),(3,4),(4,5),(5,6),(6,7),(7,8),(8,9),(9,10)}.
APPEARS IN
RELATED QUESTIONS
The binary operation *: R x R → R is defined as a *b = 2a + b Find (2 * 3)*4
Test whether the following relation R3 is (i) reflexive (ii) symmetric and (iii) transitive:
R3 on R is defined by (a, b) ∈ R3 `⇔` a2 – 4ab + 3b2 = 0.
If A = {1, 2, 3, 4} define relations on A which have properties of being reflexive, symmetric and transitive ?
Show that the relation R on the set A = {x ∈ Z ; 0 ≤ x ≤ 12}, given by R = {(a, b) : a = b}, is an equivalence relation. Find the set of all elements related to 1.
Let R be the relation defined on the set A = {1, 2, 3, 4, 5, 6, 7} by R = {(a, b) : both a and b are either odd or even}. Show that R is an equivalence relation. Further, show that all the elements of the subset {1, 3, 5, 7} are related to each other and all the elements of the subset {2, 4, 6} are related to each other, but no element of the subset {1, 3, 5, 7} is related to any element of the subset {2, 4, 6}.
If R and S are transitive relations on a set A, then prove that R ∪ S may not be a transitive relation on A.
Let A = {0, 1, 2, 3} and R be a relation on A defined as
R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}
Is R reflexive? symmetric? transitive?
Let A = {1, 2, 3}. Then, the number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is ______.
If A = {a, b, c, d}, then a relation R = {(a, b), (b, a), (a, a)} on A is _____________ .
Mark the correct alternative in the following question:
The maximum number of equivalence relations on the set A = {1, 2, 3} is _______________ .
Mark the correct alternative in the following question:
Let L denote the set of all straight lines in a plane. Let a relation R be defined by lRm if l is perpendicular to m for all l, m ∈ L. Then, R is ______________ .
Show that the relation R on the set Z of integers, given by R = {(a,b):2divides (a - b)} is an equivalence relation.
Show that the relation R on the set Z of all integers, given by R = {(a,b) : 2 divides (a-b)} is an equivalence relation.
If A = {a, b, c}, B = (x , y} find B × A.
Consider the set A = {1, 2, 3} and the relation R = {(1, 2), (1, 3)}. R is a transitive relation.
The following defines a relation on N:
x is greater than y, x, y ∈ N
Determine which of the above relations are reflexive, symmetric and transitive.
If f(x) = `1 - 1/"x", "then f"("f"(1/"x"))` ____________.
Let A = {1, 2, 3, …. n} and B = {a, b}. Then the number of surjections from A into B is ____________.
Let A = {x : -1 ≤ x ≤ 1} and f : A → A is a function defined by f(x) = x |x| then f is ____________.
Given set A = {a, b, c}. An identity relation in set A is ____________.
Find: `int (x + 1)/((x^2 + 1)x) dx`
If f(x + 2a) = f(x – 2a), then f(x) is:
Given a non-empty set X, define the relation R in P(X) as follows:
For A, B ∈ P(X), (4, B) ∈ R iff A ⊂ B. Prove that R is reflexive, transitive and not symmetric.
Let N be the set of all natural numbers and R be a relation on N × N defined by (a, b) R (c, d) `⇔` ad = bc for all (a, b), (c, d) ∈ N × N. Show that R is an equivalence relation on N × N. Also, find the equivalence class of (2, 6), i.e., [(2, 6)].
Which relation is called an Empty Relation?
What characterizes an Identity Relation?
What should be checked to determine whether a relation is reflexive?
What should be checked to determine whether a relation is transitive?
Which combination of properties is required for an equivalence relation?
