Commutative algebra Definition
Unique factorisation domain
Builds on Integral domainIrreducible elementAssociate elements
Definition
A unique factorisation domain is an integral domain with these two properties.
- Every nonzero element that is not a unit is a product of irreducible elements, with .
- The factorization is unique up to order and units. If with all irreducible, then . Also, there is a permutation of such that and are associates for each .
Remarks
The integers are a unique factorisation domain: this is the fundamental theorem of arithmetic. Every principal ideal domain is a unique factorisation domain, and so is every polynomial ring over a unique factorisation domain. The ring is not a unique factorisation domain. In a unique factorisation domain, irreducible elements are prime.
Reading path
To understand this page from the ground up, read these 10 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Group concept
- Ring definition
- Commutative ring definition
- Unit of a ring definition
- Zero divisor definition
- Divisibility in a commutative ring definition
- Integral domain definition
- Associate elements definition
- Irreducible element definition
- Unique factorisation domain definition
Where this leads
24 pages build on this one.
- Existence of splitting fields
- Eisenstein's criterion
- Galois field
- PID implies UFD
- Product of primitive polynomials is primitive
- Content of a polynomial
- Z[√-5] is not a UFD
- Impossibility of doubling the cube
- Polynomial ring over a UFD is a UFD
- Reduction modulo p test for irreducibility
- Gauss's lemma
- In a UFD irreducible elements are prime
- Primitive polynomial
- Existence of finite fields of every prime power order
- Every polynomial has a root in some extension field
- Regular local rings are UFDs
- Perron's irreducibility criterion
- Weil conjectures
- Standard conjectures on algebraic cycles
- Factorization of polynomials
- Nagata's criterion for factoriality
- Quintic equation
- Impossibility of the classical construction problems
- Factorization of polynomials over finite fields
Further reading
About this page
| Tag | 06YMXJMXYS |
|---|---|
| URI | m2://06YMXJMXYS |
| Kind | definition |
| Writing | W1 stated |
| MSC | 13F15 |
| Defines | Unique factorisation domain |
| Uses | Integral domain, Irreducible element, Associate elements |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Used by
- PID implies UFD
- Product of primitive polynomials is primitive
- Content of a polynomial
- Z[√-5] is not a UFD
- Polynomial ring over a UFD is a UFD
- Gauss's lemma
- In a UFD irreducible elements are prime
- Factorization of polynomials
- Nagata's criterion for factoriality