Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as
R = {(a, b): b = a + 1} is reflexive, symmetric or transitive.
Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as
R = {(a, b): b = a + 1} is reflexive, symmetric or transitive.
Solution and Explanation
Let A = {1, 2, 3, 4, 5, 6}.
A relation R is defined on set A as:
R = {(a, b): b = a + 1}
∴R = {(1, 2), (2, 3), (3, 4), (4, 5), (5, 6)}
We can find (a, a) ∉ R, where a ∈ A.
For instance,
(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6) ∉ R
∴R is not reflexive.
It can be observed that (1, 2) ∈ R, but (2, 1) ∉ R.
∴R is not symmetric.
Now, (1, 2), (2, 3) ∈ R
But, (1, 3) ∉ R
∴R is not transitive.
Hence, R is neither reflexive, nor symmetric, nor transitive.
Top Questions on Relations and Functions
- The function \( f : \mathbb{R} \to \mathbb{R} \) defined by \( f(x) = e^x + e^{-x} \) is:
- WBJEE - 2024
- Mathematics
- Relations and Functions
- For the real numbers \( x \) and \( y \), we write \( x \, P \, y \) iff \( x - y + \sqrt{2} \) is an irrational number.
Then the relation \( P \) is:- WBJEE - 2024
- Mathematics
- Relations and Functions
- For every real number \(x \neq -1\), let \(f(x) = \frac{x}{x+1}\). Write \(f_1(x) = f(x)\) and for \(n \geq 2\), \(f_n(x) = f(f_{n-1}(x))\). Then \(f_1(-2), f_2(-2), \ldots, f_n(-2)\) must be:
- WBJEE - 2024
- Mathematics
- Relations and Functions
- In \(\mathbb{R}\), a relation \(p\) is defined as follows: For \(a, b \in \mathbb{R}\), \(apb\) holds if \(a^2 - 4ab + 3b^2 = 0\).
Then:- WBJEE - 2024
- Mathematics
- Relations and Functions
- Let \(f : \mathbb{R} \to \mathbb{R}\) be a function defined by \(f(x) = \frac{e^{|x|} - e^{-x}}{e^x + e^{-x}}\), then:
- WBJEE - 2024
- 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.