Advertisements
Advertisements
Question
Let A = {1, 2, 3}. Then, the number of equivalence relations containing (1, 2) is ______.
Options
1
2
3
4
Advertisements
Solution
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
RELATED QUESTIONS
Let N denote the set of all natural numbers and R be the relation on N × N defined by (a, b) R (c, d) if ad (b + c) = bc (a + d). Show that R is an equivalence relation.
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 exactly 7 cm taller than y}
Check whether the relation R in R defined by R = {(a, b) : a ≤ b3} is reflexive, symmetric or transitive.
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.
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.
The binary operation *: R x R → R is defined as a *b = 2a + b Find (2 * 3)*4
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.
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
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 symmetric but neither reflexive nor transitive ?
Show that the relation '≥' on the set R of all real numbers is reflexive and transitive but not symmetric ?
Give an example of a relation which is symmetric and transitive but not reflexive?
Defines a relation on N:
xy is square of an integer, x, y ∈ N
Determine the above relation is reflexive, symmetric and transitive.
Show that the relation R defined by R = {(a, b) : a – b is divisible by 3; a, b ∈ Z} is an equivalence relation.
m is said to be related to n if m and n are integers and m − n is divisible by 13. Does this define an equivalence relation?
Let S be a relation on the set R of all real numbers defined by
S = {(a, b) ∈ R × R : a2 + b2 = 1}
Prove that S is not an equivalence relation on R.
If R and S are relations on a set A, then prove that R and S are symmetric ⇒ R ∩ S and R ∪ S are symmetric ?
State the reason for the relation R on the set {1, 2, 3} given by R = {(1, 2), (2, 1)} to be transitive ?
If R is a relation on the set A = {1, 2, 3} given by R = {(1, 1), (2, 2), (3, 3)}, then R is ____________ .
In the set Z of all integers, which of the following relation R is not 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.
If A = {a, b, c}, B = (x , y} find A × A.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6} Find (A × B) ∩ (A × C).
Consider the set A = {1, 2, 3} and R be the smallest equivalence relation on A, then R = ______
Consider the set A = {1, 2, 3} and the relation R = {(1, 2), (1, 3)}. R is a transitive relation.
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
reflexive, transitive but not symmetric
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 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.
Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a is congruent to b ∀ a, b ∈ T. Then R is ______.
If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is ______.
Let the relation R be defined in N by aRb if 2a + 3b = 30. Then R = ______.
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.
If f(x) = `1 - 1/"x", "then f"("f"(1/"x"))` ____________.
Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a is congruent to b ∀ a, b ∈ T. Then R is ____________.
Let A = {1, 2, 3, …. n} and B = {a, b}. Then the number of surjections from A into B is ____________.
Given set A = {1, 2, 3} and a relation R = {(1, 2), (2, 1)}, the relation R will be ____________.
A relation \(R\) is symmetric if which condition is satisfied?
What should be checked to determine whether a relation is reflexive?
What should be checked to determine whether a relation is transitive?
