The integers are a Euclidean domain
Builds on Euclidean domainThe ring of integers
Statement
The ring of integers is a Euclidean domain, with the absolute value as Euclidean function. That is, for all with , there are with and .
Remarks
The proof: let be the least element of . Then , because otherwise would be a smaller element of this set. The pair with is unique. Consequences: is a principal ideal domain, and integers factor uniquely into primes.
Reading path
To understand this page from the ground up, read these 8 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Group concept
- Ring definition
- Commutative ring definition
- Zero divisor definition
- The ring of integers example
- Integral domain definition
- Euclidean domain definition
- The integers are a Euclidean domain statement
Further reading
About this page
| Tag | 000JFQGDXG |
|---|---|
| URI | m2://000JFQGDXG |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 11A05 |
| Status | This copy of the site has no build data. Run m2 status 000JFQGDXG. |
| Uses | Euclidean domain, The ring of integers |
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.