The Gaussian integers are a Euclidean domain
Builds on Gaussian integersNorm on the Gaussian integersEuclidean domain
Statement
The ring of Gaussian integers is a Euclidean domain, with the norm as Euclidean function. That is, for all with , there are with and .
Remarks
The proof: write in . Let , where and are integers nearest to and . Then , so has . A consequence is that is a principal ideal domain and a unique factorization domain.
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
- Subring definition
- Zero divisor definition
- Integral domain definition
- Euclidean domain definition
- Gaussian integers object
- Norm on the Gaussian integers definition
- The Gaussian integers are a Euclidean domain statement
Where this leads
1 page builds on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Gaussian_integer, Euclidean division
About this page
| Tag | 0PN13BB7BT |
|---|---|
| URI | m2://0PN13BB7BT |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 11R11 |
| Status | This copy of the site has no build data. Run m2 status 0PN13BB7BT. |
| Uses | Gaussian integers, Norm on the Gaussian integers, Euclidean 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.