Atomic domain

Last updated

In mathematics, more specifically ring theory, an atomic domain or factorization domain is an integral domain in which every non-zero non-unit can be written in at least one way as a finite product of irreducible elements. Atomic domains are different from unique factorization domains in that this decomposition of an element into irreducibles need not be unique; stated differently, an irreducible element is not necessarily a prime element.

Contents

Important examples of atomic domains include the class of all unique factorization domains and all Noetherian domains. More generally, any integral domain satisfying the ascending chain condition on principal ideals (ACCP) is an atomic domain. Although the converse is claimed to hold in Cohn's paper, [1] this is known to be false. [2]

The term "atomic" is due to P. M. Cohn, who called an irreducible element of an integral domain an "atom".

Motivation

In this section, a ring can be viewed as merely an abstract set in which one can perform the operations of addition and multiplication; analogous to the integers.

The ring of integers (that is, the set of integers with the natural operations of addition and multiplication) satisfy many important properties. One such property is the fundamental theorem of arithmetic. Thus, when considering abstract rings, a natural question to ask is under what conditions such a theorem holds. Since a unique factorization domain is precisely a ring in which an analogue of the fundamental theorem of arithmetic holds, this question is readily answered. However, one notices that there are two aspects of the fundamental theorem of the arithmetic: first, that any integer is the finite product of prime numbers, and second, that this product is unique up to rearrangement (and multiplication by units). Therefore, it is also natural to ask under what conditions particular elements of a ring can be "decomposed" without requiring uniqueness. The concept of an atomic domain addresses this.

Definition

Let R be an integral domain. If every non-zero non-unit x of R can be written as a product of irreducible elements, R is referred to as an atomic domain. (The product is necessarily finite, since infinite products are not defined in ring theory. Such a product is allowed to involve the same irreducible element more than once as a factor.) Any such expression is called a factorization of x.

Special cases

In an atomic domain, it is possible that different factorizations of the same element x have different lengths. It is even possible that among the factorizations of x there is no bound on the number of irreducible factors. If on the contrary the number of factors is bounded for every non-zero non-unit x, then R is a bounded factorization domain (BFD); formally this means that for each such x there exists an integer N such that if x = x1x2...xn with none of the xi invertible then n < N.

If such a bound exists, no chain of proper divisors from x to 1 can exceed this bound in length (since the quotient at every step can be factored, producing a factorization of x with at least one irreducible factor for each step of the chain), so there cannot be any infinite strictly ascending chain of principal ideals of R. That condition, called the ascending chain condition on principal ideals or ACCP, is strictly weaker than the BFD condition, and strictly stronger than the atomic condition (in other words, even if there exist infinite chains of proper divisors, it can still be that every x possesses a finite factorization [3] ).

Two independent conditions that are both strictly stronger than the BFD condition are the half-factorial domain condition (HFD: any two factorizations of any given x have the same length) and the finite factorization domain condition (FFD: any x has but a finite number of non-associate divisors). Every unique factorization domain obviously satisfies these two conditions, but neither implies unique factorization.

Related Research Articles

In mathematics, more specifically in ring theory, a Euclidean domain is an integral domain that can be endowed with a Euclidean function which allows a suitable generalization of the Euclidean division of the integers. This generalized Euclidean algorithm can be put to many of the same uses as Euclid's original algorithm in the ring of integers: in any Euclidean domain, one can apply the Euclidean algorithm to compute the greatest common divisor of any two elements. In particular, the greatest common divisor of any two elements exists and can be written as a linear combination of them. Also every ideal in a Euclidean domain is principal, which implies a suitable generalization of the fundamental theorem of arithmetic: every Euclidean domain is a unique factorization domain.

In mathematics, a finite field or Galois field is a field that contains a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are given by the integers mod p when p is a prime number.

Integral domain Commutative ring with no zero divisors other than zero

In mathematics, specifically abstract algebra, an integral domain is a nonzero commutative ring in which the product of any two nonzero elements is nonzero. Integral domains are generalizations of the ring of integers and provide a natural setting for studying divisibility. In an integral domain, every nonzero element a has the cancellation property, that is, if a ≠ 0, an equality ab = ac implies b = c.

In mathematics, a principal ideal domain, or PID, is an integral domain in which every ideal is principal, i.e., can be generated by a single element. More generally, a principal ideal ring is a nonzero commutative ring whose ideals are principal, although some authors refer to PIDs as principal rings. The distinction is that a principal ideal ring may have zero divisors whereas a principal ideal domain cannot.

Gaussian integer Complex number whose real and imaginary parts are both integers

In number theory, a Gaussian integer is a complex number whose real and imaginary parts are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as Z[i]. This integral domain is a particular case of a commutative ring of quadratic integers. It does not have a total ordering that respects arithmetic.

In mathematics, more specifically in the area of abstract algebra known as ring theory, a Noetherian ring is a ring that satisfies the ascending chain condition on left and right ideals; that is, given any increasing sequence of left ideals:

In mathematics, a unique factorization domain (UFD) is a ring in which a statement analogous to the fundamental theorem of arithmetic holds. Specifically, a UFD is an integral domain in which every non-zero non-unit element can be written as a product of prime elements, uniquely up to order and units.

Commutative ring Algebraic structure

In ring theory, a branch of abstract algebra, a commutative ring is a ring in which the multiplication operation is commutative. The study of commutative rings is called commutative algebra. Complementarily, noncommutative algebra is the study of noncommutative rings where multiplication is not required to be commutative.

Factorization (Mathematical) decomposition into a product

In mathematics, factorization or factoring consists of writing a number or another mathematical object as a product of several factors, usually smaller or simpler objects of the same kind. For example, 3 × 5 is a factorization of the integer 15, and (x – 2)(x + 2) is a factorization of the polynomial x2 – 4.

In number theory, the ideal class group of an algebraic number field K is the quotient group JK/PK where JK is the group of fractional ideals of the ring of integers of K, and PK is its subgroup of principal ideals. The class group is a measure of the extent to which unique factorization fails in the ring of integers of K. The order of the group, which is finite, is called the class number of K.

Algebraic number theory Branch of number theory

Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations. Number-theoretic questions are expressed in terms of properties of algebraic objects such as algebraic number fields and their rings of integers, finite fields, and function fields. These properties, such as whether a ring admits unique factorization, the behavior of ideals, and the Galois groups of fields, can resolve questions of primary importance in number theory, like the existence of solutions to Diophantine equations.

In mathematics, an irreducible polynomial is, roughly speaking, a polynomial that cannot be factored into the product of two non-constant polynomials. The property of irreducibility depends on the nature of the coefficients that are accepted for the possible factors, that is, the field or ring to which the coefficients of the polynomial and its possible factors are supposed to belong. For example, the polynomial x2 − 2 is a polynomial with integer coefficients, but, as every integer is also a real number, it is also a polynomial with real coefficients. It is irreducible if it is considered as a polynomial with integer coefficients, but it factors as if it is considered as a polynomial with real coefficients. One says that the polynomial x2 − 2 is irreducible over the integers but not over the reals.

Ring theory is the branch of mathematics in which rings are studied: that is, structures supporting both an addition and a multiplication operation. This is a glossary of some terms of the subject.

Polynomial ring Algebraic structure

In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more indeterminates with coefficients in another ring, often a field.

In algebra, Gauss's lemma, named after Carl Friedrich Gauss, is a statement about polynomials over the integers, or, more generally, over a unique factorization domain. Gauss's lemma underlies all the theory of factorization and greatest common divisors of such polynomials.

In mathematics, a GCD domain is an integral domain R with the property that any two elements have a greatest common divisor (GCD); i.e., there is a unique minimal principal ideal containing the ideal generated by two given elements. Equivalently, any two elements of R have a least common multiple (LCM).

In mathematics, a Bézout domain is a form of a Prüfer domain. It is an integral domain in which the sum of two principal ideals is again a principal ideal. This means that for every pair of elements a Bézout identity holds, and that every finitely generated ideal is principal. Any principal ideal domain (PID) is a Bézout domain, but a Bézout domain need not be a Noetherian ring, so it could have non-finitely generated ideals ; if so, it is not a unique factorization domain (UFD), but still is a GCD domain. The theory of Bézout domains retains many of the properties of PIDs, without requiring the Noetherian property. Bézout domains are named after the French mathematician Étienne Bézout.

In algebra, the content of a polynomial with integer coefficients is the greatest common divisor of its coefficients. The primitive part of such a polynomial is the quotient of the polynomial by its content. Thus a polynomial is the product of its primitive part and its content, and this factorization is unique up to the multiplication of the content by a unit of the ring of the coefficients.

In abstract algebra, the ascending chain condition can be applied to the posets of principal left, principal right, or principal two-sided ideals of a ring, partially ordered by inclusion. The ascending chain condition on principal ideals is satisfied if there is no infinite strictly ascending chain of principal ideals of the given type (left/right/two-sided) in the ring, or said another way, every ascending chain is eventually constant.

This is a glossary of commutative algebra.

References

  1. ↑ P.M. Cohn, Bezout rings and their subrings; Proc. Camb. Phil.Soc. 64 (1968) 251–264
  2. ↑ A. Grams, Atomic rings and the ascending chain condition for principal ideals. Proc. Cambridge Philos. Soc. 75 (1974), 321–329.
  3. ↑ D. D. Anderson, D. F. Anderson, M. Zafrullah, Factorization in integral domains; J. Pure and Applied Algebra 69 (1990) 1–19
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.