Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I want to determine which of the following cases are the rings Euclidean Domains and in which they are UFDs.

  1. $\mathbb{Q}[X]$
  2. $\bigcup_{n=1}^{\infty}\mathbb{Q}[x^\frac{1}{n}]$
  3. $\mathbb{Q}[X,Y,Z]$
  4. $\mathbb{Z}[\frac{1}{2}]$

Here are my thoughts thus far:

  1. $\mathbb{Q}$ is a field and so $\mathbb{Q}[X]$ is a Euclidean Domain. It is also a UFD (I think I have shown correctly why this is the case, so I only need comments on this if it is in fact not a UFD).

I'm really struggling for ideas for the other cases. Guidance would be very appreciated.

share|improve this question

3 Answers 3

up vote 2 down vote accepted
  1. A univariate polynomial ring $\,F[x]\,$ over a field is Euclidean $\Rightarrow$ PID $\Rightarrow$ UFD.

  2. $\bigcup_{n=1}^{\infty}\mathbb{Q}[x^\frac{1}{n}]\,$ fails ACCP by $(x) \subsetneq (x^{1/2}) \subsetneq (x^{1/4}) \subsetneq\,\ldots\,$ so is $\ \lnot \rm UFD\,\Rightarrow\,\lnot$ Euclidean.

  3. Polynomial rings over UFDs are UFDs, thus so is $\,\Bbb Q[x,y,z],\,$ but it's $\,\lnot\rm PID\,\Rightarrow\,\lnot$ Euclidean, since $\,(x,y)\,$ is not principal.

  4. Localization preserves Euclidean domains. Hint: lift the Euclidean function from $\,\Bbb Z\to \Bbb Z[1/2]\,$ by ignoring all factors of $\,2,\ $ i.e. for odd $\,a,b,\,\ b 2^i\mid a 2^j \in \Bbb Z[1/2]\iff b\mid a\in \Bbb Z.\,$ If not, then $\, 0 < r = a-qb < b,\,$ so $\,v(r) \le r < b = v(b 2^j),\,$ where $\,v(r)\,$ is the odd part $> 0$ of $\,r.$

share|improve this answer
    
These comments are very useful. Thanks. –  Mathmo Jun 10 '13 at 20:05

$2$. This ring is not an UFD (since $x=(x^{\frac{1}{n}})^n$ has many different decompositions).

$3$. $\mathbb{Q}[X,Y,Z]$ is an UFD, but is not Euclidean (since it is not a PID).

$4$. Every ring of fractions of an Euclidean domain is also Euclidean, so in this case your ring is Euclidean (since $\mathbb Z[\frac{1}{2}]=S^{-1}\mathbb Z$, where $S=\{1,2,2^2,\dots\}$).

share|improve this answer
    
Quick tip: in English, "a UFD" and "a unique factorization domain" are correct, but the "an" is considered incorrect. The rule about using the article "an" for vowels only applies to vowel sounds not vowel letters. So you would also say "a Euclidean domain" or "an ED". –  rschwieb Jul 18 '13 at 23:16

For 2, what would a prime factorization be for $x$?

In general, a Euclidean domain is also a Principal Ideal Domain. Can you find a non-principal ideal in $\mathbb Q[X,Y,Z]$?

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.