A discrete valuation on a field k is a surjective homomorphism of abelian groups v:(k×,⋅)→(Z,+) such that v(a+b)≥min(v(a),v(b)) for all a,b∈k× such that a+b∈k×.
Proposition A
Let k be a field and let v be a discrete valuation on k. Then the set R={a∈k×∣v(a)≥0}∪{0} is a subring of k and, in fact, R is a Euclidean domain.
Proof
Since group homomorphisms preserve identity, v(1)=0. Thus 1∈R and we only need to check closure.
Suppose a,b∈R are non-zero, then v(ab)=v(a)+v(b) and a sum of two non-negative integers is itself non-negative. So ab∈R. If, instead, either a=0 or b=0, then ab=0, which is also in R.
Suppose a,b∈R and a+b=0. In that case, a+b∈R. Suppose otherwise, that a+b∈k×. If a=0 or b=0, the sum is equal to the other summand, which is in R. If neither is 0, then v(a+b)≥min(v(a),v(b)) and since v(a)≥0 and v(b)≥0,v(a+b)≥0.
Observe that (−1)⋅(−1)=1 making −1 an involution in k×. Since (Z,+) is torsion-free, v(−1)=0. Hence, for each a∈R, the element −a=−1⋅a has valuation of v(−1)+v(a)=v(a), so −a∈R.
This demonstrates that R is a subring of k.
Suppose a,b∈R are non-zero. We want to find q,r∈R such that a=qb+r with r=0 or v(r)<v(b). Let S={(q′,r′)∈R×R∣a=q′b+r′}. Note that (0,a)∈S, so S is non-empty. If (q′,0)∈S then we are done. Assume that all elements of S carry a non-zero remainder.
Let (q,r)∈S. Suppose, for the sake of contradiction, that v(r)≥v(b). Then v(r)−v(b)≥0 and hence r/b∈R. In that case, a=(q+r/b)b+0 which gives rise to (q+r/b,0)∈S, contradicting our assumption that all elements of S have non-zero remainder.
Thus v(r)<v(b) and hence v is a Euclidean valuation.
■
Proposition B
The ring of rational numbers with the denominator not divisible by a fixed prime p is a DVR.
Proof
Let v:Q×→(Z,+) be a homomorphism of abelian groups defined as p↦1,q↦0,−1↦0, where q is a prime distinct from p. Since Q×≅(Z/2Z)⊕⨁p∈PZ, the universal property of a direct sum guarantees that v is a well-defined surjective homomorphism.
Let a,b∈Q× such that a+b∈Q×. Write a=pma′ and b=pnb′ such that v(a′)=v(b′)=0. Without loss of generality, assume that n≤m, hence a+b=pn(pm−na′+b′). So v(a+b)=min(v(a),v(b))+v(pm−na′+b′).
Let den(x) denote the reduced denominator of x, and let F(x) denote the multiset of factors of x (up to a consistent choice of representatives) as in 2.1.
Recall that the sum of two fractions x/x′+y/y′ can be written in reduced form as follows: start from (xy′+yx′)/(x′y′) and cancel out the redundant factors. Thus,
F(den(x/x′+y/y′))⊆F(x′y′)=F(x′)+F(y′),
that is, cancelling factors cannot add new factors into the denominator above what is already present in F(x′y′).
Since m−n≥0,p∈/F(den(pm−na′)). Since v(b′)=0,p∈/F(den(b′)) also. Certainly p∈/F(den(pm−na′))+F(den(b′)).
Thus v(pm−na′+b′)≥0, and hence v(a+b)≥min(v(a),v(b)).
This gives us a discrete valuation on Q. Taking 0 and all elements of x∈Q such that v(x)≥0 gives us a DVR. Since v(x)≥0,x (as a reduced fraction) has no powers of p in the denominator.