Show that the relation R in R defined as R = {(a, b): a ≤ b}, is reflexive and transitive
but not symmetric.
Show that the relation R in R defined as R = {(a, b): a ≤ b}, is reflexive and transitive
but not symmetric.
Solution and Explanation
R = {(a, b); a ≤ b}
Clearly (a, a) ∈ R as a = a.
∴R is reflexive.
Now,
(2, 4) ∈ R (as 2 < 4)
But, (4, 2) ∉ R as 4 is greater than 2.
∴ R is not symmetric.
Now, let (a, b), (b, c) ∈ R.
Then,
a ≤ b and b ≤ c
⇒ a ≤ c
⇒ (a, c) ∈ R
∴R is transitive.
Hence, R is reflexive and transitive but not symmetric.
Top Questions on Relations and Functions
- Let \( f : \mathbb{R} \to \mathbb{R} \) be defined as \( f(x) = 10 - x^2 \), then:
- CUET (UG) - 2024
- Mathematics
- Relations and Functions
- Relation \( R \) on the set \( A = \{1, 2, 3, \ldots, 13, 14\} \) defined as \( R = \{(x, y) : 3x - y = 0\} \) is:
- CUET (UG) - 2024
- Mathematics
- Relations and Functions
- Match List I with List II
LIST I LIST II A. Range of y=cosec-1x I. R-(-1, 1) B. Domain of sec-1x II. (0, π) C. Domain of sin-1x III. [-1, 1] D. Range of y=cot-1x IV. \([\frac{-π}{2},\frac{π}{2}]\)-{0} Choose the correct answer from the options given below:- CUET (UG) - 2023
- Mathematics
- Relations and Functions
- If f(x) - 27x3 and g(x) = \((x)^{\frac{1}{3}}\), then gof(x) is :
- CUET (UG) - 2023
- Mathematics
- Relations and Functions
- The relation R in the set A = {1, 2, 3, 4} is given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)} is :
- CUET (UG) - 2023
- Mathematics
- Relations and Functions
Questions Asked in CBSE CLASS XII exam
- Find the inverse of each of the matrices, if it exists. \(\begin{bmatrix} 1 & 3\\ 2 & 7\end{bmatrix}\)
- For what values of x,\(\begin{bmatrix} 1 & 2 & 1 \end{bmatrix}\)\(\begin{bmatrix} 1 & 2 & 0\\ 2 & 0 & 1 \\1&0&2 \end{bmatrix}\)\(\begin{bmatrix} 0 \\2\\x\end{bmatrix}\)=O?
- Find the inverse of each of the matrices,if it exists \(\begin{bmatrix} 2 & 1 \\ 7 & 4 \end{bmatrix}\)
What is the Planning Process?
- CBSE CLASS XII - 2023
- Planning process steps
- Find the inverse of each of the matrices,if it exists. \(\begin{bmatrix} 2 & 3\\ 5 & 7 \end{bmatrix}\)
Concepts Used:
Types of Relation
TYPES OF RELATION
Empty Relation
Relation is said to be empty relation if no element of set X is related or mapped to any element of X i.e, R = Φ.
Universal Relation
A relation R in a set, say A is a universal relation if each element of A is related to every element of A.
R = A × A.
Identity Relation
Every element of set A is related to itself only then the relation is identity relation.
Inverse Relation
Let R be a relation from set A to set B i.e., R ∈ A × B. The relation R-1 is said to be an Inverse relation if R-1 from set B to A is denoted by R-1
Reflexive Relation
If every element of set A maps to itself, the relation is Reflexive Relation. For every a ∈ A, (a, a) ∈ R.
Symmetric Relation
A relation R is said to be symmetric if (a, b) ∈ R then (b, a) ∈ R, for all a & b ∈ A.
Transitive Relation
A relation is said to be transitive if, (a, b) ∈ R, (b, c) ∈ R, then (a, c) ∈ R, for all a, b, c ∈ A
Equivalence Relation
A relation is said to be equivalence if and only if it is Reflexive, Symmetric, and Transitive.