Skip to main content
Log in

Posets Generated by Irreducible Elements

  • Published:
Order Aims and scope Submit manuscript

Abstract

Let J be a fixed partially ordered set (poset). Among all posets in which J is join-dense and consists of all completely join-irreducible elements, there is an up to isomorphism unique greatest one, the Alexandroff completion L. Moreover, the class of all such posets has a canonical set of representatives, C 0 L, consisting of those sets between J and L which intersect each of the intervals I j =[j ,j ] (jJ), where j and j denote the greatest element of L less than, respectively, not greater than j. The complete lattices in C 0 L form a closure system C L, consisting of all Dedekind–MacNeille completions of posets in C 0 L. We describe explicitly those L for which C 0 L, respectively, C L is a (complete atomic) Boolean lattice, and similarly, those for which C L is distributive (or modular). Analogous results are obtained for C κ L, the closure system of all posets in C 0 L that are closed under meets of less than κ elements (where κ is any cardinal number).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Birkhoff, G.: Lattice Theory, 3rd edn, Amer. Math. Soc., Providence, RI, 1967.

    Google Scholar 

  2. Crawley, P. and Dilworth, R. P.: Algebraic Theory of Lattices, Prentice-Hall, Englewood Cliffs, NJ, 1973.

    Google Scholar 

  3. Deiters, K. and Erné, M.: Negations and contrapositions of complete lattices, Discrete Math. 181 (1998), 91–111.

    Google Scholar 

  4. Erné, M.: Adjunctions and standard constructions for partially ordered sets, In: G. Eigenthaler et al. (eds), Contributions to General Algebra 2, Proc. Klagenfurt, 1982, Hölder-Pichler-Tempsky, Vienna, 1983, pp. 77–106.

    Google Scholar 

  5. Erné, M.: Ordnungs-und Verbandstheorie, Fernuniversität Hagen, 1985.

  6. Erné, M.: Compact generation in partially ordered sets, J. Austral. Math. Soc. (A) 42 (1987), 69–83.

    Google Scholar 

  7. Erné, M.: Bigeneration in complete lattices and principal separation in ordered sets, Order 8 (1991), 197–221.

    Google Scholar 

  8. Erné, M.: Intervals in lattices of κ-meet-closed subsets, Preprint, University of Hannover, 2002.

  9. Erné, M.: Algebraic ordered sets and their generalizations, In: I. Rosenberg and G. Sabidussi (eds), Algebras and Orders, Kluwer Acad. Publ., Dordrecht, 1993.

    Google Scholar 

  10. Fleischer, I.: Even every join-extension solves a universal problem, J. Austral. Math. Soc. (A) 21 (1976), 220–223.

    Google Scholar 

  11. Šešelja, B. and Tepavčević, A.: On the collection of lattices determined by the same poset of meet-irreducibles, Novi Sad J. Math. 26 (1996), 11–19.

    Google Scholar 

  12. Šešelja, B. and Tepavčević, A.: On generation of finite posets by meet-irreducibles, Discrete Math. 186 (1998), 269–275.

    Google Scholar 

  13. Šešelja, B. and Tepavčević, A.: Collection of finite lattices generated by a poset, Order 17 (2000), 129–139.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Erné, M., Šešelja, B. & Tepavčević, A. Posets Generated by Irreducible Elements. Order 20, 79–89 (2003). https://doi.org/10.1023/A:1024438130716

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024438130716

Navigation