, Volume 21, Issue 2, pp 137–153 | Cite as

Intervals in Lattices of κ-Meet-Closed Subsets

  • Marcel Erné


We study abstract properties of intervals in the complete lattice of all κ-meet-closed subsets (κ-subsemilattices) of a κ-(meet-)semilattice S, where κ is an arbitrary cardinal number. Any interval of that kind is an extremally detachable closure system (that is, for each closed set A and each point x outside A, deleting x from the closure of A∪{x} leaves a closed set). Such closure systems have many pleasant geometric and lattice-theoretical properties; for example, they are always weakly atomic, lower locally Boolean and lower semimodular, and each member has a decomposition into completely join-irreducible elements. For intervals of κ-subsemilattices, we describe the covering relation, the coatoms, the ∨-irreducible and the ∨-prime elements in terms of the underlying κ-semilattices. Although such intervals may fail to be lower continuous, they are strongly coatomic if and only if every element has an irredundant (and even a least) join-decomposition. We also characterize those intervals which are Boolean, distributive (equivalently: modular), or semimodular.


(weakly) atomic (strongly) coatomic complete lattice extremally detachable interval irreducible meet-closed prime semilattice 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adaricheva, K. V.: Semidistributive and coalgebraic lattices of subsemilattices, Algebra and Logic 27 (1988), 385–395. CrossRefGoogle Scholar
  2. 2.
    Alexandroff, P.: Diskrete Räume, Mat. Sb. 2 (1937), 501–518. Google Scholar
  3. 3.
    Birkhoff, G.: Lattice Theory, 3rd edn, Amer. Math. Soc. Publ. XX, Providence, RI, 1967. Google Scholar
  4. 4.
    Crawley, P. and Dilworth, R. P.: Algebraic Theory of Lattices, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1973. Google Scholar
  5. 5.
    Diercks, V.: Zerlegungstheorie in vollständigen Verbänden, Diplomarbeit (Thesis), University of Hannover, 1982. Google Scholar
  6. 6.
    Edelman, P. H. and Jamison, R. E.: The theory of convex geometries, Geom. Dedicata 19 (1985), 247–270. CrossRefGoogle Scholar
  7. 7.
    Erné, M.: Ordnungs- und Verbandstheorie, Fernuniversität Hagen, 1985. Google Scholar
  8. 8.
    Erné, M.: Bigeneration in complete lattices and principal separation in ordered sets, Order 8 (1991), 197–221. CrossRefGoogle Scholar
  9. 9.
    Erné, M.: Algebraic ordered sets and their generalizations, In: I. Rosenberg and G. Sabidussi (eds), Algebras and Orders, Proc. Montreal, 1992, Kluwer Acad. Publ., Amsterdam, 1993. Google Scholar
  10. 10.
    Erné, M.: Convex geometries and anti-exchange properties, Preprint, University of Hannover, 2002. Google Scholar
  11. 11.
    Erné, M., Šešelja, B. and Tepavčević, A.: Posets generated by irreducible elements, Order 20 (2003), 79–89. CrossRefGoogle Scholar
  12. 12.
    Gorbunov, V.: Canonical decompositions in complete lattices, Algebra and Logic 17 (1978), 323–332. CrossRefGoogle Scholar
  13. 13.
    Jamison-Waldner, R.: Copoints in antimatroids, In: Proc. 11th SE Conf. Comb., Graph Theory and Comput., Congressus Numerantium 29 (1980), 535–544. Google Scholar
  14. 14.
    Semyonova, V. M.: Lattices with unique irreducible decompositions, Algebra and Logic 39 (2000), 54–60. Google Scholar
  15. 15.
    Semyonova, V. M.: Decompositions in complete lattices, Algebra and Logic 40 (2001), 384–390. CrossRefGoogle Scholar
  16. 16.
    Šešelja, B. and Tepavčević, A.: Collection of finite lattices generated by a poset, Order 17 (2000), 129–139. CrossRefGoogle Scholar

Copyright information

© Springer 2005

Authors and Affiliations

  1. 1.Institute of MathematicsUniversity of HannoverGermany

Personalised recommendations