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 ∨] (j∈J), 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).
Similar content being viewed by others
References
Birkhoff, G.: Lattice Theory, 3rd edn, Amer. Math. Soc., Providence, RI, 1967.
Crawley, P. and Dilworth, R. P.: Algebraic Theory of Lattices, Prentice-Hall, Englewood Cliffs, NJ, 1973.
Deiters, K. and Erné, M.: Negations and contrapositions of complete lattices, Discrete Math. 181 (1998), 91–111.
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.
Erné, M.: Ordnungs-und Verbandstheorie, Fernuniversität Hagen, 1985.
Erné, M.: Compact generation in partially ordered sets, J. Austral. Math. Soc. (A) 42 (1987), 69–83.
Erné, M.: Bigeneration in complete lattices and principal separation in ordered sets, Order 8 (1991), 197–221.
Erné, M.: Intervals in lattices of κ-meet-closed subsets, Preprint, University of Hannover, 2002.
Erné, M.: Algebraic ordered sets and their generalizations, In: I. Rosenberg and G. Sabidussi (eds), Algebras and Orders, Kluwer Acad. Publ., Dordrecht, 1993.
Fleischer, I.: Even every join-extension solves a universal problem, J. Austral. Math. Soc. (A) 21 (1976), 220–223.
Š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.
Šešelja, B. and Tepavčević, A.: On generation of finite posets by meet-irreducibles, Discrete Math. 186 (1998), 269–275.
Šešelja, B. and Tepavčević, A.: Collection of finite lattices generated by a poset, Order 17 (2000), 129–139.
Author information
Authors and Affiliations
Rights 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
Issue Date:
DOI: https://doi.org/10.1023/A:1024438130716