1. Introduction
For the first time, Aslam et al. in [
1] discussed the concept of annihilators for a subset in
-algebras, and after that many researchers generalized it in different research articles (see [
2,
3,
4,
5]). Except these, the notion related to annihilator in
-algebras is investigated in the papers [
6,
7,
8]. In [
4], Bordbar et al. introduced the notion of the relative annihilator in a lower
-semilattice for a subset with respect to another subset as a logical extension of annihilator, and they obtained some properties related to this notion. They provide the conditions that the relative annihilator of an ideal with respect to an ideal needs to be ideal, and discussed conditions for the relative annihilator ideal to be an implicative (resp., positive implicative, commutative) ideal. Moreover, in some articles, different properties of ideals in logical algebras and ordered algebraic structures were concerned (see [
9,
10,
11,
12,
13,
14,
15,
16,
17,
18]). In order to investigate these kinds of properties for an arbitrary ideal in
-algebra, we need to know about the decomposition of an ideal. With this motivation, this article is the first try, as far as we know, to decompose an ideal in a
-algebra.
In this paper, we prove that the relative annihilator of a subset with respect to a prime ideal is also a prime ideal. Given the minimal prime decomposition of an ideal A, we provide a condition for any prime ideal to be one of minimal prime factors of A by using the relative annihilator. We consider homomorphic image and preimage of the minimal prime decomposition of an ideal. Using a semi-prime closure operation “”, we show that, if an ideal A is -closed, then every minimal prime factor of A is also -closed.
3. Primeness of Relative Annihilators
In this section, we use the notations
X as a lower
-semilattice,
as the g.l.b.(greatest lower bound) of
and
for any two arbitrary subsets
of
X, unless otherwise.
In a case that, , then we use instead of .
Definition 4 ([
4])
. Let A and B be two arbitrary subsets of X. A set is defined as follows:and it is called the relative annihilator of B with respect to A. Remark 2. If , then is denoted by . Similarly, we use instead of , when .
The next two Lemmas are from [
4].
Lemma 4. For any ideal A and a nonempty subset B of X, the following implicationis satisfied. Lemma 5. Let B be an arbitrary nonempty subset of X in which the following statement is valid for all Consider the relative annihilator . If A is an ideal of X, then the the relative annihilator is an ideal of X. Theorem 1. Let B be an arbitrary subset of X such that the condition (6) is satisfied for B. If A is a prime ideal of X, then the relative annihilator of B with respect to A is X itself or a prime ideal of X. Proof. Suppose that
. Then
is a proper ideal of
X by Lemma 5. Now, let
and
for elements
. Then,
and
for some
. Thus,
Since
A is a prime ideal of
X, it follows from Definition 3 and Lemma 4 that
. Therefore,
is a prime ideal of
X. □
Corollary 1. Suppose that X is a commutative -algebra. If A is a prime ideal of X and B is a nonempty subset of X, then the relative annihilator of B with respect to A is X itself or a prime ideal of X.
Lemma 6 ([
21])
. If A and B are ideals of X, then the relative annihilator of B with respect to A is an ideal of X. Theorem 2. If A is a prime ideal and B is an ideal of X, then the relative annihilator of B with respect to A is X itself or a prime ideal of X.
Proof. Suppose that . By using Lemma 6, is a proper ideal of X. The primeness of can be proved by a similar way as in the proof of Theorem 1. □
By changing the role of A and B in Theorem 2, the may not be a prime ideal of X. The following example shows that it is not true in general case.
Example 1. Let with the following Cayley table.∗ | 0 | 1 | 2 | 3 | 4 |
0 | 0 | 0 | 0 | 0 | 0 |
1 | 1 | 0 | 0 | 1 | 1 |
2 | 2 | 2 | 0 | 2 | 2 |
3 | 3 | 3 | 3 | 0 | 3 |
4 | 4 | 4 | 4 | 4 | 0 |
Then, by routine calculation, X is a lower -semilattice. Consider ideals and of X. It is easy to show that B is a prime ideal. Then,and it is not a prime ideal of X because but and . For any ideal
I of
X and any
, we know that
Lemma 7. For any ideal P of X and any , the following statements are satisfied: Proof. Let
. Then, for arbitrary element
,
. Hence,
. Therefore, (
8) is valid. Let
and
P be a prime ideal of
X. Obviously,
. If
, then
and so
. Consequently,
. □
Theorem 3. Let and be ideals of X. For any prime ideal P of X, the following assertions are equivalent:
- (i)
or .
- (ii)
.
- (iii)
.
Proof. The implications (i) ⇒ (ii) ⇒ (iii) are clear.
(iii) ⇒ (i) Suppose and . Then, there exist and such that . Since P is a prime ideal, we have . This is a contradiction, and so or . □
By using induction on n, the following theorem can be considered as an extension of Theorem 3.
Theorem 4. Let be ideals of X. For a prime ideal P of X, the following assertions are equivalent:
- (i)
for some .
- (ii)
.
- (iii)
.
Theorem 5. Let and be ideals of X. For any prime ideal P of X, if , then or .
Proof. It is straightforward by Theorem 3. □
Inductively, the following theorem can be proved as an extension of Theorem 5.
Theorem 6. Let be ideals of X. For a prime ideal P of X, if , then for some .
Definition 5. Letting A be an ideal of a lower -semilattice X, we say that A has a minimal prime decomposition if there exist prime ideals of X such that
- (1)
,
- (2)
.
The class is called a minimal prime decomposition of A, and each is called a minimal prime factor of A.
Lemma 8 ([
22])
. Let A, B, and C be non-empty subsets of X. Then, we have Given the minimal prime decomposition of an ideal A, we provide a condition for any prime ideal to be one of minimal prime factors of A by using the relative annihilator.
Theorem 7. Let A be an ideal of X and be a minimal prime decomposition of A. For a prime ideal P of X, the following statements are equivalent:
- (i)
or .
- (ii)
There exists such that .
Proof. (i) ⇒ (ii). Since
is a minimal prime decomposition of
A, there exist
and
. If
, then Lemmas 7 and 8 imply that
Similarly, if
, then
.
Conversely, suppose that, for an element
, we have
. Then, we have
If
, then
, and if
, then
by Lemma 7. Similarly,
or
. Thus,
is one of
,
,
and
X. We know that
since
P is proper. If
, then
or
by Theorem 5. □
Using an inductive method, the following theorem is satisfied.
Theorem 8. Let be a minimal prime decomposition of an ideal A in X. If P is a prime ideal of X, then the following statements are equivalent:
- (i)
for some .
- (ii)
There exists such that .
Theorem 9. Suppose that is an epimorphism of lower BCK-semilattices. Then,
- (i)
If P is a prime ideal of X such that , then is a prime ideal of Y.
- (ii)
For prime ideals of X, the following equation is satisfied:
Proof. (i) Suppose that
P is a prime ideal of
X and
. Then,
is an ideal of
Y by using Lemma 2. Now, let
for any
. Then, there exist
x and
y in
X such that
and
. Using Lemma 1, we have the following:
Hence, there exists
such that
. In addition, since
is a homomorphism, it follows that
Thus,
. Since
, we conclude that
. It follows from the primeness of
P that
Therefore,
is a prime ideal of
Y.
(ii) Let
. Then, there exists
such that
. Since
, we have
and so
for all
. Hence,
Therefore,
Assume that
. Then,
, and thus there exists
such that
for all
. Note that
for all
. Since
and
is an ideal, we conclude that
for all
. Therefore,
and so
Hence,
, and therefore the proof is completed. □
Lemma 9. Let be a minimal prime decomposition of an ideal A in X. If P is a prime ideal of X, then if and only if there exists such that .
Proof. Straightforward. □
Theorem 10. Let be an epimorphism of lower BCK-semilattices. Let A be an ideal of X such that . If is a minimal prime decomposition of A in X, then is a minimal prime decomposition of in Y.
Proof. Note that
is an ideal of
Y (Lemma 1). If
is a minimal prime decomposition of
A in
X, then
and so
. Suppose that
Since
, we conclude that
for all
by using Lemma 3. Hence,
This is a contradiction, so
is a minimal prime decomposition of
in
Y. □
Corollary 2. Suppose that is an isomorphism of lower BCK-semilattices. Let A be an ideal of X. If is a minimal prime decomposition of A in X, then is a minimal prime decomposition of in Y.
Theorem 11. Suppose that is an epimorphism of lower BCK-semilattices. Let B be an ideal of Y. If is a minimal prime decomposition of B in Y, then is a minimal prime decomposition of in X.
Proof. Obviously,
is an ideal of
X. If
is a minimal prime decomposition of
B in
Y, then
Thus,
Suppose that
Since
is onto,
for all
. Hence,
This is a contradiction, and so
Therefore,
is a minimal prime decomposition of
in
X. □
Lemma 10 ([
19])
. If X is Noetherian -algebra, then each ideal of X has a unique minimal prime decomposition. Lemma 11 ([
19])
. Every proper ideal of X is equal to the intersection of all minimal prime ideals associated with it. For an ideal A of X, consider the set . This set is not closed subset under the ∧ operation in X in general. The following example shows it.
Example 2. Let with the following Cayley table:∗ | 0 | 1 | 2 | 3 | 4 |
0 | 0 | 0 | 0 | 0 | 0 |
1 | 1 | 0 | 0 | 0 | 0 |
2 | 2 | 1 | 0 | 1 | 1 |
3 | 3 | 3 | 3 | 0 | 3 |
4 | 4 | 4 | 4 | 4 | 0 |
Then, X is a lower -semilattice. For an ideal of X, we have , which is not a ∧-closed subset of X because , but . For a subset A of X with , we can check that the set may not be an ideal of X. In the following example, we check it.
Example 3. Suppose that with the following Cayley table:∗ | 0 | 1 | 2 | 3 | 4 |
0 | 0 | 0 | 0 | 0 | 0 |
1 | 1 | 0 | 1 | 0 | 1 |
2 | 2 | 2 | 0 | 2 | 0 |
3 | 3 | 1 | 3 | 0 | 3 |
4 | 4 | 4 | 4 | 4 | 0 |
Then, X is a lower -semilattice. For a subset of X, we have . By routine verification, we can investigate that is not an ideal of X. The following theorem provided a characterization of a prime ideal.
Theorem 12. For an arbitrary ideal P of X, the following assertions are equivalent:
- (i)
P is a prime ideal of X.
- (ii)
is a closed subset under the ∧ operation in X, that is, for all .
Proof. (i) → (ii): Suppose that P is a prime ideal of X and are arbitrary elements. If , then clearly . Since P is a prime ideal, or , which is contradictory because x and y were chosen from the set . Thus, and is the closed subset under the ∧ operation.
(ii) → (i): Suppose that . If and , then clearly and also . Using condition (ii), we conclude that , which is a contradiction from the first assumption . Thus, or and P is a prime ideal of X. □
Definition 6. Let X be a -algebra. We defined in [2] the closure operation on , as the following functionsuch thatwhere is the set of all ideals of X. An ideal
A in a
-algebra
X is said to be
-closed (see [
2]) if
.
Definition 7 ([
3])
. For a closure operation “” on X, we have the following definitions:- (i)
“” is a semi-prime closure operation if we havefor every . - (ii)
“” is a good semi-prime closure operation, if we havefor every .
Theorem 13 ([
3])
. Suppose that “” is a semi-prime closure operation on X and S is a closed subset of X under the ∧ operation. If X is Noetherian and A is a -closed ideal of X, then the setis a -closed ideal of X. Lemma 12. If is a minimal prime decomposition of an ideal A of X, then Proof. Suppose that for such that , . Then, it follows that and this is a contradiction because is a minimal prime decomposition of an ideal A of X. □
Theorem 14. Suppose that A is an ideal of X with a minimal prime decompositionAssume that X is Noetherian and “” is a semi-prime closure operation on . If A is -closed, then so is for all . Proof. For any
, let
Then, we will prove that
. If
, then there exists
such that
. It follows that
and so
. Thus,
for all
. Now, assume that
. Using Lemma 12, we can take an element
, and so
and
for all
with
. Then,
and
for all
with
. Thus,
and so
. Therefore,
, which implies that
for all
. Since
is a ∧-closed subset of
X for all
by Theorem 12, we conclude from Theorem 13 that
is a
-closed ideal of
X for all
. □