Question
Question: Let R be a relation on the set of integers given by \(aRb \Leftrightarrow a = {2^k}b\) for some inte...
Let R be a relation on the set of integers given by aRb⇔a=2kb for some integer k. Then R is
A) An equivalence relation
B) Reflexive and transitive but not symmetric
C) Reflexive and transitive but not transitive
D) Symmetric and transitive but not Reflexive
Solution
A relation on set A is called an equivalence relation if it is reflexive, symmetric, and transitive.
Reflexive relation: A binary relation R over a set X is reflexive if it relates every element of X to itself. Formally this may be written ∀x∈X:xRx
Symmetric relation: It is a type of binary relation. A binary relation R over a set X is symmetric if
∀a,b∈X:(aRb⇔bRa)
Transitive relation: A homogeneous relation R on the set X is a transitive relation is, for all a,b,c∈X, if aRb and bRc, then aRc. Or in terms of first-order logic:
∀a,b,c∈X:(aRb∧bRc)⇒aRc
Complete step-by-step solution:
First, let us check for reflexive relations.
Let us assume any integer a.
We have,
⇒a=2ka
Take the value of k is equal to 0.
Therefore,
⇒a=20a
As we know that the value of 20 is 1.
⇒a=a
So, we can say that
⇒(a,a)∈R
Hence R is reflexive on Z.
Now, let us check for symmetric relations.
Let (a,b)∈R
Then, for some integer k
a=2kb
Let us divide both sides by 2k
So,
⇒2ka=2k2kb
That is equal to
b=2−ka
Hence R is symmetric on Z.
Now, let us check for transitive relations.
Let (a,b)∈R and (b,c)∈R.
a=2kb and b=2mc for some integers k and m.
⇒a=2k+mc
⇒(a,c)∈R
Hence R is transitive on Z.
Therefore, R is an equivalence relation on Z.
Option A is the correct answer.
Note: The examples of reflexive relations include:
Is equal to
Is a subset of
Divides
Is greater than or equal to
Is less than or equal to
The examples of symmetric relations include:
Is equal to
Is comparable to
... and ... are odd
The examples of symmetric relations include:
Is a subset of
Divides
implies