Advertisements
Advertisements
Question
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 _____________ .
Options
symmetric but not transitive
transitive but not symmetric
neither symmetric nor transitive
both symmetric and transitive
Advertisements
Solution
Hence, R is transitive but not symmetric.
APPEARS IN
RELATED QUESTIONS
Given an example of a relation. Which is Symmetric but neither reflexive nor transitive.
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.
Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is
(A) 1
(B) 2
(C) 3
(D) 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 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 father of and y}
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.
The following relation is defined on the set of real numbers.
aRb if 1 + ab > 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 ?
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 reflexive and transitive but not symmetric?
Prove that the relation R on Z defined by
(a, b) ∈ R ⇔ a − b is divisible by 5
is an equivalence relation on Z.
Show that the relation R on 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.
Let Z be the set of all integers and Z0 be the set of all non-zero integers. Let a relation R on Z × Z0be defined as (a, b) R (c, d) ⇔ ad = bc for all (a, b), (c, d) ∈ Z × Z0,
Prove that R is an equivalence relation on Z × Z0.
If R and S are relations on a set A, then prove that R is reflexive and S is any relation ⇒ R ∪ S is reflexive ?
Define an equivalence relation ?
Let R be a relation on the set N given by
R = {(a, b) : a = b − 2, b > 6}. Then,
The relation R defined on the set A = {1, 2, 3, 4, 5} by
R = {(a, b) : | a2 − b2 | < 16} is given by ______________ .
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 R be a relation on N defined by x + 2y = 8. The domain of R is _______________ .
If R is the largest equivalence relation on a set A and S is any relation on A, then _____________ .
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, _____________________ .
Mark the correct alternative in the following question:
The maximum number of equivalence relations on the set A = {1, 2, 3} is _______________ .
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find A × (B ∪ C).
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 Z be the set of integers and R be the relation defined in Z such that aRb if a – b is divisible by 3. Then R partitions the set Z into ______ pairwise disjoint subsets
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, symmetric and transitive
The following defines a relation on N:
x is greater than y, x, y ∈ N
Determine which of the above relations are reflexive, symmetric and transitive.
If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, 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 ______.
Every relation which is symmetric and transitive is also reflexive.
R = {(1, 1), (2, 2), (1, 2), (2, 1), (2, 3)} be a relation on A, then R is ____________.
Let A = {1, 2, 3}, then the domain of the relation R = {(1, 1), (2, 3), (2, 1)} defined on A is ____________.
If f(x) = `1 - 1/"x", "then f"("f"(1/"x"))` ____________.
Total number of equivalence relations defined in the set S = {a, b, c} is ____________.
An organization conducted a bike race under 2 different categories-boys and girls. Totally there were 250 participants. 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. Let B = {b1,b2,b3} G={g1,g2} where B represents the set of boys selected and G the set of girls who were selected for the final race.
Ravi decides to explore these sets for various types of relations and functions.
- Let R: B → B be defined by R = {(x, y): x and y are students of same sex}, Then this relation 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 ____________.
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)
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 ______.
