Arguesian lattices which are not type-1 (Q2276988): Difference between revisions

If a lattice is representable by pairwise commuting equivalence relations on some set (i.e. of type-1), then it satisfies the Arguesian identity [cf. \textit{B. Jónsson}, Proc. 19th Nordic Congr. Math., Reykjavik, Iceland 1984, 78-108 (1985; Zbl 0576.06009)]. As announced in Bull. Am. Math. Soc., New Ser. 16, 121-123 (1987; Zbl 0616.06006), the author disproves the converse statement, thus answering a question posed by Jónsson in 1953. More generally, he proves that no finite set of identities or even universal Horn sentences can characterize type-1 lattices. His counterexamples also serve to show that even if the skeleton is assumed to be distributive neither the Arguesian identity nor any other finite set of identities implies type-1. This settles a conjecture of \textit{J. B. Nation} and \textit{D. Pickering} [Algebra Univers. 24, 91-100 (1987; Zbl 0633.06003)] in the negative.