A prime p gives Q a second, non-Archimedean notion of distance: numbers become close when their difference is divisible by a high power of p. Completing Q under this metric produces Qp, the field where Hensel's lemma, Ostrowski's theorem, and modern arithmetic geometry live.
IntuitionRedefining closeness by divisibility
Ordinarily, two numbers are close when their difference is small. Fix a prime p instead, and declare two integers close when their difference is divisible by a **high power of p. This is not a metaphor: it is a genuine, rigorous notion of distance, just built from a completely different rule. The key gadget is the p-adic valuation** vp(n), the exponent of the highest power of p that divides the integer n (with vp(0)=∞). Large vp(n) means n is 'small' in the p-adic sense — the opposite of what n looks like on the number line.
A concrete check with p=5: take the integers 2, 7, 12, and 127. We have 7−2=5, so v5(7−2)=1; and 12−2=10=2⋅5, also v5(12−2)=1. But 127−2=125=53, so v5(127−2)=3. In the 5-adic sense, 127 sits far closer to 2 than either 7 or 12 does, even though 127 looks enormous on the ordinary number line and 7, 12 look nearby. Divisibility by 53, not ordinary size, decides closeness.
A circle with 9 evenly spaced points labeled 0 through 8; a chord is drawn from each point x to the point 2x mod 9, illustrating the doubling map on Z/9Z.
The clock face here is Z/9Z=Z/32Z, one finite stage of the tower Z/3Z,Z/32Z,Z/33Z,… whose limit builds the 3-adic integers Z3. Two integers land on the same point exactly when they are congruent modulo 9 — that is, when their 3-adic distance is at most 3−2. Congruence modulo a higher power of p always means the two numbers are closer in the p-adic metric.
UndergraduateBuilding Zp as a limit of finite rings
The valuation vp turns into a genuine absolute value on Q by setting ∣x∣p=p−vp(x) for x=0 and ∣0∣p=0: writing x=pvp(x)ba with p∤a, p∤b isolates exactly how divisible x is by p. This is multiplicative just like the usual absolute value, ∣xy∣p=∣x∣p∣y∣p, so dp(x,y)=∣x−y∣p is a genuine metric on Q — a rival to the familiar Euclidean one.
∣x∣p=p−vp(x)
Two equivalent ways to build the completion Qp of Q under ∣⋅∣p: (1) formally complete Q with respect to dp, exactly as Cauchy sequences build R from Q under the usual metric; or (2) first build the **p-adic integers** as an inverse limit of finite rings, Zp=limnZ/pnZ — a compatible sequence of residues modulo p,p2,p3,… — and then form Qp as its field of fractions. Both routes give the same field.
Zp=nlimZ/pnZ
Definition: p-adic integers and p-adic numbers
Every nonzero x∈Qp has a unique **p-adic expansion** x=∑i=k∞aipi with k=vp(x)∈Z, digits 0≤ai≤p−1, and ak=0; the series converges because ∣aipi∣p=p−i→0. An element lies in Zp exactly when k≥0, i.e. when it is an ordinary (possibly infinite) base-p expansion with no negative powers of p — the p-adic analogue of a decimal with finitely many digits before the point but arbitrarily many after it, except the infinite tail runs toward higher, not lower, powers of p.
x=i=k∑∞aipi,0≤ai≤p−1,k=vp(x)
Topologically, Zp (all digit sequences a0,a1,a2,…) is compact: it is homeomorphic to a product ∏i≥0{0,…,p−1} of finite discrete sets, so Tychonoff's theorem applies directly. Qp=⋃kp−kZp is then locally compact (every point has a compact neighborhood, namely a translate of Zp), exactly as R is locally compact but not compact. This local compactness is what lets Qp carry a Haar measure and support genuine p-adic analysis and integration.
For all x,y∈Qp, ∣x+y∣p≤max(∣x∣p,∣y∣p), and equality ∣x+y∣p=max(∣x∣p,∣y∣p) holds whenever ∣x∣p=∣y∣p.
Why is it true?
This is the defining feature separating the p-adic world from ordinary geometry: it forces every triangle to be isosceles. If dp(x,z)=∣x−z∣p, dp(x,y), dp(y,z) are the three pairwise distances among three points, the two largest of them must be equal. There is no such thing as a p-adic triangle with one side strictly longer than the other two — a picture that has no counterpart for the ordinary absolute value on R.
Proof
Write x=pvp(x)u, y=pvp(y)w with u,w units in Zp (i.e. ∣u∣p=∣w∣p=1), and suppose without loss of generality vp(x)≤vp(y), so ∣x∣p≥∣y∣p. Factor out the smaller power: x+y=pvp(x)(u+pvp(y)−vp(x)w). The term in parentheses is a genuine element of Zp (a sum of elements of Zp), so its p-adic absolute value is ≤1; hence ∣x+y∣p≤p−vp(x)=∣x∣p=max(∣x∣p,∣y∣p), proving the inequality. If moreover vp(x)<vp(y) strictly (i.e. ∣x∣p=∣y∣p), then pvp(y)−vp(x)w≡0(modp) while u is a unit, so u+pvp(y)−vp(x)w≡u≡0(modp) is again a unit; thus ∣x+y∣p=p−vp(x) exactly, giving equality.
∣x+y∣p≤max(∣x∣p,∣y∣p),equality if ∣x∣p=∣y∣p
Example: Checking the isosceles-triangle property with p=3
Take x=54 and y=24, and p=3. Compute ∣54∣3 and ∣24∣3 directly, then check the ultrametric prediction against 54+24=78.
Solution
Factor: 54=2⋅33, so v3(54)=3 and ∣54∣3=3−3=1/27. Also 24=23⋅3, so v3(24)=1 and ∣24∣3=3−1=1/3. Since ∣54∣3=1/27=1/3=∣24∣3, the theorem's equality case applies, predicting ∣78∣3=max(1/27,1/3)=1/3. Directly: 78=2⋅3⋅13, so v3(78)=1 and ∣78∣3=1/3 — exactly as predicted. The triangle with vertices 0, 54, 78 (sides 54, 24, 78 in 3-adic distance) has its two longest sides, 1/27-side and 1/3-side... more precisely its two largest distances equal to 1/3, confirming the isosceles shape.
Let f(X)∈Zp[X] and suppose a∈Zp satisfies f(a)≡0(modp) and f′(a)≡0(modp) (a **simple root mod p**). Then there exists a unique α∈Zp with f(α)=0 exactly and α≡a(modp).
Why is it true?
This is the p-adic cousin of Newton's method, except it converges exactly rather than merely approximately: because Qp is complete and ∣⋅∣p is ultrametric, the Newton iterates an+1=an−f(an)/f′(an) do not just approach a root, they stabilize digit by digit and land on one precisely after infinitely many corrections. A simple root mod p is guaranteed to 'lift' uniquely all the way to an honest root in Zp, turning a finite, checkable congruence condition into an existence proof for an exact p-adic number.
Proof
Construct α as a limit of successive approximations a=a0,a1,a2,⋯∈Zp with an+1=an−f(an)/f′(an), showing by induction that vp(f(an))≥n+1 and vp(f′(an))=vp(f′(a))=0 for all n (the derivative stays a unit since an+1≡an(modp) at every step, so f′(an)≡f′(a)≡0(modp) throughout). Then vp(an+1−an)=vp(f(an))−vp(f′(an))≥n+1, so (an) is Cauchy in the p-adic metric; by completeness of Zp it converges to some α≡a(modp), and continuity of f forces f(α)=limf(an)=0. Uniqueness: if β=α were another root with β≡a(modp), the mean value / Taylor expansion f(β)−f(α)=(β−α)(f′(α)+p(⋯)) with f′(α) a unit would force β=α.
Let f(X)=X2−2 and p=7. Since 32=9≡2(mod7), a0=3 is a root mod 7. Use Hensel's lemma to find the next 7-adic digit, i.e. determine αmod49.
Solution
Check the hypotheses: f(3)=9−2=7≡0(mod7), and f′(3)=2⋅3=6≡0(mod7), so Hensel's lemma applies. Write the next approximation as a1=3+7k for k∈{0,…,6} and expand modulo 49: (3+7k)2=9+42k+49k2≡9+42k(mod49). We need 9+42k≡2(mod49), i.e. 42k≡−7≡42(mod49); dividing through by 7 gives 6k≡6(mod7), so k≡1(mod7). Taking k=1 gives a1=3+7=10. Check: 102=100=2⋅49+2≡2(mod49) — exactly right. So α≡10(mod49), and the process continues to pin down α=…a2a1a0 in base 7 digit by digit forever.
AdvancedOstrowski's theorem: p-adic numbers are exactly as fundamental as the reals
Why single out R as the completion of Q, when each prime p produces its own Qp? The honest answer is that there is no reason to: R has no special status among absolute values on Q beyond being the 'infinite place'. This is made precise by Ostrowski's theorem, and it is the theorem that certifies p-adic arithmetic is not a curiosity bolted onto number theory, but exactly as fundamental as the real numbers themselves.
Every nontrivial absolute value on Q is equivalent either to the usual absolute value ∣⋅∣∞, or to ∣⋅∣p for exactly one prime p.
Why is it true?
This says the 'places' of Q — the essentially different ways to measure size and complete the field — are exactly the classical primes 2,3,5,7,… together with one extra 'infinite prime' ∞ standing for the usual absolute value. Nothing distinguishes ∞ structurally from any p; it just happens to be the one Archimedean place. This single fact is the seed of the adeles and the entire local-global philosophy of modern number theory: to understand Q, study it simultaneously at every place R,Q2,Q3,Q5,….
Proof
Sketch. Let ∣⋅∣ be a nontrivial absolute value on Q. Case 1 (non-Archimedean): if ∣n∣≤1 for every integer n, the set p={n∈Z:∣n∣<1} is a prime ideal of Z (it is closed under addition by the ultrametric inequality, which any absolute value with ∣n∣≤1 on Z automatically satisfies, and under multiplication by primality), hence p=(p) for a unique prime p; comparing ∣p∣ to p−1 and using multiplicativity shows ∣⋅∣ is equivalent to ∣⋅∣p. Case 2 (Archimedean): if ∣n0∣>1 for some integer n0, write any integer n>1 in base n0 and use the triangle inequality together with ∣n0k∣=∣n0∣k→∞ to bound ∣n∣ above and below by powers of n itself, forcing ∣n∣=nc for a constant c∈(0,1] independent of n; this makes ∣⋅∣ equivalent to ∣⋅∣∞.
That local-global philosophy pays off spectacularly for quadratic forms. The Hasse–Minkowski theorem (Hasse, early 1920s, building on Minkowski) says a quadratic form f in several variables over Q represents 0 nontrivially over Qif and only if it represents 0 nontrivially over every completion: over R and over Qp for every prime p. Checking solvability over R is just a sign condition, and checking solvability over Qp reduces to a finite computation using Hensel's lemma — so an a priori infinite search over Qn collapses to finitely many easy local checks. This is the archetype of a local-global (Hasse) principle; it is a genuine miracle special to quadratic forms; degree-3 forms can fail it (Selmer's curve 3x3+4y3+5z3=0 has points everywhere locally but no rational point).
frepresents0overQ⟺frepresents0overRand overQpfor every primep
A finite rooted binary tree with three levels: the root splits into two children, each of which splits into two more, forming a small symmetric branching diagram. It is used purely as a generic branching-tree analogy, not an accurate rendering of the infinite (p+1)-regular Bruhat-Tits tree.
Honest disclaimer: this finite binary tree is only an illustrative stand-in, not a literal picture of the Bruhat–Tits tree attached to SL2(Qp). The real Bruhat–Tits tree is infinite and (p+1)-regular — every vertex has p+1 neighbors, not 2 — and its vertices are homothety classes of lattices in Qp2. What this picture does convey honestly is the qualitative shape shared by all such trees: a branching, self-similar structure with no cycles, mirroring how nested p-adic balls never partially overlap — they are always either disjoint or one contains the other, just like branches splitting apart and never rejoining.
Qp is the prototype of a local field, and every number field K has its own family of completions at its primes, generalizing Qp — the basic objects of algebraic number theory's local-global machinery (class field theory, ramification, Galois representations). Fixing p and letting the field vary in a towerQp⊂K∞ is the setting of Iwasawa theory, whose p-adic L-functions p-adically interpolate classical L-values and encode deep arithmetic invariants (class numbers, Selmer groups) — one of the main engines of modern arithmetic geometry, feeding directly into the tools used to attack the Birch–Swinnerton-Dyer conjecture and beyond.
ResearchPerfectoid spaces and the living frontier
For most of the twentieth century p-adic numbers stayed inside algebraic number theory. That changed in the 2010s with Peter Scholze's introduction of perfectoid spaces: highly ramified p-adic geometric objects (built from towers like Qp(p1/p∞)) whose geometry becomes, remarkably, equivalent to the geometry of certain spaces in positive characteristic via a 'tilting' correspondence. This lets deep theorems about characteristic-p geometry (where Frobenius makes life easier) be transported back to prove new results in mixed and p-adic characteristic, and vice versa.
If ∣x∣p=1/9 and ∣y∣p=1/27 with p=3, what does the ultrametric inequality tell us about ∣x+y∣p?
According to Ostrowski's theorem, what are the nontrivial absolute values on Q, up to equivalence?
Hensel's lemma lets you lift a root a of f modulo p to an exact root in Zp provided which condition holds?
What does the p-adic valuation vp(n) of a nonzero integer n measure?