90 research outputs found
Convex sublattices of a lattice and a fixed point property
The collection CL(T) of nonempty convex sublattices of a lattice T ordered by bi-domination is a lattice. We say that T has the fixed point property for convex sublattices (CLFPP for short) if every order preserving map f from T to CL(T) has a fixed point, that is x > f(x) for some x > T. We examine which lattices may have CLFPP. We introduce the selection property for convex sublattices (CLSP); we observe that a complete lattice with CLSP must have CLFPP, and that this property implies that CL(T) is complete. We show that for a lattice T, the fact that CL(T) is complete is equivalent to the fact that T is complete and the lattice of all subsets of a countable set, ordered by containment, is not order embeddable into T. We show that for the lattice T = I(P) of initial segments of a poset P, the implications above are equivalences and that these properties are equivalent to the fact that P has no infinite antichain. A crucial part of this proof is a straightforward application of a wonderful Hausdor type result due to Abraham, Bonnet, Cummings, Dzamondja and Thompson [2010]
Sublattices of lattices of order-convex sets, I. The main representation theorem
For a partially ordered set P, we denote by Co(P) the lattice of order-convex
subsets of P. We find three new lattice identities, (S), (U), and (B), such
that the following result holds. Theorem. Let L be a lattice. Then L embeds
into some lattice of the form Co(P) iff L satisfies (S), (U), and (B).
Furthermore, if L has an embedding into some Co(P), then it has such an
embedding that preserves the existing bounds. If L is finite, then one can take
P finite, of cardinality at most , where n is the number of
join-irreducible elements of L. On the other hand, the partially ordered set P
can be chosen in such a way that there are no infinite bounded chains in P and
the undirected graph of the predecessor relation of P is a tree
On scattered convex geometries
A convex geometry is a closure space satisfying the anti-exchange axiom. For
several types of algebraic convex geometries we describe when the collection of
closed sets is order scattered, in terms of obstructions to the semilattice of
compact elements. In particular, a semilattice , that does not
appear among minimal obstructions to order-scattered algebraic modular
lattices, plays a prominent role in convex geometries case. The connection to
topological scatteredness is established in convex geometries of relatively
convex sets.Comment: 25 pages, 1 figure, submitte
- …