Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-25T08:56:54.287Z Has data issue: false hasContentIssue false

Compact generation in partially ordered sets

Published online by Cambridge University Press:  09 April 2009

Marcel Erné
Affiliation:
Institut für Mathematik, Universität Hannover, D-3000 Hannover 1, Federal Republic of Germany
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Several “classical” results on algebraic complete lattices extend to algebraic posets and, more generally, to so called compactly generated posets; but, of course, there may arise difficulties in the absence of certain joins or meets. For example, the property of weak atomicity turns out to be valid in all Dedekind complete compactly generated posets, but not in arbitrary algebraic posets. The compactly generated posets are, up to isomorphism, the inductive centralized systems, where a system of sets is called centralized if it contains all point closures. A similar representation theorem holds for algebraic posets; it is known that every algebraic poset is isomorphic to the system i(Q) of all directed lower sets in some poset Q; we show that only those posets P which satisfy the ascending chain condition are isomorphic to their own “up-completion” i(P). We also touch upon a few structural aspects such as the formation of direct sums, products and substructures. The note concludes with several applications of a generalized version of the Birkhoff Frink decomposition theorem for algebraic lattices.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1987

References

[1]Alexandroff, P. S., ‘Diskrete Räume’, Mat. Sb. (N.S.) 2 (1937), 501518.Google Scholar
[2]Banaschewski, B., ‘Hüllensysteme und Erweiterung von Quasi-Ordnungen’, Z. Math. Logik Grundlagen Math. 2 (1956), 369377.Google Scholar
[3]Birkhoff, G. and Frink, O., ‘Representation of lattices by sets’, Trans. Amer. Math. Soc. 64 (1948), 299316.Google Scholar
[4]Cohn, P. M., Universal algebra (Harper and Row, New York, 1965).Google Scholar
[5]Crawley, P. and Dilworth, R. P., Algebraic theory of lattices (Prentice Hall, Inc., Englewood Cliffs, N. J., 1973).Google Scholar
[6]Diener, K.-H., ‘Über zwei Birkhoff-Frinksche Struktursätze der allgemeinen Algebra’, Arch. Math. 7 (1956), 339346.Google Scholar
[7]Erné, M., ‘Scott convergence and Scott topology in partially ordered sets II’, (in Continuous lattices, Lecture Notes in Math. 871, Springer, Berlin, Heidelberg, New York, 1981).Google Scholar
[8]Erné, M., ‘On the existence of decompositions in lattices’, Algebra Universalis, to appear.Google Scholar
[9]Erné, M., ‘Adjunctions and standard constructions for partially ordered sets’ (Contributions to general algebra II, Proc. Klagenfurt Conference 1982, to appear).Google Scholar
[10]Gierz, G., Hofmann, K. H., Keimel, K., Lawson, J. D., Mislove, M. and Scott, D. S., A compendium of continuous lattices (Springer, Berlin, Heidelberg New York, 1980).CrossRefGoogle Scholar
[11]Higgs, D., ‘Lattices isomorphic to their ideal lattices’, Algebra Universalis 1 (1971), 7172.CrossRefGoogle Scholar
[12]Hoffmann, R.-E., ‘Sobrification of partially ordered sets’, Semigroup Forum 17 (1979), 123138.Google Scholar
[13]Hoffmann, R.-E., ‘Continuous posets and adjoint sequencesSemigroup Forum 18 (1979), 173188.CrossRefGoogle Scholar
[14]Hoffmann, R.-E., ‘Continuous posets, prime spectra of completely distributive complete lattices, and Hausdorff compactifications’ (in Continuous lattices, Lecture Notes in Math. 871, Springer, Berlin, Heidelberg, New York, 1981).Google Scholar
[15]Lawson, J. D., ‘The duality of continuous posetsHouston J. Math. 5 (1979), 357386.Google Scholar
[16]Mayer-Kalkschmidt, J. and Steiner, E., ‘Some theorems in set theory and applications in the ideal theory of partially ordered sets’, Duke Math. J. 31 (1964), 287390.CrossRefGoogle Scholar
[17]Wolk, E. S., ‘Dedekind completeness and a fixed point theorem’, Canad. J. Math. 9 (1957), 400405.CrossRefGoogle Scholar
[18]Wright, J. B., Wagner, E. G. and Thatcher, J. W., ‘A uniform approach to inductive posets and inductive closure’, Theoret. Comput. Sci. 7 (1978), 5777.Google Scholar