2 Valuation Rings

Definition 2.1 (Valuation). Let K be a field. A valuation on K is a function v:K×→ℝ such that

  • (i) v(xy)=v(x)+v(y)
  • (ii) v(x+y)≥min⁡(v(x),v(y))

Fix 0<α<1. If v is a valuation on K, then

|x|={αv(x)x≠00x=0

determines a non-archimedean absolute value on K.

Conversely a non-archimedean absolute value determines a valuation v(x)=log⁡α|x|.

Remark.

  • Ignore the trivial valuation v(x)=0.

  • Say v1,v2 are equivalent if there exists c∈ℝ>0 such that v1(x)=cv2(x) for all x∈K×.

Example.

  • K=ℚ, vp(x)=−log⁡p|x|p is known as the p-adic valuation.

  • If k is a field, consider K=k(t)=Frac⁡(k[t]) the rational function field. Then define

    v(tnf(t)g(t))=n

    for f,g∈k[t] with f(0),g(0)≠0. We call this the t-adic valuation.

  • K=k((t))=Frac⁡(k[[t]])={∑⁡i=n∞aiti|ai∈k,n∈ℤ}, known as the field of formal Laurent series over k. Then we can define

    v(∑Iaiti)=min⁡{i|ai≠0}

    is the t-adic valuation on K.

Definition 2.2. Let (K,|∙|) be a non-archimedean valued field. The valuation ring of K is defined to be

OK={x∈K||x|≤1}(=B¯(0,1))(={x∈K×|v(x)≥0}∪{0})

Proposition 2.3.

  • (i) OK is an open subring of K
  • (ii) The subsets {x∈K||x|≤r} and {x∈K||x|<r} for r≤1 are open ideals in OK.
  • (iii) OK×={x∈K||x|=1}.

Proof.

  • (i) |0|=0, |1|=1 so 0,1∈OK. If x∈OK, then |−x|=|x| hence −x∈OK. If x,y∈OK, then
    |x+y|≤max⁡(|x|,|y|)≤1.

    Hence x+y∈OK. If x,y∈OK, then |xy|=|x||y|≤1, hence xy∈OK. Thus OK is a ring. Since OK=B¯(0,1), it is open.

  • (ii) Similar to (i).
  • (iii) Note that |x||x−1|=|xx−1|=1. Thus |x|=1⟺|x−1|=1⟺x,x−1∈OK⟺x∈OK×□

Notation.

  • m:={x∈OK||x|<1} is a max ideal of OK.

  • k:=OK∕m is the residue field.

Corollary 2.4. OK is a local ring with unique maximal ideal m (a local ring is a ring with a unique maximal ideal).

Proof. Let m′ be a maximal ideal. Suppose m′≠m. Then there exists x∈m′∖m. Using part (iii) of Proposition 2.3, we get that x is a unit, hence m′=OK, a contradiction. □

Example. K=ℚ with |∙|p. Then

OK=ℤ(p)={ab∈ℚ|p∤b},

and m=pℤ(p), k=𝔽p.

Definition 2.5. Let v:K×→ℝ be a valuation. If v(K×)≅ℤ, we say v is a discrete valuation. K is said to be a discretely valued field. An element π∈OK is uniformiser if v(π)>0 and v(π) generates v(K×).

Example.

Remark. If v is a discrete valuation, can replace with equivalent one such that v(K×)=ℤ> Call such a v normalised valuations (then v(π)=1 if and only if π is a unit).

Lemma 2.6. Assuming that:

Then the following are equivalent:
  • (i) v is discrete
  • (ii) OK is a PID
  • (iii) OK is Noetherian
  • (iv) m is principal

Proof.

  • (i) ⟹ (ii) OK is an integral domain since it is a subset of K, which is an integral domain.

    Let I⊆OK be a non-zero ideal. Let x∈I such that v(x)=min⁡{v(a)|a∈I}, which exists since v is discrete. Then we claim

    xOK={a∈OK|v(a)≥v(x)}

    is equal to I.

    • ⊆ (I is an ideal)
    • ⊇ Let y∈I. Then v(x−1y)≥0. Hence y=x(x−1y)∈xOK.
  • (ii) ⟹ (iii) Clear.
  • (iii) ⟹ (iv) Write m=x1OK+⋯+xnOK. Without loss of generality,
    v(x1)≤v(x2)≤⋯≤v(xn).

    Then x2,…,xn∈x1OK. Hence m=x1OK.

  • (iv) ⟹ (i) Let m=πOK for some π∈OK and let c=v(π). Then if v(x)>0, x∈m hence v(x)≥c. Thus v(K×)∩(0,c)=∅. Since v(K×) is a subgroup of (ℝ,+), we deduce v(K×)=ℤ. □

Suppose v is a discrete valuation on K, π∈OK a uniformiser. For x∈K×, let n∈ℤ such that v(x)=nv(π). Then u=π−nx∈OK× and x=uπn. In particular, K=OK[1π] and hence K=Frac⁡(OK).

Definition 2.7 (Discrete valuation ring). A ring R is called a discrete valuation ring (DVR) if it is a PID with exactly one non-zero prime ideal (necessarily maximal).

Lemma 2.8.

Proof.

  • (i) OK is a PID by Lemma 2.6. Hence any non-zero prime ideal is maximal and hence OK is a discrete valuation ring since it is a local ring.
  • (ii) Let R be a discrete valuation ring, with maximal ideal m. Then m=(π) for some π∈R. Since PIDs are UFDs, we may write any x∈R∖{0} uniquely as πnu with n≥0, u∈R×. Then any y∈K× can be written uniquely as πmu with u∈R×, m∈ℤ. Define v(πmu)=m; check v is a valuation and OK=R. □

Example. ℤ(p), k[[t]] (k a field) are discrete valuation rings.