Abstract
We call a latticeL strictly locally order-affine complete if, given a finite subsemilatticeS ofL n, every functionf: S →L which preserves congruences and order, is a polynomial function. The main results are the following: (1) all relatively complemented lattices are strictly locally order-affine complete; (2) a finite modular lattice is strictly locally order-affine complete if and only if it is relatively complemented. These results extend and generalize the earlier results of D. Dorninger [2] and R. Wille [9, 10].
Similar content being viewed by others
References
K. Baker and A. Pixley (1975) Polynomial interpolation and the Chinese remainder theorem for algebraic systems,Math. Z. 143, 165–174.
D. Dorninger (1980) A note on local polynomial functions over lattices,Algebra Universalis 11, 135–138.
D. Dorninger and D. Eigenthaler (1982) On compatible and order preserving functions on lattices,Banach Center Publ. 9, Semester 1978, Universal Algebra and Applications, pp. 97–104.
D Dorninger and W. Nöbauer (1979) Local polynomial functions on lattices and universal algebras,Colloq. Math. 42, 83–93.
G. Grätzer (1964) Boolean functions on distributive lattices,Acta Math. Acad. Sci. Hung. 15, 195–201.
G. Grätzer (1978)General Lattice Theory, Birkhäuser Verlag, Basel and Stuttgart.
C. Herrmann (1973)S-verklebte Summen von Verbänden,Math. Z. 130, 255–274.
E. T. Schmidt (1987) On locally order-polynomially complete lattices,Acta Math. Hung. 49, 481–486.
R. Wille (1977) Ein Charakterisierung endlichen ordnungpolynomvollständiger Verbände,Archiv der Math. 28, 449–560.
R. Wille (1977) Über endliche, ordnungsaffinvollständige Verbände,Math. Z. 155, 103–107.
Author information
Authors and Affiliations
Additional information
Communicated by G. Grätzer
Rights and permissions
About this article
Cite this article
Kaarli, K., Täht, K. Strictly locally order affine complete lattices. Order 10, 261–270 (1993). https://doi.org/10.1007/BF01110547
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01110547