Advertisements
Advertisements
प्रश्न
Let A = {1, 2, 3}. Then, the number of equivalence relations containing (1, 2) is ______.
विकल्प
1
2
3
4
Advertisements
उत्तर
Let A = {1, 2, 3}. Then, the number of equivalence relations containing (1, 2) is 2.
Explanation:
Given that A = {1, 2, 3}
An equivalence relation is reflexive, symmetric, and transitive.
The shortest relation that includes (1, 2) is
R1 = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}
It contains more than just the four elements (2, 3), (3, 2), (3, 3) and (3, 1).
Now, if (2, 3) ∈ R1, then for the symmetric relation, there will also be (3, 2) ∈ R1. Again, the transitive relation (1, 3) and (3, 1) will also be in R1.
Hence, any relation greater than R1 will be the only universal relation.
Hence, the number of equivalence relations covering (1, 2) is only two.
APPEARS IN
संबंधित प्रश्न
Show that the relation R in R defined as R = {(a, b) : a ≤ b}, is reflexive and transitive but not symmetric.
Show that the relation R in the set A of all the books in a library of a college, given by R = {(x, y) : x and y have the same number of pages} is an equivalence relation.
Given an example of a relation. Which is symmetric but neither reflexive nor transitive.
Given an example of a relation. Which is symmetric and transitive but not reflexive.
Show that the relation R defined in the set A of all triangles as R = {(T1, T2) : T1 is similar to T2}, is an 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?
Let L be the set of all lines in the XY plane and R be the relation in L defined as R = {(L1, L2) : L1 is parallel to L2}. Show that R is an equivalence relation. Find the set of all lines related to the line y = 2x + 4.
Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is ______.
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
Let A = {1, 2, 3}, and let R1 = {(1, 1), (1, 3), (3, 1), (2, 2), (2, 1), (3, 3)}, R2 = {(2, 2), (3, 1), (1, 3)}, R3 = {(1, 3), (3, 3)}. Find whether or not each of the relations R1, R2, R3 on A is (i) reflexive (ii) symmetric (iii) transitive.
The following relation is defined on the set of real numbers.
aRb if a – b > 0
Find whether relation is reflexive, symmetric or transitive.
Prove that every identity relation on a set is reflexive, but the converse is not necessarily true.
Is it true that every relation which is symmetric and transitive is also reflexive? Give reasons.
Give an example of a relation which is reflexive and symmetric but not transitive?
Give an example of a relation which is symmetric but neither reflexive nor transitive?
Let A = {a, b, c} and the relation R be defined on A as follows: R = {(a, a), (b, c), (a, b)}. Then, write minimum number of ordered pairs to be added in R to make it reflexive and transitive.
If R and S are transitive relations on a set A, then prove that R ∪ S may not be a transitive relation on A.
Define a reflexive relation ?
Write the smallest equivalence relation on the set A = {1, 2, 3} ?
The relation R defined on the set A = {1, 2, 3, 4, 5} by
R = {(a, b) : | a2 − b2 | < 16} is given by ______________ .
If A = {1, 2, 3}, B = {1, 4, 6, 9} and R is a relation from A to B defined by 'x is greater than y'. The range of R is ______________ .
If R is a relation on the set A = {1, 2, 3} given by R = {(1, 1), (2, 2), (3, 3)}, then R is ____________ .
If A = {1, 2, 3}, then a relation R = {(2, 3)} on A 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 R defined as R = {(a, b): a ≤ b}, is reflexive, and transitive but not symmetric.
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.
If A = {a, b, c}, B = (x , y} find A × B.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find A × (B ∪ C).
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find (A × B) ∪ (A × C).
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
Give an example of a map which is not one-one but onto
The following defines a relation on N:
x y is square of an integer x, y ∈ N
Determine which of the above relations are reflexive, symmetric and transitive.
The following defines a relation on N:
x + 4y = 10 x, y ∈ N.
Determine which of the above relations are reflexive, symmetric and transitive.
Let us define a relation R in R as aRb if a ≥ b. Then R is ______.
Let A = {1, 2, 3} and consider the relation R = {1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1,3)}. Then R is ______.
Let A = {1, 2, 3} and R = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ____________.
Given set A = {a, b, c}. An identity relation in set A is ____________.
A relation 'R' in a set 'A' is called a universal relation, if each element of' A' is related to :-
Let R = {(a, b): a = a2} for all, a, b ∈ N, then R salifies.
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?
