Hensel’s Lemma

Lifting Solutions from Modular Arithmetic

One of the central ideas of number theory is that congruences modulo powers of a prime often approximate genuine arithmetic solutions.

Suppose a polynomial equation has a solution modulo $p$ . Can this solution be refined to a solution modulo $p^2$ , then modulo $p^3$ , and eventually to a solution in the field of $p$ -adic numbers?

Hensel’s lemma answers this question.

It is one of the foundational results of $p$ -adic analysis and local number theory. In many respects, it plays the same role in $p$ -adic arithmetic that Newton’s method plays in real analysis.

Motivation

Consider the polynomial

f(x)=x^2-2.

Over the integers, the equation

x^2=2

has no solution. Over the real numbers, it has the solutions

\pm\sqrt2.

What happens over the $7$ -adic numbers?

Modulo $7$ ,

3^2=9\equiv2\pmod7.

Thus $x=3$ is a solution of

x^2-2\equiv0\pmod7.

Can this approximate solution be improved to a solution modulo higher powers of $7$ ?

Hensel’s lemma guarantees that it can.

Statement of Hensel’s Lemma

There are several equivalent forms of the theorem. The most common version is the following.

Theorem (Hensel’s Lemma). Let

f(x)\in\mathbb{Z}_p[x]

and suppose there exists $a\in\mathbb{Z}_p$ such that

f(a)\equiv0\pmod p

and

f'(a)\not\equiv0\pmod p.

Then there exists a unique $p$ -adic integer

\alpha\in\mathbb{Z}_p

satisfying

f(\alpha)=0

and

\alpha\equiv a\pmod p.

Thus a nondegenerate solution modulo $p$ lifts uniquely to an actual $p$ -adic root.

The condition involving the derivative prevents repeated-root degeneracy.

Example: Square Root of $2$ in $\mathbb{Q}_7$

Consider again

f(x)=x^2-2.

Modulo $7$ ,

f(3)=9-2=7\equiv0\pmod7.

The derivative is

f'(x)=2x.

Evaluating at $x=3$ ,

f'(3)=6\not\equiv0\pmod7.

Therefore Hensel’s lemma applies.

Hence there exists a unique element

\alpha\in\mathbb{Z}_7

such that

\alpha^2=2

and

\alpha\equiv3\pmod7.

Thus $2$ possesses a square root in the field $\mathbb{Q}_7$ .

By contrast, modulo $5$ ,

x^2\equiv2\pmod5

has no solution. Consequently $\sqrt2\notin\mathbb{Q}_5$ .

The existence of local roots therefore depends strongly on the prime.

Iterative Lifting

Hensel’s lemma may be understood as a lifting process.

Suppose

a_1

satisfies

f(a_1)\equiv0\pmod p.

One seeks a refinement

a_2=a_1+pk

satisfying

f(a_2)\equiv0\pmod{p^2}.

Repeating the procedure constructs solutions modulo arbitrarily large powers:

a_n \pmod{p^n}.

These approximations converge $p$ -adically to an actual root.

The process resembles Newton iteration:

x_{n+1} = x_n-\frac{f(x_n)}{f'(x_n)}.

Indeed, Hensel’s lemma may be viewed as a $p$ -adic version of Newton’s method.

Factorization Version

Hensel’s lemma also applies to polynomial factorizations.

Theorem. Suppose

f(x)\in\mathbb{Z}_p[x]

reduces modulo $p$ as

f(x)\equiv g(x)h(x)\pmod p,

where $g$ and $h$ are coprime modulo $p$ .

Then this factorization lifts uniquely to a factorization over $\mathbb{Z}_p[x]$ :

f(x)=G(x)H(x),

with

G(x)\equiv g(x)\pmod p, \qquad H(x)\equiv h(x)\pmod p.

Thus factorization behavior modulo $p$ often determines factorization over the $p$ -adic integers.

This principle is fundamental in local algebra.

Simple and Multiple Roots

The derivative condition

f'(a)\not\equiv0\pmod p

means the root is simple modulo $p$ .

If instead

f'(a)\equiv0\pmod p,

then lifting may fail or may cease to be unique.

For example, consider

f(x)=x^2.

Modulo $p$ , the root $x=0$ is repeated. The derivative vanishes:

f'(x)=2x.

The lifting behavior becomes more subtle.

Repeated roots are closely connected with ramification in algebraic number theory.

Henselian Rings

The ring

\mathbb{Z}_p

has a special structural property encoded by Hensel’s lemma.

A local ring satisfying analogous lifting properties is called Henselian.

Henselian rings behave similarly to complete local fields and arise naturally in algebraic geometry and commutative algebra.

Thus Hensel’s lemma extends beyond $p$ -adic arithmetic into general local algebra.

Applications to Polynomial Equations

Hensel’s lemma is one of the most powerful tools for studying local solvability.

To determine whether

f(x)=0

has a solution in $\mathbb{Q}_p$ , one often:

solves the equation modulo $p$ ;
checks the derivative condition;
lifts the solution using Hensel’s lemma.

This method reduces difficult local problems to finite computations.

For example, one may determine whether quadratic equations possess $p$ -adic solutions by analyzing congruences modulo $p$ .

Local-Global Principles

Hensel’s lemma plays a major role in local-global methods.

Many Diophantine equations are studied first over:

\mathbb{R}, \qquad \mathbb{Q}_2, \qquad \mathbb{Q}_3, \qquad \mathbb{Q}_5, \ldots

If an equation fails to have a solution in some completion, then it cannot possess a rational solution.

Hensel’s lemma makes local analysis computationally accessible because it converts $p$ -adic questions into modular arithmetic problems.

This idea underlies the Hasse principle and much of arithmetic geometry.

Hensel’s Lemma and Algebraic Extensions

Finite extensions of $\mathbb{Q}_p$ are often constructed using roots of polynomials.

Hensel’s lemma helps determine:

whether a polynomial splits over $\mathbb{Q}_p$ ;
whether roots already exist locally;
how primes factor in extensions.

For example, local factorization patterns influence ramification and inertia groups.

Thus Hensel’s lemma connects local analysis with Galois theory.

Modern Importance

Hensel’s lemma appears throughout modern mathematics.

It is fundamental in:

local field theory;
algebraic number theory;
arithmetic geometry;
rigid analytic geometry;
deformation theory;
computational number theory.

The theorem embodies a recurring principle in arithmetic:

local approximate solutions often determine exact solutions.

This lifting philosophy extends far beyond $p$ -adic numbers and remains one of the central structural ideas of modern number theory.