GATE CSE 1996 | Question: 2.2

Question

Let $R$ be a non-empty relation on a collection of sets defined by $_{A}R_ B$ if and only if $A \cap B = \phi$. Then, (pick the true statement)

• A. $A$ is reflexive and transitive

• B. $R$ is symmetric and not transitive

• C. $R$ is an equivalence relation

• D. $R$ is not reflexive and not symmetric

Comments

beautiful question!

---

A∩B = B∩A = ∅, hence symmetric

---

 ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎ ‎

---

Detailed Video Solution: https://www.youtube.com/watch?v=vSJee6IieP8&t=1486s

Since $R$ is a non-empty relation on "a collection of sets", So, $R$ is definitely Symmetric. BUT $R$ may or may not be reflexive, transitive & it will depend on the base set. 

NOTE that, $R$ may Or may not be reflexive, transitive, equivalence relation. 

For example, if we define $R$ on the set $\{ \phi \}$ then $R$ is reflexive, symmetric & equivalence relation. 

For example, if we define $R$ on the set $\{ \{ a\}, \{ b \} \}$ then $R$ is symmetric & Not transitive, Not reflexive. 

For example, if we define $R$ on the set $\{ \{a \}, \{a,b \} \}$ then $R$ is Not reflexive, But $R$ is transitive.

Detailed Video Solution: https://www.youtube.com/watch?v=vSJee6IieP8&t=1486s  

---

sir but how is {{a},{a,b}} even a relation in tthis case?

---

That's not the relation that's the base set which is given to be the collection of sets that's { {a}, {a,b} } in some case just to prove the above given relation can be transitive as well but not always as it depends upon the base set, the only thing we can definitely say is that the relation is symmetric whatever the base set is taken.

Answer 1

Let $A = \{1,2,3\}$ and $B = \{4,5\}$  and $C = \{1,6,7\}$

now $A\cap B = \emptyset$ and $B\cap C= \emptyset$ but $A\cap C\neq \emptyset$, so $R$ is not transitive.

$A\cap A = A$, so $R$ is not reflexive.

$A\cap B = B\cap A$, so $R$ is symmetric

So, $A$ is false as $R$ is not reflexive or transitive

$B$ is true.

$C$ is false because $R$ is not transitive or reflexive

$D$ is false because $R$ is symmetric

Comments

First, understand the relation. It is given that relation is defined on sets and two sets are only related when their intersection is the empty set.

So let's take an example. A={1,2,3} B={4,5} C={1,6,7}

here A and B are related as  A⋂B = phi

B and C are also related as B⋂C = phi

but A and C are not related as you can see their intersection is not empty

Hence the relation is not transitive.

---

Actually what is the relation here ??

---

A counterexample for proving $R$ is not transitive is choosing 3 sets $ A,B,C$ such that

$A \cap B = \phi  $ and  $B \cap C = \phi  $ but  $A \cap C \not = \phi  $

Answer 2

​​​​​​

Short trick

Empty set always symmetric relation

The correct option is B R is symmetric and not transitive
(i) Reflexive
A∩A=A≠ϕ
So; (A, A) doesn't belongs to relation R,
∴ Relation R is not reflexive.

(ii) Symmetric
If A∩B=ϕ then B∩A=ϕ is also true.
∴ Relation R is not Symmetric relation.

(iii) Transitive
If A∩B=ϕ and B∩C=ϕ, it need be true that A∩C=ϕ
For example:
A={1,2}, B={3,4}, C={1,5,6}
A∩B=ϕ and B∩C=ϕ but
A∩C={1}≠ϕ
∴ Relation R is not transitive relation.

Comments

Here R is Symmetric relation.

Answer 3

Answer: A

Let A = {1,2} and B = {3,4}.

Then R = {(1,3),(1,4),(2,3),(2,4)} which is not reflexive and not symmetric.

Comments

There is (1,3) but not (3,1) and there is (1,5) but not (5,1) and likewise for all elements.Therefore it is not symmetric.

---

This question is based on relation on sets and not on elements of a set. So, here if A(intersection)B is null then B(intersection)A is also null and hence symmetric.

---

A ∩ B = ⏀ , B ∩ A = ⏀ , symmetry holds on aRb when we consider it as empty relation.

but for non-empty relation, I think bRa is also required to have symmetry property.

Answer 4

Option B: $R$ is symmetric and not transitive

---

Note here, it’s written that the relation is on collection of sets, i.e. the relation is between sets not between elements of sets. So, (A,B) will be part of R iff A∩B = ∅.

So it cant be reflexive since A∩A != ∅

But it can be symmetric since A∩B = B∩A = ∅ (here A and B are disjoint sets, A={1,2} and B={3,4}

Also, its not sure that it will always be transitive, for eg. A={1,2}, B={3,4} and C={2,5}, here A∩B = ∅, B∩C = ∅ but A∩C != ∅

which makes R, symmetric but not reflexive or transitive.

Answer 5

http://math.stackexchange.com/questions/690482/is-the-relation-r-emptyset-is-it-reflexive-symmetric-and-transitive-why

no option is correct

Comments

• Empty set always symmetric relation

https://www.google.com/url?sa=t&source=web&rct=j&url=https://math.stackexchange.com/questions/1081333/prove-that-the-empty-relation-is-transitive-symmetric-but-not-reflexive&ved=2ahUKEwjC-sunmLbgAhXL6Y8KHQGkCI4QFjABegQICxAF&usg=AOvVaw0pry_ewvXRyfvwqisyqpNZ

https://proofwiki.org/wiki/Null_Relation_is_Antireflexive,_Symmetric_and_Transitive