Folioby Interconnected
Log InSign Up

$p$-adic Valuations and an Introduction to Local Methods — Viewing Integers One Prime at a Time

We define the p-adic valuation v_p(n) and the p-adic absolute value, and state Ostrowski's theorem. We construct the ring of p-adic integers Z_p, prove Hensel's lemma, and discuss the local-global principle.

FO
Folio Official
March 1, 2026

1 Thep-adic Valuation

Definition 1 (p-adic valuation).
For a prime p and a nonzero integer n, the p-adic valuation of n, denoted vp​(n), is the non-negative integer k such that pk∣n and pk+1∤n. We set vp​(0)=+∞. For a rational number r=a/b (b=0), we extend the definition by vp​(r)=vp​(a)−vp​(b).
Theorem 2 (Properties of the p-adic valuation).
For nonzero rationals x,y:
  1. vp​(xy)=vp​(x)+vp​(y) (multiplicativity).

  2. vp​(x+y)≥min(vp​(x),vp​(y)) (ultrametric inequality), with equality whenever vp​(x)=vp​(y).

Proof.
(1) Write x=pau and y=pbv with gcd(u,p)=gcd(v,p)=1. Then xy=pa+buv with gcd(uv,p)=1, so vp​(xy)=a+b.

(2) Let vp​(x)=a and vp​(y)=b with a≤b. Then x+y=pa(u+pb−av), so vp​(x+y)≥a=min(a,b). When a<b, u+pb−av≡u≡0(modp), so vp​(x+y)=a. □
Remark 3.
The fundamental theorem of arithmetic can be restated as follows: every nonzero integer n is uniquely expressed as n=±∏p​pvp​(n), where the product runs over all primes and vp​(n)=0 for all but finitely many p.

2 Thep-adic Absolute Value

Definition 4 (p-adic absolute value).
For a nonzero rational x, set ∣x∣p​=p−vp​(x), and define ∣0∣p​=0. This is called the p-adic absolute value.
Theorem 5 (Properties of the p-adic absolute value).
  1. ∣x∣p​≥0, with ∣x∣p​=0 if and only if x=0.

  2. ∣xy∣p​=∣x∣p​∣y∣p​.

  3. ∣x+y∣p​≤max(∣x∣p​,∣y∣p​) (ultrametric inequality).

Remark 6.
Property (3) is strictly stronger than the ordinary triangle inequality ∣x+y∣≤∣x∣+∣y∣. An absolute value satisfying (3) is called non-archimedean.

3 Ostrowski's Theorem

Theorem 7 (Ostrowski's theorem).
Every nontrivial absolute value on Q is equivalent either to the usual absolute value ∣⋅∣∞​ or to the p-adic absolute value ∣⋅∣p​ for some prime p.
Remark 8.
This theorem means that the only ways to complete Q are to obtain R (the completion with respect to ∣⋅∣∞​) or Qp​ (the completion with respect to ∣⋅∣p​). The collection of all primes p together with ∞ constitutes the set of places of Q, and these places govern the global structure of number theory.

4 Thep-adic IntegersZp​

Definition 9 (p-adic integers).
The set of p-adic numbers x∈Qp​ with ∣x∣p​≤1 is called the ring ofp-adic integers and is denoted Zp​. Formally, it can be constructed as the inverse limit Zp​=lim​Z/pnZ:
Zp​={(an​)n≥1​∈n=1∏∞​Z/pnZ​an+1​≡an​(modpn) for all n}.
Theorem 10.
Zp​ is an integral domain with fraction field Qp​. Its unique maximal ideal is pZp​, and Zp​/pZp​≅Z/pZ. In other words, Zp​ is a discrete valuation ring.

5 Hensel's Lemma

Theorem 11 (Hensel's lemma).
Let f(x)∈Zp​[x] and suppose a∈Zp​ satisfies ∣f(a)∣p​<∣f′(a)∣p2​. Then there exists a unique α∈Zp​ with f(α)=0 and ∣α−a∣p​≤∣f(a)/f′(a)∣p​<∣f′(a)∣p​.
Proof.
The Newton iteration an+1​=an​−f(an​)/f′(an​) converges in the p-adic topology. The ultrametric inequality ensures that ∣an+1​−an​∣p​ shrinks rapidly and ∣f(an​)∣p​ decreases at twice the rate (quadratic convergence). By the completeness of Zp​, the limit α=liman​ exists and satisfies f(α)=0. □
Example 12.
Take p=7 and f(x)=x2−2. With a=3, we have f(3)=7, f′(3)=6, ∣f(3)∣7​=1/7<1=∣f′(3)∣72​. By Hensel's lemma, 2​∈Z7​; that is, 2 has a square root in the 7-adic integers.

6 The Local–Global Principle

Remark 13.
The local–global principle (or Hasse principle) asserts that an equation has a solution over Q if and only if it has solutions over R and over Qp​ for every prime p. For quadratic forms this is established by the Hasse–Minkowski theorem, but the principle fails in general. A classical counterexample is the equation 3x3+4y3+5z3=0, which has solutions in R and in every Qp​ but not in Q.
Number TheoryAlgebraTextbookp-adic NumbersValuation
FO
Folio Official

Mathematics "between the lines" — exploring the intuition textbooks leave out, written in LaTeX on Folio.

1 followers·107 articles
Number Theory TextbookPart 12 of 13
Previous
Chebyshev's Estimates: 0.92 x/ln x < π(x) < 1.11 x/ln x and the Prime Number Theorem
Next
Introduction to Algebraic Integers — Extending the Notion of Integer

Share your expertise with the world

Write articles with LaTeX support, build your audience, and earn from your knowledge.

Start Writing — It's Free

More from Folio Official

Folio Official·March 1, 2026

Continued Fractions and Diophantine Approximation — The Theory of Rational Approximation

We define finite and infinite continued fractions, prove convergence, and rigorously establish the properties of convergents. We develop the theory of best rational approximations, solve the Pell equation x^2 - Dy^2 = 1 via continued fractions, and discuss the Stern--Brocot tree.

Number TheoryAlgebraTextbook
3
Folio Official·March 1, 2026

Primes and the Fundamental Theorem of Arithmetic — The Atomic Decomposition of Integers

We define prime numbers and establish their basic properties, including Euclid's proof of the infinitude of primes. We then give a rigorous proof of the fundamental theorem of arithmetic (existence and uniqueness of prime factorization), and discuss the sieve of Eratosthenes and the Miller--Rabin primality test.

Number TheoryAlgebraTextbook
3
Folio Official·March 1, 2026

Introduction to Algebraic Integers — Extending the Notion of Integer

Using the Gaussian integers Z[i] and the Eisenstein integers Z[omega] as concrete examples, we introduce rings of algebraic integers. We demonstrate the failure of unique factorization in Z[sqrt(-5)] and show how ideals and prime ideal factorization restore uniqueness. We define the class number and discuss its significance.

Number TheoryAlgebraTextbook
2
Folio Official·March 1, 2026

Arithmetic Functions and Multiplicative Functions — Functions on the Integers

We systematically define the principal multiplicative functions (phi, sigma, mu, d), develop the ring structure of Dirichlet convolution, and give a rigorous proof of the Moebius inversion formula. We also clarify the connection to the inclusion-exclusion principle.

Number TheoryAlgebraTextbook
1