Let R_{1} and R_{2} be two relations defined | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(D) relation $R$ is transitive if $(a, b) \in R$ and $(b, c) \in R$ implies $(a, c) \in R$.For $R_{1}$: Let $a = 2 + \sqrt{3}$,$b = 2 - \sqrt{3}$,and

Vedclass · Accepted Answer

Neither $R_{1}$ nor $R_{2}$ is transitive

Vedclass · Answer

(D) relation $R$ is transitive if $(a, b) \in R$ and $(b, c) \in R$ implies $(a, c) \in R$.For $R_{1}$: Let $a = 2 + \sqrt{3}$,$b = 2 - \sqrt{3}$,and $c = 1 + 2\sqrt{3}$.Then $a^{2} + b^{2} = (7 + 4\sqrt{3}) + (7 - 4\sqrt{3}) = 14 \in \mathbb{Q}$. So $(a, b) \in R_{1}$.Also $b^{2} + c^{2} = (7 - 4\sqrt{3}) + (13 + 4\sqrt{3}) = 20 \in \mathbb{Q}$. So $(b, c) \in R_{1}$.However,$a^{2} + c^{2} = (7 + 4\sqrt{3}) + (13 + 4\sqrt{3}) = 20 + 8\sqrt{3} 
otin \mathbb{Q}$.Thus,$(a, c) 
otin R_{1}$,so $R_{1}$ is not transitive.For $R_{2}$: Let $a^{2} = 1$,$b^{2} = \sqrt{3}$,and $c^{2} = 2 - \sqrt{3}$.Then $a^{2} + b^{2} = 1 + \sqrt{3} 
otin \mathbb{Q}$. So $(a, b) \in R_{2}$.Also $b^{2} + c^{2} = \sqrt{3} + (2 - \sqrt{3}) = 2 \in \mathbb{Q}$.Wait,for $(b, c) \in R_{2}$,we need $b^{2} + c^{2} 
otin \mathbb{Q}$. Let $b^{2} = \sqrt{3}$ and $c^{2} = 1 + \sqrt{3}$.Then $b^{2} + c^{2} = 1 + 2\sqrt{3} 
otin \mathbb{Q}$. So $(b, c) \in R_{2}$.Now check $a^{2} + c^{2} = 1 + (1 + \sqrt{3}) = 2 + \sqrt{3} 
otin \mathbb{Q}$.However,if we choose $a^{2} = 1$,$b^{2} = \sqrt{3}$,$c^{2} = 2$,then $a^{2} + b^{2} 
otin \mathbb{Q}$ and $b^{2} + c^{2} 
otin \mathbb{Q}$,but $a^{2} + c^{2} = 3 \in \mathbb{Q}$.Thus,$(a, c) 
otin R_{2}$,so $R_{2}$ is not transitive.Therefore,neither $R_{1}$ nor $R_{2}$ is transitive.

Let $R_{1}$ and $R_{2}$ be two relations defined as follows:
$R_{1} = \{(a, b) \in \mathbb{R}^{2} : a^{2} + b^{2} \in \mathbb{Q}\}$ and $R_{2} = \{(a, b) \in \mathbb{R}^{2} : a^{2} + b^{2} \notin \mathbb{Q}\}$
where $\mathbb{Q}$ is the set of all rational numbers. Then:

Similar Questions

Let $R$ be a reflexive relation on a finite set $A$ containing $n$ elements,and let $R$ contain $m$ ordered pairs. Then,

If $n(A) = m$,then the total number of reflexive relations that can be defined on $A$ is-

The relation $R = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)\}$ on set $A = \{1, 2, 3\}$ is

Let $A = \{1, 2, 3, 4\}$ and $R = \{(1, 2), (2, 3), (1, 4)\}$ be a relation on $A$. Let $S$ be the smallest equivalence relation on $A$ such that $R \subset S$. If the number of elements in $S$ is $n$,then the value of $n$ is:

Let $A = \{1, 2, 3, 4\}$ and $R$ be a relation on the set $A \times A$ defined by $R = \{((a, b), (c, d)) : 2a + 3b = 4c + 5d\}$. Then the number of elements in $R$ is:

Vedclass Test Series

Exam Paper Generator

Online Exam Module

Let $R_{1}$ and $R_{2}$ be two relations defined as follows:$R_{1} = \{(a, b) \in \mathbb{R}^{2} : a^{2} + b^{2} \in \mathbb{Q}\}$ and $R_{2} = \{(a, b) \in \mathbb{R}^{2} : a^{2} + b^{2} \notin \mathbb{Q}\}$where $\mathbb{Q}$ is the set of all rational numbers. Then: