Retracts of rectangular distributive lattices and some related observations
arXiv:2112.12498
Abstract
By a rectangular distributive lattice we mean the direct product of two non-singleton finite chains. We prove that the retracts (ordered by set inclusion and together with the empty set) of a rectangular distributive lattice form a lattice, which we denote by Ret(). Also, we describe and count the retracts of . Some easy properties of retracts, retractions, and retraction kernels of (mainly distributive) lattices are observed and several examples are presented, including a 12-element modular lattice such that Ret() is not a lattice.
14 pages 4 figures