ProofComplete

Local Fields and Valuations - Key Proof

We prove Hensel's Lemma, the foundational tool for lifting solutions in complete discrete valuation fields.

ProofHensel's Lemma

Let KK be complete with discrete valuation vv, valuation ring OK\mathcal{O}_K, maximal ideal m\mathfrak{m}, and residue field Îș=OK/m\kappa = \mathcal{O}_K/\mathfrak{m}.

Let f(x)∈OK[x]f(x) \in \mathcal{O}_K[x] and a0∈OKa_0 \in \mathcal{O}_K such that v(f(a0))>0v(f(a_0)) > 0 and v(fâ€Č(a0))=0v(f'(a_0)) = 0 (i.e., fˉ(aˉ0)=0\bar{f}(\bar{a}_0) = 0 and fˉâ€Č(aˉ0)≠0\bar{f}'(\bar{a}_0) \neq 0 in Îș[x]\kappa[x]).

Step 1: Newton iteration

Define sequence {an}\{a_n\} by Newton's method: an+1=an−f(an)fâ€Č(an)a_{n+1} = a_n - \frac{f(a_n)}{f'(a_n)}

We prove {an}\{a_n\} is Cauchy and converges to a root of ff.

Step 2: Valuation estimates

Assume v(an−an−1)≄cnv(a_n - a_{n-1}) \geq c_n with cn→∞c_n \to \infty. Then: f(an+1)=f(an)−fâ€Č(an)⋅f(an)fâ€Č(an)+O((f(an)/fâ€Č(an))2)f(a_{n+1}) = f(a_n) - f'(a_n) \cdot \frac{f(a_n)}{f'(a_n)} + O((f(a_n)/f'(a_n))^2)

The main term cancels. Since v(fâ€Č(an))=0v(f'(a_n)) = 0 remains constant and v(f(an))v(f(a_n)) increases, we get: v(f(an+1))≄2v(f(an))−v(fâ€Č(an))=2v(f(an))v(f(a_{n+1})) \geq 2v(f(a_n)) - v(f'(a_n)) = 2v(f(a_n))

So v(f(an))v(f(a_n)) doubles at each step: if v(f(a0))≄1v(f(a_0)) \geq 1, then v(f(an))≄2nv(f(a_n)) \geq 2^n.

Step 3: Cauchy property

From an+1−an=−f(an)/fâ€Č(an)a_{n+1} - a_n = -f(a_n)/f'(a_n): v(an+1−an)=v(f(an))−v(fâ€Č(an))≄2nv(a_{n+1} - a_n) = v(f(a_n)) - v(f'(a_n)) \geq 2^n

So v(an+1−an)→∞v(a_{n+1} - a_n) \to \infty, proving {an}\{a_n\} is Cauchy.

Step 4: Convergence to root

Since KK is complete, a=lim⁡n→∞ana = \lim_{n \to \infty} a_n exists. By continuity of ff: f(a)=lim⁡n→∞f(an)=0f(a) = \lim_{n \to \infty} f(a_n) = 0

since v(f(an))→∞v(f(a_n)) \to \infty means f(an)→0f(a_n) \to 0.

Step 5: Uniqueness

If bb is another root with bˉ=aˉ0\bar{b} = \bar{a}_0, then for c=(a+b)/2c = (a+b)/2, the mean value theorem gives: f(a)−f(b)=fâ€Č(c)(a−b)f(a) - f(b) = f'(c)(a - b)

Since f(a)=f(b)=0f(a) = f(b) = 0 and v(fâ€Č(c))=v(fâ€Č(a0))=0v(f'(c)) = v(f'(a_0)) = 0, this implies v(a−b)=∞v(a - b) = \infty, so a=ba = b.

■
Remark

Hensel's lemma is the pp-adic analogue of the implicit function theorem. It shows that simple roots modulo m\mathfrak{m} lift uniquely to actual roots, enabling systematic solution of polynomial equations in local fields.

The quadratic convergence (doubling of valuation) makes Newton iteration extremely efficient for pp-adic computation.