Advertisements
Advertisements
प्रश्न
Mark the correct alternative in the following question:
The relation S defined on the set R of all real number by the rule aSb if a b is _______________ .
पर्याय
an equivalence relation
reflexive, transitive but not symmetric
symmetric, transitive but not reflexive
neither transitive nor reflexive but symmetric
Advertisements
उत्तर
We have,
S = {(a, b) : a b; a, b R}
Hence, The relation S defined on the set R of all real number by the rule aSb if a b is reflexive, transitive but not symmetric.
APPEARS IN
संबंधित प्रश्न
Determine whether the following relation is reflexive, symmetric and transitive:
Relation R in the set Z of all integers defined as R = {(x, y) : x – y is an integer}.
Show that the relation R in the set A of all the books in a library of a college, given by R = {(x, y) : x and y have the same number of pages} is an equivalence relation.
Show that the relation R in the set A = {1, 2, 3, 4, 5} given by R = {(a, b) : |a − b| is even}, is an equivalence relation. Show that all the elements of {1, 3, 5} are related to each other and all the elements of {2, 4} are related to each other. But no element of {1, 3, 5} is related to any element of {2, 4}.
Given an example of a relation. Which is reflexive and transitive but not symmetric.
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 R be the relation in the set N given by R = {(a, b) : a = b – 2, b > 6}. Choose the correct answer.
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 work at the same place}
Test whether the following relation R2 is (i) reflexive (ii) symmetric and (iii) transitive:
R2 on Z defined by (a, b) ∈ R2 ⇔ |a – b| ≤ 5
The following relation is defined on the set of real numbers. aRb if |a| ≤ b
Find whether relation is reflexive, symmetric or transitive.
If A = {1, 2, 3, 4} define relations on A which have properties of being reflexive, symmetric and 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 it reflexive and transitive.
Defines a relation on N:
xy is square of an integer, x, y ∈ N
Determine the above relation is reflexive, symmetric and transitive.
Let n be a fixed positive integer. Define a relation R on Z as follows:
(a, b) ∈ R ⇔ a − b is divisible by n.
Show that R is an equivalence relation on Z.
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 A = {3, 5, 7} and B = {2, 4, 9} and R is a relation given by "is less than", write R as a set ordered pairs.
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 R = {(a, a3) : a is a prime number less than 5} be a relation. Find the range of R.
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].
If A = {a, b, c}, then the relation R = {(b, c)} on A is _______________ .
Let A = {1, 2, 3}. Then, the number of equivalence relations containing (1, 2) is ______.
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.
In the set of natural numbers N, define a relation R as follows: ∀ n, m ∈ N, nRm if on division by 5 each of the integers n and m leaves the remainder less than 5, i.e. one of the numbers 0, 1, 2, 3 and 4. Show that R is equivalence relation. Also, obtain the pairwise disjoint subsets determined by R
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
reflexive, transitive but not symmetric
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
symmetric but neither reflexive nor transitive
Every relation which is symmetric and transitive is also reflexive.
Let R be the relation on N defined as by x + 2 y = 8 The domain of R is ____________.
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 ____________.
Total number of equivalence relations defined in the set S = {a, b, c} 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?
On the set N of all natural numbers, define the relation R by a R b, if GCD of a and b is 2. Then, R is
A market research group conducted a survey of 2000 consumers and reported that 1720 consumers like product P1 and 1450 consumers like product P2. What is the least number that must have liked both the products?
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.
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)
If a relation R on the set {a, b, c} defined by R = {(b, b)}, then classify the relation.
Which relation is called an Empty Relation?
Which statement about the Identity Relation is correct?
Which combination of properties is required for an equivalence relation?
