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 (abbreviated to ACCP) 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.
The counterpart descending chain condition may also be applied to these posets, however there is currently no need for the terminology "DCCP" since such rings are already called left or right perfect rings. (See below.)
Noetherian rings (e.g. principal ideal domains) are typical examples, but some important non-Noetherian rings also satisfy (ACCP), notably unique factorization domains and left or right perfect rings.
It is well known that a nonzero nonunit in a Noetherian integral domain factors into irreducibles. The proof of this relies on only (ACCP) not (ACC), so in any integral domain with (ACCP), an irreducible factorization exists. (In other words, any integral domains with (ACCP) are atomic. But the converse is false, as shown in .) Such a factorization may not be unique; the usual way to establish uniqueness of factorizations uses Euclid's lemma, which requires factors to be prime rather than just irreducible. Indeed, one has the following characterization: let A be an integral domain. Then the following are equivalent.
A is a UFD.
A satisfies (ACCP) and every irreducible of A is prime.
A is a GCD domain satisfying (ACCP).
The so-called Nagata criterion holds for an integral domain A satisfying (ACCP): Let S be a multiplicatively closed subset of A generated by prime elements. If the localization S−1A is a UFD, so is A. (Note that the converse of this is trivial.)
An integral domain A satisfies (ACCP) if and only if the polynomial ring A[t] does. The analogous fact is false if A is not an integral domain.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
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. Important examples of atomic domains include the class of all unique factorization domains and all Noetherian domains.
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). A GCD domain generalizes a unique factorization domain (UFD) to a non-Noetherian setting in the following sense: an integral domain is a UFD if and only if it is a GCD domain satisfying the ascending chain condition on principal ideals (and in particular if it is Noetherian).
In mathematics, specifically in abstract algebra, a prime element of a commutative ring is an object satisfying certain properties similar to the prime numbers in the integers and to irreducible polynomials. Care should be taken to distinguish prime elements from irreducible elements, a concept which is the same in UFDs but not the same in general. An element p of a commutative ring R is said to be prime if it is not the zero element or a unit and whenever p divides ab for some a and b in R, then p divides a or p divides b.
Today enterprises operate in a constantly changing market, characterized by shorter and shorter product life cycles, an increased demand for flexibility and changing techniques and technologies. In order to control these factors of complexity, enterprise m ...
EPFL2005
The worst-case hardness of finding short vectors in ideals of cyclotomic number fields (Ideal-SVP) is a central matter in lattice based cryptography. Assuming the worst-case hardness of Ideal-SVP allows to prove the Ring-LWE and Ring-SIS assumptions, and t ...
Springer International Publishing Ag2017
Let K be a field with char(K) ≠ 2. The Witt-Grothendieck ring (K) and the Witt ring W (K) of K are both quotients of the group ring ℤ[𝓖(K)], where 𝓖(K) := K*/(K*)2 is the square class group of K. Since ℤ[𝓖(K)] is integra ...