Advertisements
Advertisements
Question
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.
Advertisements
Solution
We have,
A = {1, 2, 3} and R = {(1, 2), (1, 1), (2, 3)}
To make R a transitive relation on A, (1, 3) must be added to it.
So, the minimum number of ordered pairs that may be added to R to make it a transitive relation is 1.
APPEARS IN
RELATED QUESTIONS
Let A = {1, 2, 3,......, 9} and R be the relation in A × A defined by (a, b) R (c, d) if a + d = b + c for (a, b), (c, d) in A × A. Prove that R is an equivalence relation. Also, obtain the equivalence class [(2, 5)].
Determine whether the following relation is reflexive, symmetric and transitive:
Relation R in the set N of natural numbers defined as R = {(x, y) : y = x + 5 and x < 4}.
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 defined in the set A of all polygons as R = {(P1, P2): P1 and P2 have same number of sides}, is an equivalence relation. What is the set of all elements in A related to the right angle triangle T with sides 3, 4 and 5?
The following relation is defined on the set of real numbers.
aRb if a – b > 0
Find whether relation is reflexive, symmetric or transitive.
Is it true that every relation which is symmetric and transitive is also reflexive? Give reasons.
Give an example of a relation which is reflexive and symmetric but not transitive?
Give an example of a relation which is reflexive and transitive but not symmetric?
Show that the relation R defined by R = {(a, b) : a – b is divisible by 3; a, b ∈ Z} is an equivalence relation.
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) : x2 + y2 ≤ 4; x, y ∈ Z} is a relation on Z, write the domain of R.
If R = {(x, y) : x + 2y = 8} is a relation on N by, then write the range of R.
Let A = {3, 5, 7}, B = {2, 6, 10} and R be a relation from A to B defined by R = {(x, y) : x and y are relatively prime}. Then, write R and R−1.
Define an equivalence relation ?
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 A = {2, 3, 4, 5, ..., 17, 18}. Let '≃' be the equivalence relation on A × A, cartesian product of Awith itself, defined by (a, b) ≃ (c, d) if ad = bc. Then, the number of ordered pairs of the equivalence class of (3, 2) 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 R is the largest equivalence relation on a set A and S is any relation on A, then _____________ .
Mark the correct alternative in the following question:
The maximum number of equivalence relations on the set A = {1, 2, 3} is _______________ .
For the matrix A = `[(2,3),(5,7)]`, find (A + A') and verify that it is a symmetric matrix.
For real numbers x and y, define xRy if and only if x – y + `sqrt(2)` is an irrational number. Then the relation R is ______.
Consider the set A = {1, 2, 3} and R be the smallest equivalence relation on A, then R = ______
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 R reflexive 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:
a mapping from B to A
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.
The following defines a relation on N:
x y is square of an integer x, y ∈ N
Determine which of the above relations are reflexive, symmetric and transitive.
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 us define a relation R in R as aRb if a ≥ b. Then R is ______.
Let A = {1, 2, 3}. Which of the following is not an equivalence relation on A?
Let A = {1, 2, 3}, then the domain of the relation R = {(1, 1), (2, 3), (2, 1)} defined on A is ____________.
The relation R is defined on the set of natural numbers as {(a, b) : a = 2b}. Then, R-1 is given by ____________.
Let the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12}, given by R = {(a, b) : |a – b| is a multiple of 4}. Then [1], the equivalence class containing 1, is:
The relation > (greater than) on the set of real numbers is
A relation in a set 'A' is known as empty relation:-
A relation 'R' in a set 'A' is called a universal relation, if each element of' A' is related to :-
Define the relation R in the set N × N as follows:
For (a, b), (c, d) ∈ N × N, (a, b) R (c, d) if ad = bc. Prove that R is an equivalence relation in N × N.
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 ______.
