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)].
Advertisements
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
Given an example of a relation. Which is transitive but neither reflexive nor symmetric.
Given an example of a relation. Which is symmetric and transitive but not reflexive.
Let R be the relation in the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Choose the correct answer.
Let A be the set of all human beings in a town at a particular time. Determine whether the following relation is reflexive, symmetric and transitive:
R = {(x, y) : x is father of y}
Test whether the following relation R1 is (i) reflexive (ii) symmetric and (iii) transitive :
R1 on Q0 defined by (a, b) ∈ R1 ⇔ a = 1/b.
Show that the relation R on the set Z of integers, given by
R = {(a, b) : 2 divides a – b}, is an equivalence relation.
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 relations on a set A, then prove that R is reflexive and S is any relation ⇒ R ∪ S is reflexive ?
Write the identity relation on set A = {a, b, c}.
Write the smallest reflexive relation on set A = {1, 2, 3, 4}.
If R is a symmetric relation on a set A, then write a relation between R and R−1.
Let A = {3, 5, 7}, B = {2, 6, 10} and R be a relation from A to B defined by R = {(x, y) : x and y are relatively prime}. Then, write R and R−1.
R is a relation from {11, 12, 13} to {8, 10, 12} defined by y = x − 3. Then, R−1 is ______________ .
If A = {1, 2, 3}, then a relation R = {(2, 3)} on A is _____________ .
For the matrix A = `[(2,3),(5,7)]`, find (A + A') and verify that it is a symmetric matrix.
Show that the relation S in the set A = [x ∈ Z : 0 ≤ x ≤ 12] given by S = [(a, b) : a, b ∈ Z, ∣a − b∣ is divisible by 3] is an equivalence relation.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find (A × B) ∪ (A × C).
Let n be a fixed positive integer. Define a relation R in Z as follows: ∀ a, b ∈ Z, aRb if and only if a – b is divisible by n. Show that R is an equivalance relation
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
a mapping from A to B which is not injective
The maximum number of equivalence relations on the set A = {1, 2, 3} are ______.
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.
Let A = {1, 2, 3} and R = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ____________.
Let A = {1, 2, 3}, then the domain of the relation R = {(1, 1), (2, 3), (2, 1)} defined on A 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?
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.
lf A = {x ∈ z+ : x < 10 and x is a multiple of 3 or 4}, where z+ is the set of positive integers, then the total number of symmetric relations on A is ______.
Which pair of relations are called trivial relations?
