half-factorial ring
An integral domain![]()
is called a half-factorial ring (HFD) if it satisfies the following conditions:
-
•
Every nonzero element of that is not a unit can be factored into a product of a finite number of irreducibles.
-
•
If and are two factorizations of the same element into irreducibles, then .
If, in , the irreducibles and are always pairwise associates![]()
, then is a factorial ring (UFD).
For example, many orders (http://planetmath.org/OrderInAnAlgebra) in the maximal order![]()
of an algebraic number field
![]()
are half-factorial rings, e.g. is a HFD but not a UFD (see http://www.math.ndsu.nodak.edu/faculty/coykenda/paper6b.pdfthis paper).
| Title | half-factorial ring |
|---|---|
| Canonical name | HalffactorialRing |
| Date of creation | 2013-03-22 18:31:14 |
| Last modified on | 2013-03-22 18:31:14 |
| Owner | pahio (2872) |
| Last modified by | pahio (2872) |
| Numerical id | 7 |
| Author | pahio (2872) |
| Entry type | Definition |
| Classification | msc 13G05 |
| Synonym | half-factorial domain |
| Defines | HFD |