Advertisements
Advertisements
Question
Check whether the relation R in R defined by R = {(a, b) : a ≤ b3} is reflexive, symmetric or transitive.
Advertisements
Solution
(i) Reflexive:
Let a ∈ R, a ≤ a3, which is false.
∴ (a, a) ∉ R
Thus, R is not reflexive.
(ii) Symmetric:
Let a, b ∈ R, and (a, b) ∈ R
⇒ a ≤ b3
Does not imply b ≤ a3
∴ (b, a) ∉ R
Thus, R is not symmetric.
(iii) Transitive:
Let a, b, c ∈ R, consider (a, b) ∈ R and (b, c) ∈ R
⇒ a ≤ b3 and b ≤ c3
⇒ a ≤ c3 is false.
⇒ (a, c) ∉ R
∴ R is not transitive.
Hence, R is neither reflexive, nor symmetric, nor transitive.
RELATED QUESTIONS
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 in the set A = {1, 2, 3, 4, 5} given by R = {(a, b) : |a − b| is even}, is an equivalence relation. Show that all the elements of {1, 3, 5} are related to each other and all the elements of {2, 4} are related to each other. But no element of {1, 3, 5} is related to any element of {2, 4}.
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.
The following relation is defined on the set of real numbers. aRb if |a| ≤ b
Find whether relation is reflexive, symmetric or transitive.
Show that the relation '≥' on the set R of all real numbers is reflexive and transitive but not symmetric ?
Defines a relation on N:
x + 4y = 10, x, y ∈ N
Determine the above relation is reflexive, symmetric and transitive.
Prove that the relation R on Z defined by
(a, b) ∈ R ⇔ a − b is divisible by 5
is an equivalence relation on Z.
m is said to be related to n if m and n are integers and m − n is divisible by 13. Does this define an equivalence relation?
Let R be the relation defined on the set A = {1, 2, 3, 4, 5, 6, 7} by R = {(a, b) : both a and b are either odd or even}. Show that R is an equivalence relation. Further, show that all the elements of the subset {1, 3, 5, 7} are related to each other and all the elements of the subset {2, 4, 6} are related to each other, but no element of the subset {1, 3, 5, 7} is related to any element of the subset {2, 4, 6}.
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 ?
Define a reflexive relation ?
Define a transitive relation ?
Write the smallest equivalence relation on the set A = {1, 2, 3} ?
Let R be a relation on the set N given by
R = {(a, b) : a = b − 2, b > 6}. Then,
The relation 'R' in N × N such that
(a, b) R (c, d) ⇔ a + d = b + c is ______________ .
If R is a relation on the set A = {1, 2, 3, 4, 5, 6, 7, 8, 9} given by x R y ⇔ y = 3 x, then R = _____________ .
S is a relation over the set R of all real numbers and it is given by (a, b) ∈ S ⇔ ab ≥ 0. Then, S is _______________ .
Show that the relation R defined by (a, b)R(c,d) ⇒ a + d = b + c on the A x A , where A = {1, 2,3,...,10} is an equivalence relation. Hence write the equivalence class [(3, 4)]; a, b, c,d ∈ A.
If A = {a, b, c}, B = (x , y} find A × B.
R = {(a, b) / b = a + 1, a ∈ Z, 0 < a < 5}. Find the Range of R.
Consider the set A = {1, 2, 3} and the relation R = {(1, 2), (1, 3)}. R is a transitive relation.
Let n be a fixed positive integer. Define a relation R in Z as follows: ∀ a, b ∈ Z, aRb if and only if a – b is divisible by n. Show that R is an equivalance relation
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
The following defines a relation on N:
x + y = 10, x, y ∈ N
Determine which of the above relations are reflexive, symmetric and transitive.
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 and also obtain the equivalent class [(2, 5)]
Let R = {(3, 1), (1, 3), (3, 3)} be a relation defined on the set A = {1, 2, 3}. Then R is symmetric, transitive but not reflexive.
Let R be the relation on N defined as by x + 2 y = 8 The domain of R is ____________.
Let A = {1, 2, 3} and R = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ____________.
Given set A = {a, b, c}. An identity relation in set A 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 = {(x, y): y is divisible by x} 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.
- Let R: B → B be defined by R = {(x, y): x and y are students of same sex}, Then this relation R is ____________.
Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the saplings along the line y = x − 4. Let L be the set of all lines which are parallel on the ground and R be a relation on L.
Answer the following using the above information.
- Let R = `{ ("L"_1, "L"_2) ∶ "L"_1 bot "L"_2 "where" "L"_1, "L"_2 in "L" }` which of the following is true?
If A is a finite set consisting of n elements, then the number of reflexive relations on A is
On the set N of all natural numbers, define the relation R by a R b, if GCD of a and b is 2. Then, R is
Let R = {(a, b): a = a2} for all, a, b ∈ N, then R salifies.
Statement 1: The intersection of two equivalence relations is always an equivalence relation.
Statement 2: The Union of two equivalence relations is always an equivalence relation.
Which one of the following is correct?
