Hierarchy Sets in Almost Distributive Lattices and Their Structural Properties
DOI:
https://doi.org/10.29020/nybg.ejpam.v18i4.6686Keywords:
Almost distributive lattices, Ideals, Filters, Hierarchy sets, Prime hierarchy sets, Maximal hierarchy sets, Inverted-hierarchy setsAbstract
This paper studies hierarchy sets in almost distributive lattices, focusing on two key types: prime and maximal hierarchy sets. We show that every maximal hierarchy set is prime, but not vice versa, and use Zorn’s Lemma to prove the existence of prime hierarchy sets extending a given one. We also introduce inverted-hierarchy sets, defined via join operations, and analyze their relation to filters. The results provide structural insights and extend ideal and filter theory within almost distributive lattices.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 G. Chinnayya, S. Ramesh, G. Jogarao, Ravikumar Bandaru, Aiyared Iampan
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.