Correspondences of the semigroup of endomorphisms of an equivalence relation. (Q2353729): Difference between revisions

Let \(X\) be an arbitrary nonempty set. A transformation \(\varphi\) of \(X\) is called an endomorphism of a relation \(\rho\subseteq X\times X\) if \((x,y)\in\rho\) implies \((\varphi(x),\varphi (y))\in\rho\) for every \(x,y\in X\). An ordered pair \((\varphi,\psi)\) of transformations of \(X\) is called an endotopism of \(\rho\) if \((x,y)\in\rho\) implies \((\varphi(x),\psi(y))\in\rho\) for every \(x,y\in X\). This endotopism is called strong if \((\varphi(x),\psi(y))\in\rho\) implies \((x,y)\in\rho\) for every \(x,y\in X\). If \(\varphi\) and \(\psi\) both are permutations of \(X\) the strong endotopism \((\varphi,\psi)\) of \(\rho\) is called an autotopism of \(\rho\). The aim of the paper ``is to describe faithful representations of the semigroup of all endotopisms, of the monoid of all strong endotopisms, and of the group of all autotopisms of an equivalence relation''. For example, it is proved that the endotopism semigroup of an equivalence relation \(\varepsilon\) is isomorphic to a subdirect product of wreath products of the symmetric semigroup of \(X/\varepsilon\) with a small category \(K\) which is defined.