Self-commuting lattice polynomial functions on chains (Q543287): Difference between revisions

The article deals with polynomial functions on a lattice \((L;\wedge,\vee)\). A clone of polynomial functions on \(L\) is a set of operations on \(L\) that contains all constants, all projections on \(L\), and is closed under the operations \(\wedge\), \(\vee\) and composition; these polynomial functions are represented in the disjunctive or conjunctive normal forms. A polynomial function \(f:\;L^n \to L\) is self-commuting if \[ \begin{multlined} f(f(a_{11},a_{12},\dots,a_{1n}),f(a_{21},a_{22},\dots,a_{2n}),\dots,f(a_{n1},a_{n2},\dots,a_{nn}) = \\ f(f(a_{11},a_{21},\dots,a_{n1}),f(a_{12},a_{22},\dots,a_{n2}),\dots,f(a_{1n},a_{2n},\dots,a_{nn})\end{multlined} \] for arbitrary \(a_{jk}\), \(j,k = 1,\dots,n\). A polynomial function \(f:\;L^n \to L\) has chain form if \[ f((x_1,\dots,x_n)) = a_\emptyset \vee \bigvee_{i=1,\dots,n} a_ix_i \vee \bigvee_{1 \leq l \leq r} \bigg(a_{S_l} \bigwedge_{S_l} x_i\bigg), \] for some subsets \(S_1,\dots,S_r \subseteq \{1,\dots,n\}\) with at least two elements such that for \(1 \leq l \leq r\), the \(S_l\) is essential, and the following conditions are satisfied: (1) \(S_1 \subseteq S_2 \subseteq \dots \subseteq S_r\), (2) if \(r \geq 1\), then for all \(i \in \{1,\dots,n\}\), there exists a \(j \in S_1\) such that \(a_i \leq a_j\), and (3) \(a_I \leq a_j\) whenever \(I \subseteq J\) and \[ I,J \in \{\emptyset\} \cup \{\{i\}:\;i \in \{1,\dots,n\}\} \cup \{S_l:\;1 \leq l \leq r\}. \] The main result: if \(L\) is a bounded chain, then a polynomial function is self-commuting if and only if it has chain form.