Next Article in Journal
Spherical Superpixel Segmentation with Context Identity and Contour Intensity
Previous Article in Journal
A Genetic Algorithm for Three-Dimensional Discrete Tomography
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Ideals in Bipolar Quantum Linear Algebra

by
Kittipong Laipaporn
and
Prathomjit Khachorncharoenkul
*,†
Center of Excellence for Ecoinformatics, School of Science, Walailak University, Nakhon Si Thammarat 80160, Thailand
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Symmetry 2024, 16(7), 924; https://doi.org/10.3390/sym16070924
Submission received: 30 April 2024 / Revised: 8 July 2024 / Accepted: 8 July 2024 / Published: 19 July 2024
(This article belongs to the Section Mathematics)

Abstract

:
Since bipolar quantum linear algebra (BQLA), under two operations–-addition and multiplication—demonstrates the properties of semirings, and since ideals play an important role in abstract algebra, our results are compelling for the ideals of a semiring. In this article, we investigate the characteristics of ideals, principal ideals, prime ideals, maximal ideals, and the smallest ideal containing any nonempty subset. By applying elementary real analysis, particularly the infimum, our main result is stated as follows: for any closed set I in BQLA, I is a nontrivial proper ideal if and only if there exists c ( 0 , 1 ] such that I = ( x , y ) R 2 | c x y x c and x , y 0 . This shows that its shape has to be symmetric with the graph y = x .
MSC:
16Y60; 26A99

1. Introduction

In ring theory, ideals play a significant role in studying various properties and structures of rings, such as quotient rings and factor structures. In essence, the study and exploration of ideals in semirings not only reveal the intricate details of these algebraic structures but also provide a versatile framework for theoretical advancements and practical applications across diverse fields of mathematics and beyond. Previous research has studied the use of knowledge of ideals. In 2014, Y. Katsov, T. G. Nam, and J. Zumbrägel [1] investigated various classes of semirings and complete semirings, focusing on the property of being ideal-simple, congruence-simple, or both. In 2018, P. Nasehpour [2] examined the prime, primary, and maximal ideals of commutative semirings. The localization and primary decomposition of ideals in commutative semirings were also studied. In 2019, I. Chajda and H. Länger [3] studied complements of annihilator ideals and constructed commutative semirings with a complemented lattice of ideals. In 2023, M. Korbelář [4] studied the idempotent and torsion properties with additively divisible elements in a finitely generated commutative semiring with an identity. Additionally, J. Goswami and L. Boro [5] showed a weakly nilpotent graph on a commutative semiring with an identity. Despite decades of research, the properties of ideals continue to be discussed and applied as the foundation for in-depth study in different fields of mathematics.
In 2011, W.R. Zhang proposed the idea of bipolar quantum linear algebra (BQLA). BQLA can be applied to various fields such as bipolar fuzzy sets, bipolar disorder, bipolar cognitive mapping, and the causal theory of YinYang bipolar atoms, which includes supper symmetrical quantum cosmology. Moreover, in Chapter 8 of [6], BQLA was an important tool for creating many results; for example, the symmetry law (or elementary energy equilibrium), the energy transfer equilibrium law [7], and the law of energy symmetry (or YinYang-n-element system nonequilibrium strengthening law) [8]. Some recent articles related to the bipolar concepts, for example, “Ground-0 Axioms vs. First Principles and Second Law: From the Geometry of Light and Logic of Photon to Mind–Light–Matter Unity-AI&QI” [9] and “Bipolar Fuzzy Supra Topology via (Q-) Neighborhood and its Application in Data Mining Process” [10]. Even though BQLA has been widely applied in many fields, we found that BQLA is hardly developed in the field of ideals. So, this is one of our aspirations to study the system of BQLA in the theoretical sense of abstract algebra that may be applied for further applications.
This article aims to study the ideal characteristic of I, where I is either an open or closed set in a bipolar set B with respect to the usual topology on R 2 , and is divided into three parts as follows:
  • We give the necessary and sufficient conditions to analyze the ideal I (see Theorem 3 and Corollary 2), and the consequences are all possible ideals I that can be expressed in the symmetric region with the graph y = x .
  • All principal ideals, prime ideals, and maximal ideals are identified in Theorem 4, Theorem 5, and Theorem 6, respectively.
  • If I { ( 0 , 0 ) } is a closed subset in { ( a , b ) | a , b R + } , then we also deliver the conditions to classify the ideal generated by I into three forms: { ( a , b ) | a , b R + } { ( 0 , 0 ) } , { ( x , x ) B } , or ( x , y ) B | c x y x c for some c ( 0 , 1 ] (see Theorem 9).
Throughout the proofs in this article, we try to limit all tools to those easily accessible to students pursuing an undergraduate degree. We use basic knowledge of elementary mathematical analysis, especially open sets, closed sets, and the usual topology on R 2 . In addition, we apply the concept of an infimum to claim the existence of a constant c ( 0 , 1 ] for representing the ideal I = ( x , y ) R 2 | c x y x c and x , y 0 .
The outline of this paper is as follows. We provide the definitions and terminology required for this research in Section 2. Our significant findings concerning the characteristics of ideals, principal ideals, prime ideals, maximal ideals, and the smallest ideal containing any nonempty subset are demonstrated in Section 3. This section is divided into two parts: first, the proofs utilize basic mathematical methods and apply elementary real analysis with a focus on the infimum; and second, we incorporate a suggestion from a reviewer, which was to simplify our proofs by applying an isomorphism of semirings, as presented in Section 3.2. In the last section, Section 4, we summarize the overall perspective of this article.

2. Material and Methods

For simplicity, below, we present the terminology [6,11,12] used in this article.
Definition 1.
The set of all bipolar agents is the bipolar set
B = { ( a , b ) | a , b R 0 + } .
The interior of B is B * = { ( a , b ) | a , b R + } .
Definition 2
(Addition of the bipolar set). Let ( a , b ) , ( c , d ) B . Then,
( a , b ) + ( c , d ) = ( a c , b + d )
with ( 0 , 0 ) as the identity (see Figure 1). The addition has commutative and associative properties.
Definition 3
(Multiplication of the bipolar set). Let ( a , b ) , ( c , d ) B . Then,
( a , b ) ( c , d ) = ( a d b c , a c + b d )
with ( 0 , 1 ) as the identity (see Figure 2). The multiplication has commutative and associative properties. Moreover, the multiplication has distributive properties over the addition.
Definition 4.
Let R be a nonempty set. Then, ( R , + , · ) is a semiring if the following conditions hold:
1. 
( R , + ) is a commutative semigroup;
2. 
( R , · ) is a semigroup;
3. 
Left and right distributivity hold.
In particular, a semiring ( R , + , · ) is said to be commutative if ( R , · ) is commutative. If a semigroup ( R , · ) has a neutral element, we call this element the identity of the semiring R. If a semigroup ( R , + ) has a neutral element, we call this element the zero of the semiring R.
As a result, ( B , + , · ) forms a commutative semiring with identity ( 0 , 1 ) and zero ( 0 , 0 ) , and ( B * , + , · ) forms a commutative semiring.
Definition 5.
A nonempty subset I of a semiring R is said to be a left (resp. right) ideal of R if the following conditions hold:
1. 
a + b I for all a , b I ;
2. 
r a (resp. a r ) I for any a I and r R .
If I is a left and a right ideal of a semiring R, it is called a two-sided ideal, or simply, an ideal of R. In addition, if R is commutative, then the concepts of left ideals, right ideals, and two-sided ideals clearly coincide.
Definition 6.
A proper ideal P of a semiring R is prime if a b P implies that a P or b P for all elements a and b of R.
Definition 7.
A proper ideal M of a semiring R is maximal if M I R for any ideal I of R implies that either I = M or I = R .
Definition 8.
For each nonempty subset X of a semiring R, ( X ) i is the smallest ideal of R containing X, called the ideal of R generated by X.
Definition 9.
An ideal I of a semiring R is principal if there exists an element a of R such that I = ( { a } ) i , or simply, I = ( a ) i .

3. Main Results

3.1. Proofs Utilizing Foundational Mathematical Techniques

First, we introduce the notations and some properties that play a significant role in this section.
Let s , t R + be such that s t . Then, we define (see Figure 3)
I ( s , t ) ¯ = ( x , y ) B | t s x y s t x
and
I ( s , t ) = ( x , y ) B | t s x < y < s t x .
Actually, I ( 1 , 1 ) ¯ = { ( x , x ) | x 0 } . Moreover, we let the notations I ( 0 , b ) ¯ = I ( a , 0 ) ¯ = B and I ( 0 , b ) = I ( a , 0 ) = B * for any a , b R + .
Proposition 1. 
Let s , t R + . Then, I ( s , t ) ¯ and I ( s , t ) are closed under addition.
Proof. 
We only show the case I ( s , t ) ¯ . Let ( a , b ) , ( c , d ) I ( s , t ) ¯ . Since b a s t and d c s t , we obtain b t a s and d t c s . Then, t ( b + d ) = b t + d t a s + c s = s ( a + c ) . Thus, b + d a + c s t . Similarly, it is easy to see that b + d a + c t s . □
Theorem 1.
Let s , t R + . Then, I ( s , t ) ¯ is an ideal of a semiring B.
Proof. 
By Proposition 1, I ( s , t ) ¯ is closed under addition. Next, let ( c , d ) I ( s , t ) ¯ and ( x , y ) B . Then, ( a , b ) : = ( c , d ) ( x , y ) . So, a = c y + d x and b = c x + d y . Consider b a = c d x + y c d y + x . Since ( c , d ) I ( s , t ) ¯ , we have ( d , c ) I ( s , t ) ¯ such that t s d c s t and t s c d s t . If d c 1 , then b a < d c s t , and if d c < 1 , then b a < c d s t . So, we have b a s t . Similarly, if c d 1 , then b a = c d x + y c d y + x > x + y c d y + c d x = d c t s , and if c d < 1 , then b a = c d x + y c d y + x > c d x + c d y x + y = c d t s . Thus, b a t s . As a result, ( a , b ) I ( s , t ) ¯ . We conclude that I ( s , t ) ¯ is an ideal of a semiring B. □
Theorem 2.
Let s , t R + . Then, I ( s , t ) is an ideal of a semiring B * .
Proof. 
Applying Proposition 1 and a similar argument as Theorem 1. □
Corollary 1. 
Let s , t R + . Then, I ( s , t ) { ( 0 , 0 ) } is an ideal of a semiring B.
Now, we know that the following sets are ideals of the semiring B: { ( 0 , 0 ) } , B, B * { ( 0 , 0 ) } , I ( s , t ) { ( 0 , 0 ) } , I ( 1 , 1 ) ¯ , and I ( s , t ) ¯ , where s > t (see Figure 4 and Figure 5). In addition, the sets B * , I ( s , t ) , I ( 1 , 1 ) ¯ { ( 0 , 0 ) } , and I ( s , t ) ¯ { ( 0 , 0 ) } , where s > t are ideals of the semiring B * (see Figure 6). Moreover, Table 1 and Table 2 present the relatively open (closed) sets in B and B * , respectively.
This motivates us to consider other forms of ideals. So, the remainder of this section is devoted to answering this query.
Theorem 3.
Let I be a closed set of a semiring B. Then, I is a nontrivial proper ideal of B if and only if there exists 0 < c 1 such that I = I ( 1 , c ) ¯ .
Proof. 
We only prove the sufficient part. Since I is a closed set and a nontrivial ideal of B, we know that I is not { ( 0 , 0 ) } , I ( s , t ) { ( 0 , 0 ) } , B * { ( 0 , 0 ) } , or B. We assume that there exists ( x 0 , y 0 ) I such that x 0 and y 0 are positive. If no such point ( x 0 , y 0 ) exists where x 0 y 0 , then I must be { ( x , x ) | x 0 } , that is, I = I ( 1 , 1 ) ¯ . Now, we have ( x 0 , y 0 ) I such that x 0 y 0 , and both of them are positive. Let C = y x | ( x , y ) I . Then, 0 < c = inf C < 1 because ( x 0 , y 0 ) I , ( y 0 , x 0 ) = ( 1 , 0 ) ( x 0 , y 0 ) I and min x 0 y 0 , y 0 x 0 < 1 . To show that I = I ( 1 , c ) ¯ , we need more notations and rely on the following results: since the ideal I B , there exists ( a , b ) B * I such that a b . If a = b , it would contradict the fact that I is an ideal. Specifically,
( a , a ) = 0 , a α + β ( α + β ) , α + β I for some ( α , β ) I .
Let M = min a b , b a < 1 and m > 0 be such that m M . From now on, we consider only the case a > b . The case a < b can be proven in a similar manner. Since a > b , we obtain M = b a . Define L m = { ( x , y ) B * | y = ( m ) ( x ) } . We claim the following:
  • L m I = for all 0 < m M ;
  • A I = , where A = ( x , y ) B * | M > y x ;
  • M is a lower bound of C.
Suppose that we have these claims; we are ready to show that I = I ( 1 , c ) ¯ . Let ( x , y ) I . Then, y x C , and we have c y x . If y x 1 , then c y x 1 1 c . Therefore, ( x , y ) I ( 1 , c ) ¯ . If y x > 1 , then 0 < x y < 1 . Since I is an ideal and ( x , y ) I , we obtain ( y , x ) I . So, x y C , and then c x y < 1 1 c . Thus, ( y , x ) I ( 1 , c ) ¯ . Since I ( 1 , c ) ¯ is an ideal, we obtain ( x , y ) I ( 1 , c ) ¯ . Using the contrapositive, we assume that ( x , y ) I . Applying a similar argument as for the point ( a , b ) I , we conclude that M = min x y , y x is a lower bound for C. Since I is a closed set, we have c = min C C , and then y x < c or y x > 1 c . So, ( x , y ) I ( 1 , c ) ¯ . We can conclude that I ( 1 , c ) ¯ I . Now, we proceed to prove our claims as follows:
  • For m = M , suppose L M I . We let ( e , f ) L M I , and then b = f a e . Since ( e , f ) I and I is an ideal, we have ( a , b ) = e a e , f a e = 0 , a e ( e , f ) B I I , which contradicts ( a , b ) I . For m < M , suppose ( e , f ) L m I . Since I is an ideal, ( e , f ) I , and m = f e , we have ( 1 , m ) = 0 , 1 e ( e , f ) I . If we can choose ( s , t ) B * such that ( 1 , M ) = ( s , t ) ( 1 , m ) , then ( 1 , M ) I , but ( 1 , M ) L M . This contradicts L M I = . We select s and t to finish the proof. Choose s = M m 1 m 2 and t = 1 m s = m 1 m s . Then, s > 0 and 1 M > 0 > m ( m 1 ) = m 2 m . Thus, 1 m 2 > M m > 0 , and then 1 m > 1 > M m 1 m 2 = s . So, t > 0 . Hence, ( s , t ) B * and
    ( s , t ) ( 1 , m ) = ( s m t , s + m t ) = s m 1 + m s , M m 1 m 2 + m m 2 M m 1 m 2 = 1 , M m + m m 3 m 2 M + m 3 1 m 2 = ( 1 , M ) .
  • It is easy to see that A I = since A = 0 < m < M L m and L m I = for all 0 < m < M .
  • Suppose that M is not a lower bound of C. Then, there exists ( x , y ) I such that y x < M . Consequently, ( x , y ) A . Hence, ( x , y ) A I , which is a contradiction.
Corollary 2. 
Let I { ( 0 , 0 ) } be an open set of a semiring B. Then, I is a nontrivial ideal of B if and only if there exists 0 < c < 1 such that I = I ( 1 , c ) { ( 0 , 0 ) } or I = B * { ( 0 , 0 ) } .
Proof. 
In Theorem 3, by changing the set C = y x | ( x , y ) I to a new set C = y x | ( x , y ) is any element in the closure of I and ( x , y ) ( 0 , 0 ) and applying the same process in the proof of Theorem 3. □
Remark 1.
Let a , b , c , d R + . Then,
1. 
I ( 1 , 1 ) ¯ I ( a , b ) ¯ .
2. 
I ( 1 , 1 ) ¯ = I ( a , a ) ¯ .
3. 
I ( a , b ) ¯ = I ( c , d ) ¯ if b a = d c .
4. 
I ( a , b ) ¯ = I ( a , b ) · ( c , d ) ¯ if b a = d c .
5. 
If 0 < a < b < 1 , then I ( 1 , b ) ¯ I ( 1 , a ) ¯ .
The principal ideals, prime ideals, and maximum ideals in a semiring B are discussed in the following theorems.
Theorem 4.
Let s , t R + . Then, I ( s , t ) ¯ is a principal ideal of a semiring B. Moreover, every nontrivial proper ideal of B, being a closed set, is a principal ideal.
Proof. 
We show that I ( s , t ) ¯ = ( s , t ) i . If s = t , clearly I ( 1 , 1 ) ¯ = ( 1 , 1 ) i . Suppose t < s . Since ( s , t ) i = { ( x , y ) ( s , t ) | ( x , y ) B * } , ( s , t ) I ( s , t ) ¯ , and I ( s , t ) ¯ is an ideal of a semiring B, it follows that ( s , t ) i I ( s , t ) ¯ . Conversely, let ( a , b ) I ( s , t ) ¯ . Then,
t s a b s t a .
Choose m = a s b t s 2 t 2 and n = a t b s t 2 s 2 . Then, m > 0 because t < s and b t < a s by Equation (1). Similarly, we know that n > 0 because t < s and a t < b s . Moreover, ( t , s ) = ( 1 , 0 ) ( s , t ) ( s , t ) i and ( s , t ) ( s , t ) i . Thus, we obtain
( a , b ) = ( 0 , m ) ( s , t ) + ( 0 , n ) ( t , s ) ( s , t ) i .
By Theorem 3, we conclude that every nontrivial proper ideal of B, being a closed set, is I ( s , t ) ¯ = I ( 1 , t s ) ¯ , which is a principal ideal. □
Note: It is easy to see that B = ( ( 0 , t ) ) i or B = ( ( s , 0 ) ) i for any s , t R + , and { ( 0 , 0 ) } = ( ( 0 , 0 ) ) i . Hence, by Theorem 4, we conclude that every ideal of B, being a closed set, is a principal ideal.
Theorem 5.
Let I be a prime ideal of a semiring B. Then, the following statements hold:
1. 
If I is a closed set, then I = { ( 0 , 0 ) } or I = I ( 1 , 1 ) ¯ .
2. 
If I { ( 0 , 0 ) } is an open set, then I = B * { ( 0 , 0 ) } .
Proof. 
  • Assume that I is any nontrivial proper ideal of B, being a closed set. Then, by Theorem 3, I = I ( 1 , c ) ¯ , where c 0 , 1 .
    Case 1:  c = 1 . Let ( a , b ) , ( c , d ) B such that ( a , b ) ( c , d ) I ( 1 , 1 ) ¯ . Since ( a , b ) ( c , d ) = ( a d b c , a c + b d ) , we have a d + b c = a c + b d . If d c = 0 , then ( c , d ) I ( 1 , 1 ) ¯ . If d c 0 , then a = b . This implies that ( a , b ) I ( 1 , 1 ) ¯ . Hence, I ( 1 , 1 ) ¯ is a prime ideal.
    Case 2:  c 1 . Note that 1 , c 1 + ϵ I ( 1 , c ) ¯ for any ϵ > 0 . So, c 1 + ϵ , 1 I ( 1 , c ) ¯ since I ( 1 , c ) ¯ is an ideal. If we find that ϵ > 0 such that
    1 , c 1 + ϵ c 1 + ϵ , 1 I ( 1 , c ) ¯ ,
    then we can conclude that I ( 1 , c ) ¯ is not a prime ideal.
    Consider 1 , c 1 + ϵ c 1 + ϵ , 1 I ( 1 , c ) ¯ . This implies that
    c 1 2 c ( 1 + ϵ ) ( 1 + ϵ ) 2 + c 2 1 c .
    So, c ( 1 + 2 ϵ + ϵ 2 + c 2 ) 2 c ( 1 + ϵ ) and 2 c 2 ( 1 + ϵ ) 1 + 2 ϵ + ϵ 2 + c 2 . Then,
    ϵ 2 1 c 2 and 0 ϵ 2 + ( 2 ϵ + 1 ) ( 1 c 2 ) .
    Thus, 0 < ϵ 1 c 2 because 0 ϵ 2 + ( 2 ϵ + 1 ) ( 1 c 2 ) is true for any ϵ > 0 and c ( 0 , 1 ] . Hence, if we choose ϵ = 1 2 1 c 2 , then we have proven that I ( 1 , c ) ¯ is not a prime ideal.
    As a result, { ( 0 , 0 ) } and I ( 1 , 1 ) ¯ are only two prime ideals of B, being closed sets.
  • Since I { ( 0 , 0 ) } is an open set, by Corollary 2, we conclude that I = I ( 1 , c ) { ( 0 , 0 ) } or I = B * { ( 0 , 0 ) } , where 0 < c < 1 . Likewise, the proof of 1. in Case 2 confirms that I ( 1 , c ) { ( 0 , 0 ) } is not a prime ideal. Applying the contrapositive of the definition of prime ideals, we conclude that B * { ( 0 , 0 ) } is a prime ideal.
Theorem 6.
B * { ( 0 , 0 ) } is a maximal ideal of a semiring B.
Proof. 
Let I be any ideal of a semiring B such that B * { ( 0 , 0 ) } I B .
  • Case 1: There exists ( 0 , b ) I . To show that I = B , let x > 0 be given. Then, ( 0 , x ) = 0 , x b ( 0 , b ) I and ( x , 0 ) = x b , 0 ( 0 , b ) I since I is an ideal. So, I = B .
  • Case 2: There exists ( a , 0 ) I . Then, ( 0 , a ) = ( 1 , 0 ) ( a , 0 ) I , and by Case 1, we obtain I = B .
  • Case 3: For any a , b > 0 , ( a , 0 ) and ( 0 , b ) are not elements in I. To show that I = B * { ( 0 , 0 ) } , let ( x , y ) I . Since x , y > 0 , we have ( x , y ) B * B * { ( 0 , 0 ) } . □
Throughout Theorems 7–9, we examine the smallest ideal ( A ) i of B containing any nonempty subset A as follows:
Theorem 7 presents a finite set A. Next, a nonempty compact set A is established in Theorem 8, and finally, the necessary and sufficient conditions to clarify the shape of ( A ) i for any nonempty closed subset A are stated in Theorem 9.
Theorem 7.
Let A be a subset of a semiring B. Then, the following statements hold:
1. 
For each a , b R + , if A = { ( a , b ) } , then ( A ) i = I ( 1 , m ) ¯ , where m = min a b , b a .
2. 
If A is a finite set, then ( A ) i = I ( 1 , m ) ¯ , where m = min s t , t s | ( s , t ) A .
Proof. 
  • Assume A = { ( a , b ) } , where a , b R + .
    Case 1:  a = b . Since ( a , a ) A ( A ) i and ( A ) i is an ideal of B, we obtain
    ( x , x ) = 0 , x a ( a , a ) ( A ) i
    for each ( x , x ) I ( 1 , 1 ) ¯ . Thus, I ( 1 , 1 ) ¯ ( A ) i . But, ( a , a ) I ( 1 , 1 ) ¯ , so I ( 1 , 1 ) ¯ is an ideal of B containing A. This implies that ( A ) i I ( 1 , 1 ) ¯ .
    Case 2:  a b . We only show the case a > b . The other case can be proven similarly. Since ( a , b ) A ( A ) i and ( A ) i is an ideal of B, it follows that for any ( x , y ) L 1 : = ( x , y ) B * | y = b a ( x ) , we have
    ( x , y ) = x , b x a = 0 , x a ( a , b ) ( A ) i .
    Thus, L 1 ( A ) i . Next, let L 2 : = ( x , y ) B * | y = a b ( x ) . Then, we have L 2 = ( 1 , 0 ) L 1 ( A ) i . Last, for any ( x , y ) I 1 , b a ¯ ( L 1 L 2 ) , we can write
    ( x , y ) = 0 , x a 2 y a b a 2 b 2 1 , b a + 0 , y a b x b 2 a 2 b 2 1 , a b
    because a > b and b a x < y < a b x . So, I 1 , b a ¯ ( A ) i . But, ( a , b ) I 1 , b a ¯ , so I 1 , b a ¯ is an ideal of B containing A. This implies that ( A ) i I 1 , b a ¯ .
  • Assume that A is a finite subset of B. We only show the case A = { ( a , b ) , ( c , d ) } . In other cases, there is a similar process. Let m = min s t , t s | ( s , t ) A . By 1. and Remark 1 (5.), we obtain A I ( 1 , m ) ¯ and then ( A ) i I ( 1 , m ) ¯ . Conversely, we separate two cases. If min a b , b a < min c d , d c , we obtain I ( 1 , m ) ¯ = { ( a , b ) } i ( A ) i . If min a b , b a > min c d , d c , similarly, I ( 1 , m ) ¯ ( A ) i .
Note: It is evident that if A = { ( 0 , 0 ) } , then ( A ) i = { ( 0 , 0 ) } , and if A has an element ( s , 0 ) or ( 0 , t ) where s , t > 0 , then ( A ) i = B , which is why we consider A B * in the following theorems.
Theorem 8.
Let A B * be a nonempty compact set. Define A S = A ( 1 , 0 ) A , and A S is a part of A S under a line y = x . Then, the following statements hold:
1. 
( A S ) i = I ( s , t ) ¯ , where t = inf { y | ( x , y ) A S } and s = sup { x | ( x , t ) A S } .
2. 
( A S ) i = ( A S ) i .
3. 
( A S ) i = ( A ) i .
Proof. 
  • Since A is a compact set, we have ( s , t ) A S . By Theorem 3, we have ( A S ) i = I ( 1 , c ) ¯ , where c 0 , 1 . Actually, c is the infimum of the set y x | ( x , y ) ( A S ) i . Since the set A S is closed and bounded, we have ( s , t ) A S ( A S ) i and then c t s . For any ( a , b ) I ( s , t ) ¯ , we can see that
    c t s b a s t 1 c .
    This implies that ( a , b ) I ( 1 , c ) ¯ = ( A S ) i , so I ( s , t ) ¯ ( A S ) i . We now show that ( A S ) i I ( s , t ) ¯ . Let ( a , b ) A S . Without loss of generality, assume a b . By the definition of t, we have t b . Let L = ( x , y ) B * | y = b a ( x ) . There exists t s > 0 such that t s = b a ( s ) and t s t . This implies that
    b a = t s s t s ,
    and b t s a . Since a b , we obtain b a 1 s t , so b s t a . As a result, t s a b s t a and then ( a , b ) I ( s , t ) ¯ . Thus, I ( s , t ) ¯ is an ideal containing A S , and it follows that ( A S ) i I ( s , t ) ¯ .
  • Since A S A S , we obtain ( A S ) i ( A S ) i . Conversely, let ( a , b ) A S .
    Case 1:  ( a , b ) A . If ( a , b ) is under the line y = x , then ( a , b ) A S ( A S ) i . If ( a , b ) is above the line y = x , then ( b , a ) is under the line y = x and ( b , a ) A S ( A S ) i . So, ( a , b ) = ( 1 , 0 ) ( b , a ) ( A S ) i .
    Case 2:  ( a , b ) ( 1 , 0 ) A . This implies that ( b , a ) A . Similar to Case 1, we have ( b , a ) ( A S ) i and hence ( a , b ) = ( 1 , 0 ) ( b , a ) ( A S ) i .
    As a result, A S ( A S ) i and ( A S ) i ( A S ) i .
  • It suffices to show that ( A ) i = ( A S ) i . Since A A S , we obtain ( A ) i ( A S ) i . To show that A S ( A ) i , let ( a , b ) A S . If ( a , b ) A , then ( a , b ) ( A ) i . If ( a , b ) ( 1 , 0 ) A , then ( b , a ) A ( A ) i and ( a , b ) = ( 1 , 0 ) ( b , a ) ( A ) i . Thus, by the definition of ( A S ) i , we conclude that ( A S ) i ( A ) i .
Theorem 9.
Let A { ( 0 , 0 ) } be a nonempty closed subset of B * . Define A S = A ( 1 , 0 ) A , and A S is a part of A S under the line y = x . For each m ( 0 , 1 ] , let
T m = { ( x , y ) B * | y ( m ) ( x ) } .
Then, the following statements hold:
1. 
A s T m for any m if and only if ( A ) i = B * { ( 0 , 0 ) } .
2. 
A s T m = for some m if and only if ( A ) i = I ( s , t ) ¯ for some positive real numbers s and t.
3. 
A T 1 if and only if ( A ) i = I ( 1 , 1 ) ¯ .
Proof. 
  • Suppose A s T m for all m. It suffices to show that B * ( A ) i . Let ( a , b ) B * . If a b , then there exists ( a 1 , b 1 ) A s T b a . Since A s ( A ) i and ( a 1 , b 1 ) ( A ) i is an ideal, by Theorem 7 (1.), we obtain I ( a 1 , b 1 ) ¯ ( A ) i . Since ( a 1 , b 1 ) T b a , we obtain b 1 a 1 b a a b a 1 b 1 and then ( a , b ) I ( a , b ) ¯ I ( a 1 , b 1 ) ¯ ( A ) i . If a < b , then ( b , a ) ( A ) i . By the fact that ( a , b ) = ( 1 , 0 ) ( b , a ) , we also have ( a , b ) ( A ) i . Conversely, we prove by contrapositive. Suppose A s T m = for some m ( 0 , 1 ] . Let ( a , b ) A . If a b , then ( a , b ) A s and then ( a , b ) T m . Since m < 1 < a b < 1 m , we have ( b , a ) I ( 1 , m ) ¯ and then ( a , b ) I ( 1 , m ) ¯ . If a < b , then ( b , a ) A s and ( b , a ) T m . In the same manner, we have ( a , b ) I ( 1 , m ) ¯ . This implies that A I ( 1 , m ) ¯ . Since I ( 1 , m ) ¯ is an ideal containing A and I ( 1 , m ) ¯ is a proper subset of B * { ( 0 , 0 ) } , we conclude that ( A ) i B * { ( 0 , 0 ) } .
  • Suppose there exists ( s , t ) B * such that ( A ) i = I ( s , t ) ¯ . Since I ( s , t ) ¯ B * { ( 0 , 0 ) } , we have A s T m = for some m > 0 by 1. Conversely, suppose that there exists m 0 > 0 such that A s T m 0 = . By 1, we obtain ( A ) i B * { ( 0 , 0 ) } . Let
    M = { m ( 0 , 1 ] | A s T m = }
    and m = sup M . Then, we show that ( A ) i = I ( 1 , m ) ¯ . Let ( x , y ) I ( 1 , m ) ¯ . Given the property of the ideal I ( 1 , m ) ¯ , we assume that x y . It follows that m < y x 1 . If A s T y x = , then y x M , which is a contradiction. Thus, A s T y x , implying there exists ( a , b ) such that a b . This implies that ( a , b ) A s ( A ) i . Since ( a , b ) T y x , we have b a y x 1 . Thus, ( x , y ) I ( x , y ) ¯ I ( a , b ) ¯ ( A ) i . To show that ( A ) i I ( 1 , m ) ¯ , by Theorem 8 (2. and 3.), it is enough to show that A s I ( 1 , m ) ¯ . Let ( x , y ) A s and x y . If ( x , y ) I ( 1 , m ) ¯ , then y x < m 1 and then y < ( m ) ( x ) . This implies that ( x , y ) T m , so A s T m , which is a contradiction.
  • We only prove the sufficient part. Clearly, ( A ) i I ( 1 , 1 ) ¯ by assumption. Let ( x , x ) I ( 1 , 1 ) ¯ . Since A , let ( a , a ) A ( A ) i . Then, ( x , x ) = 0 , x a ( a , a ) ( A ) i .

3.2. Proof Utilizing the Isomorphism Approach

First, we define a set
B : = { ( x , y ) R 2 | x | y | }
and a map T : B B (see Figure 7), where for each ( a , b ) B ,
T ( a , b ) = ( b + a , b a ) .
These additions were recommended by a reviewer to support our findings.
Then, B is a commutative semiring with identity ( 1 , 1 ) and zero ( 0 , 0 ) under pointwise addition and multiplication, and T is an isomorphism of semirings, as shown in Proposition 2.
In this section, the reviewer’s suggestion that the set B and the mapping T results in a reduction in the complexity of multiplication on B. To enhance clarity, we have to eliminate certain details from the proofs of our main results, Theorems 3–6. For brevity, refer to Theorems 10–13.
Proposition 2. 
Let B and B be the above-defined semirings. If a map T is defined as above, then T is an isomorphism of semirings.
Proof. 
Clearly, T ( 0 , 0 ) = ( 0 , 0 ) and T ( 0 , 1 ) = ( 1 , 1 ) . A map T is a homomorphism because for any ( a , b ) , ( c , d ) B ,
T ( a , b ) + T ( c , d ) = ( b + a , b a ) + ( d + c , d c ) = ( b + a + d + c , b + d a c ) = T ( a c , b + d ) = T ( ( a , b ) + ( c , d ) )
and
T ( a , b ) T ( c , d ) = ( b + a , b a ) ( d + c , d c ) = ( ( b + a ) ( d + c ) , ( b a ) ( d c ) ) = ( b d + b c + a d + a c , b d b c a d + a c ) = T ( b c a d , a c + b d ) = T ( ( a , b ) ( c , d ) ) .
To show that T is 1-1, let ( a , b ) , ( c , d ) B such that T ( a , b ) = T ( c , d ) . Then, b + a = d + c and b a = d c . This implies that a = c and b = d ; hence, ( a , b ) = ( c , d ) . Lastly, to show that T is on B , let ( x , y ) B . Then, x | y | . Set a = x y 2 and b = x + y 2 . Then, ( a , b ) B and T ( a , b ) = ( b + a , b a ) = ( x , y ) . As a result, T is an isomorphism of semirings. □
Next, we introduce the notations that play a significant role in our results for this section. For r [ 0 , 1 ] , we let
I r = { ( x , y ) R 2 | r x | y | } if r 0 { ( x , 0 ) R 2 | x 0 } if r = 0 ,
and
I r * = { ( x , y ) R 2 | r x > | y | } if r 0 { ( x , 0 ) R 2 | x > 0 } if r = 0 ,
Remark 2.
From Proposition 2, we know that T is an isomorphism of semirings. The following sets are isomorphic:
  • { ( a , 0 ) R 2 | a 0 } { ( a , b ) B | a = b } ;
  • { ( 0 , b ) R 2 | b 0 } { ( a , b ) B | a = b } ;
  • I ( 1 , 1 ) ¯ I 0 ;
  • I ( s , t ) ¯ I r ; I ( s , t ) I r * , where r = s t s + t .
Theorem 10.
Let I be any nonempty subset of B .
1. 
For a closed set I of B , I is an ideal on B if and only if there exists r ( 0 , 1 ] such that I = I r or I = I 0 .
2. 
For an open set I { ( 0 , 0 ) } of B , I is an ideal on B if and only if there exists r ( 0 , 1 ] such that I = I r * { ( 0 , 0 ) } .
Proof. 
  • Clearly, I 0 is a closed set and an ideal of B , and I r is a closed set of B . To show that I r is an ideal of B , let ( x , y ) , ( a , b ) I r . Then, r x | y | and r a | b | . So, r ( x + a ) | y | + | b | | y + b | . This implies that ( x , y ) + ( a , b ) = ( x + a , y + b ) I r . Let ( u , v ) B . Since r x | y | and u | v | , we have r ( x u ) | y v | and then ( x , y ) ( u , v ) = ( x u , y v ) I r . Now, we shall proceed to prove the sufficient condition. Assume that I is an ideal on B . If I I 0 , then it is easy to see that I = I 0 . Now, we can assume that there exists ( a , b ) I such that a > 0 and b 0 since I is an ideal. Let R = | y | x | ( x , y ) I . Then, R . Since x | y | 0 for any ( x , y ) I B , we conclude that 1 is an upper bound of the set R. So, we can let r = sup R . Since ( a , b ) I and | b | a > 0 , it follows that r has to be an element in ( 0 , 1 ] . Since I is a closed set, there exists ( c , d ) I such that | d | c = r . We now show that I = I r . Since r = sup R , | y | x r for any ( x , y ) I . That is, I I r . Conversely, for any ( x , y ) R 2 such that r x | y | , we obtain | y | r x = | d | c x and then | y | | d | x c . This implies that x c , y d B . Thus, ( x , y ) = x c , y d ( c , d ) I .
  • The outline of the proof is analogous to that of the closed set version.
Theorem 11.
For each ( s , t ) B ,
( ( s , t ) ) i = { ( 0 , 0 ) } if s = 0 I | t | s if s > 0 .
Proof. 
Let ( s , t ) B . If s = 0 , then t must be equal to zero and ( ( s , t ) ) i = { ( 0 , 0 ) } . If s > 0 and t = 0 , it follows that ( ( s , t ) ) i = I 0 . Suppose s > 0 and t 0 . We show that ( ( s , t ) ) i = I | t | s . Since | t | s s | t | , we obtain ( s , t ) I | t | s . So, ( ( s , t ) ) i I | t | s . For each ( x , y ) I | t | s , we have | t | s x | y | , that is, x s , y t B . Thus, ( x , y ) = x s , y t ( s , t ) ( ( s , t ) ) i , so I | t | s ( ( s , t ) ) i . □
Remark 3.
In actuality, the constant r ( 0 , 1 ] in Theorem 10 can be represented as r = | d | c , where ( c , d ) is the boundary point of I if I is a closed set. According to Theorem 10, for any closed ideal I of B , we can conclude that I = I | d | c for some ( c , d ) I , and then I = ( ( c , d ) ) i by Theorem 11. This means that I is a principal ideal. Hence, every ideal of B , being a closed set, is a principal ideal.
Theorem 12.
Let I be a prime ideal of a semiring B . Then, the following statements hold:
1. 
If I is a closed set, then I = { ( 0 , 0 ) } or I = I 0 .
2. 
If I { ( 0 , 0 ) } is an open set, then I = I 1 * { ( 0 , 0 ) } .
Proof. 
To show that I r and I r * are not prime ideals for any r ( 0 , 1 ) , let r ( 0 , 1 ) . Then, ( r 1 ) ( r 4 ) > 0 , and it follows that 0 < r r 2 < 1 r . Let ϵ = r r 2 . Then, ( 1 , r + ϵ ) I r * and ( 1 , r + ϵ ) I r since r + ϵ > r . But,
( 1 , r + ϵ ) ( 1 , r + ϵ ) = ( 1 , ( r + ϵ ) 2 ) I R * I r
because ( r + ϵ ) 2 = ( r + r ) 2 4 = r 2 + 2 r r + r 4 < r + 2 r ( 1 ) + r 4 = r . □
Theorem 13.
I 1 * { ( 0 , 0 ) } is a maximal ideal of a semiring B .
Proof. 
Let I be an ideal such that I 1 * { ( 0 , 0 ) } I B . Suppose I I 1 * { ( 0 , 0 ) } . Then, there exists x > 0 such that ( x , x ) I ( I 1 * { ( 0 , 0 ) } ) or ( x , x ) I ( I 1 * { ( 0 , 0 ) } ) . Since B = I 1 = ( ( x , x ) ) i = ( ( x , x ) ) i I , we have B = I . Hence, I 1 * { ( 0 , 0 ) } is a maximal ideal of B . □
The following table (see Table 3) presents a comparison of the results obtained from Theorems 4–6 in Section 3.1 and Theorems 11–13.

4. Discussion and Conclusions

Briefly, on a semiring ( B , + , · ) , where B = ( x , y ) R 2 | x , y 0 , there are only six possible forms for the ideal I (see Figure 4 and Figure 5), as follows:
  • A singleton set { ( 0 , 0 ) } ;
  • A straight line y = x ;
  • A V-shaped region I ( s , t ) ¯ = ( x , y ) R 2 | t s x y s t x , where s , t R + such that s > t ;
  • A V-shaped region I ( s , t ) { ( 0 , 0 ) } = ( x , y ) B | t s x < y < s t x { ( 0 , 0 ) } , where s , t R + such that s > t ;
  • B * { ( 0 , 0 ) } , where B * = ( x , y ) R 2 | x , y > 0 ;
  • A whole space B.
All of them are symmetric with the graph y = x . In particular, we also guarantee that every ideal of B, being a closed set, is a principal ideal. The sets { ( 0 , 0 ) } and I ( 1 , 1 ) ¯ are only two prime ideals, being closed sets. And, B * { ( 0 , 0 ) } is the only maximal ideal of a semiring B.
For more details, we study how the set
I ( s , t ) ¯ = ( x , y ) B | t s x y s t x ,
where ( s , t ) B and s t , relates to the ideal in a semiring B. Then, we find the following:
  • All nontrivial proper ideals of B, being a closed set, are in the form I ( 1 , c ) ¯ for some c ( 0 , 1 ] .
  • Every nontrivial proper ideal of B, being a closed set, is a principal ideal.
  • All possible prime ideals are classified, that is, one of the prime ideals of B is I ( 1 , 1 ) ¯ .
  • For any nonempty proper compact set A of B * , there exists a point ( s , t ) B such that ( A ) i = I ( s , t ) ¯ , where ( A ) i is the ideal of B generated by A.
  • The necessary and sufficient conditions for ( A ) i = B * { ( 0 , 0 ) } , ( A ) i = I ( s , t ) ¯ for some ( s , t ) B * , and ( A ) i = I ( 1 , 1 ) ¯ are distributed, where A { ( 0 , 0 ) } is any nonempty closed subset of B * .
Actually, we envision a V-shape of ideal I in the bipolar set B from the multiplicative definition. We consider such an element of B as a vector in R 2 space. In order to obtain a clear conceptual grasp, if we let ( 3 , 4 ) I , then each vector lies on the straight line y = 4 3 x contained in I, say L 1 , because ( 3 b , 4 b ) = ( 0 , b ) ( 3 , 4 ) I for any b 0 . In addition, ( 4 , 3 ) = ( 1 , 0 ) ( 3 , 4 ) I . Similarly, we observe that each vector lies on the straight line y = 3 4 x contained in I, say L 2 . Thus, two straight lines form the boundary of a V-shape of ideal I containing a vector ( 3 , 4 ) . Moreover, for any ( a , b ) B , the result of ( a , b ) ( 3 , 4 ) = ( 0 , a ) ( 4 , 3 ) + ( 0 , b ) ( 3 , 4 ) is a sum of two vectors, where one is in the straight line L 1 and another lies on the straight line L 2 . As a result, ( a , b ) ( 3 , 4 ) must be a vector between L 1 and L 2 . This means that it is contained in a region with two straight lines L 1 and L 2 that are the boundaries of a V-shape.
In other words, we start with one point and we end with one V-shaped region corresponding to that point. This convinces us that the ideal must be the arbitrary union of V-shaped regions that originate from any point in I. Given the character of the V-shape, it forms a chain with a partially ordered relation “⊆”, ensuring it has a maximal element by Zorn’s lemma. Lastly, we provide more details: the maximal element is I ( 1 , c ) ¯ , where c = inf y x | ( x , y ) I . In addition, we examine the structure of I on the semigroup ( B , + ) . The result in every ideal must be an arbitrary union of sets of rectangular shapes indexed by some set. So, we would like to move on from the concept of ideals to the theory of modules.
Moreover, in Section 3.2, we transform the set B by applying the semiring isomorphism T ( a , b ) = ( b + a , b a ) so that B B , where B = { ( x , y ) R 2 | x | y | } . The main differences between ( B , + , · ) and ( B , + , · ) lie in the multiplicative operations of B and B . So, we can avoid the complicated effect of multiplication on B ( a , b ) ( c , d ) = ( a d b c , a c + b d ) for ( a , b ) , ( c , d ) B —compared to the easier multiplication on B ( a , b ) ( c , d ) = ( a c , b d ) for ( a , b ) , ( c , d ) B . This streamlines many details in the proofs of our main results, Theorems 3–6, making them neater (see Theorems 10–13).

Author Contributions

Conceptualization, K.L. and P.K.; Methodology, K.L. and P.K.; Investigation, K.L. and P.K.; Writing—original draft, K.L. and P.K.; Writing—review—editing, K.L. and P.K.; Visualization, K.L. and P.K. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

We would like to express our gratitude to Curt Hrad Barnes and Pajaree Sonsungsan for their meticulous language scrutiny. We would like to thank Wen-Ran Zhang, Rasimate Maungchang, and Thawit Hanvattanakul for their support. Additionally, we are grateful to the reviewers for carefully reading the manuscript and providing helpful remarks, especially for introducing the set B and the mapping T.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Katsov, Y.; Nam, T.G.; Zumbragel, J. On simpleness of semirings and complete semirings. J. Algebra Its Appl. 2014, 13, 1450015. [Google Scholar] [CrossRef]
  2. Nasehpour, P. Some remarks on ideals of commutative semirings. Quasigr. Relat. Syst. 2018, 26, 281–298. [Google Scholar]
  3. Chajda, I.; Langer, H. Ideals and their complements in commutative semirings. Soft Comput. 2019, 23, 5385–5392. [Google Scholar] [CrossRef] [PubMed]
  4. Korbelar, M. Torsion factors of commutative monoid semirings. Semigroup Forum 2023, 106, 662–675. [Google Scholar] [CrossRef]
  5. Goswami, J.; Boro, L. On the Weakly Nilpotent Graph of a Commutative Semiring. Bol. Soc. Paran. Mat. 2023, 41, 1–10. [Google Scholar] [CrossRef]
  6. Zhang, W.R. YinYang Bipolar Relativity: A Unifying Theory of Nature, Agents and Causality with Applications in Quantum Computing, Cognitive Informatics and Life Sciences; IGI Global Publishing: Hershey, PA, USA, 2011. [Google Scholar]
  7. Zhang, W.R.; Chen, S.S. Equilibrium and non-equilibrium modeling of YinYang Wuxing for diagnostic decision analysis in traditional Chinese medicine. Int. J. Inf. Technol. Decis. Mak. 2009, 8, 529–548. [Google Scholar] [CrossRef]
  8. Zhang, W.R.; Zhang, H.J.; Shi, Y.; Chen, S.S. Bipolar linear algebra and YinYang-n-element cellular networks for equilibrium-based biosystem simulation and regulation. J. Biol. Syst. 2009, 17, 547–576. [Google Scholar] [CrossRef]
  9. Zhang, W.R. Ground-0 axioms vs. first principles and second law: From the geometry of light and logic of photon to mind-light-matter unity-AI&QI. IEEE/CAA J. Autom. Sin. 2021, 8, 534–553. [Google Scholar] [CrossRef]
  10. Varol, B.P.; Malkoç, H. Bipolar fuzzy supra topology via (Q-) neighborhood and its application in data mining process. Symmetry 2024, 16, 216. [Google Scholar] [CrossRef]
  11. Hebisch, U.; Weinert, H.J. Semirings-Algebraic Theory and Applications in Computer Science; World Scientific: Singapore, 1998. [Google Scholar]
  12. Golan, J.S. Semirings and Their Applications; Springer: Dordrecht, The Netherlands, 1999. [Google Scholar]
Figure 1. The result of ( a , b ) + ( c , d ) = ( a c , b + d ) .
Figure 1. The result of ( a , b ) + ( c , d ) = ( a c , b + d ) .
Symmetry 16 00924 g001
Figure 2. The result of ( a , b ) ( c , d ) = ( a d b c , a c + b d ) . In contrast, ( a d b c , a c + b d ) = ( 0 , a ) ( d , c ) + ( 0 , b ) ( c , d ) .
Figure 2. The result of ( a , b ) ( c , d ) = ( a d b c , a c + b d ) . In contrast, ( a d b c , a c + b d ) = ( 0 , a ) ( d , c ) + ( 0 , b ) ( c , d ) .
Symmetry 16 00924 g002
Figure 3. (Left) The V-shaped region I ( s , t ) ¯ . (Right) The V-shaped region I ( s , t ) .
Figure 3. (Left) The V-shaped region I ( s , t ) ¯ . (Right) The V-shaped region I ( s , t ) .
Symmetry 16 00924 g003
Figure 4. Trivial ideals in a semiring B.
Figure 4. Trivial ideals in a semiring B.
Symmetry 16 00924 g004
Figure 5. Non-trivial ideals in a semiring B.
Figure 5. Non-trivial ideals in a semiring B.
Symmetry 16 00924 g005
Figure 6. Ideals in a semiring B * .
Figure 6. Ideals in a semiring B * .
Symmetry 16 00924 g006
Figure 7. The map T from B to B .
Figure 7. The map T from B to B .
Symmetry 16 00924 g007
Table 1. Open and closed sets in B.
Table 1. Open and closed sets in B.
Ideals in a Semiring BOpenClosed
{ ( 0 , 0 ) }
B
B * { ( 0 , 0 ) }
I ( s , t ) ¯
I ( 1 , 1 ) ¯
I ( s , t ) { ( 0 , 0 ) }
Table 2. Open and closed sets in B * .
Table 2. Open and closed sets in B * .
Ideals in a Semiring B * OpenClosed
B *
I ( s , t )
I ( 1 , 1 ) ¯ { ( 0 , 0 ) }
I ( s , t ) ¯ { ( 0 , 0 ) }
Table 3. Comparison between main results in Section 3.1 and Section 3.2.
Table 3. Comparison between main results in Section 3.1 and Section 3.2.
TypeIn B In B
Principal Ideal { ( 0 , 0 ) } { ( 0 , 0 ) }
I | t | s where s | t | I s + | t | 2 , s | t | 2 ¯ where s | t |
Prime Ideal { ( 0 , 0 ) } { ( 0 , 0 ) }
I 0 I ( 1 , 1 ) ¯
I 1 * { ( 0 , 0 ) } B * { ( 0 , 0 ) }
Maximal Ideal I 1 * { ( 0 , 0 ) } B * { ( 0 , 0 ) }
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Laipaporn, K.; Khachorncharoenkul, P. Ideals in Bipolar Quantum Linear Algebra. Symmetry 2024, 16, 924. https://doi.org/10.3390/sym16070924

AMA Style

Laipaporn K, Khachorncharoenkul P. Ideals in Bipolar Quantum Linear Algebra. Symmetry. 2024; 16(7):924. https://doi.org/10.3390/sym16070924

Chicago/Turabian Style

Laipaporn, Kittipong, and Prathomjit Khachorncharoenkul. 2024. "Ideals in Bipolar Quantum Linear Algebra" Symmetry 16, no. 7: 924. https://doi.org/10.3390/sym16070924

APA Style

Laipaporn, K., & Khachorncharoenkul, P. (2024). Ideals in Bipolar Quantum Linear Algebra. Symmetry, 16(7), 924. https://doi.org/10.3390/sym16070924

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop