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:

  • (i) f(xn)≡0(modπn+2r)
  • (ii) xn+1≡xn(modπn+r)

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′(xn))=v(f′(xi))=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)Y2+⋯,

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

f(xn+1)=f(xn)+cf′(xn)+c2f2(xN)+c2f2(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′(xn)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⁡n→∞f(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′−x≠0. 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:=OK∕m 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ℤ)2if 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×)2≅ℤ∕2ℤ (𝔽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)|=2−3<2−2=|f′(1)|2.

Hensel’s Lemma version 1 gives

b∈(ℤ2×)2⟺b≡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+⋯+an∈K[X]

with a0,an≠0. 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(ar+⋯+anXn−r)(modm).

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