Beyond the Reals: An Introduction to p-adic Number Systems and Their Power in Number Theory

P-adic number systems represent a profound extension of our standard concept of numbers. For each prime *p*, there exists a field of p-adic numbers, ℚp, which is constructed by completing the rational numbers using a non-standard notion of distance. This 'p-adic distance' considers two numbers to be close if their difference is divisible by a high power of the prime *p*. This leads to a number system with strange and powerful properties, governed by the ultrametric inequality, where numbers can be represented as base-*p* expansions that extend infinitely to the left. Beyond being a mathematical curiosity, p-adic numbers are a cornerstone of modern number theory. Their primary application is in the study of Diophantine equations. Hensel's Lemma, a p-adic analogue of Newton's method, provides a powerful algorithm for solving polynomial equations by refining an approximate solution modulo *p* into an exact solution in the p-adic integers. Furthermore, the famous Hasse-Minkowski theorem, or Local-Global Principle, demonstrates that the existence of rational solutions to quadratic equations is entirely determined by their existence in the real numbers and in every p-adic field. This allows impossibly hard problems over the rational numbers to be solved by analyzing them in these more manageable 'local' settings.

Introduction: A Different Notion of 'Close'

In mathematics, we are most familiar with the real numbers, ℝ. We understand them as the completion of the rational numbers, ℚ, by 'filling in the gaps'. For example, the sequence 3, 3.1, 3.14, 3.141, ... is a sequence of rational numbers that gets progressively 'closer' to the irrational number π. This notion of 'closeness' is defined by the standard absolute value, |x - y|. But what if we defined 'closeness' in a completely different way?

P-adic number systems, for a given prime number p, do exactly this. Instead of considering numbers close if their difference is small in the usual sense, p-adic numbers are considered close if their difference is divisible by a high power of p. This seemingly strange idea, developed by Kurt Hensel in the late 19th century, provides an incredibly powerful tool for solving problems in number theory, creating a bridge between the discrete world of integers and the continuous world of analysis.

Section 1: The p-adic Absolute Value and Ultrametric Geometry

To build a new number system, we need a new way to measure distance. This begins with the p-adic valuation.

Definition (p-adic Valuation): For a prime p and a non-zero integer n, the p-adic valuation, denoted v_p(n), is the highest power of p that divides n. By convention, v_p(0) = ∞. For a rational number x = a/b, the valuation is defined as v_p(x) = v_p(a) - v_p(b).

Example: Let p = 5.

• v₅(50) = v₅(2 5²) = 2*
• v₅(7) = 0
• v₅(1/125) = v₅(1) - v₅(5³) = 0 - 3 = -3

From this valuation, we define the p-adic absolute value.

Definition (p-adic Absolute Value): For a rational number x and a prime p, the p-adic absolute value is |x|_p = p^-v_p(x). By convention, |0|_p = 0.

Example: Let p = 5.

• |50|₅ = 5^-v₅(50) = 5^-2 = 1/25 (This is 'small'!)
• |7|₅ = 5^-v₅(7) = 5^-0 = 1 (This is 'large'.)
• |1/125|₅ = 5^-v₅(1/125) = 5^-(-3) = 125 (This is 'very large'.)

This absolute value has a bizarre and powerful property that distinguishes it from the usual absolute value: the Ultrametric Inequality.

|x + y|_p ≤ max(|x|_p, |y|_p)

This is much stronger than the standard triangle inequality (|x + y| ≤ |x| + |y|). It implies strange geometric properties. For instance, in a p-adic space, all triangles are isosceles. If you have three points A, B, and C, the two largest side lengths must be equal. Furthermore, any point inside a 'disk' (a set of points y such that |y - x|_p < r) is its center!

Section 2: Constructing the p-adic Numbers (ℚ_p)

Just as the real numbers ℝ are the completion of ℚ with respect to the usual absolute value, the field of p-adic numbers, denoted ℚ_p, is the completion of ℚ with respect to the p-adic absolute value |·|_p. While the formal definition involves Cauchy sequences, a more intuitive way to understand them is through base-p expansions.

A real number can be written as a decimal expansion, which is a sum of powers of 10, potentially extending infinitely to the right. A p-adic number can be written as a base-p expansion that extends infinitely to the left.

The ring of p-adic integers, ℤ_p, consists of all p-adic numbers with non-negative valuation (i.e., |x|_p ≤ 1). They can be written as:

x = d₀ + d₁p + d₂p² + d₃p³ + ...

where each digit d_i is an integer satisfying 0 ≤ d_i < p.

Example (Arithmetic in ℤ₅): Let's represent -1 in ℤ₅. We are looking for a number x = ...d₂d₁d₀ in base 5 such that x + 1 = 0.

• d₀ + 1 must be a multiple of 5. So, d₀ = 4. We carry a 1.
• d₁ + 1 (carry) must be a multiple of 5. So, d₁ = 4. We carry a 1.
• This continues indefinitely. Therefore, in ℤ₅, -1 = ...444₅ = 4 + 4·5 + 4·5² + ...

This is a geometric series which, in a p-adic sense, converges: 4(1 + 5 + 5² + ...) = 4(1 / (1-5)) = 4 / (-4) = -1.

The full field of p-adic numbers, ℚ_p, allows for a finite number of negative powers of p, similar to how real numbers can have digits after the decimal point:

x = d_-mp^-m + ... + d_-1p^-1 + d₀ + d₁p + ...

Section 3: Applications in Number Theory

P-adic numbers are not just an intellectual curiosity; they are a fundamental tool for solving Diophantine equations (polynomial equations with integer solutions).

1. Hensel's Lemma: This is arguably the most important tool in p-adic analysis. It is a p-adic version of Newton's method for finding roots of functions. Informally, it states:

If a polynomial equation f(x) = 0 (with integer coefficients) has a simple approximate solution modulo p, then you can refine it to find a unique, exact solution in the p-adic integers ℤ_p.

Example: Does x² = 2 have a solution in ℤ₇? First, we solve modulo 7: x² ≡ 2 (mod 7). We can check that x ≡ 3 (mod 7) is a solution (since 3² = 9 ≡ 2). Since the derivative f'(x) = 2x is non-zero at x=3 (i.e., 2·3 = 6 <binary data, 1 bytes> 0 (mod 7)), this is a simple root. Hensel's Lemma guarantees we can 'lift' this to a unique solution in ℤ₇. We can find the next digit by setting x = 3 + 7k and solving modulo 49: (3 + 7k)² ≡ 2 (mod 49) 9 + 42k + 49k² ≡ 2 (mod 49) 42k ≡ -7 (mod 49) Dividing by 7 gives 6k ≡ -1 ≡ 6 (mod 7), so k ≡ 1 (mod 7). Our refined solution is x ≡ 3 + 1·7 = 10 (mod 49). This iterative process can be continued to find all the digits of the 7-adic square root of 2. In contrast, since x² ≡ 2 (mod 5) has no solution, there is no square root of 2 in ℚ₅.

2. The Hasse-Minkowski Theorem (The Local-Global Principle): This profound theorem connects 'local' properties of equations to 'global' ones. It states:

A quadratic equation with rational coefficients has a non-trivial rational solution (a 'global' solution) if and only if it has a non-trivial solution in the real numbers ℝ and in the p-adic numbers ℚ_p for every prime p (the 'local' solutions).

This is incredibly powerful. To determine if an equation has a rational solution—a very hard problem—we can instead check for solutions in the 'simpler' local fields. Often, we can find a single prime p for which there is no solution in ℚ_p, which immediately proves there is no rational solution.

Example: Consider the equation 3x² + 4y² = 5z². Does it have a non-zero integer solution? We can test this in ℚ₃ (or equivalently, modulo 3). The equation becomes 0·x² + 1·y² ≡ 2·z² (mod 3), or y² ≡ 2z² (mod 3). The squares modulo 3 are 0 and 1. If z is not a multiple of 3, then z² ≡ 1, and the equation is y² ≡ 2 (mod 3), which has no solution. If z is a multiple of 3, then z² ≡ 0, so y² ≡ 0, which means y must also be a multiple of 3. A deeper argument shows this forces x to also be a multiple of 3, meaning we can always divide a solution (x, y, z) by 3 to get a smaller solution, a process that can't continue forever. This 'descent' argument shows there are no non-trivial solutions in ℚ₃, and thus by the Hasse-Minkowski theorem, no non-trivial rational solutions.

Browse public study notes