Advertisements
Advertisements
Question
Let A = {1, 2, 3,......, 9} and R be the relation in A × A defined by (a, b) R (c, d) if a + d = b + c for (a, b), (c, d) in A × A. Prove that R is an equivalence relation. Also, obtain the equivalence class [(2, 5)].
Solution
A = {1, 2, 3, ..., 9} ⊂ ℕ, the set of natural numbers
Let R be the relation in A × A defined by (a, b) R (c, d) if a + d = b + c for (a, b), (c, d) in A × A.
We have to show that R is an equivalence relation.
Reflexivity:
Let (a, b) be an arbitrary element of A × A. Then, we have:
(a, b) ∈ A × A
⇒ a, b ∈ A
⇒ a + b = b + a (by commutativity of addition on A ⊂ ℕ)
⇒ (a, b) R (a, b)
Thus, (a, b) R (a, b) for all (a, b) ∈ A × A.
So, R is reflexive.
Symmetry:
Let (a, b), (c, d) ∈ A × A such that (a, b) R (c, d).
a + d = b + c
⇒ b + c = a + d
⇒ c + b = d + a (by commutativity of addition on A ⊂ ℕ)
⇒ (c, d) R (a, b)
Thus, (a, b) R (c, d) ⇒ (c, d) R (a, b) for all (a, b), (c, d) ∈ A × A.
So, R is symmetric
Transitivity:
Let (a, b), (c, d), (e, f) ∈ A × A such that (a, b) R (c, d) and (c, d) R (e, f). Then, we have:
(a, b) R (c, d)
⇒ a + d = b + c ... (1)
(c, d) R (e, f)
⇒ c + f = d + e ... (2)
Adding equations (1) and (2), we get:
(a + d) + (c + f) = (b + c) + (d + e)
⇒ a + f = b + e
⇒ (a, b) R (e, f)
Thus, (a, b) R (c, d) and (c, d) R (e, f) ⇒ (a, b) R (e, f) for all (a, b), (c, d), (e, f) ∈ A × A.
So, R is transitive on A × A.
Thus, R is reflexive, symmetric and transitive.
∴ R is an equivalence relation.
To write the equivalence class of [(2, 5)], we need to search all the elements of the type (a, b) such that 2 + b = 5 + a.
∴ Equivalence class of [(2, 5)] = {(1, 4), (2, 5), (3, 6), (4, 7), (5, 8), (6, 9)}
APPEARS IN
RELATED QUESTIONS
determination of whether the following relations are reflexive, symmetric, and transitive:
Relation R in the set N of natural numbers defined as
R = {(x, y): y = x + 5 and x < 4}
Show that each of the relation R in the set A= {x ∈ Z : 0 ≤ x ≤ = 12} given by R = {(a, b) : |a - b| is a multiple of 4} is an equivalence relation. Find the set of all elements related to 1 in each case.
Show that the relation R defined in the set A of all triangles as R = {(T1, T2): T1 is similar to T2}, is equivalence relation. Consider three right angle triangles T1 with sides 3, 4, 5, T2 with sides 5, 12, 13 and T3 with sides 6, 8, and 10. Which triangles among T1, T2 and T3 are related?
Show that the relation R defined in the set A of all polygons as R = {(P1, P2): P1 and P2have same number of sides}, is an equivalence relation. What is the set of all elements in A related to the right angle triangle T with sides 3, 4 and 5?
Test whether the following relation R2 is (i) reflexive (ii) symmetric and (iii) transitive:
R2 on Z defined by (a, b) ∈ R2 ⇔ |a – b| ≤ 5
Write the smallest reflexive relation on set A = {1, 2, 3, 4}.
Let R = {(x, y) : |x2 − y2| <1) be a relation on set A = {1, 2, 3, 4, 5}. Write R as a set of ordered pairs.
Define a reflexive relation ?
Define a transitive relation ?
If A = {1, 2, 3}, then a relation R = {(2, 3)} on A 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 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.
Let A = {6, 8} and B = {1, 3, 5}.
Let R = {(a, b)/a∈ A, b∈ B, a – b is an even number}. Show that R is an empty relation from A to B.
Let L denote the set of all straight lines in a plane. Let a relation R be defined by lRm if and only if l is perpendicular to m ∀ l, m ∈ L. Then R is ______.
Let R be relation defined on the set of natural number N as follows:
R = {(x, y): x ∈N, y ∈N, 2x + y = 41}. Find the domain and range of the relation R. Also verify whether R is reflexive, symmetric and transitive
Let us define a relation R in R as aRb if a ≥ b. Then R is ______.
Let R = {(3, 1), (1, 3), (3, 3)} be a relation defined on the set A = {1, 2, 3}. Then R is symmetric, transitive but not reflexive.
The relation R on the set A = {1, 2, 3} defined as R = {{1, 1), (1, 2), (2, 1), (3, 3)} is reflexive, symmetric and transitive.
Let S = {1, 2, 3, 4, 5} and let A = S x S. Define the relation R on A as follows:
(a, b) R (c, d) iff ad = cb. Then, R is ____________.
A relation R in set A = {1, 2, 3} is defined as R = {(1, 1), (1, 2), (2, 2), (3, 3)}. Which of the following ordered pair in R shall be removed to make it an equivalence relation in A?
Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let A be the set of players while B be the set of all possible outcomes.
A = {S, D}, B = {1,2,3,4,5,6}
- Let R: B → B be defined by R = {(1,1),(1,2), (2,2), (3,3), (4,4), (5,5), (6,6)}, then R is ____________.
Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the saplings along the line y = x − 4. Let L be the set of all lines which are parallel on the ground and R be a relation on L.
Answer the following using the above information.
- Let R = {(L1, L2 ): L1 is parallel to L2 and L1: y = x – 4} then which of the following can be taken as L2?
If A = {1,2,3}, B = {4,6,9} and R is a relation from A to B defined by ‘x is smaller than y’. The range of R is ____________.
The relation R = {(1,1),(2,2),(3,3)} on {1,2,3} is ____________.
In a group of 52 persons, 16 drink tea but not coffee, while 33 drink tea. How many persons drink coffee but not tea?
A relation 'R' in a set 'A' is called reflexive, if
Let R = {(x, y) : x, y ∈ N and x2 – 4xy + 3y2 = 0}, where N is the set of all natural numbers. Then the relation R is ______.
A relation R on (1, 2, 3) is given by R = {(1, 1), (2, 2), (1, 2), (3, 3), (2, 3)}. Then the relation R is ______.
Statement 1: The intersection of two equivalence relations is always an equivalence relation.
Statement 2: The Union of two equivalence relations is always an equivalence relation.
Which one of the following is correct?
