The correct option is
D Reflexive and transitive but not symmetric
A relation
R is said to be reflexive if
(a,a)∈R for all
a∈A, that is , every element of
A is related to itself.
Given,
aRb⇔|a−b|≤1, R defined on set of real numbers.
⇒−1≤a−b≤1
In given inequality if a∈ Real Numers then b∈ Real Numers which is satisfying above reflexive relation property i.e. every element satisfying a also satisfies b.
A relation R is said to be symmetric if (a,b)∈R⇒(b,a)∈R, that is aRb⇒bRa for all(a,b)∈R
Given, −1≤a−b≤1
−1+b≤a≤1+bor−1+a≤b≤1+a
From above inequality for one value of a multiple values of b are produced which lies between [−1+a,1+a]
For above inequality to be symmetric all these multiple values of b should map to single a. But, for one value of b multiple values of a are produced which lies between [−1+b,1+b]. That means instead multiple values of b mapping to one element, one element of b mapping to multiple values of a.
Hence above relation is not symmetric.
A relation R is said to be transitive if (a,b)∈Rand(b,c)∈R⇒(a,c)∈R
In the given inequality |a−b|≤1 one value of a given multiple values of b∈R[−1+a,1+a] and all these multiple values of b produce another set of multiple values say c.
But for every (a,b)∈R and (b,c)∈R (a,c)∈R
So, R is transitive.