Let A = {1, 2, 3, 4, 5, 6, 7}. Then the relation is [2023]
an equivalence relation
reflexive but neither symmetric nor transitive
transitive but neither symmetric nor reflexive
symmetric but neither reflexive nor transitive
(4)
Given,
and
For Reflexive: Let
So, , which is not possible.
So, the given relation is not reflexive.
For Symmetric:
Hence, the given relation is symmetric.
For Transitive: Let and and .
But it does not imply that .
So, is not transitive.
Let A = {2, 3, 4} and B = {8, 9, 12}. Then the number of elements in the relation
divides and divides is [2023]
24
12
36
18
(3)
[IMAGE 2]
divides
Each element has 2 choices.
divides
Each element has 2 choices.
Let A = {1, 3, 4, 6, 9} and B = {2, 4, 5, 8, 10}. Let R be a relation defined on A x B such that and Then the number of elements in the set R is [2023]
52
180
26
160
(4)
We have, ;
At , there are 5 choices for ;
, there are 4 choices for ;
, there are 4 choices for ;
, there are 2 choices for ;
, there is 1 choice for ;
Now, at , there are 4 choices for ;
, there are 3 choices for ;
, there are 2 choices for ;
, there is 1 choice for .
Let R be a relation on R, given by
R = is an irrational number
Then R is [2023]
reflexive and symmetric but not transitive
reflexive and transitive but not symmetric
reflexive but neither symmetric nor transitive
an equivalence relation
(3)
is an irrational number}
Reflexive: For , we have which is an irrational number. is reflexive.
Symmetric: Let , i.e., is an irrational number.
Now, we need to check or not.
Let and
Then which is an irrational number.
But which is not an irrational number.
For ,
is not symmetric.
Transitive: Let and
Let
Then which is an irrational number.
Also, which is an irrational number.
But which is not an irrational
is not transitive.
Let P(S) denote the power set of S = {1, 2, 3, ...., 10}. Define the relations and on P(S) as if and if . Then [2023]
both and are not equivalence relations
only is an equivalence relation
only is an equivalence relation
both and are equivalence relations
The relation is [2023]
reflexive but not symmetric
transitive but not reflexive
symmetric but not transitive
neither symmetric nor transitive
(4)
[IMAGE 3]
Reflexive :
Symmetric: Let
Thus, But
Transitive:
But
Let R be a relation defined on as if is a multiple of 5, . [2023]
symmetric but not transitive
not reflexive
an equivalence relation
transitive but not symmetric
(3)
If 'R' be a relation defined on as is is a multiple of 5, .
(i) is a multiple of 5
R is a reflexive relation.
(ii) (let)
Now,
So, R is a symmetric relation.
(iii) ;
Now,
So, R is a transitive relation.
Hence Relation 'R' is an equivalence relation.
The minimum number of elements that must be added to the relation R = {(a, b), (b, c)} on the set {a, b, c} so that it becomes symmetric and transitive is [2023]
3
7
4
5
(2)
Given relation, and set =
For symmetric, since
So, be in R. For transitive, since
So, should be in R. Then should also be in R since lies in R.
Since , so should also lie in R.
Since , so should also lie in R.
Since , so should also lie in R.
Elements to be added are:
.
Total number of elements to be added = 7.
Let R be a relation on N x N defined by (a, b) R(c, d) if and only if . Then R is [2023]
transitive but neither reflexive nor symmetric
symmetric but neither reflexive nor transitive
symmetric and transitive but not reflexive
reflexive and symmetric but not transitive
(2)
We have,
For reflexive: which is false.
Hence, it is not reflexive.
For symmetric:
Hence, it is symmetric.
For transitive:
Hence, it is not transitive.
Among the relations
and
[2023]
S is transitive but T is not
both S and T are symmetric
neither S nor T is transitive
T is symmetric but S is not
(4)
For relation
Then, on relation
If , then is not necessarily positive.