You visited us 1 times! Enjoying our articles? Unlock Full Access!

Equivalence Class

The binary re...

Question

The binary relation $S = f (empty set)$ on set $A = {1, 2, 3}$ is

Neither reflexive nor symmetric

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Symmetric and reflexive

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Transitive and reflexive

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Transitive and symmetric

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

Open in App

Solution

The correct option is D Transitive and symmetric
The empty relation on any set is always transitive and symmetric but not reflexive.

Suggest Corrections

Similar questions

R

{1, 2, 3}

R

{1, 2, 3}

S = {(1, 2), (2, 1), (2, 3)}

{1, 2, 3}

A = {1, 2, 3}

R

S

R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}

S = {(1, 1), (2, 2), (3, 3), (1, 3), (3, 1)}

n

Join BYJU'S Learning Program