Congruence lifting of diagrams of finite Boolean semilattices requires large congruence varieties

Abstract

We construct a diagram D, indexed by a finite partially ordered set, of finite Boolean semilattices and (v,0,1)-embeddings, with top semilattice 24, such that for any variety V of algebras, if D has a lifting, with respect to the congruence lattice functor, by algebras and homomorphisms in V, then there exists an algebra U in V such that the congruence lattice of U contains, as a 0,1-sublattice, the five-element modular nondistributive lattice M3. In particular, V has an algebra whose congruence lattice is neither join- nor meet-semidistributive. Using earlier work of K.A. Kearnes and A.Szendrei, we also deduce that V has no nontrivial congruence lattice identity. In particular, there is no functor F from finite Boolean semilattices and (v,0,1)-embeddings to lattices and lattice embeddings such that the composition Con F is equivalent to the identity (where Con denotes the congruence lattice functor), thus solving negatively a problem raised by P. Pudlak in 1985 about the existence of a functorial solution of the Congruence Lattice Problem.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…