Number theory often asks for solutions that are stable under increasing precision. If a congruence has a solution modulo $p$, does it lift \to a solution modulo $p^2$, then $p^3$, and so on? This question is not a technical curiosity; it is the doorway \to a local view of arithmetic. The $p$-adic numbers package “all powers of a prime at once” into a single field in which convergence means “agreement to high $p$-power accuracy.” Once that viewpoint is internalized, many classical arguments become sharper: lifting roots becomes a controlled analytic step, solvability questions acquire local criteria, and arithmetic becomes a study of completions much like $\mathbb{R}$ completes $\mathbb{Q}$ using the usual absolute value.
The $p$-adic absolute value
Fix a prime $p$. For a nonzero rational number $x$, write it uniquely as
Featured Console DealCompact 1440p Gaming ConsoleXbox Series S 512GB SSD All-Digital Gaming Console + 1 Wireless Controller, White
Xbox Series S 512GB SSD All-Digital Gaming Console + 1 Wireless Controller, White
An easy console pick for digital-first players who want a compact system with quick loading and smooth performance.
- 512GB custom NVMe SSD
- Up to 1440p gaming
- Up to 120 FPS support
- Includes Xbox Wireless Controller
- VRR and low-latency gaming features
Why it stands out
- Compact footprint
- Fast SSD loading
- Easy console recommendation for smaller setups
Things to know
- Digital-only
- Storage can fill quickly
where $a$ and $b$ are integers not divisible by $p$. The exponent $v_p(x)\in\mathbb{Z}$ is the $p$-adic valuation. Define
This absolute value measures how divisible a number is by $p$. Large positive $v_p(x)$ means $x$ has many factors of $p$, so $|x|_p$ is tiny.
Two features distinguish $|\cdot|_p$ from the usual absolute value.
- Multiplicativity: $|xy|_p = |x|_p|y|_p$, immediate from additivity of $v_p$.
- Non-Archimedean triangle inequality:
In valuation terms, $v_p(x+y)\ge \min(v_p(x),v_p(y))$, with strict inequality only when cancellation occurs.
That stronger inequality is the source of much of $p$-adic geometry and analysis. It implies, for example, that in a $p$-adic metric, triangles are “isosceles with a short base”: two sides are always at least as long as the third.
Completing $\mathbb{Q}$: from precision \to a field
Define a metric by $d_p(x,y)=|x-y|_p$. A sequence $(x_n)$ is Cauchy if $|x_n-x_m|_p$ becomes small for large $n,m$, meaning $x_n$ and $x_m$ agree modulo high powers of $p$. Completing $\mathbb{Q}$ with respect to this metric produces the field $\mathbb{Q}_p$ of $p$-adic numbers.
Every $p$-adic number can be represented by an infinite expansion
where each digit $a_i$ lies in $\{0,1,\dots,p-1\}$. This looks like a base-$p$ expansion, but it extends to the left rather than to the \right: higher powers of $p$ are “smaller.” Truncating after $p^k$ gives an approximation modulo $p^k$, and the truncations converge in the $p$-adic metric.
A few structural facts are indispensable:
- The valuation $v_p$ extends \to $\mathbb{Q}_p^\times$, and $|\cdot|_p$ extends \to $\mathbb{Q}_p$.
- The ring of $p$-adic integers is
equivalently those with $v_p(x)\ge 0$. It is a compact, complete, local ring with maximal ideal $p\mathbb{Z}_p$.
- The units of $\mathbb{Z}_p$ are exactly those with $v_p(x)=0$, i.e. numbers not divisible by $p$.
The slogan “$\mathbb{Z}_p$ remembers all congruences modulo $p^k$ simultaneously” is literally true: $\mathbb{Z}_p$ is the inverse limit of the rings $\mathbb{Z}/p^k\mathbb{Z}$.
Hensel’s Lemma: the lifting engine
Hensel’s Lemma is the $p$-adic analogue of Newton’s method. It tells when a solution modulo $p$ lifts uniquely \to a solution modulo all powers of $p$, and thus \to a solution in $\mathbb{Z}_p$.
A standard version is:
Let $f(x)\in \mathbb{Z}_p[x]$ (or $\mathbb{Z}[x]$). Suppose there exists $a\in\mathbb{Z}_p$ such that
Then there exists a unique $\alpha\in\mathbb{Z}_p$ with $\alpha\equiv a\pmod p$ and $f(\alpha)=0$.
The hypothesis $f'(a)\not\equiv 0\pmod p$ is a nondegeneracy condition: the root mod $p$ is simple. The conclusion is stronger than “a root exists.” It gives uniqueness of the lift and produces it by an explicit iteration.
The Newton iteration in $p$-adics
Start with $a_0=a$. Define
Because $f'(a_n)$ is a unit in $\mathbb{Z}_p$, the division is legitimate in $\mathbb{Z}_p$. The non-Archimedean inequality makes the convergence extremely strong: each step roughly doubles the number of correct $p$-adic digits under mild conditions. In practice, this provides a fast method for computing $p$-adic roots to high precision.
A concrete lifting example
Consider solving $x^2 \equiv 2 \pmod{p^k}$ for an odd prime $p$. First check whether $2$ is a quadratic residue mod $p$. If it is, choose $a$ with $a^2\equiv 2\pmod p$. Here $f(x)=x^2-2$ and $f'(x)=2x$. The condition $f'(a)\not\equiv 0\pmod p$ becomes $2a\not\equiv 0\pmod p$, which holds because $p\neq 2$ and $a\not\equiv 0\pmod p$. Hensel then produces a unique lift $\alpha\in\mathbb{Z}_p$ with $\alpha^2=2$. Every truncation of $\alpha$ gives a solution mod $p^k$.
The same pattern works for a wide class of congruences: find a simple root mod $p$, then lift.
Local solvability as a guiding principle
Many global Diophantine problems become tractable once separated into local conditions. The guiding idea is:
- If an equation has a rational (or integer) solution, then it has a solution in every completion of $\mathbb{Q}$: in $\mathbb{R}$ and in every $\mathbb{Q}_p$.
- Conversely, for certain classes of equations, having solutions in all completions implies a rational solution.
The second direction is subtle and does not always hold, but even the first direction is valuable: it provides obstructions. If an equation fails in $\mathbb{Q}_p$ for some $p$, it cannot hold over $\mathbb{Q}$.
A local check is often a congruence check. Since $\mathbb{Z}_p$ is the inverse limit of $\mathbb{Z}/p^k\mathbb{Z}$, solvability in $\mathbb{Z}_p$ corresponds to consistent solvability modulo $p^k$ for all $k$, and Hensel’s Lemma is the central tool for producing that consistency.
Geometry of $p$-adic distance
The inequality $|x+y|_p \le \max(|x|_p,|y|_p)$ has striking geometric consequences.
- Balls are both open and closed. A $p$-adic ball $B(a,p^{-k}) = \{x:\ |x-a|_p \le p^{-k}\}$ is clopen. This reflects the totally disconnected topology.
- Nested balls behave cleanly. Any two balls are either disjoint or one contains the other. There is no partial overlap. This is a powerful simplification in analysis and measure theory.
- Series converge by term size alone. A series $\sum b_n$ in $\mathbb{Q}_p$ converges if and only if $b_n\to 0$ in $|\cdot|_p$. There is no analogue of alternating-series subtlety; the strong triangle inequality collapses many complications.
These features are not optional curiosities; they shape the way number theory uses $p$-adics, especially in arguments that mix algebra and analysis.
Units, logarithms, and the structure of $\mathbb{Z}_p^\times$
The multiplicative group of units has a rich internal structure. For odd $p$,
where $\mu_{p-1}$ is the cyclic group of $(p-1)$-st roots of unity in $\mathbb{Z}_p$, and $1+p\mathbb{Z}_p$ is a pro-$p$ group. On $1+p\mathbb{Z}_p$, one can define a $p$-adic logarithm and exponential via power series:
which converge for $u$ sufficiently divisible by $p$. These functions turn multiplicative problems into additive ones, a method that parallels real analysis but with different convergence thresholds.
This is one of the reasons $p$-adic tools are so effective in studying congruences of multiplicative order, lifting roots of unity, and analyzing torsion phenomena in arithmetic settings.
Lifting beyond simple roots
The simplest Hensel condition uses $f'(a)\not\equiv 0\pmod p$. There are also useful variants that handle multiple roots by requiring stronger divisibility of $f(a)$ relative \to $f'(a)$. A common practical form is:
- If $v_p(f(a)) > 2v_p(f'(a))$, then there exists $\alpha$ with $f(\alpha)=0$ and $\alpha\equiv a\pmod{p^{v_p(f'(a))}}$.
This version explains why multiple-root situations are delicate: when $f'(a)$ is divisible by $p$, Newton steps can lose invertibility, and one needs additional $p$-adic accuracy in $f(a)$ \to compensate.
In computations, a reliable workflow is:
- Solve modulo $p$ first and classify roots as simple or multiple by checking $f'(a)\pmod p$.
- For simple roots, lift with the standard iteration.
- For multiple roots, lift only after verifying a strengthened divisibility condition or after factoring $f$ modulo $p$ and lifting factors.
The point is not to memorize all variants, but to remember what controls lifting: invertibility of the derivative, or extra valuation room when invertibility fails.
What to remember in practice
The fastest way to make $p$-adics usable rather than intimidating is to keep a small checklist:
- Valuation $v_p(x)$ measures $p$-divisibility; $|x|_p = p^{-v_p(x)}$.
- “Close” means “agree modulo a high power of $p$.”
- $\mathbb{Z}_p$ stores all residues mod $p^k$ coherently.
- Hensel’s Lemma lifts simple roots mod $p$ \to roots in $\mathbb{Z}_p$ and to solutions mod $p^k$ for every $k$.
- Non-Archimedean geometry simplifies convergence, ball structure, and many analytic arguments.
With those pieces in place, $p$-adic numbers stop being an exotic construction and become a disciplined way to talk about arithmetic at a single prime, with tools that are both conceptual and computationally effective.
Books by Drew Higgins
Bible Study / Spiritual Warfare
Ephesians 6 Field Guide: Spiritual Warfare and the Full Armor of God
Spiritual warfare is real—but it was never meant to turn your life into panic, obsession, or…
Leave a Reply