A general theory of almost factoriality (Q1072601): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q589156 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Ezio Stagnaro / rank | |||
Normal rank |
Revision as of 12:49, 16 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A general theory of almost factoriality |
scientific article |
Statements
A general theory of almost factoriality (English)
0 references
1985
0 references
The paper deals with a generalization of the notion of almost factoriality, or semifactoriality, of a commutative integral domain R, by dropping the hypothesis that R is Krull. [For the same generalization, even if with results in other directions, cf. the reviewer, Ann. Univ. Ferrara, Nuova Ser., Sez. VII 19, 157-179 (1974; Zbl 0306.13004)]. From the introduction: ''Let R be a commutative integral domain with 1. The non-zero elements a, b of R may be called v-coprime if \(aR\cap bR=abR\). A Krull domain is called almost factorial if for all f, g in R there is \(n\in N\) such that \(f^ nR\cap g^ nR\) is principal. From this it is easy to establish that if R is almost factorial then for all x in R there is \(n\in N\) such that \(x^ n=p_ 1p_ 2...p_ r\) where \(p_ i\) are mutually v-coprime primary elements and that this expression is unique. In this article we drop the requirement that R be Krull and replace the primary elements by elements called prime blocks and develop a theory of almost factoriality, a special case of which is the theory of almost factorial Krull domains. We start with the definition that a non- zero non-unit \(p\in R\) is a prime block if for all x,y\(\in R\) with x, y both v-coprime to p there exist n(x,y)\(\in N\) and \(d\in R\) such that \((x^ n,y^ n)\subseteq dR\) and at least one of \(x^ n/d, y^ n/d\) is v-coprime to p. Using this definition we show that if a non-unit x is expressible as a product of finitely many prime blocks then it is expressible uniquely as a product of mutually v-coprime prime blocks. Thus a ''general almost factorial ring'' is an integral domain R such that for all \(x\in R-\{0\}\) there is n(x)\(\in N\) such that \(x^ n\) is expressible as a product of prime blocks. Here we take a unit as an empty product. We show that a general almost UFD R is an almost GCD (AGCD) domain that is for x,y\(\in R\) there is \(n\in N\) such that \(x^ nR\cap y^ nR\) is principal. Unlike the UFD's and GCD-domains a general almost UFD and hence an almost GCD-domain may not be integrally closed. An example of a non-integrally closed general almost UFD is constructed to establish this point. We also study the relationship between an almost GCD-domain and its integral closure. It is interesting to note that the integral closure of an almost GCD-domain is an almost GCD-domain.''.
0 references
almost factoriality
0 references
semifactoriality
0 references
prime blocks
0 references
general almost UFD
0 references
almost GCD-domain
0 references
integral closure
0 references