R and S are equivalence relations on set A. Prove $R\cap S$ is an equivalence relation on A.

This is a textbook problem, and I'm trying to understand how it can be proved. I feel like I can come up with a counterexample, but assume I must be wrong somewhere in my understanding.

For sake of counterexample, assume A = {1,2}, R={(1,1)}, S={(2,2)}, then R and S are equivalence relations (as they are both reflexive, symmetric and transitive). However, the intersection of R and S is the empty set. Since an equivalence relation cannot be the empty set, then $R\cap S$ is not an equivalence relation.

So... what is my mistake here?

• List the axioms for equivalence relations. Then verify them one by one. – Jacob Wakem Nov 3 '16 at 5:26
• How can I do that when there are no specifics for the set? Also, why is the example I give not an adequate counterexample? (I'm assuming its not) – Alex Butterfield Nov 3 '16 at 7:44
• By logical argument on x (R and S) y implies xRy and xSy implies (some propertry of equivalence relations for R) and (some property of equivalence relations for S) implies (some property of equivalence relations for (R and S) ) . – Jacob Wakem Nov 3 '16 at 16:50

$R$ and $S$ are not equivalence relations. $(2,2)\not\in R$ and $(1,1)\not\in S$.