Interpolation of monotone functions in lattices (Q1363441): Difference between revisions

A lattice \(L\) is called order polynomially complete if every monotone function on \(L\) is a polynomial on \(L\). All finite order polynomially complete lattices were classified. It is a long-standing problem whether there exist infinite order polynomially complete lattices. The author presents a local solution of this problem. Main Theorem: Let \(\lambda\) and \(\kappa\) be infinite cardinals, and let \(L_0\) be a lattice of size \(\leq \lambda^{\kappa}\). Then there is a lattice \(L\) of size \(\lambda ^{\kappa }, \;L_0\subseteq L\), such that for every \(n\), for every partial monotone function \(f: L^n\rightarrow L\) with domain of size \(\leq \kappa\), there is a polynomial function \(f'\) on \(L\) which extends \(f\), i.e., \(L\) is ``\(\kappa\)-locally order polynomially complete''.