Proposition

Let kk be a field. Then k[[x]]k[[x]] is an Euclidean domain.

Proof

We define v:k[[x]]{0}Z0v : k[[x]] \setminus \{0\} \to \mathbb{Z}_{\geq 0} by setting v(f)v(f) to be the degree of the dominant term of ff (which we will refer to as the order of ff).

Suppose a,bk[[x]]a, b \in k[[x]] with bb non-zero. If bb is a unit, then we can divide by bb without remainder, which suffices for Euclidean valuation. Suppose otherwise.

Let rk[[x]]r \in k[[x]] be the polynomial containing all monomials of aa whose degree in xx is less than the order of b.b. Note that, by construction, v(r)<v(b).v(r) < v(b).

We want to find qk[[x]]q \in k[[x]] such that a=bq+r.a = bq + r. To do this, we will define a series of approximations that converge to the desired q.q.

Let q0=0,q_0 = 0, and let a0=ar.a_0 = a - r. Observe that the invariant a0=arq0ba_0 = a - r - q_0b holds at this step.

Suppose qn1q_{n - 1} and an1a_{n - 1} are defined, and the required invariant holds for them. Then we define their successors as follows. If an1=0a_{n - 1} = 0 then an=0a_n = 0 and qn=qn1.q_n = q_{n - 1}. Otherwise, let sxmsx^m be the dominant monomial of an1.a_{n - 1}. Since kk is a field and mv(b),m \geq v(b), there exists a monomial sxms'x^{m'} such that the dominant term of sxmbs'x^{m'}b is sxm.sx^m. Let qn=qn1+sxmq_n = q_{n - 1} + s'x^{m'} and let an=an1sxmb.a_n = a_{n - 1} - s'x^{m'}b.

Since an1=arqn1b,a_{n - 1} = a - r - q_{n - 1}b, we observe that

an=arqn1bsxmb=ar(qn1+sxm)b,a_n = a - r - q_{n - 1}b - s'x^{m'}b = a - r - (q_{n - 1} + s'x^{m'})b,

which validates our invariant. Also note that, as long as both an1a_{n -1} and ana_n are non-zero, v(an1)<v(an),v(a_{n - 1}) < v(a_n), as subtracting sxmbs'x^{m'}b removes the dominant monomial of an1.a_{n - 1}.

Define a metric d(f,g)d(f,g) on k[[x]]k[[x]] by d(f,g)=2v(fg)d(f,g) = 2^{-v(f - g)} if fgf \neq g and d(f,g)=0d(f,g) = 0 if f=g.f = g. By construction, d(ar,bqn)0d(a - r, bq_n) \to 0 as n0.n \to 0. By completeness of k[[x]],k[[x]], this limit exists.

Taking qq to be the limit of q0,q1,,q_0, q_1, \ldots, we now can write a=bq+r.a = bq + r. Since rr is either 00 or has valuation v(r)v(r) less than b,b, vv is indeed a Euclidean valuation on k[[x]].k[[x]]. Thus, k[[x]]k[[x]] is a Euclidean domain.

\blacksquare