2021/05/26 by Gábor Czédli, Czédli, Gábor
Computer Science · Decision Sciences · #06C10 #Advanced Algebra and Logic #FOS: Mathematics #Fuzzy and Soft Set Theory #Rings and Algebras (math.RA) #Rough Sets and Fuzzy Logic
paper · pdf · doi:10.48550/arxiv.2105.12868
openalex publication_date 2021/05/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Patch lattices, introduced by G. Czédli and E.T. Schmidt in 2013, are the building stones for slim (and so necessarily finite and planar) semimodular lattices with respect to gluing. Slim semimodular lattices were introduced by G. Grätzer and E. Knapp in 2007, and they have been intensively studied since then. Outside lattice theory, these lattices played the main role in adding a uniqueness part to the classical Jordan--Hölder theorem for groups by G. Czédli and E.T. Schmidt in 2011, and they also led to results in combinatorial geometry. In this paper, we prove that slim patch lattices are exactly the absolute retracts with more than two elements for the category of slim semimodular lattices with length-preserving lattice embeddings as morphisms. Also, slim patch lattices are the same as the maximal objects L in this category such that |L|>2. Furthermore, slim patch lattices are characterized as the algebraically closed lattices L in this category such that |L|>2. Finally, we prove that if we consider \0,1\-preserving lattice homomorphisms rather than length-preserving ones, then the absolute retracts for the class of slim semimodular lattices are the at most 4-element boolean lattices.