General Interpolation by Polynomial Functions of Distributive Lattices

Abstract

AbstractFor a distributive lattice L, we consider the problem of interpolating functions f : D → L defined on a finite set D ⊆ L n, by means of lattice polynomial functions of L. Two instances of this problem have already been solved.In the case when L is a distributive lattice with least and greatest elements 0 and 1, Goodstein proved that a function f : {0,1}n → L can be interpolated by a lattice polynomial function p : L n → L if and only if f is monotone; in this case, the interpolating polynomial p was shown to be unique.The interpolation problem was also considered in the more general setting where L is a distributive lattice, not necessarily bounded, and where D ⊆ L n is allowed to range over cuboids \(D=\left\{ a_{1},b_{1}\right\} \times\cdots\times\left\{ a_{n},b_{n}\right\} \) with a i ,b i ∈ L and a i < b i . In this case, the class of such partial functions that can be interpolated by lattice polynomial functions was completely described.In this paper, we extend these results by completely characterizing the class of lattice functions that can be interpolated by polynomial functions on arbitrary finite subsets D ⊆ L n. As in the latter setting, interpolating polynomials are not necessarily unique. We provide explicit descriptions of all possible lattice polynomial functions that interpolate these lattice functions, when such an interpolation is available.KeywordsPolynomial FunctionBoolean AlgebraDistributive LatticeLattice FunctionAggregation FunctionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.