Unique factorization domain

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.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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: x = p 1 p 2 ⋅⋅⋅ p n with and this representation is unique in the following sense: If q 1 , ..., q m are irreducible elements of R such that x = q 1 q 2 ⋅⋅⋅ q m with , then , and there exists a bijective map such that p i is associated to q φ(i) for . \sin \pi z = \pi z \prod_{n=1}^{\infty} \left(1-{{z^2}\over{n^2}}\right).

Text derived from https://en.wikipedia.org/w/index.php?oldid=1371682736 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.