Abstract:In the first section of this paper, we prove an analogue of Stone's Theorem for posets satisfying DCC by using semiprime ideals. We also prove the existence of prime ideals in atomic posets in which atoms are dually distributive. Further, it is proved that every maximal non-dense (non-principal) ideal of a 0-distributive poset (meet-semilattice) is prime. The second section focuses on the characterizations of (minimal) prime ideals in pseudocomplemented posets. The third section deals with the generalization o… Show more
“…For the case of 3-ideals, some of the results in this paper are to be found in [31]. The m-ideals always form an ideal completion, the m-ideal completion I m Q .…”
Section: Ideal Completions and Distributive Lawsmentioning
confidence: 97%
“…Notice that in case m > 1, every subset I satisfying the implication B ⊂ m I ⇒ B ⊆ I is automatically a down-set. The following special cases are included in our general definition: the 0-ideals are the down-sets, alias order ideals or semi-ideals [31], the 1-ideals and the 2-ideals are the down-sets containing Q ℓ , the 3-ideals are the ideals in [30][31][32]34] containing Q ℓ , the ω-ideals are the ideals in the sense of Frink [21] (cf. [2,8,17,39]), the ω 1 -ideals (for the least uncountable cardinal ω 1 ) are the σ -ideals [35], the Ω-ideals are the cuts, alias closed ideals [3] or normal ideals [25].…”
Section: Ideal Completions and Distributive Lawsmentioning
confidence: 99%
“…Now, let us consider a few local and global variants of the usual distributive laws in lattices, and their generalizations to posets (see e.g. [8,11,20,30,31,36,50]). Our first definition generalizes the classical notion of distributivity (for elements) in lattices: an element a of a poset Q is called m-distributive if…”
Section: Ideal Completions and Distributive Lawsmentioning
confidence: 99%
“…For posets instead of lattices, the discussion becomes more subtle, because there are various reasonable notions of ideals, of distributivity, of primeness, etc., and the absence of joins or meets may cause serious problems. This area of order theory was investigated in a series of papers by Erné [10][11][12][13][14][15][16][17][18][19][20] and independently by Chajda, Halas, Larmerová, Rachůnek, Niederle [5,6,26,27,29,30,36,39], and later by Joshi, Kharat, Mokbel, Mundlik, Waphare [31,32,34,49,50] and many others.…”
a b s t r a c tThe ''bottom'' of a partially ordered set (poset) Q is the set Q ℓ of its lower bounds (hence, Q ℓ is empty or a singleton). The poset Q is said to be atomic if each element of Q \Q ℓ dominates an atom, that is, a minimal element of Q \Q ℓ . Thus, all finite posets are atomic. We study general closure systems of down-sets (referred to as ideals) in posets. In particular, we investigate so-called m-ideals for arbitrary cardinals m, providing common generalizations of ideals in lattices and of cuts in posets. Various properties of posets and their atoms are described by means of ideals, polars (annihilators) and residuals, defined parallel to ring theory. We deduce diverse characterizations of atomic posets satisfying certain distributive laws, e.g. by the representation of specific ideals as intersections of prime ideals, or by maximality and minimality properties. We investigate non-dense ideals (down-sets having nontrivial polars) and semiprime ideals (down-sets all of whose residuals are ideals). Our results are constructive in that they do not require any set-theoretical choice principles.
“…For the case of 3-ideals, some of the results in this paper are to be found in [31]. The m-ideals always form an ideal completion, the m-ideal completion I m Q .…”
Section: Ideal Completions and Distributive Lawsmentioning
confidence: 97%
“…Notice that in case m > 1, every subset I satisfying the implication B ⊂ m I ⇒ B ⊆ I is automatically a down-set. The following special cases are included in our general definition: the 0-ideals are the down-sets, alias order ideals or semi-ideals [31], the 1-ideals and the 2-ideals are the down-sets containing Q ℓ , the 3-ideals are the ideals in [30][31][32]34] containing Q ℓ , the ω-ideals are the ideals in the sense of Frink [21] (cf. [2,8,17,39]), the ω 1 -ideals (for the least uncountable cardinal ω 1 ) are the σ -ideals [35], the Ω-ideals are the cuts, alias closed ideals [3] or normal ideals [25].…”
Section: Ideal Completions and Distributive Lawsmentioning
confidence: 99%
“…Now, let us consider a few local and global variants of the usual distributive laws in lattices, and their generalizations to posets (see e.g. [8,11,20,30,31,36,50]). Our first definition generalizes the classical notion of distributivity (for elements) in lattices: an element a of a poset Q is called m-distributive if…”
Section: Ideal Completions and Distributive Lawsmentioning
confidence: 99%
“…For posets instead of lattices, the discussion becomes more subtle, because there are various reasonable notions of ideals, of distributivity, of primeness, etc., and the absence of joins or meets may cause serious problems. This area of order theory was investigated in a series of papers by Erné [10][11][12][13][14][15][16][17][18][19][20] and independently by Chajda, Halas, Larmerová, Rachůnek, Niederle [5,6,26,27,29,30,36,39], and later by Joshi, Kharat, Mokbel, Mundlik, Waphare [31,32,34,49,50] and many others.…”
a b s t r a c tThe ''bottom'' of a partially ordered set (poset) Q is the set Q ℓ of its lower bounds (hence, Q ℓ is empty or a singleton). The poset Q is said to be atomic if each element of Q \Q ℓ dominates an atom, that is, a minimal element of Q \Q ℓ . Thus, all finite posets are atomic. We study general closure systems of down-sets (referred to as ideals) in posets. In particular, we investigate so-called m-ideals for arbitrary cardinals m, providing common generalizations of ideals in lattices and of cuts in posets. Various properties of posets and their atoms are described by means of ideals, polars (annihilators) and residuals, defined parallel to ring theory. We deduce diverse characterizations of atomic posets satisfying certain distributive laws, e.g. by the representation of specific ideals as intersections of prime ideals, or by maximality and minimality properties. We investigate non-dense ideals (down-sets having nontrivial polars) and semiprime ideals (down-sets all of whose residuals are ideals). Our results are constructive in that they do not require any set-theoretical choice principles.
“…During last few years, the theory of prime ideals of posets has been developed; see David and Erné (1992), Erné (2006), Erné and Joshi (2015), Halaš et al (2010), Halaš and Rachůnek (1995) and, Joshi and Mundlik (2013). In fact, Venkatanarasimhan (1970) seems to be first who introduced the topology on the set of all prime semi-ideals of a poset and characterized T 1 -spaces.…”
In this paper, we continue our study of prime ideals in posets that was started in Joshi and Mundlik (Cent Eur J Math 11(5):940-955, 2013) and, Erné and Joshi (Discrete Math 338:954-971, 2015). We study the hull-kernel topology on the set of all prime ideals P(Q), minimal prime ideals Min(Q) and maximal ideals Max(Q) of a poset Q. Then topological properties like compactness, connectedness and separation axioms of P(Q) are studied. Further, we focus on the space of minimal prime ideals Min(Q) of a poset Q. Under the additional assumption that every maximal ideal is prime, the collection of all maximal ideals Max(Q) of a poset Q forms a subspace of P(Q). Finally, we prove a characterization of a space of maximal ideals of a poset to be a normal space.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.