A relation on \(A\) is a subset of \(A\times A\). Each ordered pair records a link from its first entry to its second.
Reflexivity requires every self-pair. Symmetry requires a reverse for every pair. Transitivity requires \((a,c)\) whenever \((a,b)\) and \((b,c)\) belong to the relation.
A relation satisfying all three properties is an equivalence relation. Its classes partition the set. Every member of one class is related to every other member.