Factorizations in Modules and Splitting Multiplicatively Closed Subsets
Ashkan Nikseresht

TL;DR
This paper explores how multiplicatively closed subsets that split modules can be used to analyze factorization properties in commutative rings and their localizations, leading to Nagata-type theorems.
Contribution
It introduces the concept of splitting multiplicatively closed subsets in modules and applies this to study factorization and localization properties in rings.
Findings
Defined splitting multiplicatively closed subsets in modules
Established connections between factorization properties of rings and their localizations
Derived Nagata-type theorems for integral domains
Abstract
We introduce the concept of multiplicatively closed subsets of a commutative ring which split an -module and study factorization properties of elements of with respect to such a set. Also we demonstrate how one can utilize this concept to investigate factorization properties of and deduce some Nagata type theorems relating factorization properties of to those of its localizations, when is an integral domain.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRings, Modules, and Algebras · Advanced Algebra and Logic · Axon Guidance and Neuronal Signaling
Factorizations in Modules and Splitting Multiplicatively Closed Subsets
Ashkan Nikseresht
*Department of Mathematics, Institute for Advanced Studies in Basic Sciences,
P.O. Box 45195-1159, Zanjan, Iran
E-mail: [email protected]*
Abstract
We introduce the concept of multiplicatively closed subsets of a commutative ring which split an -module and study factorization properties of elements of with respect to such a set. Also we demonstrate how one can utilize this concept to investigate factorization properties of and deduce some Nagata type theorems relating factorization properties of to those of its localizations, when is an integral domain.
†† Keywords: splitting multiplicatively closed subset; factorization; atomicity.†† MSC 2010: 13A05; 13F15; 13C99.
1 Introduction
Throughout this paper all rings are commutative with identity and all modules are unitary. We assume that all modules are nonzero. Also denotes a ring and is an -module.
Theory of factorization in commutative rings which has a long history (see for example [18]), still gets a lot of attention from various researchers. To see some recent papers on this subject, the reader is referred to [4, 5, 13, 10, 11, 12, 14, 15, 20, 19, 17, 1]. In [6, 7], D. D. Anderson and S. Valdes-Leon generalized the theory of factorization in integral domains to commutative rings with zero divisors and to modules as well. These concepts are further studied in [4, 12, 1, 8, 20].
One of the longstanding questions in this subject is “what is the relationship between factorization properties of and those of its localizations?”, especially when is a domain (see for example [3, 8, 18]). In particular, many have tried to give conditions under which, if is a UFD (or has other types of factorization properties), then is so, where is a multiplicatively closed subset of . For example [16, Corollary 8.32], says that if is a Krull domain and is generated by a set of primes and is a UFD, then is a UFD. This type of results, are called Nagata type theorems due to a theorem of Nagata in [18]. One can find some other similar results and a brief review of this subject in [3, Section 3].
On the other hand, in [19] the concept of factorization with respect to a saturated multiplicatively closed subset (also called a divisor closed multiplicative submonoid) of is introduced. If we apply Theorem 3.9 of that paper with and assume that is an integral domain, then we get a Nagata type result which states that if is a bounded factorization domain and as an -module is an -bounded factorization module, then is a bounded factorization domain (for exact definitions, see Section 2). It is still unknown whether the similar result holds for other factorization properties such as unique or finite factorization (see [19, Question 3.11]).
The main aim of this research is to find partial answers to the above question and utilize them to find relations between factorization properties of and , especially when is a domain. For this, we generalize the concept of an splitting multiplicatively closed subset in [3] which is of key importance in the results of that paper. Interestingly, we find out that this concept is equivalent to another one which is completely stated in terms of factorization properties with respect to a saturated multiplicatively closed subset.
In Section 2, we briefly review the concepts of factorization theory with respect to a saturated multiplicatively closed subset. Then in Section 3, we state the definition of a multiplicatively closed subset which splits and study basic properties of such sets. In Section 4, we present our main results, which state how factorization properties of and are related when splits . Finally, in Section 5, we present an example in which is an integral domain to show how our result could be applied in order to study factorization properties of integral domains.
In the following, by and we mean the set of units and Jacobson radical of , respectively. Furthermore, , where , means the set of zero divisors of , that is, . In addition, (resp. ) denotes the annihilator in of (resp. in of ). Any other undefined notation is as in [9].
2 A brief review of factorization with respect to a saturated multiplicatively closed subset
In this section we recall the main concepts of factorization with respect to a saturated multiplicatively closed subset of which is needed in this paper. For more details and several examples the reader is referred to [19]. In the sequel, always denotes a saturated multiplicatively closed subset of (we let to contain 0, which means ).
We say that two elements, and of , are -associates and write , if there exist such that and . They are called -strong associates, if for some and we denote it by . Also we call them -very strong associates, denoted by , when and either or from for some it follows that .
In the case that , we drop the prefixes. In this case, our notations coincide with that of [6, 7]. An is called -primitive (resp. -strongly primitive, -very strongly primitive), when for some implies (resp. , ). A nonunit element is called irreducible (resp. strongly irreducible, very strongly irreducible) if for some , implies or (resp. or , or ). Note that here by being associates in , we mean being associates in as an -module.
By an -factorization of with length , we mean an equation where ’s are nonunits in , and . If moreover, for some {irreducible, strongly irreducible, very strongly irreducible} and {primitive, strongly primitive, very strongly primitive} ’s are and is -, we call this an ()--factorization. If every nonzero element of has an ()--factorization, we say that is ()--atomic.
By an -atomic factorization we mean an (irreducible, primitive)--factorization and by an -atomic module we mean a module which is (irreducible, primitive)--atomic. Also we say two -atomic factorizations are isomorphic, if , and for a permutation of , we have for all .
We say that is -présimplifiable when from (), we can deduce that or . By [19, Theorem 2.7(ii)], this is equivalent to saying that the three relations , and coincide or to asserting that is reflexive. In particular, all kinds of -primitivity and also by [19, Theorem 2.7(iv)], all types of -factorization are equivalent for a nonzero element of , if is -présimplifiable.
We call a module , an -unique factorization module or -UFM (resp. -finite factorization module or -FFM), when is -atomic and every nonzero element of has exactly one (resp. finitely many) -atomic factorization up to isomorphism. Also we say that is an -bounded factorization module or -BFM, if for every there is an such that the length of every -factorization of is at most and say that is an -half factorial module or -HFM when is -atomic and for each element the length of all -atomic factorizations of are the same.
Note that in the cases that or , these concepts coincide with the previously defined notations (see [6, 7, 20]). For example an integral domain is a UFD if and only if it is an -UFM over itself. Moreover, a BFR (bounded factorization Ring) means a ring which is a BFM over itself and a FFD (finite factorization domain) means a domain which is a -BFM. The notations UFR, FFR, BFD, HFD, …, have similar meanings. Also, we sometimes say has unique factorization (or has finite factorization or is présimplifiable, …) with respect to instead of saying is an -UFM (or -FFM or -présimplifiable, …).
Furthermore, if , we say that has unique factorization in when every nonzero nonunit element in has unique factorization (with respect to ). Similar notations are used for other factorization properties. In the following remark, we collect some observations which will be used in the paper without any further mention.
Remark 2.1**.**
- (i)
Every -UFM is both an -FFM and an -HFM by definition and every -BFM is -présimplifiable (see remarks on page 8 of [19]). 2. (ii)
If has unique factorization in , then it is half factorial and has finite factorization in and if has bounded factorization in , then it is présimplifiable in . Also if is a saturated multiplicatively closed subset or more generally, has the property that leads to and , then being half factorial or having finite factorization in results to having bounded factorization in (see the second paragraph of [19, p. 8]). 3. (iii)
It is straightforward to see if and , then all kinds of -primitivity for are equivalent to being a unit and for elements in , any type of -associativity is equivalent to the corresponding type of -associativity, since is assumed to be saturated. 4. (iv)
An element is -very strongly primitive, if and only if from for some and , we can deduce .
It should be mentioned that one can define other kinds of isomorphisms using different types of associativity and also many forms of UFM, HFM, … based on the choice of the type of irreducibility, primitivity and isomorphism (see [6, 7] for the case ). But in order not to make the paper too long, we just investigate the forms defined above, mentioning that similar techniques could be utilized to get similar results on the other forms.
3 -splitting multiplicatively closed subsets
A main concept used in [3] to relate factorization in and is the notion of a splitting multiplicatively closed subset of . A saturated multiplicatively closed subset of a domain is called a splitting multiplicative set, when for each , for some and such that for all . An equivalent condition is that principal ideals of contract to principal ideals in [3, Lemma 1.2]. Here we will restate this condition using factorization properties of the -module with respect to and generalize it to every -module . For this we need some more definitions.
Definition 3.1**.**
By a compact -atomic factorization of an element , we mean an equation of the form for and -primitive element . We say that a subset is compactly -atomic if every nonzero element of has a compact -atomic factorization. If is compactly -atomic and for every and compact -atomic factorizations of , we have (resp. and ), then is called semi--factorable (resp. -factorable).
Clearly every -atomic module is compactly -atomic but the following example shows that the converse is not true. This example also shows that not all -UFM’s are factorable. Note that as usual when , we drop the prefixes.
Example 3.2**.**
Let be a ring with no irreducible elements (such as the domain in [19, Example 2.14]) and , then the -module is not atomic but is compactly atomic and even factorable, since is the only compact atomic factorization of an up to associates. Also if for a maximal ideal of , then as in [19, Example 2.14], is a UFM which is not even semi-factorable, since for any nonunit and any , are two compact atomic factorizations of and . Note that if we choose to be a valuation domain of Krull dimension 1 which is not a discrete valuation domain, then is présimplifiable.
On the other hand, if is an -UFM and is atomic in , then is -factorable. Because if is a compact -atomic factorization of a nonzero element , then by replacing with its atomic factorization, we get the unique -atomic factorization of and hence and are unique up to -associates. Some properties of semi--factorable modules is stated in the next proposition.
Proposition 3.3**.**
Suppose that is a semi--factorable subset of .
- (i)
If is -primitive, then and is -very strongly primitive. 2. (ii)
If , then is -factorable. 3. (iii)
If , then is présimplifiable in , all kinds of irreducibility are equivalent for elements in and all kinds of associativity are equivalent for pairs of elements in .
Proof.
(i): It is easy to see that . Now if for some , then since is -primitive, there is an such that , hence and by , it follows that and is -very strongly primitive.
(ii): Let be two compact -atomic factorizations of . By semi--factorability, and hence for some . Since is saturated, . Now and as , we get . Since is -very strongly primitive by (i), we deduce that and hence , as required.
(iii): Assume that for some and let be an -primitive element of . Since is saturated, and because and , we get and by (i), it follows that . Therefore, is présimplifiable in . Other parts of the claim follows from [6, Theorem 2.2(2)] or [19, Theorem 2.7(iv)]. ∎
Part (ii) of the above proposition shows that if , then semi--factorability and -factorability are equivalent. Indeed, the author does not know an example of a semi--factorable module which is not -factorable even when is nonempty.
The next theorem and the remark following it, state conditions under which -factorization properties of are determined by factorization properties of elements in .
Theorem 3.4**.**
Suppose that is semi--factorable, and let be one of the following properties: being présimplifiable, having unique factorization, having finite factorization, being half factorial, having bounded factorization, being atomic. Then has with respect to if and only if has in .
Proof.
(): Let and . By replacing with an -primitive element appearing in its compact -atomic factorization, we can assume is -primitive. First assume atomicity. So is -atomic and has an -atomic factorization with each irreducible and , -primitive. Since is semi--factorable, we deduce that . By (3.3)(iii), , that is, for some and has an atomic factorization.
Now for the other factorization properties, note that multiplication by turns any factorization of into an -factorization of with the same length. Also this operation preserves isomorphism, so factorization properties of pass to . A similar argument takes care of being présimplifiable.
(): For = atomicity, the result is clear. Suppose that is présimplifiable in , for some and and let be a compact -atomic factorization of . Then are two compact -atomic factorizations for and hence . In particular, for some . Since is présimplifiable in , we deduce that , as required.
So assume atomicity or being présimplifiable. In any of the cases, is présimplifiable in by (2.1)(ii) and hence is -présimplifiable by the previous paragraph. Now if are two -atomic factorizations of , then by semi--factorability of , we get two -atomic factorizations of with lengths . Thus if = being half factorial, then and hence is an -HFM. The case of bounded factorization is quite similar. For having unique factorization or finite factorization, note that according to (3.3)(ii), in the above factorizations of and so if these two factorizations are non-isomorphic, then the two factorizations of are also non-isomorphic. So the number of non-isomorphic factorizations of and are the same. ∎
In several parts of the proof of the above result, we did not use the assumptions or semi--factorability of . So we get the following remark that states some weaker conditions under which, some -factorization properties of are determined by factorization properties of elements in .
Remark 3.5**.**
Note that in the proof of (3.4)(), for = having bounded factorization or being présimplifiable, we did not use any of the two assumptions. Also for other properties, we could replace the condition “” with the weaker condition “ is présimplifiable in ”.
In the proof of (3.4)(), for = being présimplifiable, atomic or half factorial or having bounded factorization, we did not need the condition “” and for the other properties we could replace the two conditions with “ is -factorable.” ∎
Combining (3.3)(iii) with the case being présimplifiable of (3.4) we get:
Corollary 3.6**.**
If is semi--factorable and , then is -présimplifiable.
Next we define the main concept of this research, namely -splitting sets.
Definition 3.7**.**
Let . We say that splits or is -splitting, when the following two conditions hold.
- (i)
is semi--factorable. 2. (ii)
For every -primitive element and -primitive element such that , the element is -primitive.
To see an example of this concept, see Section 5. The following result shows that this definition generalizes the concept of splitting multiplicative sets as defined in [3].
Theorem 3.8**.**
Suppose that is a domain. Then is a splitting multiplicative set (in the sense of [3]) if and only if splits .
Proof.
(): Note that since is a domain, it is présimplifiable and all kinds of associativity are equivalent and also all kinds of primitivity are equivalent. Suppose that is -primitive. By assumption we can write with such that for all . By -primitivity, for some . It follows that if is -primitive, then
[TABLE]
Conversely, if satisfies and for some , then , that is, for some and hence , and is -primitive. Thus satisfying is equivalent to being -primitive. Consequently, according to [3, Corollary 1.4(a)], is -factorable. Now assume that are nonzero -primitive elements of . By the above remarks and satisfy and hence by [3, corollary 1.4(b)], also satisfies and hence is -primitive, as required.
(): It suffices to show that -primitive elements of , such as , satisfy . Let , say for . If is the compact -atomic factorization of (), then are compact -atomic factorizations of , because by assumption is -primitive. So by semi--factorability, and for some . Thus and therefore, . ∎
At the end of this section we state a proposition which will be needed in the later sections.
Proposition 3.9**.**
Suppose that is -splitting, is a saturated multiplicatively closed subset of and is compactly -atomic. Then splits . If , then splits the -module .
Proof.
Suppose are two compact -atomic factorizations of . There exists an -primitive . Then are two compact -atomic factorizations of . So . Now assume are -primitive and . If is a compact -atomic factorization of and is -primitive, then and are both -primitive by condition (ii) of definition of -splitting saturated multiplicatively closed subsets and hence from we deduce that is a unit. Therefore is -primitive and splits .
To prove the claim about , it suffices to show that an is -primitive if and only if its image is -primitive in . Assume that is -primitive and . So with . Let be such that . Since is compactly -atomic, we can assume that is -primitive. Also suppose that is a compact -atomic factorization of . Then and it follows from being -splitting that , and . Thus is -primitive. The reverse implication is straightforward. ∎
4 Behavior of -factorizations under localization
Throughout this section we assume that are two saturated multiplicatively closed subsets of and set to be the saturated multiplicatively closed subset, of . We investigate how factorization properties of with respect to is related to factorization properties of with respect to , under the assumption that splits . As we will see, in the case that , we get some Nagata type theorems and also our results serve as partial answers to [19, Question 3.11]. To this end, we first study how irreducibility behaves under localization.
Proposition 4.1**.**
Suppose that splits and . Let {irreducible, strongly irreducible, very strongly irreducible}* and be the compact -atomic factorization of . Then is if and only if is so in .*
Proof.
Suppose that is very strongly irreducible and . Note that as , we must have . As and , we conclude that and hence . If is the compact -atomic factorization of (), then and thus . So is -primitive by (3.7)(ii). According to (3.3)(ii) (applied with ), we have , in particular, for some . Because is very strongly irreducible, one of ’s, say is a unit. Thus and as is not a unit of (since ), it is very strongly irreducible. Similar arguments show that if is (strongly) irreducible, then is so.
Conversely, suppose that is very strongly irreducible and . Then . So they have compact -atomic factorizations and with . Since splits and is a compact -atomic factorization of the -primitive element we deduce that and hence are both -primitive. On the other hand, and it follows from very strongly irreducibility of that for example . This means that and since is -primitive, we conclude that . Therefore, is very strongly irreducible.
Now assume that is strongly irreducible and . As in the above paragraph we see that are -primitive and . So by strongly irreducibility of it follows that for example , that is, for some . So and by (3.3)(ii) . But (3.3)(i) implies that and hence according to [19, Theorem 2.7(i)], , as required. The case irreducible is similar. ∎
Next we consider how -primitivity behaves under localization. Recall that throughout this section are saturated multiplicatively closed subsets and .
Proposition 4.2**.**
Suppose splits , and is compactly -atomic. Let , {primitive, strongly primitive, very strongly primitive}* and assume that is the compact -atomic factorization of . Then is - in the -module if and only if is - in .*
Proof.
As , we have , so we write instead of . Assume that is - and for . If and are compact -atomic factorizations of and , then we get and as splits , we deduce that . This means that and both and are -primitive. Also .
Consider the case that primitive. Then we get , that is, for , . This leads to , where is a compact -atomic factorization of with . Consequently we get and for some . As , we conclude that and hence is -primitive.
Now consider the case that strongly primitive. Then we get , whence with both . Thus and as splits , which implies by (3.3)(i) and hence by [19, Theorem 2.7(i)], , as required. We leave the similar proof of the case very strongly primitive to the reader.
Conversely, assume that is -primitive and for some and . One can readily check that if for and (resp. , ), then (resp. , ). Therefore, we can assume that and also for and . If and are compact -atomic factorizations of and with , then it follows that and hence . In particular, for some . Note that and hence are in , so as is -primitive, we deduce that , hence for some . Thus and . Since , we see that which shows that is -primitive. The proof for (very) strongly primitivity is similar. ∎
To see how -atomicity of and -atomicity of are related, we need a lemma.
Lemma 4.3**.**
Suppose that and such that is and is - where {irreducible, strongly irreducible, very strongly irreducible}, {primitive, strongly primitive, very strongly primitive}. If is semi--factorable, then is -primitive. If splits and is compactly -atomic, then is -primitive.
Proof.
If is a compact -atomic factorization of , then by -primitivity, . So for some . Thus and since is -very strongly primitive by (3.3), we deduce that is a unit and hence is -primitive.
Now assume that splits , is compactly -atomic and let be a compact -atomic factorization of . Since is irreducible, either or . In the former case, it follows that and as is saturated, we get the contradiction . So and for some . Note that since and is saturated, we must have . If is a compact -atomic factorization of , then and thus , for both sides are compact -atomic factorizations in and splits by (3.9). This means that and the result follows. ∎
Theorem 4.4**.**
Suppose that is -splitting, is compactly -atomic, {irreducible, strongly irreducible, very strongly irreducible}* and {primitive, strongly primitive, very strongly primitive}. Then the following hold.*
- (i)
If is (, )--atomic, then is (, very strongly primitive)--atomic. 2. (ii)
Assume that . Then is (, )--atomic if and only if is (, primitive)--atomic and is (, )--atomic.
Proof.
(i): If is an (, )--atomic factorization of where and , then by (4.3), and are -primitive and hence their product is also -primitive and by (3.3)(i), indeed -very strongly primitive. Therefore is an (, very strongly primitive)--atomic factorization of .
(ii): (): It follows from (i) that is (, primitive)--atomic. Suppose is an (, )--atomic factorization of where and , then by (4.3), (4.2) and (4.1), is and is -. Hence we get the (, )--atomic factorization , where . So is (, )--atomic.
(): Let . Then by assumption where are and is -primitive. Assume is an (, )-T-atomic factorization where , and let and be compact -atomic factorizations of and , respectively. Then as and hence are it follows from (4.1) that is . Similarly by (4.2), is -. Since all and are -primitive and splits , is -primitive. Now from the above factorization of it follows that for some and since and are both -primitive and by (3.3)(ii), and hence according to (3.3)(i). This implies that with . We conclude that is an (, )--atomic factorization of . ∎
To establish a version of the above theorem for other factorization properties we need:
Lemma 4.5**.**
Suppose that is semi--factorable and . If is an -UFM, -HFM or -FFM, then is an -BFM. Also if is an -BFM, then is compactly -atomic.
Proof.
Let . In either of the cases, the possible lengths of an -atomic factorization of are finite and hence there is an upper bound on these lengths. Now let where . By replacing with one of its compact -atomic factorizations, the length of this factorization does not decrease. Therefore, we can assume that is -primitive.
Let be an -atomic factorization of . If , then as is -very strongly primitive by (4.3) and (3.3)(i), we must have against our assumption. So . Similarly, we can find -atomic factorizations for each with for all . Consequently, we get an -atomic factorization . Hence and is an -BFM.
Now assume that and is an -BFM. Then there is an -primitive element . If with , then and hence . If is the largest possible length of -factorizations of , then is -very strongly primitive and the result follows. ∎
Note that although under the conditions of the first part of the above lemma, is an -BFM, but it need not be an -BFM as demonstrated in [19, Example 2.14] with and .
Theorem 4.6**.**
Suppose that is semi--factorable, and let be one of the following properties: being présimplifiable, having unique factorization, having finite factorization, being half factorial, having bounded factorization. If has with respect to then it has with respect to .
Proof.
For the case that being présimplifiable or having bounded factorization, the result is [19, Theorem 3.8] (and does not need semi--factorability or -regularity). For other cases, note that by the previous lemma, is an -BFM and hence -atomic and therefore is atomic in by (3.4). Let and . By replacing with an -primitive element appearing in an -atomic factorization of , we can assume that is -primitive. Now if is an atomic factorization, then is an -atomic factorization of with the same length and two factorizations of arising in this way are isomorphic if and only if the two factorizations of are isomorphic. Consequently, has in and hence by (3.4), has with respect to . ∎
Another condition under which, an -UFM is an -UFM is presented in [19, Theorem 3.8 & Notation 3.5].
Lemma 4.7**.**
Assume that splits , is compactly -atomic and . Let be irreducible and be -primitive. Then in if and only if in and if and only if .
Proof.
(): Trivial. (): Suppose . Then , where is a compact -atomic factorization of . Hence by (4.3), (3.9) and (3.3)(ii), and . Similarly and . The proof of the other statement is similar. ∎
Theorem 4.8**.**
Suppose that splits , and let be one of the following properties: having unique factorization, having finite factorization, being half factorial, having bounded factorization. Then has with respect to if and only if has with respect to and has with respect to . A similar statement holds for being présimplifiable, if we further assume that is compactly -atomic.
Proof.
(): According to (4.6), we just need to show that has with respect to . Note that by (4.5), in all cases is compactly -atomic. First assume that being présimplifiable and for some . If and are compact -atomic factorizations of and with , then and as splits and by (3.3), it follows that . Then for some and since is -présimplifiable and , we deduce and , as required.
For being présimplifiable, since is -atomic, it follows form (4.4) that is -atomic. Let be -primitive. If is any -factorization of and and are compact -atomic factorization of and , then which by (3.3)(ii) implies that . Also according to (4.1) and (4.2), is irreducible if and only if is so and is -primitive if and only if is so. Therefore, if for example the number of -atomic factorizations of is finite, then so is the number of -atomic factorizations of . Similarly other -factorization properties of pass to -factorization properties of . Noting that each is a unit multiple of some where is -primitive, the result is concluded.
(): The cases being présimplifiable or having bounded factorization is [19, Theorem 3.9] (with much less assumptions). So assume that having unique factorization or finite factorization or being half factorial. Note that by (4.5) applied with , we see that is -BFM and is compact -atomic. Thus it follows (4.4)(ii), that is -atomic. We prove the result for having finite factorization and the other cases follow similarly.
Let be an -atomic factorization of with and . Then by (4.3), each , and hence their product are -primitive. Consequently, is -isomorphic (and thus -isomorphic) to one of the finite -atomic factorizations of . So if we show -primitive elements of have finitely many -atomic factorizations, we are done. Thus we assume is -primitive and . Then is a -atomic factorization of by (4.1) and (4.2). Therefore, each -atomic factorization of leads to a -atomic factorization of and according to (4.7) if two such -atomic factorizations of are -isomorphic, then the original -atomic factorizations of are -isomorphic. Consequently, as has finitely many -atomic factorizations up to -isomorphisms, also has finitely many -atomic factorizations up to -isomorphism, as claimed. ∎
It should be mentioned that () of the above theorem, is a partial answer to [19, Question 3.11]. Summing up Theorems (4.4)(ii), (4.8) and (3.4), we get:
Corollary 4.9**.**
Let be two saturated multiplicatively closed subsets of and set . Suppose that splits and . For {having unique factorization, having finite factorization, being half factorial, having bounded factorization}, the following are equivalent.
- (i)
* has with respect to .* 2. (ii)
* has with respect to and has with respect to .* 3. (iii)
* has in and has with respect to .*
If we further assume that is compactly -atomic, then the above conditions are also equivalent for being présimplifiable or atomic.
If we set in the above corollary, we get some Nagata type theorems. If we further assume that and is an integral domain, then this corollary implies [3, Theorems 3.1 & 3.3] (except for ACCP and idf-domain, which are not investigated in this research). Because if is generated by primes, then every element of has a unique factorization as a product of primes and hence irreducibles, that is, has unique factorization (and whence has finite and bounded factorization and is présimplifiable, atomic and half factorial) in . Indeed, even when and is a domain, this corollary is slightly stronger than [3, Theorem 3.1], since in our results need not be generated by primes. An example in which is not generated by primes is presented in the next section.
5 An application
We present an example which shows how our main result (4.9), could be applied in the case that and is an integral domain, the classical and most important situation in the factorization theory. Note that in this case, is présimplifiable and hence all types of associativity (resp. irreducibility, primitivity) are equivalent to each other. Also if splits , then is compactly -atomic and hence (4.9) could be applied for all {having unique factorization, having finite factorization, being half factorial, having bounded factorization, being atomic}. First let’s state the setting of our example as a notation.
Notation 5.1**.**
In this section, we assume that where are integral domains and . Also we set and denote the quotient field of by .
It is easy to see that is a saturated multiplicatively closed subset of , indeed, it is the saturated multiplicatively closed subset generated by . Also if and , then , while . So is not prime and is not generated by primes if .
Theorem 5.2**.**
The set splits if and only if all of the following conditions hold:
- (i)
* splits ;* 2. (ii)
for every there are and such that ; 3. (iii)
.
In particular, if either is a filed or is any -splitting saturated multiplicatively closed subset of and , then splits .
Proof.
(): Note that if , and for some , then and . Thus is -primitive if and only if it is -primitive and so (i) follows as splits . To see (ii), let . If is -primitive, then should be -primitive by (ii) of Definition (3.7). But is an -factorization of , a contradiction. So is not -primitive. Thus if its compact -atomic factorization is , with and -primitive , then . Whence and for some and (ii) follows with .
Now let and for some . Assume that and are compact -atomic (hence -atomic) factorizations of and . Then are two compact -atomic factorizations of , therefore by uniqueness of such factorizations we have , that is, . Consequently, .
(): Suppose that with and . If , then has a compact -atomic factorization where . Therefore is a compact -atomic factorization of (note that is -primitive, since is so). If , then by (ii), there are and such that . If is the compact -atomic factorization of , then set . Thus we get the compact -factorization . Thus is compactly -atomic and is -primitive if and only if is nonzero and -primitive in . In particular, if are -primitive, then is -primitive in by (i) and is -primitive.
It remains to show the uniqueness of compact -factorizations of . Assume that and are two -atomic factorizations of where and are -primitive and . Therefore, by the previous paragraph, , are -primitive and hence . Also and hence , by (iii). Consequently, for some and . If is the compact -atomic factorization of , then . Since both and are -primitive, we must have and in particular, . Similarly , hence and as is a domain, for some . It follows that and hence , as required. ∎
Thus in particular, we can apply (4.9) with , in the case . Since in this case is prime, has unique factorization in and hence we get
Corollary 5.3**.**
If is an integral domain, then is atomic (resp. a BFD, a FFD, a HFD, a UFD) if and only if is so.
Theorem 5.4**.**
Using Notation 5.1 and assuming that the conditions (i)–(iii) of (5.2) hold, then we have
- (i)
* is atomic (resp. a BFD, a HFD) if and only if and is atomic (resp. a BFD, a HFD).* 2. (ii)
* is a FFD if and only if and is a FFD.* 3. (iii)
* is a UFD if and only if and is a UFD.*
Proof.
In all cases, by applying (4.9), we deduce that has the desired property if and only if has in and has . Thus according to (5.3), we just need to show that in each case, has in if and only if the stated condition on and is satisfied.
(i): Assume is atomic in . Then has decomposition with irreducible and such that is irreducible in . If , then and as is irreducible, it follows that . Conversely, if , then is irreducible for each and hence is an atomic factorization of . Also in any atomic factorization of exactly terms of the form appear where . Since irreducible elements of are exactly those of the form for , it follows that any atomic factorization of has length and is half factorial and has bounded factorization in .
(ii): If has finite factorization in , then it is atomic in and hence by (i), and the irreducible elements in are of the form for . Note that if and only if if and only if the image of in the quotient group are equal. So if are infinite elements of , such that for each , then we can find an infinite set of non-isomorphic atomic factorizations of .
Conversely, suppose that . If , then and hence . Therefore, by (i) is atomic and half factorial in and irreducibles of in are of the form with . Since every atomic factorization of has the same length , to show that it has finitely many factorizations it suffices to show that it has only finitely many non-associate irreducible divisors. But there are non-associate irreducible elements in , because if and only if , and we are done. The proof of (iii) is similar. ∎
This theorem generalizes the following previously known result (for example, it is an immediate consequence of the propositions considering the construction in [2]) which follows from (5.4) in the case that is a field.
Corollary 5.5**.**
Assume that is a field. Then is atomic if and only if is a BFD if and only if is a HFD if and only if is a field. Also is a FFD (resp. UFD) if and only if is a field and (resp. ).
Acknowledgement
This research was financially supported by a grant of National Elites Foundation of Iran. The author would like to thank the referee for his/her nice comments.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Alan, On finite factorization rings, Comm. Algebra , 40 (2012), 4089–4099.
- 2[2] D. D. Anderson, D. F. Anderson and M. Zafrullah, Factorization in integral domains, J. Pure Appl. Algebra, 69 (1990), 1–19.
- 3[3] —, Factorization in integral domains II, J. Algebra, 152 (1992), 78–93.
- 4[4] D. D. Anderson, Amit Ganatra, Bounded Factorization Rings, Comm. Alg. , 35 (2007), 3892–3903.
- 5[5] D. D. Anderson and S. Chun, Irreducible elements in commutative rings with zero-divisors, Houston J. Math. , 37:3 (2011), 741–744.
- 6[6] D. D. Anderson and S. Valdes-Leon, Factorization in commutative rings with zero divisors, Rocky Mount. J. Math., 26 (1996), 439–480.
- 7[7] —, Factorization in commutative rings with zero divisors, II, Lecture Notes in Pure and Applied Math., Marcel Dekker, 189 (1997), 197–219.
- 8[8] A. G. Aḡargün, D. D. Anderson and S. Valdes-Leon, Factorization in commutative rings with zero divisors, III, Rocky Mount. J. Math., 31 (2001), 1–21.
