Advertisements
Advertisements
प्रश्न
Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is
(A) 1
(B) 2
(C) 3
(D) 4
उत्तर
It is given that A = {1, 2, 3}.
The smallest equivalence relation containing (1, 2) is given by,
R1 = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}
Now, we are left with only four pairs i.e., (2, 3), (3, 2), (1, 3), and (3, 1).
If we odd any one pair [say (2, 3)] to R1, then for symmetry we must add (3, 2). Also, for transitivity we are required to add (1, 3) and (3, 1).
Hence, the only equivalence relation (bigger than R1) is the universal relation.
This shows that the total number of equivalence relations containing (1, 2) is two.
The correct answer is B.
APPEARS IN
संबंधित प्रश्न
Show that each of the relation R in the set A= {x ∈ Z : 0 ≤ x ≤ = 12} given by R = {(a,b) : a = b} is an equivalence relation. Find the set of all elements related to 1 in each case.
Given a non-empty set X, consider P (X), which is the set of all subsets of X. Define the relation R in P(X) as follows:
For subsets A, B in P(X), ARB if and only if A ⊂ B. Is R an equivalence relation on P(X)? Justify your answer.
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.
The following relation is defined on the set of real numbers.
aRb if a – b > 0
Find whether relation is reflexive, symmetric or transitive.
If A = {1, 2, 3, 4} define relations on A which have properties of being symmetric but neither reflexive nor transitive ?
Defines a relation on N :
xy is square of an integer, x, y ∈ N
Determine the above relation is reflexive, symmetric and transitive.
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?
Write the smallest reflexive relation on set A = {1, 2, 3, 4}.
If R = {(x, y) : x + 2y = 8} is a relation on N by, then write the range of R.
If R is a symmetric relation on a set A, then write a relation between R and R−1.
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].
For the set A = {1, 2, 3}, define a relation R on the set A as follows:
R = {(1, 1), (2, 2), (3, 3), (1, 3)}
Write the ordered pairs to be added to R to make the smallest equivalence relation.
Mark the correct alternative in the following question:
Consider a non-empty set consisting of children in a family and a relation R defined as aRb if a is brother of b. Then, R 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.
Show that the relation R on the set Z of all integers, given by R = {(a,b) : 2 divides (a-b)} is an equivalence relation.
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 × 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 A = {0, 1, 2, 3} and define a relation R on A as follows: R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}. Is R reflexive? symmetric? 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 R reflexive and transitive
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
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
an injective mapping from A to B
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 neither one-one nor onto
The following defines a relation on N:
x + y = 10, x, y ∈ N
Determine which of the above relations are reflexive, symmetric and transitive.
The maximum number of equivalence relations on the set A = {1, 2, 3} are ______.
Let A = { 2, 3, 6 } Which of the following relations on A are 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} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}. Then R is ____________.
Let R be a relation on the set N of natural numbers denoted by nRm ⇔ n is a factor of m (i.e. n | m). Then, R is ____________.
Given triangles with sides T1: 3, 4, 5; T2: 5, 12, 13; T3: 6, 8, 10; T4: 4, 7, 9 and a relation R inset of triangles defined as R = `{(Delta_1, Delta_2) : Delta_1 "is similar to" Delta_2}`. Which triangles belong to the same equivalence class?
A relation S in the set of real numbers is defined as `"xSy" => "x" - "y" + sqrt3` is an irrational number, then relation S is ____________.
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 ____________.
In a group of 52 persons, 16 drink tea but not coffee, while 33 drink tea. How many persons drink coffee but not tea?
Which of the following is/are example of symmetric
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.
If a relation R on the set {a, b, c} defined by R = {(b, b)}, then classify the relation.
