Somehow searching for this question I only find "all fields are euclidean domains" and "euclidean domains with unique quotient-remainder are either $F$ or the polynomial ring $F[X]$ for some field $F$".
Things I think I know:
- irreducible are primes in GCD domains and thus in Euclidean Domains, so all irreducibles generate prime ideals
- Euclidean domains are commutative rings so the "modulo irreducible" creates a quotient ring by a prime ideal which is always at least an integral domain
- the quotient ring is a field iff the ideal is maximal
- therefore the question translates to asking either "when does the irreducible generates a maximal ideal?" or "in which euclidean domains do all irreducibles generate maximal ideals (like for the integers and polynomials over finite fields)?"
- This seems to be slightly different than asking when are all the prime ideals maximal (which is answered in If every prime ideal is maximal, what can we say about the ring?) because in this case the zero ideal is not required to be maximal.
- For the polynomial ring $F[x]$ of a finite field $F$ it always generates a field.
Examples
- For the polynomials over complex numbers only $x-c$ generate maximal ideals and the other irreducible polynomials do not, so being an euclidean domain and even being $F[X]$ is clearly not enough unless $F$ is finite.
- In polynomial rings over fields the quotient-remainder are unique so uniqueness is not sufficient.
- The euclidean domain of integers generates a field, so the uniqueness of quotient-remainder is not necessary.
Things that I am confused about
- I've seen multiple times than in principal ideal domains, and thus euclidean domains, all non-zero prime ideals are maximal, but this seems to contradict the above
- If $R$ is a field then it has no irreducibles because all elements all elements are divisible and either way the remainder is always zero, so in this case the answer is either "yes, but trivial" or "the question needs state first that an irreducible exists, thus excluding fields"
- Euclidean domains are unique-factorization domains which themselves are atomic domains which are defined as having factorization into irreducibles for any non-zero non-unit element, therefore an irreducible always exists in Euclidean domains, but if fields do not have irreducibles then they shouldn't be euclidean domains ???
Related questions:
- Is restricting to finite euclidean domains sufficient? Are there even finite Euclidean domains that are not finite fields? For example, can the rings of matrices over finite fields be euclidean domains?
- Does adding a discreteness structure like the integers help?
I am particularly interested in separate answers for finite and non-finite euclidean domains.
What are the other irreducible polynomials over $\mathbb{C}$?
– schiepy Sep 24 '24 at 21:44