Weakly diagonal algebras and definable principal congruences (Q861595)

An algebra is called minimal if it has no proper subalgebras. An algebra \(A\) is named weakly diagonal if every non-empty subuniverse of \(A\times A\) contains the graph of some automorphism of \(A\). The authors state that finite weakly diagonal algebras are precisely the largest minimal algebras of the varieties they generate. Then it is shown how this fact simplifies the study of varieties generated by a finite minimal algebra. Applications to the theory of affine complete varieties: (i) affine complete varieties of finite type have definable principal congruences (DPC); (ii) arithmetical affine complete varieties of finite type have equationally definable principal congruences (EDPC).