Advertisements
Advertisements
Question
Let A = {1, 2, 3}, and let R1 = {(1, 1), (1, 3), (3, 1), (2, 2), (2, 1), (3, 3)}, R2 = {(2, 2), (3, 1), (1, 3)}, R3 = {(1, 3), (3, 3)}. Find whether or not each of the relations R1, R2, R3 on A is (i) reflexive (ii) symmetric (iii) transitive.
Solution
(1) R1
Reflexivity:
Here,
(1, 1), (2, 2), (3, 3) ∈R
So, R1 is reflexive.
Symmetry:
Here,
(2,1) ∈ R1,but (1,2) ∉ R1
So, R1 is not symmetric.
Transitivity :
Here, (2, 1) ∈R1 and (1, 3)∈R1, but (2, 3)∉R1
So, R1 is not transitive.
(2) R2
Reflexivity :
Clearly, (1, 1) and (3, 3)∉R2
So, R2 is not reflexive.
Symmetry:
Here, (1, 3) ∈ R2 and (3, 1) ∈ R2
So, R2 is symmetric.
Transitivity :
Here, (1,3) ∈ R2 and (3,1) ∈ R2
But (3, 3)∉R2
So, R2 is not transitive.
(3) R3
Reflexivity :
Clearly, (1,1) ∉ R3
So, R3 is not reflexive.
Symmetry:
Here, (1, 3) ∈ R3, but (3, 1) ∉ R3
So, R3 is not symmetric.
Transitivity :
Here, (1, 3) ∈ R3 and (3, 3) ∈ R3
Also, (1, 3) ∈ R3
So, R3 is transitive.
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)].
Let N denote the set of all natural numbers and R be the relation on N × N defined by (a, b) R (c, d) if ad (b + c) = bc (a + d). Show that R is an equivalence relation.
Given a non-empty set X, consider P (X), which is the set of all subsets of X. Define the relation R in P(X) as follows:
For subsets A, B in P(X), ARB if and only if A ⊂ B. Is R an equivalence relation on P(X)? Justify your answer.
If A = {1, 2, 3, 4} define relations on A which have properties of being symmetric but neither reflexive nor transitive ?
Let R be a relation defined on the set of natural numbers N as
R = {(x, y) : x, y ∈ N, 2x + y = 41}
Find the domain and range of R. Also, verify whether R is (i) reflexive, (ii) symmetric (iii) transitive.
Show that the relation '≥' on the set R of all real numbers is reflexive and transitive but not symmetric ?
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.
Defines a relation on N :
xy is square of an integer, x, y ∈ N
Determine the above relation is reflexive, symmetric and transitive.
If R and S are transitive relations on a set A, then prove that R ∪ S may not be a transitive relation on A.
If A = {2, 3, 4}, B = {1, 3, 7} and R = {(x, y) : x ∈ A, y ∈ B and x < y} is a relation from A to B, then write R−1.
Define a symmetric relation ?
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.
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 the relation R be defined on N by aRb iff 2a + 3b = 30. Then write R as a set of ordered pairs
Let R = {(a, a), (b, b), (c, c), (a, b)} be a relation on set A = a, b, c. Then, R is _______________ .
Let A = {1, 2, 3}. Then, the number of equivalence relations containing (1, 2) 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 ______________ .
Mark the correct alternative in the following question:
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 for all a, b T. Then, R 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 ___________ .
If A = {a, b, c}, B = (x , y} find B × A.
If A = {a, b, c}, B = (x , y} find B × B.
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).
Let A = {0, 1, 2, 3} and define a relation R on A as follows: R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}. Is R reflexive? symmetric? transitive?
Let Z be the set of integers and R be the relation defined in Z such that aRb if a – b is divisible by 3. Then R partitions the set Z into ______ pairwise disjoint subsets
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 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 relation R = {(1, 1), (1, 2), (2, 1)} on A is ____________.
Let `"f"("x") = ("x" - 1)/("x" + 1),` then f(f(x)) is ____________.
Given triangles with sides T1: 3, 4, 5; T2: 5, 12, 13; T3: 6, 8, 10; T4: 4, 7, 9 and a relation R inset of triangles defined as R = `{(Delta_1, Delta_2) : Delta_1 "is similar to" Delta_2}`. Which triangles belong to the same equivalence class?
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}
- Raji wants to know the number of relations possible from A to B. How many numbers of relations are possible?
If A is a finite set consisting of n elements, then the number of reflexive relations on A is
In a group of 52 persons, 16 drink tea but not coffee, while 33 drink tea. How many persons drink coffee but not tea?
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 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 ______.
If a relation R on the set {a, b, c} defined by R = {(b, b)}, then classify the relation.