# Why isn't reflexivity redundant in the definition of equivalence relation?

An equivalence relation is defined by three properties: reflexivity, symmetry and transitivity.

Doesn't symmetry and transitivity implies reflexivity? Consider the following argument.

For any $a$ and $b$, $a R b$ implies $b R a$ by symmetry. Using transitivity, we have $a R a$.

Source: Exercise 8.46, P195 of Mathematical Proofs, 2nd (not 3rd) ed. by Chartrand et al

-
This is a good problem to pose in an introductory Discrete Math/Logic course. –  Srivatsan Jul 31 '11 at 16:23
@LePressentiment Why would you add a random source to a three and half year old question?? This is a standard exercise that you can find in many many books. –  mrf Feb 7 '14 at 7:10
How do you know that $aRb$? maybe there is no such $b$. –  LeeNeverGup Feb 7 '14 at 7:20

Actually, without the reflexivity condition, the empty relation would count as an equivalence relation, which is non-ideal.

Your argument used the hypothesis that for each $a$, there exists $b$ such that $aRb$ holds. If this is true, then symmetry and transitivity imply reflexivity, but this is not true in general.

-

No.

The missing condition is sometimes called 'seriality' -- for any x there must be a y such that x R y.

If you add seriality to the symmetry and transitivity you get a reflexive relation again.

-
I googled seriality, not much came up. You sure it's spelled right? –  Chao Xu Jul 22 '10 at 10:40
Perhaps I made up the noun form. If you google 'serial binary relation' it will come up. Although if you google 'seriality of binary relations' it will come up there too. –  bryn Jul 22 '10 at 10:42
@ChaoXu ProofWiki uses the name serial relation. –  Martin Sleziak Jul 10 '12 at 12:37