Advertisements
Advertisements
प्रश्न
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.
Advertisements
उत्तर
A = {c ∈ Z : 0≤ x ≤ 12} = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}
R = {(a, b) : |a - b| is divisible by 3}
For any element a ∈ A, we have (a, a) ∈ R as |a - a| = 0 is divisible by 3.
∴ R is reflexive.
Now, let (a, b) ∈ R ⇒ |a - b|is divisible 3.
⇒ |- (a - b)| = |b - a| is divisible by 3
⇒ (b, a) ∈ R
∴ R is symmetric.
Now, let (a, b), (b, c) ∈ R.
⇒ |a - b| is divisible by 3 and |b - c| is divisible by 3.
⇒ (a - b) is divisible by 3 and (b - c) is divisible by 3.
⇒ (a - c) = (a - b) + (b - c) is divisible by 3.
⇒ |a - c| is divisible by 3.
⇒ (a, c) ∈ R
∴ R is transitive.
Hence, R is an equivalence relation.
APPEARS IN
संबंधित प्रश्न
Show that the relation R in the set A of points in a plane given by R = {(P, Q) : distance of the point P from the origin is the same as the distance of the point Q from the origin} is an equivalence relation. Further, show that the set of all points related to a point P ≠ (0, 0) is the circle passing through P with the origin as its centre.
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.
The following relation is defined on the set of real numbers. aRb if |a| ≤ b
Find whether relation is reflexive, symmetric or transitive.
If A = {1, 2, 3, 4} define relations on A which have properties of being reflexive, symmetric and transitive ?
Is it true that every relation which is symmetric and transitive is also reflexive? Give reasons.
Let O be the origin. We define a relation between two points P and Q in a plane if OP = OQ. Show that the relation, so defined is an equivalence relation.
Write the smallest reflexive relation on set A = {1, 2, 3, 4}.
If A = {3, 5, 7} and B = {2, 4, 9} and R is a relation given by "is less than", write R as a set ordered pairs.
Let R be the equivalence relation on the set Z of the integers given by R = { (a, b) : 2 divides a - b }.
Write the equivalence class [0].
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 R be a relation on the set N given by
R = {(a, b) : a = b − 2, b > 6}. Then,
Let A = {2, 3, 4, 5, ..., 17, 18}. Let '≃' be the equivalence relation on A × A, cartesian product of Awith itself, defined by (a, b) ≃ (c, d) if ad = bc. Then, the number of ordered pairs of the equivalence class of (3, 2) is _______________ .
Let A = {1, 2, 3} and B = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ________________ .
If A = {a, b, c, d}, then a relation R = {(a, b), (b, a), (a, a)} on A is _____________ .
If `f(x) = (4x + 3)/(6x - 4), x ≠ 2/3`, show that fof (x) = x for all `x ≠ 2/3`. Also, find the inverse of f.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6} Find (A × B) ∩ (A × C).
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find A × (B ∪ C).
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.
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
reflexive, symmetric and transitive
The following defines a relation on N:
x + y = 10, x, y ∈ N
Determine which of the above relations are reflexive, symmetric and transitive.
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 and also obtain the equivalent class [(2, 5)]
The maximum number of equivalence relations on the set A = {1, 2, 3} are ______.
Every relation which is symmetric and transitive is also reflexive.
Let A = {1, 2, 3}, then the domain of the relation R = {(1, 1), (2, 3), (2, 1)} defined on A is ____________.
The relation > (greater than) on the set of real numbers is
A relation 'R' in a set 'A' is called reflexive, if
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?
