Advertisements
Advertisements
Question
Given the relation R = {(1, 2), (2, 3)} on the set A = {1, 2, 3}, add a minimum number of ordered pairs so that the enlarged relation is symmeteric, transitive and reflexive.
Advertisements
Solution
We have,
R = {(1, 2), (2, 3)}
R can be a transitive only when the elements (1, 3) is added
R can be a reflexive only when the elements (1, 1), (2, 2), (3, 3) are added
R can be a symmetric only when the elements (2, 1), (3, 1) and (3, 2) are added
So, the required enlarged relation, R' = {(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3)} = A × A
APPEARS IN
RELATED QUESTIONS
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 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.
Show that the relation R in the set A of points in a plane given by R = {(P, Q) : distance of the point P from the origin is the same as the distance of the point Q from the origin} is an equivalence relation. Further, show that the set of all points related to a point P ≠ (0, 0) is the circle passing through P with the origin as its centre.
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 wife of y}
Show that the relation '≥' on the set R of all real numbers is reflexive and transitive but not symmetric ?
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.
Show that the relation R on the set Z of integers, given by
R = {(a, b) : 2 divides a – b}, is an equivalence relation.
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 and S are symmetric ⇒ R ∩ S and R ∪ S are symmetric ?
Write the domain of the relation R defined on the set Z of integers as follows:-
(a, b) ∈ R ⇔ a2 + b2 = 25
If R = {(x, y) : x + 2y = 8} is a relation on N by, then write the range of R.
Define a transitive relation ?
A = {1, 2, 3, 4, 5, 6, 7, 8} and if R = {(x, y) : y is one half of x; x, y ∈ A} is a relation on A, then write R as a set of ordered pairs.
For the set A = {1, 2, 3}, define a relation R on the set A as follows:
R = {(1, 1), (2, 2), (3, 3), (1, 3)}
Write the ordered pairs to be added to R to make the smallest equivalence relation.
In the set Z of all integers, which of the following relation R is not an equivalence relation ?
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 _______________ .
Mark the correct alternative in the following question:
Let L denote the set of all straight lines in a plane. Let a relation R be defined by lRm if l is perpendicular to m for all l, m ∈ L. Then, R 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 the set Z of all integers, given by R = {(a,b) : 2 divides (a-b)} is an equivalence relation.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find A × (B ∩ C).
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find (A × B) ∪ (A × C).
Consider the set A = {1, 2, 3} and the relation R = {(1, 2), (1, 3)}. R is a transitive relation.
Give an example of a map which is one-one but not onto
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 relation R = {(1, 1), (1, 2), (2, 1)} on A 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 ____________.
If f(x) = `1 - 1/"x", "then f"("f"(1/"x"))` ____________.
Let R be a relation on the set N of natural numbers denoted by nRm ⇔ n is a factor of m (i.e. n | m). 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?
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 ____________.
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 = {(1,1),(1,2), (2,2), (3,3), (4,4), (5,5), (6,6)}, then R is ____________.
A relation 'R' in a set 'A' is called reflexive, if
Which of the following is/are example of symmetric
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 ______
Let A = {1, 2, 3, 4} and let R = {(2, 2), (3, 3), (4, 4), (1, 2)} be a relation on A. Then R is ______.
