Unique Factorization Domain

In mathematics, a unique factorization domain (UFD) is, roughly speaking, a commutative ring in which every element can be uniquely written as a product of prime elements, analogous to the fundamental theorem of arithmetic for the integers. Rings which are UFDs are sometimes called factorial, following the terminology of Bourbaki. Formally, a unique factorization domain is defined to be an integral domain R in which every non-zero non-unit x of R can be written as a product of irreducible elements of R:
x = p1 p2 ... pn
and this representation is unique in the following sense: if q1,...,qm are irreducible elements of R such that
x = q1 q2 ... qm,
then m = n and there exists a bijective map φ : {1,...,n} -> {1,...,n} such that pi is associated to qφ(i) for i = 1, ..., n. The uniqueness part is sometimes hard to verify, which is why the following equivalent definition is useful: a unique factorization domain is an integral domain R in which every non-zero non-unit can be written as a product of prime elements of R.

Examples

Most rings familiar from elementary mathematics are UFD's: Here are some more exotic examples of UFDs: Despite these examples, very few integral domains are UFDs. Here are a few counterexamples:
  • The ring
KX,Y/(Y^2 - X^2 + 1),
where K is a field. Then Y2 factors as YY and as (X − 1)(X + 1). Most factor rings of a polynomial ring are not UFDs.
  • The ring of all complex numbers of the form a + b √ −5, where a and b are integers. Then 6 factors as both (2)(3) and as (1 + √ −5) (1 − √ −5).

Properties

Additional examples of UFDs can be constructed as follows:
  • If R is a UFD, then so is the polynomial ring RX. By induction, we can show that the polynomial rings Z..., Xn as well as K..., Xn (K a field) are UFD's. (Any polynomial ring with more than one variable is an example of a UFD that is not a principal ideal domain.)
Some concepts defined for integers can be generalized to UFDs:
  • In UFD's, every irreducible element is prime. (In any integral domain, every prime element is irreducible, but the converse does not always hold.)
  • Any two (or finitely many) 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 which 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.

Equivalent conditions for a ring to be a UFD

Under some circumstances, it is possible to give equivalent conditions for a ring to be a UFD.
  • An integral domain is a UFD if and only if the ascending chain condition holds for principal ideals, and any two elements of A have a least common multiple.
  • A ring is a UFD if and only if its class group is zero.

 

<< PreviousWord BrowserNext >>
198 bc
parrot virtual machine
197 bc
196 bc
193 bc
192 bc
191 bc
190 bc
history of sparta
boxer rebellion
hms scorpion (1863)
football world cup 1954
general semantics
list of intel microprocessors
list of colleges and universities in california
uss wasp
list of professional sports teams in california
anna leonowens
css scorpion
shilling
geography of california
leslie groves
hannelore kohl
adams state college
pope theodore i
newtonscript
planetarium
orrery
bamburgh
grace darling
william george armstrong, 1st baron armstrong
emmeline pankhurst
arm architecture
emily davison
tetrapod
redlining
chancellor of germany
takeru kobayashi
licq
president of germany
rectifier
ibm power
visual instruction set
show low, arizona