Mathematics – Combinatorics
Scientific paper
2011-08-25
Mathematics
Combinatorics
29 pages, 1 figure
Scientific paper
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 in?finite antichain. A crucial part of this proof is a straightforward application of a wonderful Hausdorff? type result due to Abraham, Bonnet, Cummings, Dzamondja and Thompson [2010]. Key words and phrases. posets, lattices, convex sublattice, retracts, fixed point property
Duffus Dwight
Laflamme Claude
Pouzet Maurice
Woodrow Robert
No associations
LandOfFree
Convex Sublattices of a Lattice and a Fixed Point Property does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Convex Sublattices of a Lattice and a Fixed Point Property, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convex Sublattices of a Lattice and a Fixed Point Property will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-501429