Congruence-preserving functions on distributive lattices (Q998783)

A finitary function \(f: A^n\to A\) on an algebra \({\mathbf A}\) is called congruence-preserving if, for any congruence \(\theta\) of \({\mathbf A}\), \((a_i,b_i)\in\theta\), \(i= 1,\dots, n\), implies that \((f(a_1,\dots, a_n), f(b_1,\dots, b_n))\in\theta\). The set \(C({\mathbf A})\) of all congruence-preserving functions forms a clone on \(A\) (i.e., a set of finitary functions containing all projections and closed under composition). In the present paper, for any distributive lattice \({\mathbf L}= (L;\vee,\wedge)\), a ``nice'' generating set for the clone \(C({\mathbf L})\) is given. This generating set contains 7 types of functions such that every compatible function on \({\mathbf L}\) is a composition of functions of these types. The technique of the proof consists of three main steps: {\parindent=7,5mm \begin{itemize}\item[(i)] A rather simple generating set (consisting of lattice polynomials and complementations in Boolean intervals) is given in the case where the distributive lattice \({\mathbf L}\) is bounded. \item[(ii)] An extension theorem is proved which provides, for any distributive lattice \({\mathbf L}\), an extension \({\mathbf L}^*\) of \({\mathbf L}\) with the following property: \({\mathbf L}^*\) is a bounded distributive lattice, and every congruence-preserving function on \({\mathbf L}\) can be extended to a congruence-preserving function on \({\mathbf L}^*\). \item[(iii)] Finally, in the third step, the methods of (i) and (ii) are combined (in a rather sophisticated way) in order to yield the desired generating set of \(C({\mathbf L})\). \end{itemize}} The paper is a continuation of the research motivated by G. Grätzer's study of affine completeness for Boolean algebras and distributive lattices from 1962 and 1964, respectively, and by the work of G. Grätzer and E. T. Schmidt on unary isotone congruence-preserving functions of distributive lattices.