Order polynomially complete lattices must be large

DOI10.1007/S000120050075MaRDI QIDQ1966144zbMATH OpenOpenAlexFDO

Authors S. Shelah, Martin Goldstern

Publication date 27 February 2000

Published in Algebra Universalis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9707203

zbMATH Keywords

inaccessible cardinal order polynomially complete lattice

Mathematics Subject Classification ID

Large cardinals (03E55) Lattices (06B99)

Abstract: If L is an order polynomially complete lattice, (that is: every monotone function from L^n to L is induced by a lattice-theoretic polynomial) then the cardinality of L is a strongly inaccessible cardinal. In particular, the existence of such lattices is not provable in ZFC, nor from ZFC+GCH. Although the problem originates in algebra, the proof is purely set-theoretical. The main tools are partition and canonisation theorems. It is still open if the existence of infinite o.p.c. lattices can be refuted in ZFC.

Review text

A lattice \(L\) is order polynomially complete if every monotone function on \(L\) is a polynomial function. The question whether there exists an infinite order polynomially complete lattice has been treated by H. Kaiser and N. Sauer. Recently M. Haviar and M. Ploščica showed that such a lattice would have to be at least of size \(k_{\omega }\), where \(k_0 = \aleph _0\), \(k_{n+1} = 2^{k_n}\) and \(k_{\omega } = \sup \{k_n; n\in \omega \}\). The authors show here that the size of a lattice in question (if one exists at all) must be a strongly inaccessible cardinal.

Recommendations

Cited in

(4)

This page was built for publication: Order polynomially complete lattices must be large

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1966144)