2. Preliminaries
The definitions and important results from [
3,
16] are collected and given in this section. These concepts will be needed throughout this paper. We use
to represent an ADL with maximal elements.
Definition 1 ([
3]).
An algebra of type (2,2,0) satisfying the following properties is an almost distributive lattice (ADL) with zero:- (1)
;
- (2)
;
- (3)
;
- (4)
;
- (5)
;
- (6)
for any
Let
be a non-empty set. It is possible to structure
as an almost distributive lattice (ADL) by selecting an element
and defining the binary operations ∨ and ∧ on
by
The structure
, where
represents the zero element, is an example of a discrete ADL. For an ADL
, a partial order ≤ can be established on
by defining
for any
if and only if
or, equivalently,
Theorem 1 ([
3]).
For any , we have the following:- (1)
;
- (2)
;
- (3)
;
- (4)
;
- (5)
;
- (6)
;
- (7)
;
- (8)
and ;
- (9)
and ;
- (10)
and ;
- (11)
and ,
- (12)
An ADL
exhibits almost all the characteristics of a distributive lattice, except for the right distributivity of ∨ over
the commutativity of
and the commutativity of
The satisfaction of any one of these properties ensures that the ADL
becomes a distributive lattice [
17].
Theorem 2 ([
3]).
Let be an ADL with zero. For any the following conditions are equivalent:- 1.
is a distributive lattice;
- 2.
;
- 3.
;
- 4.
;
- 5.
The poset is directed above.
As usual, an element is referred to as maximal if it is a maximal element in the partially ordered set In other words, for any , if , then We represent as the collection of all such maximal elements within .
Theorem 3 ([
3]).
Suppose is an ADL and The subsequent statements are equivalent:- 1.
m is maximal with respect to ≤;
- 2.
, for all ;
- 3.
, for all ;
- 4.
is maximal, for all .
In [
3] by Swamy, it is worth noticing that an ADL denoted as
exhibits nearly all features of a distributive lattice, apart from the non-commutativity of ∨ and ∧ and the right distributivity of ∨ over ∧. Either of these properties, if present, would classify
as a distributive lattice.
A non-empty subset
of
is called an ideal (respectively, a filter) of
if
(respectively,
) for all
and all
. A proper ideal (filter)
of
is called a prime ideal (filter) if, for any
or
. A proper ideal (filter)
of
is said to be maximal if it is not properly contained in any proper ideal (filter) of
. It can be observed that every maximal ideal (filter) of
is a prime ideal (filter). The smallest ideal that contains
for each subset
of
is (
] :=
The ideal
is written as
rather than
; this is known as the principal ideal of
. The same way, for each
[
) :=
A filter like
is written as
rather than
; this is known as the principal filter of
. It is easy to see that
and
hold for any
. A sublattice of the distributive lattice
of all ideals of
is thus the set
of all principal ideals of
. Moreover, the bounded distributive lattice
containing all filters for
is defined. In an ADL [
16],
is a prime filter of
if and only if the prime ideal of
is
Given a non-empty subset
in
, the set
is a filter of
Usually, for every
where
For any
, we have
, where
is the principal filter generated by
. An element
of an ADL
is called dual dense element if
and the set
of all dual dense elements in ADL is an ideal if
is non-empty.
Definition 2 ([
10]).
For any subset of an ADL , define . For any , we simply represent by . Clearly, It is also obvious that for all and for all .
Proposition 1 ([
10]).
Let be an ADL. For any , we have the following:- (1)
implies ;
- (2)
;
- (3)
;
- (4)
if and only if .
3. Star Filters of ADLs
This section presents the concept of star filters and derives a characterization theorem for them. It shows that the collection of all star filters constitutes a complete distributive lattice. Moreover, it establishes a set of equivalent conditions that describe when a filter in an ADL becomes star. Additionally, the concept of starlets in an ADL is introduced. Finally, star quasi-complemented ADLs are defined and characterized in terms of starlets.
Now, we begin with the following definition.
Definition 3. For any non-empty subset of an ADL , the set is defined as .
Lemma 1. For any non-void subsets of the following statements hold:
- (1)
;
- (2)
implies ;
- (3)
;
- (4)
Proof. (1) and (2) are clear.
(3) By (1) and (2), it follows that . Let . Then, there is satisfying Since , there exists such that Then, and Therefore, and hence Thus,
(4) Clearly, for any we obtain This implies for all This gives for all Hence, □
For , we just write as where .
Lemma 2. For any elements in with maximal element the following properties hold:
- (1)
;
- (2)
;
- (3)
;
- (4)
implies ;
- (5)
implies ;
- (6)
and ;
- (7)
;
- (8)
if and only if ;
- (9)
implies and for any
Proof. (1) It is clear.
- (2)
Let Then, . Since we obtain that Therefore, Let . Then, there is satisfying Since , we obtain . Hence, . Thus, . Therefore, , which gives that .
- (3)
It is clear.
- (4)
Assume . Then, . This implies .
- (5)
Let . Then, . By (3), we obtain .
- (6)
Since and we obtain (6).
- (7)
For any we have . Let . Then, and . This implies Therefore, and Thus, .
- (8)
Assume . Then, clearly . Conversely, assume that . Since , we obtain . Similarly, we can obtain that . Therefore, .
- (9)
Assume that . Then, Let
Now,
Now,
Therefore,
□
Lemma 3. For each , and contains
Proof. Clearly, we have . Let . Then, there are satisfying and Since we have
Since
we obtain that
Let
Then, there exists an element
such that
Let
Since
we obtain that
. Therefore,
and contains
. □
Lemma 4. For any the following properties hold:
- (1)
;
- (2)
.
Proof. (1) It is obvious that
. Let
. Then, there exist
and
such that
and
This implies
Since
we obtain
. Therefore,
. Hence,
(2) Clearly, and hence . Let . There exists such that Since there are and satisfying that Since , there is such that . Since , there exists such that . Since and , we obtain that and . Then, . Therefore, Since we obtain . Thus, . □
Proposition 2. For any the following conditions are equivalent:
- (1)
;
- (2)
;
- (3)
.
Proof. : Assume
. Then,
Since
we obtain
: Assume . Then, choose . Since , by Proposition 1(4), we obtain . Since there is satisfying Then, and hence . Therefore, . Thus, .
: Assume . Choose . Since we have It gives for all Therefore, for each Hence, . □
The definition of a star filter in an ADL is now presented.
Definition 4. A filter of an ADL is called star if .
Example 1. Let and define on as follows:
is an ADL. Clearly, we have that We have that Then, clearly Consider the filters and Clearly, is a star filter. But is not star, because
Proposition 3. For any with , every maximal filter is a star filter.
Proof. Let with . Suppose is maximal. By Proposition 2, it follows that and . Therefore, and hence . Thus, is a star filter of . □
Let and represent the set of all star filters and all prime star filters in an ADL . Although is not necessarily a sublattice of the distributive lattice , which consists of all filters of , we will demonstrate that forms a distributive lattice.
Theorem 4. For any ADL , forms a distributive lattice.
Proof. For any
, define ∩ and ⊔ on
as in bellow:
Clearly,
in
and
is an upper bound of
. By Lemma 4(2), it gives
. Suppose
such that
and
. Let
. Then, there exist
and
such that
Since
, we obtain
. This leads to
in
. Consequently, it is straightforward to verify that
forms a distributive lattice, where
serves as the greatest element in the lattice
. □
In the following, we characterize the star filter of an ADL element-wise.
Theorem 5. For any the following conditions are equivalent:
- (1)
is star;
- (2)
For any , if and only if ;
- (3)
For any , and imply ;
- (4)
For any , and imply ; .
Proof. : Assume (1). Suppose
Let
. Then,
Since
we obtain that
. Hence,
. The converse is clear.
: Assume (2). Let with and . By our assumption, we obtain Since which gives , . Therefore,
: By Lemma 2, (8) is clear.
: Assume (4). Clearly, we have that for all and hence . Let Then, there is satisfying Then, we obtain . This implies . Since , by condition (4), we obtain . Therefore, Hence, . Thus, .
: Assume (5). It is evident that . Let . Then, there is satisfying This implies Since we conclude that . Therefore, and this shows that is star. □
Proposition 4. Consider is a star filter and a prime filter in , where and If is minimal, it follows that is a star filter.
Proof. Suppose . Then, there exists satisfying and . Consider . Suppose Then, choose an element . Then, and Since there exist and such that . Since it gives Now, This implies Since we obtain that Since , by Lemma 2(9), we obtain . Since and , we obtain . This implies or , which leads to a contradiction. Therefore, . Therefore, a prime filter can be found such that and are disjoint, and is contained within . As , it gives because of . Since , we obtain . This implies and . Therefore, . Since , we have . This leads to the conclusion that is not the minimal prime ideal among those disjoint from and containing , which leads to a contradiction. Hence, is a star filter. □
Corollary 1. If it follows that all minimal prime filters of are star filters.
Proof. Let be a prime filter of that is minimal with respect to inclusion. Suppose there exists such that Since is minimal, there is a non-maximal element such that . This implies , which leads to a contradiction. It can be concluded that . Since , by Proposition 4, is star. □
Proposition 5. The following statements in are equivalent:
- (1)
For , implies ;
- (2)
For , implies ;
- (3)
Each filter that does not intersect with is star;
- (4)
Each prime filter that does not intersect with is star.
Proof. : It is evident by Lemma 2(6).
and are straightforward.
: Assume (4). Let with . According to Lemma 2(8), it follows that . We prove that Suppose . Assuming without loss of generality that Then, . Then, there is a prime filter of satisfying and . Suppose Then, which gives This gives which leads to a contradiction to Therefore, By our assumption, we obtian that is star. Since and we obtain that which is a contradiction to Hence, □
A filter represented as is referred to as a starlet of . Since for any maximal element m, it can be noted that .
Proposition 6. For the following statements in are equivalent:
- (1)
;
- (2)
;
- (3)
.
Lemma 5. For any , the properties listed below are valid:
- (1)
implies ;
- (2)
For any ;
- (3)
.
Proof. (1) Let
with
. Then,
. This implies
.
(2) Let . Suppose . Then, and . This implies . Therefore, , which is a contradiction. Hence, .
(3) This is evident from Lemma 4(2). □
Clearly, every starlet is a star filter. Therefore, for any two starlets
and
their supremum in
can be expressed as
Also, their infimum in
is
.
Theorem 6. For any ADL , is a lattice and sublattice to the distributive lattice of all star filters of . Moreover, has the same greatest element as , while has the smallest element if and only if has an element ω of the form .
Proof. Clearly, is a sublattice to the distributive lattice . Suppose is the smallest element of . Let . Then, . Now, for any , which gives that . Hence, . Therefore, . Conversely, assume that has an element such that . Let . Then, for all . Hence, for all . Thus, for all . Hence, is the smallest element of . □
In any ADL , it is a commonly accepted fact that the quotient ADL , where denotes the congruence class of with respect to , which is a quotient lattice with respect to the operations given by and for all
Proposition 7. Let ϕ be a binary relation defined on with maximal element m byfor all . Then, ϕ is a congruence on , where is the smallest congruence class and is the unit congruence class of . Furthermore, is a star filter of . Proof. According to (9) of Lemma 2, qualifies as a congruence on . It is evident that is the smallest congruence class in . Let . By Proposition 6, we conclude that . Consequently, . This shows that represents a congruence class in . Now, consider and . As is an ideal, it follows that . Since is a congruence class under , we have . Therefore, is the unit congruence class of . It is noted that is a filter of . Let . Then, . Let . Then, . As for any , we obtain , which gives . It can be concluded that . Thus, is a star filter of . □
Definition 5. An ADL with maximal element m can be called star quasi-complemented if, for every , there is a such that and .
From Example 1, it is clearly observed that is star quasi-complemented. The star quasi-complemented ADLs are now characterized using the congruence and starlets.
Theorem 7. In ADL with maximal element m, the conditions given below are equivalent:
- (1)
is star quasi-complemented;
- (2)
is a Boolean algebra;
- (3)
is a Boolean algebra.
Proof. : Assume (1). Let
. Then, there is
satisfying
and
. Hence,
and
. Therefore,
is a Boolean algebra.
: Assume (2). Let . Then, . This implies that there is satisfying and . Hence, and . Thus, and . Therefore, is a Boolean algebra.
: Assume (3). Let . Then, . By (3), there exists such that and . Thus, and . Therefore, is star quasi-complemented. □
Theorem 8. Every ADL is an epimorphic image of the lattice of starlets.
Proof. Define by for each . It is obvious that is well defined. Let . Then, . By Lemma 5(3), we obtain . This implies that is a homomorphism. We easily obtain that is surjective. □
Proposition 8. Every maximal star filter of an ADL is prime.
Proof. Let be a maximal star filter of an ADL . Let be such that and . Then, and . Now,
Suppose . Since is star, we obtain . Hence, , which is a contradiction. Therefore, is prime. □
Theorem 9. Let and with . Then, there is such that and .
Proof. Consider . Clearly, . Clearly, satisfies the hypothesis of Zorn’s Lemma and hence has a maximal element, let it be Suppose such that and . Then, and . By the maximality of , we obtain and . Choose and . Then, Now, Suppose . Since is star, we obtain . Hence, and thus , which is a contradiction. Therefore, is prime. □
Corollary 2. Let be a star filter of an ADL and . Then, there is such that and .
Corollary 3. For any star filter of an ADL , we have Corollary 4. The intersection of all prime star filters is equal to where .
Let and with . Then, is called minimal, belonging to if there is such that . A minimal prime star filter belonging to is simply referred as a minimal prime star.
The following theorem establishes a necessary and sufficient condition for a prime star filter of an ADL to be minimal.
Theorem 10. Let and , with . Then, is minimal, belonging to if and only if to each there is such that .
Proof. Assume that is a minimal prime star filter with . By Proposition 2, we obtain . Then, is a maximal ideal with respect to the condition that . Let . Then, . By the maximality of , we obtain . Choose . This gives for some and . Therefore, , where . Conversely, let us assume that the specified condition is satisfied. If is not a minimal prime star filter associated with , then there is with . Choose an element . According to the assumed condition, there exists an element such that , which is also a subset of . However, since , it follows that must belong to , which is contained within . This leads to a contradiction. Therefore, we conclude that is indeed a minimal prime star filter belonging to . □
By taking where in place of in Theorem 10, we obtain the following.
Corollary 5. A prime star filter of an ADL with maximal element m is minimal if and only if to each there exists such that .
4. Prime Spectrum of Star Filters
In this section, we explore various algebraic properties of prime star filters in an ADL. We provide a set of equivalent conditions under which the space of prime star filters of an ADL becomes a Hausdorff space.
For every , let and for any .
The following result can be verified directly.
Lemma 6. Let be an ADL with maximal element m. For any , the following properties hold:
- (1)
;
- (2)
;
- (3)
;
- (4)
;
- (5)
.
From the above lemma, it can be easily observed that the collection forms a base for a topology on , which is called a hull–kernel topology.
Theorem 11. In any ADL , the following properties hold:
- (1)
For any is compact in ,;
- (2)
Let be a compact open subset of . Then, there exists some such that ;
- (3)
is a -space;
- (4)
The mapping defines a homomorphism from onto the lattice of all compact open subsets of .
Proof. (1) Consider
and
with
. Take
. If
, then by Corollary 2, there is
such that
and
. This implies
. Hence,
for some
, it gives a contradiction to
. Thus,
. This leads to
for some
. Since
and
there exist
and
such that
This implies
This implies
, which is a finite subcover of
. Hence,
is compact in
. Thus, for each
is a compact open subset of
.
(2) Since is open, it gives for some . As is compact, there are such that Thus, for some .
(3) Let with . Assuming without loss of generality that , let us select an element such that belongs to but not to . This implies is not included in , whereas is contained in . Therefore, we can conclude that is a -space.
(4) This can be derived from statements (2) and (3) of Lemma 6. □
Lemma 7. The statements given below hold in :
- (1)
for each ;
- (2)
for each ;
- (3)
for each .
Proof. (1) Let
. Then,
. Since
, we gain
. This gives
. Thus,
. In the same way, the other condition is true.
(2) It is evident that for every . Let . Then, . Choose and . Then, for some . Hence, . If , then . Since , which implies , it gives a contradiction. It can be concluded that . Hence, .
(3) Consider . Then, . Choose such that . This implies . As , we obtain . Hence, . Let . Then, for some . Then, for some . This gives . Therefore, . Hence, . □
Theorem 12. For an ADL is isomorphic to the lattice of open sets in .
Proof. Let the class of all open subsets of the space be denoted by ℑ. It is clear that forms a lattice. Define the map as for every . By Lemma 7(2), each open subset of can be expressed as for some . Therefore, the mapping is surjective. Now, let and assume that . If , then there is some such that . By Corollary 2, there is a prime star filter such that and . Hence, for some . By Lemma 7(3), it follows that . Since , we have . Thus, , implying that , which contradicts the choice of . Hence, we conclude that , and therefore, is injective.
For each
, we have
. Now,
Therefore,
is a homomorphism. Hence,
. □
Given any subset , let . It is evident that . Hence, forms a closed set within . Moreover, any closed set in can be formed as for some subset . Now, we have the following result.
Theorem 13. For , .
Proof. Let , and assume . Since , it follows that . Therefore, the set is a closed set that contains . Now, let be any closed set in . Then, for some . Since , we deduce that for all , meaning . This clearly gives . Therefore, is the smallest closed set that contains , which gives us . □
Theorem 14. The given conditions in below are equivalent for an ADL with maximal element m:
- (1)
Every member of is maximal;
- (2)
Every member of is minimal;
- (3)
is a -space;
- (4)
is a -space;
- (5)
For every , and for some
Proof. : As every maximal star filter is prime, this is clear.
: Assume (2). Let with By (2), we have and are minimal. This implies that and . Now, select and . Hence, and . Thus, is a -space.
: Assume (3). Let . According to Theorem 13, we have . This indicates that is maximal. Since all maximal star filters are prime, we conclude that every prime star filter is minimal. Let with . Select an element such that . Given that is minimal, there exists an element for which . Therefore, we find that , , and . Thus, we conclude that is a -space.
: Assume that is a -space. Consequently, for every , the set is a compact subset of . Thus, is also a clopen subset of . Let such that . Then, the intersection forms a compact subset of the compact space . Since is open in , it follows that is a compact open subset of . Therefore, by Theorem 11(2), there exists an element such that . Thus, we have that . Moreover, . Hence, it follows that .
: Let . We can choose elements and from such that and . By condition (5), there is an element satisfying and the condition that . It follows that . If , then , which contradicts the fact that . Therefore, we can conclude that cannot be in . This means that for every , there exists an element such that . Consequently, we can conclude that is a minimal prime star filter. □
For any ADL , it is evident that , which implies that constitutes a closed set within . The following result establishes a necessary and sufficient condition for the space to be regular.
Theorem 15. In an ADL is a regular space if and only if, for every and , there is a filter in along with an element such that .
Proof. Assuming that is a regular space, let be an element of and consider for some . This implies . Since is regular, there exist two disjoint open sets and in such that and . Thus, we have . Given that is a closed set, we can express it as for some star filter in . Therefore, it follows that . Next, since , we conclude that . The set is also closed, which allows us to write for some star filter in . Since , it follows that , indicating that . We can choose an element such that , which implies . Let . Because , we have . Since , it follows that . Therefore, we conclude that . According to (1), we find that , which leads to the result that . Thus, for any and , we have a filter in and an element such that . Conversely, assume that for every and for any there exist a filter in and an element such that . To demonstrate that the space is regular, let and consider any closed set in such that . This implies that . Therefore, there exists an element such that . Consequently, we have . Since , by our assumption, there exists a filter in and an element such that . Hence, we have , due to for . This leads to the conclusion that . Additionally, we have . Therefore, we can find two disjoint open sets and such that and . Thus, we conclude that is a regular space. □