In a UFD irreducible elements are prime
Builds on Unique factorisation domainIrreducible elementPrime elementPrime elements are irreducible in an integral domain
Statement
Let be a unique factorisation domain and let . Then is irreducible if and only if is prime.
Remarks
Prime elements are irreducible in every integral domain. The other direction needs unique factorisation. The proof: suppose is irreducible and . Factor , and into irreducibles. By uniqueness, is an associate of an irreducible factor of or of . Conversely, an integral domain in which every nonzero nonunit is a product of irreducibles, and every irreducible is prime, is a unique factorisation domain.
Reading path
To understand this page from the ground up, read these 13 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
- Prime element definition
- Irreducible element definition
- Unique factorisation domain definition
- Prime elements are irreducible in an integral domain statement
- In a UFD irreducible elements are prime statement
Further reading
About this page
| Tag | 0QRCFZKXH8 |
|---|---|
| URI | m2://0QRCFZKXH8 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 13F15 |
| Status | This copy of the site has no build data. Run m2 status 0QRCFZKXH8. |
| Uses | Unique factorisation domain, Irreducible element, Prime element, Prime elements are irreducible in an integral domain |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.