Hensel's lemma
Statement
Let and suppose satisfies and (a **simple root mod **). Then there exists a unique with exactly and .
Why is it true?
This is the -adic cousin of Newton's method, except it converges exactly rather than merely approximately: because is complete and is ultrametric, the Newton iterates do not just approach a root, they stabilize digit by digit and land on one precisely after infinitely many corrections. A simple root mod is guaranteed to 'lift' uniquely all the way to an honest root in , turning a finite, checkable congruence condition into an existence proof for an exact -adic number.
Proof sketch
Construct as a limit of successive approximations with , showing by induction that and for all (the derivative stays a unit since at every step, so throughout). Then , so is Cauchy in the -adic metric; by completeness of it converges to some , and continuity of forces . Uniqueness: if were another root with , the mean value / Taylor expansion with a unit would force .
Topics that use this theorem
Step-by-step proofs
No step-by-step proof yet for this theorem.
References
- Neal Koblitz (1984). p-adic Numbers, p-adic Analysis, and Zeta-Functions · DOI:10.1007/978-1-4612-1112-9
- Peter Scholze (2012). Perfectoid spaces · arXiv:1111.4914