Cevian operations on distributive lattices

From MaRDI portal
Publication:2332142




Abstract: We construct a completely normal bounded distributive lattice D in which for every pair (a, b) of elements, the set {x in D | a le b lor x} has a countable coinitial subset, such that D does not carry any binary operation - satisfying the identities x le y lor(x-y),(x-y)land(y-x) = 0, and x-z le (x-y)lor(y-z). In particular, D is not a homomorphic image of the lattice of all finitely generated convex {ell}-subgroups of any (not necessarily Abelian) {ell}-group. It has aleph2elements.ThissolvesnegativelyafewproblemsstatedbyIberkleid,Mart'inez,andMcGovernin2011andrecentlybytheauthor.Thisworkalsoservesaspreparationforaforthcomingpaperinwhichweprovethatforanyinfinitecardinallambda,theclassofStonedualsofspectraofallAbelianellgroupswithorderunitisnotclosedunderLinftylambda$-elementary equivalence.









This page was built for publication: Cevian operations on distributive lattices

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