Advertisements
Advertisements
Question
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 ______.
Options
Symmetric but not transitive
Transitive but not symmetric
Neither symmetric nor transitive
Both symmetric and transitive
Advertisements
Solution
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
RELATED QUESTIONS
Given an example of a relation. Which is symmetric but neither reflexive nor transitive.
Given an example of a relation. Which is reflexive and symmetric but not transitive.
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 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 and y live in the same locality}
Let R be a relation defined on the set of natural numbers N as
R = {(x, y) : x, y ∈ N, 2x + y = 41}
Find the domain and range of R. Also, verify whether R is (i) reflexive, (ii) symmetric (iii) transitive.
Give an example of a relation which is symmetric but neither reflexive nor transitive?
Show that the relation R defined by R = {(a, b) : a – b is divisible by 3; a, b ∈ Z} is an equivalence relation.
Let O be the origin. We define a relation between two points P and Q in a plane if OP = OQ. Show that the relation, so defined is an equivalence relation.
Write the smallest reflexive relation on set A = {1, 2, 3, 4}.
Let A = {2, 3, 4, 5} and B = {1, 3, 4}. If R is the relation from A to B given by a R b if "a is a divisor of b". Write R as a set of ordered pairs.
Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(a, b) : | a2- b2 | < 8}. Write R as a set of ordered pairs.
A relation ϕ from C to R is defined by x ϕ y ⇔ | x | = y. Which one is correct?
Let R be the relation on the set A = {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Then, _____________________ .
Let A = {1, 2, 3}. Then, the number of equivalence relations containing (1, 2) 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 R defined as R = {(a, b): a ≤ b}, is reflexive, and transitive but not symmetric.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find (A × B) ∪ (A × C).
Let n be a fixed positive integer. Define a relation R in Z as follows: ∀ a, b ∈ Z, aRb if and only if a – b is divisible by n. Show that R is an equivalance relation
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
reflexive, symmetric and transitive
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 and also obtain the equivalent class [(2, 5)]
The maximum number of equivalence relations on the set A = {1, 2, 3} are ______.
An integer m is said to be related to another integer n if m is a integral multiple of n. This relation in Z is reflexive, symmetric and transitive.
Let A = {1, 2, 3} and R = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ____________.
If A is a finite set containing n distinct elements, then the number of relations on A is equal to ____________.
Let A = {1, 2, 3}, then the domain of the relation R = {(1, 1), (2, 3), (2, 1)} defined on A is ____________.
A relation R on a non – empty set A is an equivalence relation if it is ____________.
Let us define a relation R in R as aRb if a ≥ b. 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?
Given set A = {a, b, c}. An identity relation in set A 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 ∶ B → B be defined by R = {(x, y): y is divisible by x} is ____________.
If A is a finite set consisting of n elements, then the number of reflexive relations on A is
Which one of the following relations on the set of real numbers R is an equivalence relation?
Which of the following is/are example of symmetric
If f(x + 2a) = f(x – 2a), then f(x) is:
Let R1 and R2 be two relations defined as follows :
R1 = {(a, b) ∈ R2 : a2 + b2 ∈ Q} and
R2 = {(a, b) ∈ R2 : a2 + b2 ∉ Q}, where Q is the set of all rational numbers. Then ______
Read the following passage:
|
An organization conducted bike race under two different categories – Boys and Girls. There were 28 participants in all. Among all of them, finally three from category 1 and two from category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project. |
Based on the above information, answer the following questions:
- How many relations are possible from B to G? (1)
- Among all the possible relations from B to G, how many functions can be formed from B to G? (1)
- Let R : B `rightarrow` B be defined by R = {(x, y) : x and y are students of the same sex}. Check if R is an equivalence relation. (2)
OR
A function f : B `rightarrow` G be defined by f = {(b1, g1), (b2, g2), (b3, g1)}. Check if f is bijective. Justify your answer. (2)
