\((1+1+2)\)-generated equivalence lattices (Q1965251)

For a set \(A\) let \(\text{Equ}(A)\) be the complete lattice of all equivalences of \(A\). A subset \(Q\) of \(\text{Equ}(A)\) is said to generate \(\text{Equ}(A)\) if no proper complete sublattice of \(\text{Equ}(A)\) includes \(Q\). The main result of the paper is the following theorem: Suppose that \(|A|\geqq 7\) and that there is no inaccessible cardinal \(m\) with \(m\leqq |A|\). Then \(\text{Equ}(A)\) can be generated by a set \(\{ \alpha,\beta,\gamma,\delta\}\subseteq \text{Equ}(A)\) such that \((\alpha, \beta,\gamma)\) and \(\{ \delta,\beta,\gamma\}\) are antichains, \(\delta <\alpha\) and \(\alpha\) does not cover \(\delta\). Thus, \(\text{Equ}(A)\) is generated by a set of the type \(1+1+2\). Earlier, \textit{H. Striez} [Stud. Sci. Math. Hung. 12, 1-17 (1977; Zbl 0487.06003)] and \textit{L. Zádori} [Universal algebra, Colloq., Szeged/Hung. 1983, Colloq. Math. Soc. János Bolyai 43, 573-586 (1986; Zbl 0634.06004)] proved that if \(A\) is finite and \(|A|\geqq 7\), then \(\text{Equ}(A)\) can be generated by a subset of order type \(1+1+2\).