Recent from talks
Nothing was collected or created yet.
Unique factorization domain
View on Wikipedia
| Algebraic structures |
|---|
In mathematics, a unique factorization domain (UFD) (also sometimes called a factorial ring following the terminology of Bourbaki) is a ring in which a statement analogous to the fundamental theorem of arithmetic holds. Specifically, a UFD is an integral domain (a nontrivial commutative ring in which the product of any two non-zero elements is non-zero) in which every non-zero non-unit element can be written as a product of irreducible elements, uniquely up to order and units.
Important examples of UFDs are the integers and polynomial rings in one or more variables with coefficients coming from the integers or from a field.
Unique factorization domains appear in the following chain of class inclusions:
- rngs ⊃ rings ⊃ commutative rings ⊃ integral domains ⊃ integrally closed domains ⊃ GCD domains ⊃ unique factorization domains ⊃ principal ideal domains ⊃ euclidean domains ⊃ fields ⊃ algebraically closed fields
Definition
[edit]Formally, a unique factorization domain is defined to be an integral domain R in which every non-zero element x of R which is not a unit can be written as a finite product of irreducible elements pi of R:
- x = p1 p2 ⋅⋅⋅ pn with n ≥ 1
and this representation is unique in the following sense: If q1, ..., qm are irreducible elements of R such that
- x = q1 q2 ⋅⋅⋅ qm with m ≥ 1,
then m = n, and there exists a bijective map φ : {1, ..., n} → {1, ..., m} such that pi is associated to qφ(i) for i ∈ {1, ..., n}.
Examples
[edit]Most rings familiar from elementary mathematics are UFDs:
- All principal ideal domains, hence all Euclidean domains, are UFDs. In particular, the integers (also see Fundamental theorem of arithmetic), the Gaussian integers and the Eisenstein integers are UFDs.
- If R is a UFD, then so is R[X], the ring of polynomials with coefficients in R. Unless R is a field, R[X] is not a principal ideal domain. By induction, a polynomial ring in any number of variables over any UFD (and in particular over a field or over the integers) is a UFD.
- The formal power series ring K[[X1, ..., Xn]] over a field K (or more generally over a regular UFD such as a PID) is a UFD. On the other hand, the formal power series ring over a UFD need not be a UFD, even if the UFD is local. For example, if R is the localization of k[x, y, z]/(x2 + y3 + z7) at the prime ideal (x, y, z) then R is a local ring that is a UFD, but the formal power series ring R[[X]] over R is not a UFD.
- The Auslander–Buchsbaum theorem states that every regular local ring is a UFD.
- is a UFD for all integers 1 ≤ n ≤ 22, but not for n = 23.
- Mori showed that if the completion of a Zariski ring, such as a Noetherian local ring, is a UFD, then the ring is a UFD.[1] The converse of this is not true: there are Noetherian local rings that are UFDs but whose completions are not. The question of when this happens is rather subtle: for example, for the localization of k[x, y, z]/(x2 + y3 + z5) at the prime ideal (x, y, z), both the local ring and its completion are UFDs, but in the apparently similar example of the localization of k[x, y, z]/(x2 + y3 + z7) at the prime ideal (x, y, z) the local ring is a UFD but its completion is not.
- Let be a field of any characteristic other than 2. Klein and Nagata showed that the ring R[X1, ..., Xn]/Q is a UFD whenever Q is a nonsingular quadratic form in the Xs and n is at least 5. When n = 4, the ring need not be a UFD. For example, R[X, Y, Z, W]/(XY − ZW) is not a UFD, because the element XY equals the element ZW so that XY and ZW are two different factorizations of the same element into irreducibles.
- The ring Q[x, y]/(x2 + 2y2 + 1) is a UFD, but the ring Q(i)[x, y]/(x2 + 2y2 + 1) is not. On the other hand, The ring Q[x, y]/(x2 + y2 − 1) is not a UFD, but the ring Q(i)[x, y]/(x2 + y2 − 1) is.[2] Similarly the coordinate ring R[X, Y, Z]/(X2 + Y2 + Z2 − 1) of the 2-dimensional real sphere is a UFD, but the coordinate ring C[X, Y, Z]/(X2 + Y2 + Z2 − 1) of the complex sphere is not.
- Suppose that the variables Xi are given weights wi, and F(X1, ..., Xn) is a homogeneous polynomial of weight w. Then if c is coprime to w and R is a UFD and either every finitely generated projective module over R is free or c is 1 mod w, the ring R[X1, ..., Xn, Z]/(Zc − F(X1, ..., Xn)) is a UFD.[3]
Non-examples
[edit]- The quadratic integer ring of all complex numbers of the form , where a and b are integers, is not a UFD because 6 factors as both 2×3 and as . These truly are different factorizations, because the only units in this ring are 1 and −1; thus, none of 2, 3, , and are associate. It is not hard to show that all four factors are irreducible as well, though this may not be obvious.[4] See also Algebraic integer.
- For a square-free positive integer d, the ring of integers of will fail to be a UFD unless d is a Heegner number.
- The ring of formal power series over the complex numbers is a UFD, but the subring of those that converge everywhere, in other words the ring of entire functions in a single complex variable, is not a UFD, since there exist entire functions with an infinity of zeros, and thus an infinity of irreducible factors, while a UFD factorization must be finite, e.g.:
Properties
[edit]Some concepts defined for integers can be generalized to UFDs:
- In UFDs, every irreducible element is prime. (In any integral domain, every prime element is irreducible, but the converse does not always hold. For instance, the element z ∈ K[x, y, z]/(z2 − xy) is irreducible, but not prime.) Note that this has a partial converse: a domain satisfying the ACCP is a UFD if and only if every irreducible element is prime.
- Any two elements of a UFD have a greatest common divisor and a least common multiple. Here, a greatest common divisor of a and b is an element d that divides both a and b, and such that every other common divisor of a and b divides d. All greatest common divisors of a and b are associated.
- Any UFD is integrally closed. In other words, if R is a UFD with quotient field K, and if an element k in K is a root of a monic polynomial with coefficients in R, then k is an element of R.
- Let S be a multiplicatively closed subset of a UFD A. Then the localization S−1A is a UFD. A partial converse to this also holds; see below.
Equivalent conditions for a ring to be a UFD
[edit]A Noetherian integral domain is a UFD if and only if every height 1 prime ideal is principal (a proof is given at the end). Also, a Dedekind domain is a UFD if and only if its ideal class group is trivial. In this case, it is in fact a principal ideal domain.
In general, for an integral domain A, the following conditions are equivalent:
- A is a UFD.
- Every nonzero prime ideal of A contains a prime element.[5]
- A satisfies ascending chain condition on principal ideals (ACCP), and the localization S−1A is a UFD, where S is a multiplicatively closed subset of A generated by prime elements. (Nagata criterion)
- A satisfies ACCP and every irreducible is prime.
- A is atomic and every irreducible is prime.
- A is a GCD domain satisfying ACCP.
- A is a Schreier domain,[6] and atomic.
- A is a pre-Schreier domain and atomic.
- A has a divisor theory in which every divisor is principal.
- A is a Krull domain in which every divisorial ideal is principal (in fact, this is the definition of UFD in Bourbaki.)
- A is a Krull domain and every prime ideal of height 1 is principal.[7]
In practice, (2) and (3) are the most useful conditions to check. For example, it follows immediately from (2) that a PID is a UFD, since every prime ideal is generated by a prime element in a PID.
For another example, consider a Noetherian integral domain in which every height one prime ideal is principal. Since every prime ideal has finite height, it contains a height one prime ideal (induction on height) that is principal. By (2), the ring is a UFD.
See also
[edit]Citations
[edit]- ^ Bourbaki (1972), 7.3, no 6, Proposition 4
- ^ Samuel (1964), p. 35
- ^ Samuel (1964), p. 31
- ^ Artin (2011), p. 360
- ^ Kaplansky
- ^ A Schreier domain is an integrally closed integral domain where, whenever x divides yz, x can be written as x = x1 x2 so that x1 divides y and x2 divides z. In particular, a GCD domain is a Schreier domain
- ^ Bourbaki (1972), 7.3, no 2, Theorem 1.
References
[edit]- Artin, Michael (2011). Algebra. Prentice Hall. ISBN 978-0-13-241377-0.
- Bourbaki, N. (1972). Commutative algebra. Paris, Hermann; Reading, Mass., Addison-Wesley Pub. Co. ISBN 9780201006445.
- Edwards, Harold M. (1990). Divisor Theory. Boston: Birkhäuser. ISBN 978-0-8176-3448-3.
- Hartley, B.; T.O. Hawkes (1970). Rings, modules and linear algebra. Chapman and Hall. ISBN 0-412-09810-5. Chap. 4.
- Lang, Serge (1993), Algebra (Third ed.), Reading, Mass.: Addison-Wesley, ISBN 978-0-201-55540-0, Zbl 0848.13001 Chapter II.5
- Sharpe, David (1987). Rings and factorization. Cambridge University Press. ISBN 0-521-33718-6.
- Samuel, Pierre (1964), Murthy, M. Pavman (ed.), Lectures on unique factorization domains, Tata Institute of Fundamental Research Lectures on Mathematics, vol. 30, Bombay: Tata Institute of Fundamental Research, MR 0214579
- Samuel, Pierre (1968). "Unique factorization". The American Mathematical Monthly. 75 (9): 945–952. doi:10.2307/2315529. ISSN 0002-9890. JSTOR 2315529.
- Weintraub, Steven H. (2008). Factorization: Unique and Otherwise. Wellesley, Mass.: A K Peters/CRC Press. ISBN 978-1-56881-241-0.
Unique factorization domain
View on GrokipediaCore Concepts
Definition
An integral domain is a commutative ring with unity (where ) that has no zero divisors, meaning that if for elements in the ring, then either or .[6] A unique factorization domain (UFD) is an integral domain in which every nonzero nonunit element can be expressed as a product of irreducible elements, and this factorization is unique up to the order of the factors and association by units.[6] The existence part of this definition guarantees that such a factorization into irreducibles always exists and is finite for any qualifying element.[6] The uniqueness theorem states that any two such factorizations of the same element differ only in the ordering of the irreducible factors and by multiplication of those factors by units from .[6] Two elements are associates, denoted , if there exists a unit such that .[6] For an element , the notation denotes the number of irreducible factors in its factorization (counting multiplicity).[6]Primes, Irreducibles, and Units
In an integral domain , a unit is a nonzero element such that there exists with ; the set of units forms a multiplicative group.[7] The units play a crucial role in factorization by allowing elements to be scaled without altering their essential structure. An irreducible element in an integral domain is a nonzero non-unit such that if for some , then either or is a unit.[7] Irreducibles serve as the "atoms" in factorizations, representing elements that cannot be further decomposed nontrivially. A prime element in an integral domain is a nonzero non-unit such that if divides for some , then divides or divides .[7] In any integral domain, every prime element is irreducible: if is prime and , then divides , so divides or ; assuming without loss of generality that divides , say , then , implying up to units, so is a unit (and symmetrically).[7] However, the converse does not hold in general; for instance, in the ring , the element is irreducible (as its norm is 4, a prime power in , preventing nontrivial factorization) but not prime, since it divides yet divides neither factor.[7] However, in a UFD, every irreducible element is prime.[1] Two elements are associates if for some unit ; this defines an equivalence relation, and factorizations into irreducibles are considered up to associates and ordering.[7] In unique factorization domains, every nonzero non-unit element factors uniquely into irreducibles up to such associates.Examples and Counterexamples
Principal Examples
The ring of integers is a prototypical example of a unique factorization domain, where every nonzero non-unit element factors uniquely into a product of prime numbers, up to ordering and association by units . For instance, the integer 6 factors as , and this representation is unique modulo units and permutation of factors. This property follows from the fundamental theorem of arithmetic, which guarantees both existence and uniqueness of such factorizations for all integers greater than 1. Polynomial rings in one variable over a field , denoted , are also unique factorization domains, with irreducible elements being the irreducible polynomials and units consisting of the nonzero constants in . In this setting, every nonconstant polynomial factors uniquely into irreducible polynomials, up to ordering and multiplication by units; for example, in , and no alternative irreducible factorization exists. This result relies on Gauss's lemma, which preserves primitivity and irreducibility when extending from the field to the polynomial ring. Gauss's lemma is proved using properties of primitive polynomials and reduction modulo primes (see Divisibility and Factorization Behavior for a detailed proof).[8][9] The Gaussian integers , where , form a unique factorization domain equipped with the norm function , which is multiplicative and takes nonnegative integer values. Factorizations in are unique up to units ; for example, , and since is prime in , this is an irreducible factorization with no distinct alternative. The norm enables a Euclidean algorithm in , ensuring the unique factorization property.[10] Polynomial rings in multiple variables over a field , such as for , are unique factorization domains, extending the one-variable case by induction. Specifically, , and since the base ring is a UFD, the extension preserves unique factorization into irreducible polynomials. Hilbert's basis theorem underpins this by confirming that such rings are Noetherian, allowing finite generation of ideals and supporting the iterative UFD structure without introducing non-unique factorizations.[11]Non-Examples
A classic example of an integral domain that fails to be a unique factorization domain (UFD) arises in quadratic integer rings, particularly . In this ring, the element 6 admits two distinct factorizations into irreducibles: .[2] The norm function plays a key role in establishing irreducibility; for instance, , , and , all of which are prime in , implying that 2, 3, and cannot be factored nontrivially in .[2] However, these irreducibles are not prime elements, as 2 divides but divides neither factor, demonstrating the failure of unique factorization.[2] Polynomial rings and their subrings provide further non-examples. Consider the subring of the polynomial ring over a field ; here, and are irreducible elements, yet yields two distinct factorizations into irreducibles, so is not a UFD.[12] Integral domains that are atomic—meaning every nonzero nonunit factors into irreducibles—but not UFDs highlight the specific failure of uniqueness. The ring is atomic, as all elements factor into irreducibles despite the non-unique factorization of elements like 6, but the irreducibles are not prime, allowing distinct factorizations.[13] Similarly, is atomic, with every nonzero nonunit expressible as a product of irreducibles like powers of and , yet uniqueness fails as shown.[12] For failures of existence rather than uniqueness, non-atomic domains serve as counterexamples, where some nonzero nonunits do not factor into irreducibles at all due to infinite descending chains of divisors. A prominent algebraic example is the ring of all algebraic integers in , which is an integral domain but non-atomic, as its multiplicative structure admits elements without finite factorizations into irreducibles.[14] Such domains underscore that UFDs require both existence and uniqueness of factorizations.Fundamental Properties
Key Structural Properties
A unique factorization domain (UFD) is an atomic domain, meaning that every non-zero non-unit element admits a factorization into irreducible elements.[15] This property follows directly from the existence part of the UFD definition, ensuring that factorization into irreducibles is always possible. In a UFD, every irreducible element is prime. To see this, suppose is an irreducible that is not prime, so there exist such that but and . Since is a UFD, and factor uniquely into irreducibles, leading to a contradiction with the uniqueness of factorization if divides without dividing either factor. This equivalence between irreducibles and primes distinguishes UFDs from more general atomic domains.[16] The uniqueness of factorization in a UFD implies that all irreducible factorizations of a given non-zero non-unit element have the same length, counting multiplicities up to units. This uniformity in factorization length is a direct consequence of the unique decomposition into primes (or irreducibles, since they coincide). Every UFD is a Schreier domain, an integrally closed integral domain in which every non-zero element is primal—meaning that for any factorization , the irreducible factors of and can be uniquely distributed into the irreducible factors of . Since UFDs are GCD domains, they satisfy this primal condition, ensuring weak divisibility properties across factorizations.[17] While the Noetherian property (every ideal is finitely generated) is not required for a domain to be a UFD—for instance, the polynomial ring in infinitely many variables over a field , denoted , is a non-Noetherian UFD. Every element is a polynomial in only finitely many indeterminates , so , and the latter is a UFD whenever is (in fact, is a UFD if and only if is a UFD). Thus the infinite-variable ring is a UFD. However, it is not Noetherian, since the ideal is not finitely generated (any finite generating set involves only finitely many variables, leaving others unaccounted for), or equivalently, the ascending chain of ideals does not stabilize. Many important UFDs are Noetherian. The Hilbert basis theorem guarantees that if is a Noetherian ring, then the polynomial ring is also Noetherian, preserving the UFD structure in finite extensions.[18][19]Divisibility and Factorization Behavior
In a unique factorization domain , any two nonzero elements possess a greatest common divisor, defined up to multiplication by units. This GCD, denoted , is constructed by taking the product of the irreducible factors common to both and , each raised to the minimum of their exponents in the unique factorizations of and .[8][2] The least common multiple (LCM) of and also exists in , again up to units, and satisfies the relation , where denotes association (i.e., differing by a unit factor). When and are coprime (i.e., is a unit), this simplifies to . This product formula generalizes to finite sets of elements, leveraging the unique factorization to determine maximal exponents for each irreducible.[20] In the polynomial ring where is a UFD (such as the polynomial ring over a field ), the content of a polynomial with coefficients is defined as the GCD of its nonzero coefficients, , which exists by the GCD property of . A polynomial is primitive if its content is a unit in . Gauss's lemma states that the content is multiplicative: for any , up to units. Moreover, the product of two primitive polynomials is primitive. A standard proof of this fact proceeds by contradiction. Suppose and are primitive but is not. Then the content of is not a unit, so some non-unit divides all coefficients of . Since is a UFD, has an irreducible factor , which is prime. Consider the ring homomorphism that reduces coefficients modulo . As is prime, is an integral domain, and thus, since the polynomial ring over an integral domain is itself an integral domain, so is the polynomial ring . Now , since all coefficients of are divisible by . In an integral domain, this implies or , so divides all coefficients of or of , contradicting the primitivity of both. Hence is primitive. This ensures that factorization into irreducibles in the quotient field ring (where is the fraction field of ) lifts to primitive factors in , preserving unique factorization.[21][22][9] Algorithmically, GCDs in a UFD can be computed by obtaining the unique factorizations of the elements and selecting the minimal exponents for common irreducibles, though this requires an effective factorization procedure. In specific UFDs admitting a Euclidean function—such as the integers (with the absolute value norm) or polynomial rings over a field (with the degree norm)—the Euclidean algorithm extends naturally to compute GCDs efficiently via repeated division with remainder, yielding the same result as the factorization method.[2][23]Characterizations and Relations
Equivalent Conditions
A fundamental equivalent condition for an integral domain to be a unique factorization domain is that every nonzero non-unit element of admits a factorization into irreducibles and that any two such factorizations of the same element are equal up to multiplication by units and reordering of factors.[1] This formulation emphasizes both the existence of irreducible factorizations and their uniqueness modulo associates.[24] Another set of equivalent conditions is that satisfies the ascending chain condition on principal ideals (ACCP)—meaning every ascending chain of principal ideals stabilizes—and that every irreducible element of is prime.[25] The ACCP guarantees the existence of factorizations into irreducibles by preventing infinite strictly ascending chains of divisors for any element, while the primality of irreducibles ensures uniqueness via the property that irreducibles divide products only if they divide one factor, leading to the standard cancellation in factorizations.[26] In a UFD, uniqueness of factorization implies the ACCP, as equal-length factorizations into irreducibles force stabilization in divisor chains.[27] For Noetherian integral domains, is a UFD if and only if every prime ideal of height one is principal.[28] This characterization leverages the Noetherian structure to relate ideal-theoretic properties to element factorization; in such domains, height-one primes arise minimally over principal ideals generated by irreducibles, and principality ensures controlled generation.[24] An additional equivalent condition is that every nonzero prime ideal of contains a nonzero principal prime ideal.[24] In a UFD, irreducible elements generate such principal prime ideals, and every prime ideal contains one generated by an irreducible factor. Conversely, this condition implies that irreducibles are prime and factorizations exist and are unique, as principal primes enforce the necessary divisibility control.[29]Connections to Other Integral Domains
Unique factorization domains (UFDs) exhibit strong connections to other classes of integral domains, particularly in terms of divisibility and factorization properties. A key implication is that every UFD is a greatest common divisor (GCD) domain, meaning that for any two elements in the domain, there exists a greatest common divisor such that divides both and , and any other common divisor divides .[30] This follows from the unique factorization property, which allows the GCD to be constructed by taking the minimum exponents in the irreducible factorizations of and .[31] Principal ideal domains (PIDs) form a subclass of UFDs, as every PID admits unique factorization into irreducibles.[32] In a PID, every ideal is principal, generated by a single element, which strengthens the divisibility structure and ensures the existence of unique factorizations. Euclidean domains, such as the ring of integers or the polynomial ring over a field , are PIDs and thus UFDs, where the Euclidean algorithm facilitates division and GCD computations.[33] However, the converse does not hold: there exist UFDs that are not PIDs. A classic example is the polynomial ring in two variables over a field , which is a UFD by iterative application of Gauss's lemma. The iterative application relies on Gauss's lemma establishing the primitivity preservation—that the product of two primitive polynomials is primitive—proved via reduction modulo a prime dividing the content and using the integral domain property of the quotient ring , as detailed elsewhere. However, it is not a PID, as the ideal requires two generators.[34][9] All UFDs are atomic domains, where every nonzero nonunit element factors into a finite product of irreducible (atomic) elements, due to the well-founded nature of the factorization process.[35] The converse fails, however: atomic domains need not have unique factorizations. For instance, the ring of integers in the quadratic field is atomic (as it is Noetherian, satisfying the ascending chain condition on principal ideals) but not a UFD, since provides two distinct irreducible factorizations.[36] UFDs can be generalized to weaker structures that retain some factorization control but relax uniqueness. Half-factorial domains (HFDs) are atomic integral domains where all irreducible factorizations of a given nonzero nonunit element have the same length, though the factors themselves may differ.[35] Every UFD is an HFD, but HFDs provide a bridge to broader classes like bounded factorization domains, with applications in number theory for analyzing tame factorization behaviors in rings of algebraic integers.[37]References
- https://proofwiki.org/wiki/UFD_is_GCD_Domain/Proof_1
- https://commalg.subwiki.org/wiki/UFD_implies_gcd
