Advertisements
Advertisements
प्रश्न
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.
Advertisements
उत्तर
We have,
A = {a, b, c} and R = {(a, a), (b, c), (a, b)}
R can be a reflexive relation only when elements (b, b) and (c, c) are added to it
R can be a transitive relation only when the element (a, c) is added to it
So, the minmum number of ordered pairs to be added in R is 3.
APPEARS IN
संबंधित प्रश्न
Determine whether the following relation is reflexive, symmetric and transitive:
Relation R in the set A = {1, 2, 3, 4, 5, 6} as R = {(x, y) : y is divisible by x}.
Show that the relation R in the set R of real numbers, defined as R = {(a, b) : a ≤ b2} is neither reflexive nor symmetric nor transitive.
Show that the relation R in 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.
Given an example of a relation. Which is Transitive but neither reflexive nor symmetric.
Given an example of a relation. Which is Reflexive and symmetric but not transitive.
Given an example of a relation. Which is Reflexive and transitive but not symmetric.
Given an example of a relation. Which is Symmetric and transitive but not reflexive.
Three relations R1, R2 and R3 are defined on a set A = {a, b, c} as follows:
R1 = {(a, a), (a, b), (a, c), (b, b), (b, c), (c, a), (c, b), (c, c)}
R2 = {(a, a)}
R3 = {(b, c)}
R4 = {(a, b), (b, c), (c, a)}.
Find whether or not each of the relations R1, R2, R3, R4 on A is (i) reflexive (ii) symmetric and (iii) transitive.
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 ?
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.
Show that the relation R defined by R = {(a, b) : a – b is divisible by 3; a, b ∈ Z} is an equivalence relation.
Let L be the set of all lines in 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 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.
If R and S are relations on a set A, then prove that R and S are symmetric ⇒ R ∩ S and R ∪ S are symmetric ?
Write the smallest reflexive relation on set A = {1, 2, 3, 4}.
If R = {(x, y) : x + 2y = 8} is a relation on N by, then write the range of R.
Define an equivalence relation ?
Let the relation R be defined on N by aRb iff 2a + 3b = 30. Then write R as a set of ordered pairs
Write the smallest equivalence relation on the set A = {1, 2, 3} ?
Let R = {(a, a), (b, b), (c, c), (a, b)} be a relation on set A = a, b, c. Then, R is _______________ .
The relation R = {(1, 1), (2, 2), (3, 3)} on the set {1, 2, 3} is ___________________ .
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 _______________ .
Write the relation in the Roster form and hence find its domain and range:
R2 = `{("a", 1/"a") "/" 0 < "a" ≤ 5, "a" ∈ "N"}`
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
reflexive, symmetric and transitive
Let R be relation defined on the set of natural number N as follows:
R = {(x, y): x ∈N, y ∈N, 2x + y = 41}. Find the domain and range of the relation R. Also verify whether R is reflexive, symmetric and transitive
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 one-one but not onto
Let us define a relation R in R as aRb if a ≥ b. Then R is ______.
Let A = {1, 2, 3, 4, 5, 6} Which of the following partitions of A correspond to an equivalence relation on A?
If A is a finite set consisting of n elements, then the number of reflexive relations on A 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?
A relation 'R' in a set 'A' is called a universal relation, if each element of' A' is related to :-
If f(x + 2a) = f(x – 2a), then f(x) is:
Let a set A = A1 ∪ A2 ∪ ... ∪ Ak, where Ai ∩ Aj = Φ for i ≠ j, 1 ≤ i, j ≤ k. Define the relation R from A to A by R = {(x, y): y ∈ Ai if and only if x ∈ Ai, 1 ≤ i ≤ k}. Then, R is ______.
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 ______.
Let N be the set of all natural numbers and R be a relation on N × N defined by (a, b) R (c, d) `⇔` ad = bc for all (a, b), (c, d) ∈ N × N. Show that R is an equivalence relation on N × N. Also, find the equivalence class of (2, 6), i.e., [(2, 6)].
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 ______.
