A characterization of well-founced algebraic lattices
DOI:
https://doi.org/10.11575/cdm.v13i1.62549Abstract
We characterize well-founded algebraic lattices by means of forbidden subsemilattices of the join-semilattice made of their compact elements. More specifically, we show that an algebraic lattice L is well-founded if and only if K(L), the join semi-lattice of compact elements of L, is well founded and contains neither [\omega]^\omega, nor \underscore(\Omega)(\omega*) as a join semilattice. As an immediate corollary, we get that an algebraic modular lattice L is well-founded if and only if K(L) is well founded and contains no infinite independent set. If K(L) is a join-subsemilattice of I_{<\omega}(Q), the set of finitely generated initial segments of a well founded poset Q, then L is well-founded if and only if K(L) is well-quasi-ordered.References
2. I. Chakir, Chanes d'ideaux et dimension algebrique des treillis distributifs, Ph.D. thesis, Universite Claude-Bernard(Lyon1), 1992.
3. I. Chakir, The length of chains in modular lattices, Order 24 (2007), 227-247.
4. I. Chakir, Chains conditions in algebraic lattices, Ph.D. thesis, University Mohamed V, Faculty of Sciences, Rabat, May 2009, arXiv:1609.07167.
5. I. Chakir and M. Pouzet, The length of chains in distributive lattices, Abstracts of papers presented to the A.M.S. 92, 502-503, T-06-118.
6. I. Chakir and M. Pouzet, Infinite independent sets in distributive lattices, Algebra Universalis 53 (2005), no. 2, 211-225.
7. D. H. J. de Jongh and R. Parikh., Well-partial orderings and hierarchies, Indag. Math. (Proc) 80 (1977), no. 3, 195-207.
8. P. Erdos and A. Tarski, On families of mutually exclusive sets, Annals of Math. 44 (1943), 315-329.
9. R. Fraisse, Theory of Relations, North-Holland Publishing Co., Amsterdam, 2000.
10. F. Galvin, E. C. Milner, and M. Pouzet, Cardinal representations for closures and preclosures, Trans. Amer. Math. Soc. 328 (1991), 667-693.
11. G. Gratzer, General Lattice Theory, Birkhauser, Basel, 1998.
12. G. Higman, Ordering by divisibility in abstract algebras, Proc. London. Math. Soc. 2 (1952), no. 3, 326-336.
13. K. H. Hofmann, M. Mislove, and A. R. Stralka, The Pontryagin duality of compact 0-dimensional semilattices and its applications, Lecture Note in Mathematics, vol. 396, Springer-Verlag., 1974.
14. J. D. Lawson, M. Mislove, and H. A. Priestley, Infinite antichains in semilattices, Order 2 (1985), 275-290.
15. J. D. Lawson, M. Mislove, and H. A. Priestley, Ordered sets with no infinite antichains, Discrete Math. 63 (1987), 225-230.
16. J. D. Lawson, M. Mislove, and H. A. Priestley, Infinite antichains and duality theories, Houston Journal of Mathematics 14 (1988), no. 3, 423-441.
17. E. C. Milner and M. Pouzet, Combinatorics, Paul Erdos is Eighty, Report, 1993, pp. 277-299.
18. M. Mislove, When are order scattered and topologically scattered the same?, Annals of Discrete Math. 23 (1984), 61-80.
19. M. Pouzet and M. Sobrani, Ordinal invariants of an age, Tech. report, Universite Claude-Bernard (Lyon 1), August 2002.
20. M. Pouzet and N. Zaguia, Ordered sets with no chains of ideals of a given type, Order 1 (1984), 159-172.
21. F. P. Ramsey, On a problem of formal logic, Proc. London Math. Soc. 30 (1930), 264-286.
22. S. Shelah, Independence of strong partition relation for small cardinals, and the free subset problem, The Journal of Symbolic Logic 45 (1980), 505-509.
23. M. Sobrani, Sur les ages de relations et quelques aspects homologiques des constructions D+M, Ph.D. thesis, Universite S. M. Ben Abdallah-Fez, Fez, Morocco, 2002.
Downloads
Published
Issue
Section
License
This copyright statement was adapted from the statement for the University of Calgary Repository and from the statement for the Electronic Journal of Combinatorics (with permission).
The copyright policy for Contributions to Discrete Mathematics (CDM) is changed for all articles appearing in issues of the journal starting from Volume 15 Number 3.
Author(s) retain copyright over submissions published starting from Volume 15 number 3. When the author(s) indicate approval of the finalized version of the article provided by the technical editors of the journal and indicate approval, they grant to Contributions to Discrete Mathematics (CDM) a world-wide, irrevocable, royalty free, non-exclusive license as described below:
The author(s) grant to CDM the right to reproduce, translate (as defined below), and/or distribute the material, including the abstract, in print and electronic format, including but not limited to audio or video.
The author(s) agree that the journal may translate, without changing the content the material, to any medium or format for the purposes of preservation.
The author(s) also agree that the journal may keep more than one copy of the article for the purposes of security, back-up, and preservation.
In granting the journal this license the author(s) warrant that the work is their original work and that they have the right to grant the rights contained in this license.
The authors represent that the work does not, to the best of their knowledge, infringe upon anyone’s copyright.
If the work contains material for which the author(s) do not hold copyright, the author(s) represent that the unrestricted permission of the copyright holder(s) to grant CDM the rights required by this license has been obtained, and that such third-party owned material is clearly identified and acknowledged within the text or content of the work.
The author(s) agree to ensure, to the extent reasonably possible, that further publication of the Work, with the same or substantially the same content, will acknowledge prior publication in CDM.
The journal highly recommends that the work be published with a Creative Commons license. Unless otherwise arranged at the time the finalized version is approved and the licence granted with CDM, the work will appear with the CC-BY-ND logo. Here is the site to get more detail, and an excerpt from the site about the CC-BY-ND. https://creativecommons.org/licenses/
Attribution-NoDerivs
CC BY-ND
This license lets others reuse the work for any purpose, including commercially; however, it cannot be shared with others in adapted form, and credit must be provided to you.