Published by:
CGP EDU Academic Team
Published on: August 13, 2026
Let R 1 be a relation defined by R 1 = {(a, b)| a ≥ b ; a, b ∈ R} . Then R 1 is
Text Solution
Verified by ExpertsThe correct answer is:
B
For any a ∈ R, we have a ≥ a, Therefore the relation R 1 is reflexive but it is not symmetric as (2, 1) ∈ R 1 but (1, 2) ∉ R 1 . The relation R 1 is transitive also, because (a, b) ∈ R 1 , (b, c) ∈ R 1 imply that a ≥ b and b ≥ c which is turn imply that a ≥ c ⇒ (a, c) ∈ R 1
──────────────────────────────────────────────────────────────────────────────────────────
Prepare Smarter with CGP Edu
Get practice questions, solutions, and test series in one place.
Write a Review
Share your experience with this question and solution.
Commentary
Send your comment, doubt, correction, or feedback to admin.
Similar Questions
Explore conceptually related problems
Identify the type of relation among reflexive, symmetric and transitive.
(i) R = {(1, 1), (2, 2), (…
Prove that the relation ''less than'' in the set of natural number is transitive but not reflexive …
Let A = {p, q , r}. Which of the following is an equivalence relation on A ?
(i) R = {(p, q), (q, r…
Let R be a relation on the set N be defined by {(x, y)| x, y ∈ N, 2x + y = 41}. Then prove that R i…
Let n be a fixed positive integer. Define a relation R on the set of integers Z, aRb ⇔ n|(a – b). T…
Let S be a set of all square matrices of order 2. If a relation R defined on set S such that AR B …