Advertisements
Advertisements
प्रश्न
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 ?
उत्तर
R is reflexive and S is any relation.
Suppose a ∈ A. Then,
(a, a) ∈ R [Since R is reflexive]
⇒ (a, a) ∈ R ∪ S
⇒ R ∪ S is reflexive on A.
APPEARS IN
संबंधित प्रश्न
determination of whether the following relations are reflexive, symmetric, and transitive:
Relation R in the set A of human beings in a town at a particular time given by (c) R = {(x, y): x is exactly 7 cm taller than y}
Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as R = {(a, b): b = a + 1} is reflexive, symmetric, or transitive.
Check whether the relation R in R defined by R = {(a, b): a ≤ b3} is reflexive, symmetric, or transitive.
Let A be the set of all human beings in a town at a particular time. Determine whether of the following relation is reflexive, symmetric and transitive :
R = {(x, y) : x and y live in the same locality}
An integer m is said to be related to another integer n if m is a multiple of n. Check if the relation is symmetric, reflexive and transitive.
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 C be the set of all complex numbers and C0 be the set of all no-zero complex numbers. Let a relation R on C0 be defined as
`z_1 R z_2 ⇔ (z_1 -z_2)/(z_1 + z_2) ` is real for all z1, z2 ∈ C0 .
Show that R is an equivalence relation.
Let R = {(x, y) : |x2 − y2| <1) be a relation on set A = {1, 2, 3, 4, 5}. Write R as a set of ordered pairs.
Define a reflexive relation ?
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.
Let R be a relation on the set N given by
R = {(a, b) : a = b − 2, b > 6}. Then,
If a relation R is defined on the set Z of integers as follows:
(a, b) ∈ R ⇔ a2 + b2 = 25. Then, domain (R) is ___________
Let A = {1, 2, 3}. Then, the number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive 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 ______________ .
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, _____________________ .
Mark the correct alternative in the following question:
The maximum number of equivalence relations on the set A = {1, 2, 3} is _______________ .
Mark the correct alternative in the following question:
For real numbers x and y, define xRy if `x-y+sqrt2` is an irrational number. Then the relation R is ___________ .
Show that the relation R on the set Z of integers, given by R = {(a,b):2divides (a - b)} is an equivalence relation.
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.
R = {(a, b) / b = a + 1, a ∈ Z, 0 < a < 5}. Find the Range of R.
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
reflexive, transitive but not symmetric
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
an injective mapping from A to B
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
a mapping from A to B which is not injective
Give an example of a map which is not one-one but onto
The maximum number of equivalence relations on the set A = {1, 2, 3} are ______.
If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is ______.
Let the relation R be defined in N by aRb if 2a + 3b = 30. Then R = ______.
Which of the following is not an equivalence relation on I, the set of integers: x, y
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 ____________.
Let A = {x : -1 ≤ x ≤ 1} and f : A → A is a function defined by f(x) = x |x| then f is ____________.
A relation S in the set of real numbers is defined as `"xSy" => "x" - "y" + sqrt3` is an irrational number, then relation S 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.
- Ravi wishes to form all the relations possible from B to G. How many such relations are possible?
There are 600 student in a school. If 400 of them can speak Telugu, 300 can speak Hindi, then the number of students who can speak both Telugu and Hindi is:
Let f(x)= ax2 + bx + c be such that f(1) = 3, f(–2) = λ and f(3) = 4. If f(0) + f(1) + f(–2) + f(3) = 14, then λ is equal to ______.
lf A = {x ∈ z+ : x < 10 and x is a multiple of 3 or 4}, where z+ is the set of positive integers, then the total number of symmetric relations on A 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)
