1. Introduction
Mathematical structures have several applications. It is important to generalize the ideals of algebraic structures and ordered algebraic structures and to make them available for further study and application. Between 1950 and 1980, mathematicians studied bi-ideals, quasi ideals, and interior ideals. During 1950–2019, however, only mathematicians studied their applications. The notions of one-sided ideals of rings and semigroups, as well as the notions of quasi ideals of rings and semigroups, can all be considered generalizations of the notion of ideals of rings and semigroups. Semigroups are generalizations of rings and groups. Semigroup structure can be studied using certain band decompositions in semigroup theory. This research uses bi-ideals of semirings with additively reduced semilattices to open a new area of mathematics. In mathematics, various types of ideals have been discussed in various structures, including semiring [
1] and ring [
2]. In the theory of algebraic numbers, Dedekind introduced the idea of ideals that included associative rings. In 1952, Good et al. [
3] introduced the notion of bi-ideals for semigroups. Furthermore, this is a special case of the
-ideal discussed by Lajos, i.e., it is a special case of the
-ideal. Lajos provided both regular and intra-regular semigroups as a result of the bi-ideals [
4]. Furthermore, Lajos developed generalized bi-ideals and quasi ideals to analyze regular and intra regular semigroups. As an example, bi-ideals that describe different classes of semigroups [
5,
6,
7]. Lajos et al. [
8] define associative rings in terms of bi-ideals. quasi ideals are generalizations of left ideals and right ideals, and are therefore special cases of bi-ideals. Steinfeld introduced the concept of quasi ideals based on semigroups and rings in 1956. In semirings, prime ideals can be described in a variety of ways [
1]. In the theory of commutative rings, the prime ideal has been extensively used. In contrast with commutative rings, its application to non-commutative rings has been less extensive. A few aspects of prime ideals in general rings have been discussed by McCoy [
2]. Prime ideals for rings and semirings can be found in [
1,
9,
10]. The concepts of prime bi-ideal and semiprime bi-ideal were introduced by Van der Walt. Specifically, with regard to the subsets
and
of ℧ and the product
, what we mean is that the subring of ℧ is generated by the set of all products
, where
. In order to define a bi-ideal
of ℧, we must satisfy the condition
[
8]. If
is any bi-ideal of ℧, then
and
[
11]. An ideal
of ℧ is prime ideal if and only if
, for ideals
and
of ℧ implies
or
[
2]. Palanikumar et al. addressed semigroups, semirings, rings, and ternary semirings in their recent work [
12,
13,
14,
15,
16,
17]. Recently, Badmaev et al. [
18,
19,
20,
21,
22] discussed various application for Boolean functions generated by maximal partial ultraclones.
There are several closely related structures that have been introduced in other contexts which have partially additive semantics, such as those in [
23,
24,
25]. It is suggested that ∑ should be emphasized in computing science, according to the flowchart enclosed with [
23]. It is possible to find partially defined infinity operations in many contexts. A wide variety of contexts can be found here, ranging from the semantics of programming languages to the integration theory of systems. Computer scientists try to make programs more understandable by changing the function that was computed without changing their function. A program transformation algebraic theory is clearly required to solve this problem [
26]. A positive partial monoid can be explained as follows: If
is defined and equals 0, then each
must be zero. An Abelian monoid satisfies the positivity requirement that
implies
. Due to the partition-association property, a subset of the summable families has finite support and a usual sum. Assume that
M is the fixed set. Functions are
Q indexed families in
M. The notation for this function is
. Here, we have used
instead of
. Instead of making the co-domain explicit, as with the function notation
, the family notation suppresses it. As a result, family notation is useful when there is a stable co-domain relationship. In technical terms, “meaning” can be called “semantics”. Programming languages use semantics to explain what programs written in a given language mean when they are run. A semantic function is a function whose input is a syntactically correct program. The output is a description of the function calculated by the program based on the input. The partial addition that will be automated for some
Q-indexed families in
M is expected to include an element of
. In the semantic concepts we want to capture, there are no uncountable sums involved, so we can only deal with countable families. Using an axiom, I will demonstrate the ineffectiveness of subdividing a sum based on an axiom.
For example,
. If
and
, we may write this result as
. Here,
is a partition of
Q; that is, if
then
and also
. In our definition of
, we would like to emphasize that any number of
j (even an infinite number of
j) is appropriate if the partition properties are true. Various ideals of partial semirings and gamma partial semirings are discussed by Rao et al. [
27,
28,
29]. Amarendra Babu et al. [
30] discussed the bi-ideals of sum ordered partial semirings. Partial addition and a ternary product-based so-semiring is discussed by Bhagyalakshmi et al. [
31]. The theory of partial semirings of continuous valued functions is explained by Shalaginova et al. [
32]. Throughout this paper, there are five sections that are organized differently. The following
Section 2 contains some basic definitions that need to be briefly explained. The different types of prime partial bi-ideals and their extensions are discussed in
Section 3. The partial semiprime bi-ideals are discussed in
Section 4. The conclusion is drawn in
Section 5. In this study, we aim to achieve the following fundamental goals:
- 1.
A one-prime partial bi-ideal implies a two-prime partial bi-ideal which implies a three-prime partial bi-ideal, but the reverse implication does not hold.
- 2.
The system implies the system, which implies system, and the opposite direction does hold with the Example.
- 3.
A one-partial semiprime bi-ideal implies a two-partial semiprime bi-ideal, which implies a three-partial semiprime bi-ideal, and the reverse implication does not match up.
- 4.
The system implies the system, which implies the system, and the opposite direction is not valid based on the Example.
3. Different Prime Partial Bi-Ideals
In this section, three different prime partial bi-ideals and their corresponding partial m systems were introduced.
Definition 10. (i) A proper prime bi-ideal Φ of ℧ is called a one-prime partial bi-ideal if implies or for any prime bi-ideals and of ℧.
(ii) A two-prime partial bi-ideal if implies .
(iii) A three-prime partial bi-ideal if implies or for any prime ideals and of ℧.
Example 1. Consider with is defined on ℧ byand is defined by the usual multiplication. Example 2. Consider with is defined on ℧ byand is defined by the usual multiplication. Remark 2. Every left ideal, right ideal and bi-ideal are a partial left ideal, partial right ideal and partial bi-ideal of ℧.
Proof.
Straightforward. □
The converse of the Remark 2 cannot be proved by the following example.
Example 3. In Example 1, (i) is a partial right ideal of ℧.
Since implies is not a right ideal of ℧.
(ii) is a partial left ideal of ℧.
Since implies is not a left ideal of ℧.
Example 4. In Example 2, (iii) is a partial ideal of ℧. Since implies Υ is not an ideal of ℧.
(iv) is a partial bi-ideal of ℧.
Since implies Θ is not a bi-ideal of ℧.
Lemma 1. If Φ is a one-prime partial bi-ideal of ℧, then Φ is a two-prime partial bi-ideal of ℧.
Proof.
Straightforward. □
In the example below, we can see that the converse of the Lemma 1 is not true.
Example 5. In Example 2,
, and
. Here, Φ is a two-prime partial bi-ideal, but not a one-prime partial bi-ideal. Now, , but and .
Lemma 2. If Φ is a two-prime partial bi-ideal of ℧, then Φ is a three-prime partial bi-ideal of ℧.
Proof.
Straightforward. □
We cannot prove the converse of Lemma 2 based on the following example.
Example 6. Based on the Example 2, . Here, Φ is a three-prime partial bi-ideal, but not a two-prime partial bi-ideal. Now, , but and .
Definition 11. (i) A subset Δ of ℧ is called a system if, for any , there exists and , such that
(ii) A subset Δ of ℧ is called a system if, for any , there exists and , such that
(iii) A subset Δ of ℧ is called a system if, for any , there exists and such that
Lemma 3. If Φ is a partial bi-ideal of ℧, then Φ is a one-prime partial bi-ideal (two-prime partial bi-ideal, three-prime partial bi-ideal) if and only if is a system ( system, system) of ℧.
Proof. Let be the one-prime partial bi-ideal of ℧ and let . Hence, . Then there exists and , such that , where and for and . Since . Thus, . Hence, is a system.
Conversely, let and be the partial bi-ideals of ℧, such that . Suppose that and Then, there exists and , such that and . Let . Since is an system, then there exists and such that . However, , which is a contradiction. Thus, or . Hence, is a one-prime partial bi-ideal of ℧. □
Remark 3. Every system is a system.
As illustrated by the following example, the converse may not be true.
Example 7. In Example 2, Clearly is an system, but not a system.
Put . Now, and such that .
Remark 4. Every system is a system.
In the following example, however, the converse may not be true.
Example 8. In Example 2, clearly, is an system, but not a system.
Let . Now, and , such that .
Remark 5. For any bi-ideal Θ of ℧, and is defined as .
Remark 6. For any bi-ideal Θ of ℧, and is defined as .
Lemma 4. Let Θ be the partial bi-ideal of ℧. Then, is a partial left ideal of ℧, such that .
Proof.
Let . Then, and . Since is a partial bi-ideal of ℧, then and . Now, . Thus, . Now, . Thus, . Let and . Since , we have and . Thus, . Hence is a partial left ideal of ℧ and . □
Lemma 5. Let Θ be the partial bi-ideal of ℧. Then is a partial subring of ℧.
Proof.
Let . Then, and . Since , and . Since and is a partial subring of ℧, we have and . Now, implies . Now, implies . Now, implies and . Thus, . Hence, is a partial subring of ℧. □
Lemma 6. Let Θ be the partial left ideal of ℧. Then, .
Proof.
Clearly, . Let , since is a partial left ideal of ℧. We have implies . Thus, . Hence, . □
Theorem 2. If Θ is any partial bi-ideal of a complete partial ring ℧, then is the unique largest two sided partial ideal of ℧ contained in Θ.
Proof.
Let be the any partial bi-ideal of ℧. First, we prove that is the two sided partial ideal of ℧. Since and , . Let and . Then, . Since , we have and . Since is a partial bi-ideal of ℧, then . Since , and . Hence, . Since , then and . Moreover, . Therefore, and . To prove that and . Now, . Moreover, , since is a partial left ideal of ℧. Hence, is a two-sided partial ideal of ℧. To prove is the largest two-sided partial ideal of ℧l let be any partial ideal of ℧ and . Let . Then, and . Hence, . Hence, . Next, and . Hence, . □
Theorem 3. Let Θ be any partial bi-ideal of a complete partial ring ℧. If Θ is a one-prime partial bi-ideal (two-prime partial bi-ideal) of ℧, then is a prime partial ideal of ℧.
Next, we provide an example showing that the converse of Theorem 3 does not hold.
Example 9. In Example 2, is a prime partial ideal.
Let and , is not a one-prime partial bi-ideal and is not a two-prime partial bi-ideal of ℧. Since
and
.
Theorem 4. Let Θ be any partial bi-ideal of a complete partial ring ℧. Θ is a three-prime partial bi-ideal of ℧ if and only if is a prime partial ideal of ℧.
Proof.
Let be a three-prime partial bi-ideal of ℧. Let C and be partial ideals of ℧, such that . Since , . Since is an three-prime partial bi-ideal of ℧, or . By Theorem 2, is the unique largest partial ideal of ℧, such that . Thus, or . Hence, is a prime partial ideal of ℧.
Conversely, let be the prime partial ideal of ℧. Suppose that , for any partial ideals and of ℧, since and are partial ideals of ℧. Hence, , since is a prime partial ideal of ℧. Hence or , since . Thus, or . Hence, is a three-prime partial bi-ideal of ℧. □
Theorem 5. Let Δ be the system and Θ be the prime bi-ideal of a complete partial ring ℧ with . Then, there exists a three-prime partial bi-ideal Φ of ℧ containing Θ with .
Proof.
Let be a partial bi-ideal with and Clearly and is an ideal of ℧. According to Zorn’s lemma, contains a maximal element with X and . Let us show that is a three-prime partial bi-ideal. Using Theorem 4, we show that is a prime partial ideal in ℧. Since and , this implies that .
Case-(i) Suppose that is a maximal prime ideal, such that . Suppose This implies that or . Suppose that and . Let us show that . Since , hence but and , hence but . Then, and . Based on the maximal property of , and . Since is an system for , then there exist and , such that . If , then for some and . If , then for some and . Now, . If then . So , which is a contradiction. Hence, . Hence, is a prime partial ideal of ℧.
Case-(ii) If is not a maximal prime ideal, then there exists a prime partial ideal , such that , to apply case-(i), we get the proof. □
4. Different Partial Semiprime Bi-Ideals
Throughout this section, we will introduce three different partial semiprime bi-ideals and their corresponding partial n systems.
Definition 12. (i) A proper prime bi-ideal Φ of ℧ is called a one-partial semiprime bi-ideal if implies , for any prime bi-ideal Θ of ℧.
(ii) It is called a two-partial semiprime bi-ideal if implies .
(iii) It is called a three-partial semiprime bi-ideal if implies , for any ideal Υ of ℧.
Lemma 7. If Φ is a one-partial semiprime bi-ideal of ℧, then Φ is a two-partial semiprime bi-ideal of ℧.
The following example suggests that Lemma 7 could not have a converse.
Example 10. In Example 2, and . Here, Φ is a two-partial semiprime bi-ideal, but not a one-partial semiprime bi-ideal by , but .
Lemma 8. If Φ is a two-partial semiprime bi-ideal of ℧, then Φ is a three-partial semiprime bi-ideal of ℧.
In the following example, the converse of Lemma 8 may not be true.
Example 11. In Example 2, is a three-partial semiprime bi-ideal, but not a two-prime partial bi-ideal. Since , but and .
Definition 13. (i) A subset N of ℧ is called a system if, for any , there exist such that .
(ii) A subset N of ℧ is called a system if for any , there exist such that .
(iii) A subset N of ℧ is called a system if for any , there exist such that .
Lemma 9. If Φ is a partial bi-ideal of ℧, then Φ is a one-partial semiprime bi-ideal, two-partial semiprime bi-ideal and three-partial semiprime bi-ideal if and only if is an system ( system, system).
Remark 7. Every system is a system.
From the following example, it can be seen that the converse may not be true.
Example 12. In Example 2, Clearly, is a system, but not a system.
Theorem 6. Let Θ be any partial bi-ideal of ℧. If Θ is a one-partial semiprime bi-ideal (two-partial semiprime bi-ideal) of ℧, then is a partial semiprime ideal of ℧.
In the following example, the converse of Theorem 6 might not be true.
Example 13. In Example 2, is a partial semiprime ideal but not a one-partial semiprime bi-ideal. For the prime bi-ideal . Since .
Theorem 7. Let Θ be any partial bi-ideal of ℧. If Θ is a three-partial semiprime bi-ideal of ℧ if and only if is a partial semiprime ideal of ℧.