Definition (discrete valuation)

A discrete valuation on a field kk is a surjective homomorphism of abelian groups v:(k×,)(Z,+)v : (k^{\times},\cdot) \to (\mathbb{Z},+) such that v(a+b)min(v(a),v(b))v(a + b) \geq \min(v(a), v(b)) for all a,bk×a,b \in k^{\times} such that a+bk×.a + b \in k^{\times}.

Proposition A

Let kk be a field and let vv be a discrete valuation on k.k. Then the set R={ak×v(a)0}{0}R = \{a \in k^{\times} \mid v(a) \geq 0\} \cup \{0\} is a subring of kk and, in fact, RR is a Euclidean domain.

Proof

Since group homomorphisms preserve identity, v(1)=0.v(1) = 0. Thus 1R1 \in R and we only need to check closure.

Suppose a,bRa,b \in R are non-zero, then v(ab)=v(a)+v(b)v(ab) = v(a) + v(b) and a sum of two non-negative integers is itself non-negative. So abR.ab \in R. If, instead, either a=0a = 0 or b=0,b = 0, then ab=0,ab = 0, which is also in R.R.

Suppose a,bRa, b \in R and a+b=0.a + b = 0. In that case, a+bR.a + b \in R. Suppose otherwise, that a+bk×.a + b \in k^{\times}. If a=0a = 0 or b=0,b = 0, the sum is equal to the other summand, which is in R.R. If neither is 0,0, then v(a+b)min(v(a),v(b))v(a + b) \geq \min(v(a),v(b)) and since v(a)0v(a) \geq 0 and v(b)0,v(b) \geq 0, v(a+b)0.v(a + b) \geq 0.

Observe that (1)(1)=1(-1) \cdot (-1) = 1 making 1-1 an involution in k×.k^{\times}. Since (Z,+)(\mathbb{Z},+) is torsion-free, v(1)=0.v(-1) = 0. Hence, for each aR,a \in R, the element a=1a-a = -1 \cdot a has valuation of v(1)+v(a)=v(a),v(-1) + v(a) = v(a), so aR.-a \in R.

This demonstrates that RR is a subring of k.k.

Suppose a,bRa, b \in R are non-zero. We want to find q,rRq, r \in R such that a=qb+ra = qb + r with r=0r = 0 or v(r)<v(b).v(r) < v(b). Let S={(q,r)R×Ra=qb+r}.S = \{ (q',r') \in R \times R \mid a = q'b + r' \}. Note that (0,a)S,(0,a) \in S, so SS is non-empty. If (q,0)S(q',0) \in S then we are done. Assume that all elements of SS carry a non-zero remainder.

Let (q,r)S.(q, r) \in S. Suppose, for the sake of contradiction, that v(r)v(b).v(r) \geq v(b). Then v(r)v(b)0v(r) - v(b) \geq 0 and hence r/bR.r/b \in R. In that case, a=(q+r/b)b+0a = (q + r/b)b + 0 which gives rise to (q+r/b,0)S,(q + r/b, 0) \in S, contradicting our assumption that all elements of SS have non-zero remainder.

Thus v(r)<v(b)v(r) < v(b) and hence vv is a Euclidean valuation.

\blacksquare

Proposition B

The ring of rational numbers with the denominator not divisible by a fixed prime pp is a DVR.

Proof

Let v:Q×(Z,+)v : \mathbb{Q}^{\times} \to (\mathbb{Z},+) be a homomorphism of abelian groups defined as p1,q0,10,p \mapsto 1, q \mapsto 0, -1 \mapsto 0, where qq is a prime distinct from p.p. Since Q×(Z/2Z)pPZ,\mathbb{Q}^{\times} \cong (\mathbb{Z}/2\mathbb{Z}) \oplus \bigoplus_{p \in \mathbb{P}} \mathbb{Z}, the universal property of a direct sum guarantees that vv is a well-defined surjective homomorphism.

Let a,bQ×a, b \in \mathbb{Q}^{\times} such that a+bQ×.a + b \in \mathbb{Q}^{\times}. Write a=pmaa = p^m a' and b=pnbb = p^n b' such that v(a)=v(b)=0.v(a') = v(b') = 0. Without loss of generality, assume that nm,n \leq m, hence a+b=pn(pmna+b).a + b = p^n (p^{m - n}a' + b'). So v(a+b)=min(v(a),v(b))+v(pmna+b).v(a + b) = \min(v(a), v(b)) + v(p^{m - n}a' + b').

Let den(x)\operatorname{den}(x) denote the reduced denominator of x,x, and let F(x)\mathsf{F}(x) denote the multiset of factors of xx (up to a consistent choice of representatives) as in 2.1.

Recall that the sum of two fractions x/x+y/yx/x' + y/y' can be written in reduced form as follows: start from (xy+yx)/(xy)(xy' + yx')/(x'y') and cancel out the redundant factors. Thus,

F(den(x/x+y/y))F(xy)=F(x)+F(y),\mathsf{F}(\operatorname{den}(x/x' + y/y')) \subseteq \mathsf{F}(x'y') = \mathsf{F}(x') + \mathsf{F}(y'),

that is, cancelling factors cannot add new factors into the denominator above what is already present in F(xy).\mathsf{F}(x'y').

Since mn0,m - n \geq 0, pF(den(pmna)).p \notin \mathsf{F}(\operatorname{den}(p^{m - n}a')). Since v(b)=0,v(b') = 0, pF(den(b))p \notin \mathsf{F}(\operatorname{den}(b')) also. Certainly pF(den(pmna))+F(den(b)).p \notin \mathsf{F}(\operatorname{den}(p^{m - n}a')) + \mathsf{F}(\operatorname{den}(b')).

Thus v(pmna+b)0,v(p^{m - n}a' + b') \geq 0, and hence v(a+b)min(v(a),v(b)).v(a + b) \geq \min(v(a), v(b)).

This gives us a discrete valuation on Q.\mathbb{Q}. Taking 00 and all elements of xQx \in \mathbb{Q} such that v(x)0v(x) \geq 0 gives us a DVR. Since v(x)0,v(x) \geq 0, xx (as a reduced fraction) has no powers of pp in the denominator.

\blacksquare