Register

Relations

593 views

1 Answer

Best answer
5 5 votes

Prove it by contradiction.

let consider that if relation $R$ is symmetric and transitive then it must be reflexive. 

Now consider $R$ as an empty relation. Now Empty relation is symmetric and transitive but not reflexive. Read here. 

Hence our assumption is wrong. 

Hence A relation which is symmetric and transitive, need not be reflexive. 

• selected by
Voting & Accepting an answer helps improve the community
← Previous · Multiversion Timesta...Next → · set theory
← Previous in category · probabilityNext in category → · Made easy Test Serie...
Position:
Show:

Related questions

0 0 votes
0 0 answers
179
179 views
Sahil_Lather asked Aug 26, 2025
179 views
Relations Posets question based on isomorphism of posets
0 0 votes
0 0 answers
791
791 views
Sahil_Lather asked Jan 27, 2023
791 views
Testbook Relations in discrete maths
Which of the following statement is not true?1If a relation on a set A is symmetric and transitive then R is reflexive.2If a relation R on a set A is irreflexive and tran...
2 2 votes
4 4 answers
736
736 views
GO Classes asked Jul 1, 2025
736 views
GO Classes DPP | Discrete mathematics | Relations | JEE MAINS
Let $R=\{(1,2),(2,3),(3,3)\}$ be a relation defined on the set $\{1,2,3,4\}$. Then the minimum number of elements, needed to be added in $R$ so that R becomes an equivale...
2 2 votes
4 4 answers
479
479 views
GO Classes asked Jul 1, 2025
479 views
GO Classes DPP | Discrete mathematics | Relations | JEE MAINS
The relation $R=\{(x, y): x, y \in \mathbb{Z}$ and $x+y$ is even $\}$ is:reflexive and transitive but not symmetric reflexive and symmetric but not transitive an equivale...