Equivalence relation

A relation that is reflexive, symmetric, and transitive.
Equivalence relation

An equivalence relation on a XX is a  X×X\sim\ \subseteq X\times X such that for all x,y,zXx,y,z\in X:

  • (Reflexive) xxx\sim x.
  • (Symmetric) If xyx\sim y, then yxy\sim x.
  • (Transitive) If xyx\sim y and yzy\sim z, then xzx\sim z.

Equivalence relations formalize “sameness up to a criterion.” They XX into , and many constructions in mathematics are quotients by equivalence relations.

Examples:

  • On Z\mathbb{Z}, define aba\sim b iff ab(modn)a\equiv b\pmod n for a fixed nNn\in\mathbb{N}; this is an equivalence relation.
  • Equality on any set XX, defined by xyx\sim y iff x=yx=y, is an equivalence relation.
  • On R\mathbb{R}, define xyx\sim y iff xyQx-y\in\mathbb{Q}; this is an equivalence relation whose classes are cosets x+Qx+\mathbb{Q}.