Advertisements
Advertisements
प्रश्न
Consider the 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 ______.
पर्याय
Symmetric but not transitive
Transitive but not symmetric
Neither symmetric nor transitive
Both symmetric and transitive
Advertisements
उत्तर
Consider the 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 transitive but not symmetric.
Explanation:
aRb ⇒ a is brother of b.
This does not mean b is also a brother of a as b can be a sister of a.
Thus, R is not symmetric.
aRb ⇒ a is brother of b.
and bRc ⇒ b is brother of c.
So, a is brother of c.
Therefore, R is transitive.
APPEARS IN
संबंधित प्रश्न
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. Also, obtain the equivalence class [(2, 5)].
Show that the relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} is symmetric but neither reflexive nor transitive.
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.
If A = {1, 2, 3, 4} define relations on A which have properties of being symmetric but neither reflexive nor transitive ?
Give an example of a relation which is reflexive and symmetric but not transitive?
Give an example of a relation which is transitive but neither reflexive nor symmetric?
Given the relation R = {(1, 2), (2, 3)} on the set A = {1, 2, 3}, add a minimum number of ordered pairs so that the enlarged relation is symmeteric, transitive and reflexive.
Let A = {1, 2, 3} and R = {(1, 2), (1, 1), (2, 3)} be a relation on A. What minimum number of ordered pairs may be added to R so that it may become a transitive relation on A.
Let Z be the set of integers. Show that the relation
R = {(a, b) : a, b ∈ Z and a + b is even}
is an equivalence relation on Z.
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.
Define a reflexive relation ?
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 _______________ .
The relation 'R' in N × N such that
(a, b) R (c, d) ⇔ a + d = b + c is ______________ .
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 ______________ .
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 _____________ .
Mark the correct alternative in the following question:
Let R be a relation on the set N of natural numbers defined by nRm if n divides m. Then, R 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 ______________ .
Mark the correct alternative in the following question:
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 for all a, b T. Then, R is ____________ .
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6} Find (A × B) ∩ (A × C).
Let R be a relation on the set N of natural numbers defined by nRm if n divides m. Then R is ______.
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 S = {1, 2, 3, 4, 5} and let A = S x S. Define the relation R on A as follows:
(a, b) R (c, d) iff ad = cb. Then, R is ____________.
A relation R in set A = {1, 2, 3} is defined as R = {(1, 1), (1, 2), (2, 2), (3, 3)}. Which of the following ordered pair in R shall be removed to make it an equivalence relation in A?
Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let A be the set of players while B be the set of all possible outcomes.
A = {S, D}, B = {1,2,3,4,5,6}
- Let R ∶ B → B be defined by R = {(x, y): y is divisible by x} is ____________.
Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let A be the set of players while B be the set of all possible outcomes.
A = {S, D}, B = {1,2,3,4,5,6}
- Let R be a relation on B defined by R = {(1,2), (2,2), (1,3), (3,4), (3,1), (4,3), (5,5)}. Then R 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 ____________.
A relation 'R' in a set 'A' is called a universal relation, if each element of' A' is related to :-
A relation 'R' in a set 'A' is called reflexive, if
Define the relation R in the set N × N as follows:
For (a, b), (c, d) ∈ N × N, (a, b) R (c, d) if ad = bc. Prove that R is an equivalence relation in N × N.
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.
Let A = {1, 2, 3, 4} and let R = {(2, 2), (3, 3), (4, 4), (1, 2)} be a relation on A. Then R is ______.
A relation R on (1, 2, 3) is given by R = {(1, 1), (2, 2), (1, 2), (3, 3), (2, 3)}. Then the relation R is ______.
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?
If a relation R on the set {a, b, c} defined by R = {(b, b)}, then classify the relation.
