Hensel's Lemma¶
A nondegenerate polynomial root or coprime monic factorization modulo a prime lifts compatibly and uniquely through higher prime-power precision.
Core Idea¶
Hensel's lemma turns suitable polynomial information modulo a prime into compatible information modulo every higher power of that prime and in the p-adic completion. A simple root \(a\pmod p\) with \(f'(a)\not\equiv0\pmod p\) lifts uniquely within its residue class; a monic factorization into coprime monic factors modulo \(p\) has a related unique normalized factor lift. The root and factor forms use distinct nondegeneracy conditions.[ref-72ac8c72cf99][ref-93832efbbc52]
Scope of Application¶
For \(f=x^2-2\), the class \(3\pmod7\) is a simple root: \(f(3)=7\) and \(f'(3)=6\) is nonzero modulo seven. The next root is \(10\pmod{49}\), since \(10^2-2=98\). In computer algebra, \(x^2+8x+15\) factors modulo five as \(x(x+3)\); those coprime residues lift to the factors \(x+5\) and \(x+3\). More difficult integer-polynomial factorizations need a separate reconstruction and exact check after Hensel lifting.[ref-72ac8c72cf99][ref-e6b4f1e52012]
Clarity¶
Starting from a root \(a_k\pmod{p^k}\), try \(a_{k+1}=a_k+t p^k\). The next congruence reduces to \(f(a_k)/p^k+t f'(a_k)\equiv0\pmod p\). If the derivative is a unit modulo \(p\), precisely one \(t\pmod p\) works. The factor version instead corrects polynomial coefficients using coprimality. A singular root or noncoprime factor pair may sometimes lift, but this simple unique-lift guarantee no longer follows.[^ref-72ac8c72cf99]
Manages Complexity¶
Each correction preserves all earlier precision, avoiding a fresh search over every residue at the next modulus. A compatible infinite tower determines a p-adic object; unrelated solutions at separate moduli do not. Modular factorization is a bridge to integer factorization, not proof of it by itself.[ref-93832efbbc52][ref-e6b4f1e52012]
Abstract Reasoning¶
The shared pattern is base congruence → invertible correction condition → compatible prime-power tower → completed lift. A scalar derivative controls the root case, while a polynomial Bézout relation from coprime factors controls the factor case.
Knowledge Transfer¶
The \(7\)-adic square-root example maps the roles to a number and one corrected digit; the computer-algebra case maps them to monic polynomial factors and coefficient correction. What transfers is compatible local-to-complete lifting under nondegeneracy, not the claim that every approximate root works or that all lifted factors are automatically integer factors.[ref-72ac8c72cf99][ref-e6b4f1e52012]
[^ref-72ac8c72cf99]: David Loeffler, Computation in Algebra and Arithmetic, ETH Zürich course notes (2022), §§4.2.1–4.2.2, printed pp. 26–27. [^ref-93832efbbc52]: Robert Y. Lewis, “A Formal Proof of Hensel's Lemma over the p-adic Integers,” arXiv:1909.11342v1 (2019), §§2 and 5. [^ref-e6b4f1e52012]: Jose Divasón, Sebastiaan J. C. Joosten, René Thiemann, and Akihisa Yamada, “A Verified Implementation of the Berlekamp–Zassenhaus Factorization Algorithm,” Journal of Automated Reasoning 64:699–735 (2020; online 2019), §§8–9.
Neighborhood in Abstraction Space¶
Hensel's Lemma sits in a sparse region of the domain-specific corpus (67th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Polynomial Rings & Rational Approximants (15 abstractions)
Nearest neighbors
- Fermat's Little Theorem — 0.87
- Quartic reciprocity — 0.84
- Trial Division — 0.84
- Power Residue Symbol — 0.84
- Algebraic Extension — 0.83
Computed from structural-signature embeddings · 2026-10-08