Local Fields
Daniel Naylor

Contents

I  Basic Theory
1Absolute values
2Valuation Rings
3The p-adic numbers

II  Complete Valued Fields
4Hensel’s Lemma
5Teichmüller lifts
6Extensions of complete valued fields

III  Local Fields
7Local Fields
8Global Fields

IV  Dedekind domains
9Dedekind domains
10Dedekind domains and extensions
10.1Completions
11Decomposition groups

V  Ramification Theory
12Different and discriminant
13Unramified and totally ramified extensions of local fields
13.1Structure of Units
14Higher Ramification Groups

VI  Local Class Field Theory
15Infinite Galois Theory
Index

Part I
Basic Theory

Example. f(x1,,xr) [c1,,xr], f(x1,,xr) = 0? This is hard to study. It is easier to study

f(x1,,xr) 0(modp) f(x1,,xr) 0(modp2)    f(x1,,xr) 0(modpn)

A local field packages all this information together.

1 Absolute values

Definition 1.1 (Absolute value). Let K be a field. An absolute value on K is a function || : K 0 such that

  • (i) |x| = 0 if and only if x = 0.
  • (ii) |xy| = |x||y| for all x,y K.
  • (iii) |x + y||x| + |y| x,y K (triangly inequality).

We say (K,||) is a valued field.

Example.

Definition 1.2 (p-adic absolute value). Let K = , and p be a prime. For 0x , write x = pna b, where (a,p) = 1, (b,p) = 1. The p-adic absolute value is defined to be

|x|p = { 0 x = 0 pnx = pna b

Verification:

An absolute value || on K induces a metric d(x,y) = |x y| on K, hence a topology on K.

Definition 1.3 (Place). Let ||, || be absolute values on a field K. We say || and || are equivalent if they induce the same topology. An equivalence class of absolute values is called a place.

Proposition 1.4. Assuming that:

Then the following are equivalent:
  • (i) || and || are equivalent.
  • (ii) |x| < 1|| < 1 for all x K.
  • (iii) There exists c >0 such that |x|c = || for all x K.

Proof.

Remark. ||2 on is not an absolute value by our definition. Some authors replace the triangle inequality by

|x + y| β |x|β + |y|β

for some fixed β >0.

Definition 1.5 (Non-archimedean). An absolute value || on K is said to be non-archimedean if it satisfies the ultrametric inequality:

|x + y| max (|x|,|y|).

If || is not non-archimedean, then it is archimedean.

Example.

Lemma 1.6. Assuming that:

Then |x y| = |y|.

Proof.

|x y| max (|x|,|y|) = |y|

and

|y| max (|x|,|x y|) |x y|.

Proposition 1.7. Assuming that:

  • (K,||) is non-archimedean

  • (xn)n=1 a sequence in K

  • |xn xn+1| 0

Then (xn)n=1 is Cauchy. In particular, if K is in addition complete, then (xn)n=1 converges.

Proof. For 𝜀 > 0, choose N such that |xn xn+1| < 𝜀 for n > N. Then N < n < m,

|xn xm| = |(xn xn+1) + + (xn1) xm)| < 𝜀.

The “In particular” is clear.

Example. p = 5, construct sequence (xn)n=1 in such that

Take x1 = 2. Suppose we have constructed xn. Let xn2 + 1 = a5n and set xn+1 = xn + b5n. Then

xn+12 + 1 = xn2 + 2bx n5n + b252n + 1 = a5n + 2bx n5n + b252n

We choose b such that a + 2bxn 0(mod5). Then we have xn+12 + 1 0(mod5n+1). Now (ii) implies that (xn)n=1 is Cauchy. Suppose xn l . Then xn2 l2. But (i) tells us that xn2 1, so l2 = 1, a contradiction. Thus (,||5) is not complete.

Definition 1.8. The p-adic numbers p is the completion of with respect to ||p.

Analogy with :

PIC

Notation. As is usual when working with metric spaces, we will be using the notation:

B(x,r) = {y K||x y| < r} B¯(x,r) = {y K||x y| r}

Lemma 1.9. Assuming that:

Then
  • (i) If z B(x,r), then B(z,r) = B(x,r) – so open balls don’t have a centre.
  • (ii) If z B¯(x,r) then B¯(x,r) = B¯(z,r).
  • (iii) B(x,r) is closed.
  • (iv) B¯(x,r) is open.

Proof.

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) x0 0 x = 0

determines a non-archimedean absolute value on K.

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

Remark.

Example.

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.

Proof.

Notation.

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 mm. 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

O K = (p) = {a b |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.

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.

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

3 The p-adic numbers

Recall that p is the completion of with respect to ||p. On Example Sheet 1, we will show that p is a field. We also show that ||p extends to p and the associated valuation is discrete.

Definition 3.1. The ring of p-adic integers p is the valuation ring

p = {x p||x|p 1}.

Facts: p is a discrete valuation ring, with maximal ideal pp, and non-zero ideals are given by pnp.

Proposition. p is the closure of inside p. In particular, p is the completion of with respect to ||p.

Proof. Need to show is dense in p. Note is dense in p. Since p p is open, we have that p is dense in p. Now:

p = {x ||x|p 1} = {a b |p b} = (p).

Thus it suffices to show is dense in (p).

Let a b (p), a,b , p b. For n , choose yn such that byn a(modpn). THen yn a b as n .

In particular, p is complete and p is dense.

Definition (Inverse limit). Let (An)n=1 be a sequence of sets / groups / rings together with homomorphisms φn : An+1 An (transition maps). Then the inverse limit of (An)n=1 is the set / group / ring defined by

lim n []An = {(an)n=1 n=1A n|φ(an+1) = an n}.

Define the group / ring operation componentwise.

Notation. Let 𝜃m : lim n []An Am denote the natural projection.

The inverse limit satisfies the following universal property:

Proposition 3.2 (Universal property of inverse limits). Assuming that:

  • B is a set / group / ring

  • ψn are homomorphisms ψn : B An such that
     B         An+1


ψψφnnn+1       An
    commutes for all n

Then there exists a unique homomorphism ψ : B lim n []An such that 𝜃n ψ = ψn.

Proof. Define

ψ : B n=1A n b n=1ψ n(b)

Then ψn = φn ψn+1 implies that ψ(b) lim n []An. The map is clearly unique (determined by ψn = 𝜃n ψ) and is a homomorphism of sets / groups / rings.

Definition 3.3 (I-adic completion). Let I R be an ideal (R a ring). The I-adic completion of R is the

R^ := lim R []In

where RIn+1 RIn is the natural projection.

Note that there exists a natural map i : R R^ by the Universal property of inverse limits (there exist maps R RIn). We say R is I-adically complete if it is an isomorphism.

Fact: ker (i : R R^) = n=1In.

Let (K,||) be a non-archimedean valued fieldand π OK such that |π| < 1.

Proposition 3.4. Assuming that:

  • K is complete with respect to ||

Then
  • (i) Then OKlim n []OKπnOK (OK is π-adically complete)
  • (ii) Every x OK can be written uniquely as x = i=0naiπi, ai A, where A OK is a set of coset representatives for OKπOK.

Proof.

Corollary 3.5.

Proof.

Example.

1 1 p = 1 + p + p2 + p3 +

Part II
Complete Valued Fields

4 Hensel’s Lemma

Theorem 4.1 (Hensel’s Lemma version 1). Assuming that:

Then there exists a unique x OK such that f(x) = 0 and |x a| < |f(a)|.

Proof. Let π OK be a uniformiser and let r = v(f(a)), with v the normalised valuation (v(π) = 1). We construct a sequence (xn)n=1 in OK such that:

Take x1 = a: then f(x1) 0(modπ1 + 2r).

Now we suppose we have constructed x1,,xn satisfying (i) and (ii). Define

xn+1 = xn f(xn) f(xn).

Since xn x1(modπr+1), we have

v(f(x n)) = v(f(x i)) = r,

and hence

f(xn) f(xn) 0(modπn+r)

by (i).

It follows that xn+1 xn(modπn+r), so (ii) holds. Note that letting X,Y be indeterminates, we have

f(X + Y ) = f0(X) + f1(X)Y + f2(X)Y 2 + ,

where fi(X) OK[X] and f0(X) = f(X), f1(X) = f(X). Thus

f(xn+1) = f(xn) + cf(x n) + c2f 2(xN) + c2f 2(xn) + πn+2r+1

where c = f(xn) f(xn).

Since c 0(modπn+r) and v(fi(xn)) 0 we have

f(xn+1) f(xn) + f(x n)c 0(modπn+2r+1),

so (i) holds.

Property (ii) implies that (xn)n=1 is Cauchy, so let x OK such that xn x. Then f(x) = lim nf(xn) = 0 by (i).

Moreover, (ii) impies that

a = x1 xn(modπr+1)n a x(modπr+1) |x a| < |f(a)|

This proves existence.

Uniqueness: suppose x also satisfies f(x) = 0, |x a| < |f(a)|. Set δ = x x0. Then

|x a| < |f(a)||x a| < |f(a)|,

and the ultrametric inequality implies

|δ| = |x x| < |f(a)| = |f(x)|.

But

0 = f(x) = f(x + δ) = f(x) =0 + f(x)δ + |||δ|2.

Hence |f(x)δ||δ|2, so |f(x)| < |δ|, a contradiction.

Corollary 4.2. Let (K,||) be a complete discretely valued field. Let f(X) OK[X] and c¯ k := OKm a simple root of f¯(X) := f(X)(modm) k[X]. Then there exists a unique x OK such that f(x) = 0, x c¯(modm).

Proof. Apply Theorem 4.1 to a lift c OK of c¯. Then |f(c)| < 1 = |f(c)|2 since c¯ is a simple root.

Example. f(X) = X2 2 has a simple root modulo 7. Thus 2 7 7.

Corollary 4.3.

p × (p×)2 { (2)2 if p > 2 (2)3if p = 2

Proof. Case p > 2: Let b p×. Applying to f(X) = X2 b, we find that b (p×)2 if and only if b (𝔽p×)2. Thus p×(p×)2𝔽p×(𝔽p×)22 (𝔽p×(p 1)).

We have an isomorphism

p × × (,+)p×

given by (u,n)upn. Thus

p × (p×)2(2)2.

Case p = 2: Let b 2×. Consider f(X) = X2 b. Note f(X) = 2X 0(mod2). Let b 1(mod8). Then

|f(1)| = 23 < 22 = |f(1)|2.

Hensel’s Lemma version 1 gives

b (2×)2b 1(mod8).

Then

2×( 2×)2(8)× (2)j.

Again using 2× 2×× , we find that 2×(2)3.

Remark. Proof uses the iteration

xn+1 = xn f(xn) f(xn),

which is the non-archimedean analogue of the unewton Raphson method.

PIC

Theorem 4.4 (Hensel’s Lemma version 2). Assuming that:

  • (K,||) is a complete discretely valued field

  • f(X) OK[X]

  • f¯(X) := f(X)(modm) k[X] factorises as f¯(X) = g¯(X)h¯(X) in k[X]

  • g¯(X) and h¯(X) coprime.

Then there is a factorisation
f(X) = g(X)h(X)

in OK[X], with g¯(X) g(X)(modm), h¯(X) h(X)(modm) and deg g¯ = deg g.

Proof. Example Sheet 1.

Corollary 4.5. Let (K,||) be a complete discretely valued field. Let

f(X) = anXn + + a n K[X]

with a0,an0. If f(X) is irreducible, then |ai| max (|a0|,|an|) for all i.

Proof. Upon scaling, we may assume f(X) OK[X] with max i(|ai|) = 1. Thus we need to show that max (|a0|,|an|) = 1. If not, let r minimal such that |ar| = 1, then 0 < r < n. Thus we have

f¯ (X) = Xr(a r + + anXnr)(modm).

Then Theorem 4.4 implies f(X) = g(X)h(X) with 0 < deg < n.

5 Teichmüller lifts

Definition 5.1 (Perfect). A ring R of characteristic p > 0 (prime) is a perfect ring if the Frobenius xxp is a bijection. A field of characteristic p is a perfect field if it is perfect as a ring.

Remark. Since characteristic R = p, (x + y)p = xp + yp, so Frobenius is a ring homomorphism.

Example.

Fact: A field of characteristic p > 0 is perfect if and only if any finite extension of k is separable.

Theorem 5.2. Assuming that:

Then there exists a unique map [] : k OK such that
  • (i) a [a] mod m for all a k
  • (ii) [ab] = [a][b] for all a,b k

Moreover if characteristic OK = p, then [] is a ring homomorphism.

Definition 5.3. The element [a] OK constructed in Theorem 5.2 is the Teichmüller lift of a.

Lemma 5.4. Assuming that:

  • (K,||) is a complete discretely valued field

  • such that k := OKm is a perfect field of characterist p

  • π OK a fixed uniformiser

  • x,y OK such that x y mod πk (k 1)

Then xp yp mod πk+1.

Proof. Let x = y + uπk with u OK. Then

xp = i=0pp i ypi(uπk)i = yp + i=1pp i yp1(uπk)i

Since OKπOK has characteristic p, we have p πOK. Thus

p i (uπk)iypi πk+1O Ki 1,

hence xp yp mod πk+1.

Proof of Theorem 5.2. Let a k. For each i 0 we choose a lift yi OK of a 1 pi , and we define

xi := yipi .

We claim that (xi)i=1 is a Cauchy sequence and its limit is independent of the choice of yi.

By construction, yi yi+1p mod π. By Lemma 5.4 and induction on k, we have yipk yi+1pk+1 and hence xi xi+1 mod πi+1 (take i = p). Hence (xi)i=1 is Cauchy, so xi x OK.

Suppose (xi)i=1 arises from another choice of yi lifting ai 1 pi . Then (xi)i=1 is Cauchy, and xi xOK. Let

xi = { xi i even xii odd .

Then xi arises from lifting

yi = { yi i even yii odd .

Then xi is Cauchy and xi x, xi x. So x = x and hence x is independet of the choice of yi. So we may define [a] = x.

Then xi = yipi (a 1 pi )pi a mod π. Hence x a mod π. So (i) is satisfied.

We let b k and we choose ui OK a lift of b 1 pi , and let zi := uipi t. Then lim izi = [b].

Now uiyi is a lift of (ab) 1 pi , hence

[ab] = lim ixizi = (lim ixi)(lim izi) = [a][b].

So (ii) is satisfied.

If characteristic K = p, yi + ui is a lift of a 1 pi + b 1 pi = (a + b) 1 pi . Then

[a + b] = lim i(yi + ui)pi = lim iyipi + uipi = lim ixi + zi = [a] + [b]

Easy to check that [0] = 0, [1] = 1, and hence [] is a ring homomorphism.

Uniqueness: let ϕ : k OK be another such map. Then for a k, ϕ(a 1 pi ) is a lift of a 1 pi . It follows that

[a] = lim iϕ(a 1 pi )pi = lim iϕ(a) = ϕ(a)

Example. K = p, [] : 𝔽p p, a 𝔽p×, [a]p1 = [ap1] = [1] = 1. So [a] is a (p 1)-th root of unity.

Lemma 5.5. Assuming that:

Then [a] is a root of unity.

Proof.

a k× a 𝔽pn× for some n [a]pn1 = [apn1 ] = [1] = 1

Theorem 5.6. Assuming that:

Then K = k((t)) (k = OKm).

Proof. Since K = Frac (OK), it suffices to show OKk[[t]. Fix π OK a uniformiser, and let [] : k OK be the Teichmüller map and define

φ : k[[t]] OK φ ( i=0a iti) = i=0[a i]πi

Then φ is a ring homomorphism since [] is, and it is a bijection by Proposition 3.4(ii).

6 Extensions of complete valued fields

Theorem 6.1. Assuming that:

Then
  • (i) || extends uniquely to an absolute value ||L on L defined by
    |y| L = |NLL(y)| 1 n y L.
  • (ii) L is complete with respect to ||L.

Recall: If LK is finite, NLK : L K is defined by NLK(y) = det K(mult(y) where mult(y) : L L is the K-linear map induced by multiplication by y.

Facts:

Definition 6.2 (Norm). Let (K,||) be a non-archimedean valued field, V a vector space over K. A normon V is a function : V 0 satisfying:

  • (i) x = 0x = 0.
  • (ii) λx = λx for all λ K, x V .
  • (iii) x + y max (x,y) for all x,y V .

Example. If V is finite dimensional and e1,,en is a basis of V . The supremum sup on V is defined by

x sup = max i|xi|,

where x = i=1nxiei.

Exercise: sup is a norm.

Definition 6.3 (Equivalent norms). Two norms 1 and 2 on V are equivalent if there exists C,D >0 such that

Cx1 x2 Dx1x V.

Fact: A norm defines a topology on V , and equivalent norms induce the same topology.

Proposition 6.4. Assuming that:

Then V is complete with respect to sup .

Proof. Let (vi)i=1 be a Cauchy sequence in V , and let e1,,en be a basis for V .

Write vi = j=1nxjiej. Then (xji)i=1 is a Cauchy sequence in K. Let xji xj K, then vi v := j=1nxjej.

Theorem 6.5. Assuming that:

Then any two norms on K are equivalent. In particular, V is complete with respect to any norm (using Proposition 6.4).

Proof. Since equivalence defines an equivalence relation on the set of norms, it suffices to show that any norm is equivalent to sup .

Let e1,,en be a basis for V , and set D := max iei > 0. Then for x = i=1nxiei, we have

x max ixiei = max i|xi|ei Dmax i|xi| = Dxsup .

To find C such that Csup , we induct on n = dim V .

For n = 1: x = x1e1 = |x1|e1, so take C = e1.

For n > 1: set V i = span e1, ,ei1,ei+1, ,en. By induction, V i is complete with respect to , hence closed.

Then ei + V i is closed for all i, and hence

S := i=1ne i + V i

is a closed subset not containing 0. Thus there exists c > 0 such that B(0,C) S = where B(0,C) = {x V |x < C}.

Let 0x = i=1nxiei and suppose |xj| = max i|xi|. Then xsup = |xj|, and 1 xj S. Thus xi x j C, and hence

x C|xj| = Cxsup .

V is complete since it is complete with respect to sup (see Proposition 6.4).

Definition 6.6 (Integral closure). Let R be a subring of S. We say s S is integral over R if there exists a monic polynomial f(X) R[X] such that f(s) = 0.

The integral closure Rint(S) of R inside S is defined to be

Rint(S) = {s S|s integral over R}.

We say R is integrally closed in S if Rint(S) = R.

Proposition 6.7. Rint (S) is a subring of S. Moreover, Rint (S) is integrally closed in S.

Proof. Example Sheet 2.

Lemma 6.8. Assuming that:

Then OK is integrally closed in K.

Proof. Let x K be integral over OK. Without loss of generality, x0. Let f(X) = Xn + an1Xn1 + + a0 OK[X] such that f(x) = 0. Then

x = an1 1 x a0 1 xn1.

If |x| > 1, we have |an1 1 x a0 1 xn1 | < 1. Thus |x| 1x OK.

Lemma 6.9. OL is the integral closure of OK inside L.

Proof. Let 0y L and let

f(X) = Xd + a d1Xd1 + + a 0 K[X]

be the minimal (monic) polynomial of y.

Claim: y integral over OK if and only if f(X) K[X].

Hence ai Ok (by Lemma 6.8). By Corollary 4.5, |ai| max (|a0|,1) for i = 0,,d 1. By property of NLK, we have NLK(y) = ±a0m for m 1.

Hence

y OL |NLK(y)| 1 |a0| 1 Corollary 4.5|ai| 1i,i.e. ai OK

Thus OKint (L) = OL and proves the Lemma.

Proof of Theorem 6.1. We first show ||L = |NLK()| 1 n satisfies the three axioms in the definition of absolute value.

So we have proved that ||L is an absolute value on L.

Since NLK(x) = xn for x K, |x|L extends || on K.

If ||L is another absolute value on L extending ||, then ||L,||L are norms on L.

Theorem 6.5 tells us that ||L,||L induce the same topology on L. Hence ||L = ||Lc for some c > 0 (by Proposition 1.4) since ||L extends ||, we have c = 1.

Now we show that L is complete with respect to ||L: this is immediate by Theorem 6.5.

Let (K,||) be a complete discretely valued field.

Corollary 6.10. Let LK be a finite extension. Then

Proof.

Corollary 6.11. Let K¯K be an algebraic closure of K. Then || extends to a unique absolute value ||K¯ on K¯.

Proof. Let x K¯, then x L for some LK finite. Define |x|K¯ = |x|L. Well-defined, i.e. independent of L by the uniqueness in Theorem 6.1.

The axioms for ||K¯ to be an absolute value can be checked over finite extensions.

Uniqueness: clear.

Remark. ||K¯ on K¯ is never discrete. For example K = p, pn p¯ for all n >0. Then

vp(pn) = 1 nv(p) = 1 n.

p¯ is not complete with respect to ||p.

Example Sheet 2: p := completion of p¯ with respect to ||p¯, then p is algebraically closed.

Proposition 6.12. Assuming that:

  • LK finite extension of complete discretely valued fields.

  • (i): OK is compact.

  • (ii): The extension of residue fields kLk is finite and separable.

Then there exists α OL such that OL = OK[α].

Later we’ll prove that the (i) implies (ii).

Proof. We’ll choose α OL such that:

kLk separable tells us that there exists α¯ kL such that kL = k(α¯).

Let α OL a lift of α¯, and g(X) OK[X] a monic lift of the minimal polynomial of α¯.

Fix πL OL a uniformiser. Then g¯(X) k[X] irreducible and separable, hence g(α) 0 mod πL and g(α) 0 mod πL.

If g(α) 0 mod πL2, then

g(α + πL) g(α) + πLg(α) mod π L2.

Thus

vL(g(α + πL)) = vL(πLg(α)) = v L(πL) = 1.

(vL normalised valuation on L).

Thus either vL(g(α)) = 1 or vL(g(α + πL)) = 1. Upon possibly replacing α by α + πL, we may assume vL(g(α)) = 1.

Set β = g(α) OK[α] a uniformiser. Then OK[α] L is the image of a continuous map:

OKn L (x0,,xn1) i=0nx iai

where n = [K(α) : K]. Since OK is compact, OK[α] L is compact, hence closed. Since kL = k(α¯), OK[α] contians a set of coset representatives for kL = OLβOL.

Let y OL. Then Proposition 3.4 gives us

y = i=0λ iβi,λ i OK[α]

Then ym = i=0mλiβi OK[α]. Hence y OK[α], since Ok[α] is closed.

Part III
Local Fields

7 Local Fields

Definition 7.1 (Local field). Let (K,||) be a valued field. Then K is a local field if it is complete and locally compact.

Reminder: locally compact means for all x K, there exists U open and V compact such that x U V .

Example. and are compact.

Proposition 7.2. Assuming that:

Then the following are equivalent:
  • (i) K is locally compact
  • (ii) OK is compact
  • (iii) v is discrete and k = OKm is finite.

Proof.

Example.

More on inverse limits.

Let (An)n=1 a sequence of sets / groups / rings and φn : An+1 An homeomorphisms.

Definition 7.3 (Profinite topology). Assume An is finite. The profinite topology on A := lim n []An is the weakest topology on A such that 𝜃n : A An is continuous for all n, where An is equipped with the discrete topology.

Fact: A = lim n []An with the profinite topology is compact, totally disconnected and Hausdorff.

Proposition 7.4. Assuming that:

Then under the isomorphism OKlim n []OKπnOK (π OK a uniformiser), the topology on OK coincides with the profinite topology.

Proof. One checks that the sets

B := {a + πnO K|n 1,a OK}

is a basis of open sets in both topologies.

For ||: clear.

For profinite topology: OKOKπnOK is continuous if and only if a + πnOK is open for all a OK.

Goal: Classify all local fields.

Lemma 7.5. Assuming that:

Then L is a local field.

Proof. Theorem 6.1 implies that L is complete and discretely valued. Suffices to show kL := OLmL is finite. Let α1,,αn be a basis for L as a K vector space.

sup (sup norm) equivalent to ||L implies that there exists r > 0 such that

O L {x L : xsup r}.

Take a K such that |a| r, then

O L i=1naα iOK L.

Then OL is finitely generated as a module over OK, hence kL is finitely generated over k.

Definition 7.6 (Equal characteristic). A non-archimedean valued field (K,||) has equal characteristic if characteristic (K) = characteristic (k). Otherwise it has mixed characteristic.

Example. p has mixed characteristic.

Theorem 7.7. Assuming that:

Then K𝔽pn((t)) for some n 1.

Proof. K complete discretely valued, characteristic K > 0. Moreover, k𝔽pn is finite, hence perfect.

By Theorem 5.6, K𝔽pn((t)).

Lemma 7.8. Assuming that:

  • K a field

Then an absolute value || is non-archimedean if and only if |n| is bounded for all n .

Proof.

Theorem 7.9 (Ostrowski’s Theorem). Assuming that:

Then || is equivalent to either the usual absolute value || or the p-adic absolute value ||p for some prime p.

Proof. Case: || is archimedean. We fix b > 1 an integer such that |b| > 1 (exists by Lemma 7.8). Let a > 1 be an integer and write bn in base a:

bn = c mam + c m1am1 + + c 0

with 0 ci < a, cm0. Let B = max 0c<a1(|c|), and then we have

|bn| (m + 1)Bmax (|a|m,1) |b| [n(logab + 1)B]1n 1 max (|a|log ab,1) m logabn |b| max (|a|log ab,1)

Then |a| > 1 and

|b| |a|logab. (∗)

Switching roles of a and b, we also obtain

|a| |b|logba. (∗∗)

Then () and ( ) gives (using logab = logb loga):

log|a| loga = log|b| logb = λ >0.

Hence |a| = aλ for all a >1, hence |x| = |x|λ for all x .

Case 2: || is non-archimedean. As in Lemma 7.8, we have |n| 1 for all n . Since || is non-trivial, there exists n >1 such that |n| < 1. Write n = p1e1prer decomposition into prime factors. Then |p| < 1, for some p {p1,,pr}. Suppose |q| < 1 for some prime q, qp. Write 1 = rp + sq with r,s . Then

1 = |rp + sq| max (|rp|,|sq|) < 1

contradiction. Thus |p| = α < 1 and |q| = 1 for all primes qp. Hence || is equivalent to ||p.

Theorem 7.10. Assuming that:

Then K is a finite extension of p.

Proof. K mixed characteristic implies that characteristic K = 0, hence K. K non-archimedean implies that ||| = ||p for some prime p. Since K is complete, p K. Suffices to show that OK is finite as a p-module.

Let π OK be a uniformiser, v a normalised valuation and set v(p) = e. Then OKpOKOKπeOK is finite since πiOKπi+1OKOKπOK is finite. Since 𝔽ppOKpOK we have OKpOK a finite dimensional vector space over 𝔽p.

Let x1,,xn OK be coset representatives for 𝔽p-basis of OKpOK. Then

{ i=1na ixi|ai {0,,r 1} }

is a set of coset representatives for OKpOK. Let y OK. Proposition 3.4(ii) tells us that

y = i=0( j=1na ijxj) pi (aij {0,,p 1}) = j=1n ( i=0a ijpi) x j p

Hence OK is finite over p.

On Example Sheet 2 we will show that if K is complete and archimedean, then K or . In summary:

If K a local field, then either:

8 Global Fields

Definition 8.1 (Global field). A global field is a field which is either:

  • (i) An algebraic number field
  • (ii) A global function field, i.e. a finite extension of 𝔽p(t).

Lemma 8.2. Assuming that:

Then for x L and σ Gal (LK), we have |σ(x)|L = |x|L.

Proof. Since x|σ(x)|L is another absolute value on L extending || on K, the result follows from uniqueness of ||L.

Lemma 8.3 (Kummer’s Lemma). Assuming that:

  • (K,||) a complete discretely valued field

  • f(X) K[X] a separable irreducible polynomial with roots α1,,αn Ksep (Ksep is the separable closure of K)

  • β Ksep with

    |β α1| < |β αi|

    for i = 2,,n.

Then α1 K(β).

Proof. Let L = K(β), L = L(α1,,αn). Then LL is a Galois extension. Let σ Gal (LL). We have

|β σ(α1)| = |σ(β α1)| = |β α1|

using Lemma 8.2. Hence σ(α1) = α1, so α1 K(β).

Proposition 8.4. Assuming that:

  • (F,||) is a complete discretely valued field

  • f(X) = i=0naiXi OK[X] a separable irreducible monic polynomial

  • α Ksep a root of f

Then there exists 𝜀 > 0 such that for any g(X) = i=0nbiXi OK[X] monic with |ai bi| < 𝜀 for all i, there exists a root β of g(X) such that K(α) = K(β).

“Nearby polynomials define the same extensions”.

Proof. Let α1,,αn Ksep be the roots of f which are necessarily distinct. Then f(α1)0. We choose 𝜀 sufficiently small such that |g(α1)| < |f(α1)|2 and |f(α1) g(α1)| < |f(α1)|. Then we have |g(α1)| < |f(α1)|2 = |g(α1)|2 (the equality is by Lemma 1.6).

By Hensel’s Lemma version 1 applied to the field K(α1) there exists β K(α1) such that g(β) = 0 and | α1| < |g(α1)|. Then

|g(α 1)| = |f(α 1)| = j=1n|α 1 αj| |α1 αi|

for i = 2,,n. (Use |α1 αi| 1 since αi integral). Since |β α1| < |α1 αi| = |β αi| using Lemma 1.6, we have that Kummer’s Lemma gives that α1 K(β) and hence K(α1) = K(β).

Theorem 8.5. Assuming that:

Then K is the completion of a global field.

Proof. Case 1: || is archimedean. Then is the completion of , and is the completion of (i) (with respect to ||).

Case 2: || non-archimedean, equal characteristic. Then K𝔽q((t)) is the completion of 𝔽q(t) with respect to the t-adic valuation.

Case 3: || non-archimedean mixed characteristic. Then K = p(α), with α a root of a monic irreducible polynomial f(X) p[X]. Since is dense in p, we choose g(X) [X] as in Proposition 8.4. Then K = (β) with β a root of g(X). Since (β) dense in p(β) = K, and K is complete, we must have that K is the completion of (β).

Part IV
Dedekind domains

9 Dedekind domains

Definition 9.1 (Dedekind domain). A Dedekind domain is a ring R such that

  • (i) R is a Noetherian integral domain.
  • (ii) R is integrally closed in Frac (R).
  • (iii) Every non-zero prime ideal is maximal.

Example.

Theorem 9.2. A ring R is a discrete valuation ring if and only if R is a Dedekind domain with exactly one non-zero prime.

Lemma 9.3. Assuming that:

  • R is a Noetherian ring

  • I R a non-zero ideal

Then there exists non-zero prime ideals p1,,pr such that p1,,pr I.

Proof. Suppose not. Since R is Noetherian, we may choose I maximal with this property. Then I is not prime, so there exists x,y R I such that x,y I.

Let I1 + (x), I2 = I + (y). Then by maximality of I, there exist p1,,pr and q1,,qs such that p1pr I1 and q1qs I2. Then p1prq1qs I1I2 I.

Lemma 9.4. Assuming that:

  • R is an integral domain

  • R is integrally closed in K = Frac (R)

  • 0I R a finitely generated ideal

  • x K

Then if xI I, we have x R.

Proof. Let I = (c1,,cn). We write

xci = j=1na ijcj

for some aij R. Let A be the matrix A = (aij)1i,jn and set B = xid n A Mn×n(K).

Then in Kn

B ( c1 c n ) = 0.

Multiply by adj (B), the adjugate matrix for B. We have

det (B)id n ( c1 c n ) = 0.

Hence det (B) = 0. But det B is a monic polynomial with coefficients in R. Then x is integral over R, hence x R.

Proof of Theorem 9.2.

Let R be an integral domain and S R a multiplicatively closed subset (x,y S implies xy S, and also have 1 S). The localisation S1R of R with respect to S is the ring

S1R = {r s|r R,s S} Frac (R).

If p is a prime ideal in R, we write R(p) for the localisation with respect to S = R p.

Example.

Facts: (not proved in this course, but can be found in a typical course / textbook on commutative algebra)

Corollary 9.5. Let R be a Dedekind domain and p R a non-zero prime ideal. Then R(p) is a discrete valuation ring.

Proof. By properties of localisation, R(p) is a Noetherian integral domain with a unique non-zero prime ideal pR(p).

It suffices to show R(p) is integrally closed in Frac (R(p)) = Frac (R) (since then R(p) is a Dedekind domain hence by Theorem 9.2, R(p) is a discrete valuation ring).

Let x Frac (R) be integral over R(p). Multiplying by denominators of a monic polynomial satisfied by x, we obtain

sxn + a n1xn1 + + a 0 = 0,

with ai R, s S = R p. Multiply by sn1. Then xs is integral over R, so xs R. Hence x R(p).

Definition 9.6 (Valuation on a Dedekind domain). If R is a Dedekind domain, and p R a non-zero prime ideal, we write vp for the normalised valuation on Frac (R) = Frac (R(p)) corresponding to the discrete valuation ring R(p).

Example. R = , p = (p), then vp is the p-adiv valuation.

Theorem 9.7. Assuming that:

Then Ican be written uniquely as aproduct of prime ideals:
I = p1e1 prer

(with pi distinct).

Remark. Clear for PIDs (PID implies UFD).

Proof (Sketch). We quote the following properties of localisation:

Let I R be a non-zero ideal. By Lemma 9.3, there are distinct prime ideals p1,,pr such that p1β1prβr I, where βi > 0.

Let 0p be a prime ideal, p{p1,,pr}. Then property (ii) gives that piR(p) = R(p), and hence IR(p) = R(p).

Corollary 9.5 gives IR(p) = (piR(pi))αi = piαiR(p i) for some 0 αi βi. Thus I = p1α1prαr by property (i).

For uniqueness, if I = p1α1prαr = p1γ1prγr then piαiR(p i) = piγiR (pi) hence ai = γi by unique factorisation in discrete valuation rings.

10 Dedekind domains and extensions

Let LK be a finite extension. For x L, we write Tr LK(x) K for the trace of the K-linear map L L, yxy.

If LK is separable of degree n and σ1,,σn : L K¯denotes the set of embeddings of L into an algebraic closure K¯, then Tr LK(x) = i=1nσi(x) K.

Lemma 10.1. Assuming that:

  • LK a finite separable extension of fields

Then the symmetric bilinear pairing (,) K (x,y) Tr LK(xy)

is non-degenerate.

Proof. LK separable tells us that L = K(α) for some α L. Consider the matrix A for (,) in the K-basis for L given by 1,α,αn1.

Then Aij = Tr LK(αi+j) = [BB]ij where

B = ( 1 1 1 σ1(α) σ2(α) σn(α) σ 1(αn1) σ 2(αn1) σ n(αn1) )

So

det A = det (B)2 = [ 1i<jn(σi(α) σj(α))]2

(Vandermonde determinant), which is non-zero since σi(α)σj(α) for ij by separability.

Exercise: On Example Sheet 3 we will show that a finite extension LK is separable if and only if the trace form is non-degenerate.

Theorem 10.2. Assuming that:

Then the integral closure OL of OK in L is a Dedekind domain.

Proof. OL a subring of L, hence OL is an integral domain.

Need to show:

Proofs:

Remark. Theorem 10.2 holds without the assumption that LK is separable.

Corollary 10.3. The ring of integers of a number field is a Dedekind domain.

Convention: OK is the ring of integers of a number field – p OK a non-zero prime ideal. We normalise ||p (absolute value associated to vp, as defined in Definition 9.6) by |x|p = (Np)vp(x), where Np = |OKp|.

In the following theorems and lemmas we will have:

Lemma 10.4. Assuming that:

  • 0x O)K

Then
(x) = p0 prime ideal pvp (x).

Proof. xOK,(p) = (pOK,(p))vp(x) by definition of vp(x).

Lemma follows from property of localisation

I = JIOK,(p) = JOK,(p)

for all prime ideals p.

Notation. P OL, p OK non-zero prime ideals. We write P|p if pOL = P1e1Prer and P {P1,,Pr} (ei > 0, P distinct).

Theorem 10.5. Assuming that:

  • OK, OL, K, L as usual

  • for p a non-zero prime ideal of OK, we write pOLP1e1Prer

Then the absolute values on L extending ||p (up to equivalence) are precisely ||P1,,||PL.

Proof. By Lemma 10.4 for any 0x OK and i = 1,,r we have vPi(x) = eivp(x). Hence, up to equivalence, ||Pi extends ||p.

Now suppose || is an absolute value on L extending ||p. Then || is bounded on , hence is non-archimedean. Let R = {x L||x| 1} L be the valuation ring for L with respect to ||. Then OK R, and since R is integrally closed in L (Lemma 6.8), we have OL R. Set

P := {x OL||x| < 1} = mR OL

(where mR is the maximal ideal of R).

Hence P a prime ideal in OL. It is non-zero since p P. Then OL,(p) R, since s OL P|s| = 1.

But OL,(p) is a discrete valuation ring, hence a maximal subring of L, so OL,(p) = R. Hence || is equivalent to ||p. Since || extends ||p, P OK = p so P1e1Prer P, so P = Pi for some i.

Let K be a number field. If σ : K , is a real or complex embedding, then x|σ(x)| defines an absolute value on K (Example Sheet 2) denoted ||σ.

Corollary 10.6. Let K be a number field with ring of integers OK. Then any absolute value on K is equivalent to either

Proof. Case 1: || non-archimedean. Then ||| is equivalent to ||p for some prime p by Ostrowski’s Theorem. Theorem 10.5 gives that || is equivalent to ||p for some 𝔭 OK a prime ideal with 𝔭|p.

Case 2: || archimedean. See Example Sheet 2.

10.1 Completions

OK a Dedekind domain, LK a finite separable extension.

Let 𝔭 OK, P OL be non-zero prime ideals with P|𝔭.

We write K𝔭 and LP for the completions of K and L with respect to the absolute values ||𝔭 and ||P respectively.

Lemma 10.7.

Proof. Let M = LK𝔭 = Im (πP) LP.

Write L = K(α) then M = K𝔭(α). Hence M is a finite extension of K𝔭 and [M : K𝔭] [L : K]. Moreover M is complete (Theorem 6.1) and since L M LP, we have M = LP.

Lemma 10.8 (Chinese remainder theorem). Assuming that:

  • R a ring

  • I1,,In R ideals

  • Ii + Ij = R for all ij

Then
  • (i) i=1n = i=1nIi ( = I say).
  • (ii) RI I=1nRIi.

Proof. Example Sheet 2.

Theorem 10.9. The natural map

L KK𝔭 P|𝔭LP

is an isomorphism.

Proof. Write L = K(α) and let f(X) K[X] be the minimal polynomial of α. Then we have

f(X) = f1(X)fr(X) K𝔭[X]

where fi(X) K𝔭[X] are distinct irreducible (separable). Since LK[X]f(X),

L KK𝔭K𝔭[X]fi(X) i=1rK𝔭[X]f i(X).

Set Li = K𝔭[X]fi(X) a finite extension of K𝔭. Then Li contains both K𝔭 and L (use K[X]f(x) K𝔭[X]fi(X) injective since morphism of fields). Moreover L is dense inside Li (approximate coefficients of K𝔭[X]fi(X) with an element of K[X]fi(X)).

The theorem follows from the following three claims:

Proof of claims:

Example. K = , L = (i), f(X) = X2 + 1. Hensel’s Lemma version 1 gives us that 1 5. Hence (5) splies in (i), i.e. 5OL = 𝔭1𝔭2.

Corollary 10.10. Let 0𝔭 OK a prime ideal. For x L we have

NLK(x) = P|𝔭NLPL𝔭(x).

Proof. Let B1,,Br be bases for LP1,,LPr as K𝔭-vector spaces. Then B = iBi is a basis for L KK𝔭 over K𝔭. Let [mult (x)]B (respectively [mult (x)]Bi) denote the matrix for mult (x) : L KK𝔭 L KK𝔭 (respectively LPi LPi) with respect to the basis B (respectively Bi). Then

[mult (x)]B = ( [mult (x)]B1 [mult (x)]Br )

hence

NLK(x) = det ([mult (x)]B) = i=1r det [mult (x)] Bi = i=1rN LPiK𝔭(x)

11 Decomposition groups

Definition 11.1 (Ramification). Let 0𝔭 be a prime ideal of OK, and

𝔭OL = P1e1 Prer

with Pi distinct prime ideals in OL, and ei > 0.

  • (i) ei is the ramification index of Pi over 𝔭.
  • (ii) We say 𝔭 ramifies in L if some ei > 1.

Example. OK = [t], OL = [T]. OK OL sends tTn. Then tOL = TnOL, so the ramification index of (T) over (t) is n.

Corresponds geometrically to the degree n of covering of Riemann surfaces , xxn.

Definition 11.2 (Residue class degree). fi := [OLPi : OK𝔭] is the residue class degree of Pi over 𝔭.

Theorem 11.3. i=1reifi = [L : K].

Proof. Let S = OK (𝔭). Exercise (properties of localisation):

In particular, (2) and (3) imply ei and fi don’t change when we replace OK and OL by S1OK and S1OL.

Thus we may assume that OK is a discrete valuation ring (hence a PID). By Chinese remainder theorem, we have

O L 𝔭OL i=1rO LPiei .

We count dimension as k := OK𝔭 vector spaces.

RHS: for each i, there exists a decreasing sequence of k-suibspaces

0 Piei1P iei PiPiei OLPiei .

Thus dim kOLPiei = j=0ei1 dim k(PijPij+1). Note that PijPij+1 is an OLPi-module and x Pij Pij+1 is a generator (for example can prove this after localisation at Pi).

Then dim kPijPij+1 = fi and we have

dim kOLPiei = eifi,

and hence

dim k i=1rO LPiei = i=1re ifi.

LHS: Structure theorem for finitely generated modules over PIDs tells us that OL is a free module over OK of rank n.

Thus OL𝔭OL(OK𝔭)n as k-vector spaces, hence dim kOL𝔭OL = n.

Geometric analogue:

f : X Y a degree n cover of compact Riemann surfaces. For y Y :

n = xf1(y)e x

where ex is the ramification index of x. Now assume LK is Galois. Then for any σ Gal (LK), σ(Pi) OK = 𝔭 and hence σ(Pi) {P1,,Pr}.

Proposition 11.4. The action of Gal (LK) on {P1,,Pr} is transitive.

Proof. Suppose not, so that there exists ij such that σ(Pi)Pj for all σ Gal (LK).

By Chinese remainder theorem, we may choose x OL such that x 0modPi, x 1modσ(Pi) for all σ Gal (LK). Then

NLK(x) = σGal (LK)σ(x) OK Pi = 𝔭 Pj.

Since Pj prime, there exists τ Gal (LK) such that τ(x) Pj. Hence x τ1(Pj), i.e. x 0modτ1(Pj), contradiction.

Corollary 11.5. Suppose LK is Galois. Then e1 = = er = e, f1 = = fr = f, and we have n = efr.

Proof. For any σ Gal (LK) we have

If LKis an extension of complete discretely valued fields with normalised valuations vL, vK and uniformisers πL,πK, then the ramification index is e = eLK = vL(πK). The residue class degree is f := fLK = [kL : k].

Corollary 11.6. Let LK be a finite separable extension. Then [L : K] = ef.

OK a Dedekind domain:

Definition 11.7 (Decomposition). Let LK be a finite Galois extension. The decomposition at a prime P of OL is the subgroup of Gal (LK) defined by

GP = {σ Gal (LK)|σ(P) = P}.

Proposition 11.8. Assuming that:

  • LK a finite Galois extension

  • 0P OL a prime ideal

  • P|𝔭 OK

Then
  • (i) LPK𝔭 is Galois.
  • (ii) There is a natural map
    res : Gal (LPK𝔭) Gal (LK)

    which is injective and has image GP.

Proof.

Part V
Ramification Theory

p = 𝔭1𝔭2 in [i] if and only if p = x2 + y2.

We will consider LK extension of algebraic number fields with [L : K] = n.

12 Different and discriminant

Notation. Let x1,,xn L. Set

Δ(x1,,xn) = det (Tr LK(xixj)) K = det ( k=1nσ k(xi)σk(xj)) = det (BB)

where σk : L K¯ are distinct embeddings and B = (σi(xj)).

Note:

Lemma 12.1. Assuming that:

  • k a perfect field

  • R a k-algebra which is finite dimensional as a k-vector space

Then the Trace form (,) : R × R R (x,y) Tr Rk(xy)(:= Tr k(mult (xy)))

is non-degenerate if and only if R = k1 × × kr where kik is a finite separable extension of k.

Proof. Example Sheet 3.

Theorem 12.2. Assuming that:

  • 0𝔭 OK prime ideal

Then
  • (i) If 𝔭 ramifies in L, then for every x1,,xn OL, we have Δ(x1,,xn) 0 mod 𝔭.
  • (ii) If 𝔭 is unramified in L, then there exists x1,,xn such that 𝔭 (Δ(x1,,xn)).

Proof.

Definition 12.3 (Discriminant). The discriminant is the ideal dLK OK generated by Δ(x1,,xn) for all choices of x1,,xn OL.

Corollary 12.4. 𝔭 ramifies L if and only if 𝔭|dLK. In particular, only finitely many primes ramify in L.

Definition 12.5 (Inverse different). The inverse different is

DLK1 = {y L : Tr LK(xy) OK x OL},

an OL submodule of L.

Lemma 12.6. DLK1 is a fractional ideal in L.

Proof. Let x1,,xn OL a K-basis for LK. Set

d := Δ(x1,,xn) = det (Tr LK(xixj)),

which is non-zero since separable.

For x DLK1 write x = j=1rλjxj with λj K. We show λj 1 dOK. We have

Tr LK(xxi) = j=1nλ j Tr LK(xixj) OK.

Set Aij = Tr LK(xixj). Multiplying by Adj (A) Mn(OK), we get

d ( λ1 λ n ) = Adj (A) ( Tr LK(xx1) Tr LK(xxn) )

Since λi 1 dOK, we have x 1 dOL. Thus DLK1 1 dOK, so DLK1 is a fractional ideal.

The inverse DLK of DLK1 is the different ideal.

Remark. DLK OL since OL DLK1.

Let IL, IK be the groups of fractional ideals.

Theorem 9.7 gives that

IL 0P prime ideals in OL ,IK 0P prime ideals in OK .

Define NLK : IL IK induced by P𝔭f for 𝔭 = P OK and f = f(P𝔭).

Fact:

  L×       IL


NNLLK∕K∕K ×      IK
(Use Corollary 10.10 and v𝔭(NLPK𝔭(x)) = fP𝔭v(x) for x LP× where v𝔭 and vP are the normalised valuations for LP, K𝔭).

Theorem 12.7. NLK(DLK) = dLK.

Proof. First assume OK, OL are PIDs. Let x1,,xn be an OK-basis for OL and y1,,yn be the dual basis with respect to trace form. Then y1,,yn is a basis for DLK1. Let σ1,,σn : L K¯ be the distinct embeddings. Have

i=1nσ i(xj)σi(yk) = Tr (xjyk) = δjk.

But

Δ (x1,,xn) = det (σi(xj))2.

Thus

Δ (x1,,xn)Δ(y1,,yn) = 1.

Write DLK1 = βOL since β L. Then

dLK1 = (Δ(x1,,xn)1) = (Δ(y1,,yn)) = (Δ(βx1,,βxn)) change of basis matrix is invertible in OK = NLK(β2)Δ(x 1,,xn) change of basis matrix is [mult (β)]

Thus

d LK1 = N LK(DLK1)2d LK

so

NLK(DLK) = dLK.

In general, localise at S = OK 𝔭 and use S1DLK = DS1OLS1OK. Then S1dLK = dS1OLS1OK. Details omitted.

Theorem 12.8. Assuming that:

  • OL = OK[α]

  • α has monic minimal polynomial g(X) OK[X]

Then DLK = (g(α)).

Proof. Let α = α1,,αn be the roots of g. Write

g(X) X α = βn1Xn1 + + β 1X + β0

with βi OL and βn1 = 1. We claim

i=1n g(X) X αi αin g(αi) = Xr

for 0 r n 1.

Indeed the difference is a palynomial of degree < n, which vanishes for X = α1,,αn. Equate coefficients of Xs, which gives

Tr LK ( αrβs g(α) ) = δrs.

Since 1,α,,αn1 is an OK basis for OL, DLK1 has an OK basis

β0 g(α) , β1 g(α),, βn1 g(α) 1 g(α) .

Note all of these are OL multiples of the last term, since the βi are in OL. So DLK1 = 1 (g(α)), hence DLK = (g(α)).

P a prime ideal of OL, 𝔭 = OK P. DLPK𝔭 using OK𝔭, OLP. We identify DLPK𝔭 with a power P.

Theorem 12.9. DLK = PDLPK𝔭 (finite product, see later).

Proof. Let x L, 𝔭 OK. Then

Tr LK(x) = P|𝔭 Tr LPK𝔭(x) (∗)

(of Corollary 10.10).

Let r(P) = vP(DLK), s(P) = vP(DLPK𝔭).

Corollary 12.10. dLK = P|𝔭dLPK𝔭.

Proof. Apply NLK to DLK = P|𝔭DLPK𝔭.

13 Unramified and totally ramified extensions of local fields

Let LK be a finite separable extension of non-archimedean local fields. Corollary 11.6 implies

[L : K] = eLKfLK. (∗)

Lemma 13.1. Assuming that:

Then
  • (i) fMK = fLKfML
  • (ii) eMK = eLKfML

Proof.

Definition 13.2 (Unramified / ramified / totally ramified). The extension LK is said to be:

  • unramified if eLK = 1 (equivalently fLK = [L : K]).

  • ramified if eLK > 1 (equivalently fLK < [L : K]).

  • totally ramified if eLK = [L : K] (equivalently fLK = 1).

From now on in this course: if unspecified LK is a finite separable extension of (non-archimedean) local fields. Also, all local fields that we consider from now on will be non-archimedean.

Theorem 13.3. Assuming that:

Then there exists a field K0, K K0 L and such that

Moreover [L : K0] = eLK, [K0 : K] = fLK and K0K is Galois.

Proof. Let k = 𝔽q, so that kL = 𝔽qf, fLK = f. Set m = qf 1, [] : 𝔽qf L the Teichmüller map for L.

Let ζm := [α] for α a generator of 𝔽qf×. ζm a primitive m-th root of unity. Set K0 = K(ζm) L, then K0K is Galois and has residue field k0 = 𝔽q(α) = kL. Hence fLK0 = 1, i.e. LK0 is totally ramified.

Let res : Gal (K0K) Gal (k0k) be the natural map. For σ Gal (K0K). We have σ(ζm) = ζm if σ(ζm) ζm mod m (since μm(K0)μm(k0) by Hensel’s Lemma version 1). Hence res is injective. Thus |Gal (K0K)||Gal (k0k)| = fK0K, so [K0 : K] = fK0K.

Hence res is an isomorphism, and K0K is unramified.

Theorem 13.4. Assuming that:

  • k = 𝔽q

  • n 1

Then there exists a unique unramified LK of degree n. Moreover, LK is Galois and the natural Gal (LK) Gal (kLk) is an isomorphism. In particular, Gal (LK) Frob LK is cyclic, where Frob LK(x) = xq mod mL for all x OL.

Proof. For n 1, take L = K(ζm) where m = qn 1.

As in Theorem 13.3:

Gal (LK)Gal (kLK) Gal (𝔽qn𝔽q).

Hence Gal (LK) is cyclic, generated by a lift of xxq.

Uniqueness: LK of degree n unramified. Then Teichmüller gives ζm L, so L = K(ζm).

Corollary 13.5. LK a finite Galois extension. Then res : Gal (LK) Gal (kLk) is surjective.

Proof. res factorises as

Gal (LK) Gal (K0K)Gal (kLk).

Definition 13.6 (Inertial subgroup). The inertial subgroup is

ILK = ker (Gal (LK) Gal (kLk)).

Definition 13.7 (Eisenstein polynomial). f(x) = xn + an1xn1 + + a0 OK[x] is Eisenstein if vK(ai) 1 for all i, and vK(a0) = 1.

Fact: f(x) Eisenstein implies f(x) irreducible.

Theorem 13.8.

Proof.

13.1 Structure of Units

Let [K : ] < , e := eKp, π a uniformiser in K.

Proposition 13.9. Assuming that:

  • r > e p1

Then exp (x) = n=0xn n! converges on πrOK and induces an isomorphism
(πrO K,+)(1 + πrO K,×).

Proof.

vK(n!) = evp(n!) = e(n sp(n)) p 1 Example Sheet 1 e (n 1 p 1 )

For x πrOK and n 1,

vK ( xn n! ) nr e(n 1) p 1 = r (n 1) (r e p 1 )>0

Hence vK (xn n! ) as n . Thus exp (x) converges.

Since vK (xn n! ) r for all n 1, exp (x) 1 + πrOK.

Consider log: 1 + πrOK πrOK.

log(1 + x) = n=1(1)n1 n xn

which converges as before.

Recall identities in [[X,Y ]]:

exp (X + Y ) = exp (X)exp (Y ) exp (log (1 + X)) = 1 + X log(exp (X)) = X

Thus exp ;(πrOK,+)(1 + πrOK,×) is an isomorphism.

K any local field: UK := OK×, π OK uniformiser.

Definition 13.10 (s-th unit group). For s , the s-th unit group UK(s) is defined by

UK(s) = (1 + πsO K,×).

Set UK(0) = UK. Then we have

UK(s) U K(s1) U K(0) = U K.

Proposition 13.11.

Proof.

Remark. Let [K : p] < . Proposition 13.9, ?? implies that there exists finite index subgroup of OK× isomorphism to (OK,+).

Example. p, p > 2, e = 1, take r = 1. Then

p× (p)×× (1 + p p)(p 1) ×p x (x mod p, x [x mod p] )

p = 2, take r = 2.

2× (4)×× (1 + p2 p)2 × 2 x (x mod 4, x 𝜀(x) )

where

𝜀(x) = { +1 x 1(mod4) 1x 1(mod4)

So:

p × (p×)2 { 2 if p > 2 (2)2if p = 2

14 Higher Ramification Groups

Let LK be a finite Galois extension of local fields, and πL OL a uniformiser.

Definition 14.1 (s-th ramification group). Let vL be a normalised valuation in OL. For s 1, the s-th ramification group is

Gs(LK) = {σ Gal (K)|vL(σ(x) x) s + 1 x OL}.

Remark. Gs only changes at integers.

Gs, s 1 used to define upper numbering.

Example.

G1(LK) = Gal (LK) G0(LK) = {σ Gal (LK)|σ(x) x mod πL x OL} = ker (Gal (LK) Gal (kLk)) = ILK

Note. For s 0,

Gs(LK) = ker (Gal (LK) Aut (OLπLs+1O L))

hence Gs(LK) is normal in G1.

Gs Gs1 G1 = Gal (LK).

Theorem 14.2.

Proof. Let K0 L be a maximal unramified extension of K in L. Upon replacing K by K0, we may assume that LK is totally ramified.

Corollary 14.3. Gal (LK) is solvable.

Proof. By Proposition 13.11, Theorem 14.2 and Theorem 13.4, for s 1,

GsGs+1a subgroup { Gal (kLk) if s = 1 (kL×,×) if s = 0 (k L,+) if s 1

Thus GsGs+1 is solvable for s 1. Conclude using Theorem 14.2(ii).

Let characteristic k = p. Then p |G0G1| and |G1| = pn. Thus G1 is the unique (since normal) Sylow p-subgroup of G0 = ILK.

Definition 14.4. G1 is called the wild inertial group, and G0G1 is called the tame quotient.

Suppose LK is finite separable. Say LK is tamely ramified if characteristic k eLK. Otherwise it is wildly ramified.

Theorem 14.5. Assuming that:

  • [K : p] <

  • LK finite

  • DLK = (πδ(LK))

Then δ(LK) eLK 1, with equality if and only if tamely ramified. In particular, LK unramified if and only if DLK = OL.

Proof. Example Sheet 3 shows DLK = DLK0 DK0K. Suffices to check 2 cases:

Corollary 14.6. Suppose LK is an extension of number fields. Let P OL, P OK = 𝔭. Then e(P𝔭) > 1 if and only if P|DLK.

Proof. Theorem 12.9 implies DLK = PDLPK𝔭. Then use e(P𝔭) = eLPK𝔭 and Theorem 14.5.

Example.

Part VI
Local Class Field Theory

15 Infinite Galois Theory

Definition 15.1 (Infinite Galois definitions).

  • LK is separable if α L, the minimal polynomial fα(X) K[X] for α is separable.

  • LK is normal if fα(X) splits in L for all α L.

  • LK is Galois if it is separable and normal. Write Gal (LK) := Aut K(L) in this case. If LK is a finite Galois extension, then we have a Galois correspondence:

    {subextensions K K L} {subgroups of Gal (LK)} K Gal (KK)

Let (I,) be a poset. Say I is a directed set if for all i,j I, there exists k I such that i k, j k.

Example.

Definition 15.2. Let (I,) be a directed set and (Gi)iI a collection of groups together with maps φij : Gj Gi, i j such that:

  • φik = φij φjk for any i j k

  • φii = id

Say ((Gi)i=1,φij) is an inverse system. The inverse limit of (Gi,φi) is

lim i []Gi = {(gi)iI iIGi|φij(gj) = gi}.

Remark.

Proposition 15.3. Assuming that:

  • LK Galois

Then
  • (i) The set I = {FKfinite|F L, F Galois} is a directed set under .
  • (ii) For F,F I, F F there is a restriction map res F,F : Gal (FK) Gal (FK) and the natural map
    Gal (LK) lim F [I] Gal (FK)

    is an isomorphism.

Proof. Example Sheet 4.

˙

Index

I-adic completion

absolute value

adically complete

archimedean

ramification index

decomposition

Dedekind domain

discrete

discretely valued

discrete valuation

discretely valued field

discrete valuation ring

Eisenstein

equal characteristic

global field

inertial subgroup

integral

integral closure

integrally closed

inverse limit

local field

localise

localisation

mixed characteristic

equivalent

non-archimedean

norm

perfect

place

profinite topology

ramified

ramifies

ramified

ramification index

Teichmüller

Teichmüller lift

totally ramified

tame quotient

tamely ramified

uniformiser

unramified

valued field

valuation ring

valuation

wild inertial group

wildly ramified