The variety generated by equivalence algebras (Q5950757): Difference between revisions

Let \(R\) be a binary relation on a set \(A\). One can define a groupoid \((A,\cdot)\) by the setting \(x\cdot y = x\) if \((x,y) \in R\) and \(x\cdot y =y\) otherwise; \((A,\cdot)\) is said to be generated by \(R\). It was already shown that if \(R\) is a digraph or a tournament then the varieties generated by the related groupoids are not finitely based. The authors investigate the case when \(R\) is an equivalence relation on \(A\) and the groupoid \((A,\cdot)\) generated by \(R\) is called an equivalence algebra. They find a finite base for the variety of equivalence algebras which consists of five identities in four variables and prove that there is no base in three variables only. Subdirectly irreducible algebras of this variety are given.