Lably
Skip to content

P-adic number

Number system extending the rational numbers

  • 21 min read
  • 15 chapters
  • 1 lab on Lably

Learn it on Lably

For example, comparing the expansion of the rational number 15 in base 3 versus the 3-adic expansion, 15=0.0121¯(base 3)=0⋅30+0⋅3−1+1⋅3−2+2⋅3−3+⋯15=1210¯2(3-adic)=⋯+2⋅33+1⋅32+0⋅31+2⋅30.

Formally, given a prime number p, a p-adic number can be defined as a series s=∑i=k∞aipi=akpk+ak+1pk+1+ak+2pk+2+⋯ where k is an integer (possibly negative), and each ai is an integer such that 0≤ai<p. A p-adic integer is a p-adic number such that k≥0.

In general, the series that represents a p-adic number is not convergent in the usual sense, but it is convergent for the p-adic absolute value |s|p=p−k, where k is the least integer i such that ai≠0 (if all ai are zero, one has the zero p-adic number, which has 0 as its p-adic absolute value).

Every rational number can be uniquely expressed as the sum of a series as above, with respect to the p-adic absolute value. This allows considering rational numbers as special p-adic numbers, and alternatively defining the p-adic numbers as the completion of the rational numbers for the p-adic absolute value, exactly as the real numbers are the completion of the rational numbers for the usual absolute value.

p-adic numbers were first described by Kurt Hensel in 1897, though, with hindsight, some of Ernst Kummer's earlier work can be interpreted as implicitly using p-adic numbers.

For every prime number p, the p-adic numbers form a field. The definition of p-adic numbers may be generalized to the case where p is not prime. However, when p is a power of a prime q, these generalized p-adic numbers can be identified with the q-adic numbers. Otherwise, the generalized p-adic numbers do not form a field. Therefore, these generalized p-adic numbers are rarely encountered in the literature.

Motivation

Roughly speaking, modular arithmetic modulo a positive integer n consists of "approximating" every integer by the remainder of its division by n, called its residue modulo n. The main property of modular arithmetic is that the residue modulo n of the result of a succession of operations on integers is the same as the result of the same succession of operations on residues modulo n.

When studying Diophantine equations, it is sometimes useful to reduce the equation modulo a prime p, since this usually provides more insight about the equation itself. Unfortunately, doing this loses some information because the reduction Z↠Z/pZ is not injective.

One way to preserve more information is to use larger moduli, such as higher prime powers, p2, p3, .... However, this has the disadvantage of Z/peZ not being a field, which loses a lot of the algebraic properties that Z/pZ has.

Kurt Hensel discovered a method which consists of using a prime modulus p, and applying Hensel's lemma to lift solutions modulo p to modulo p2, p3, .... This process creates an infinite sequence of residues, and a p-adic number is defined as the "limit" of such a sequence.

Essentially, p-adic numbers allows "taking modulo pe for all e at once". A distinguishing feature of p-adic numbers from ordinary modulo arithmetic is that the set of p-adic numbers Qp forms a field, making division by p possible (unlike when working modulo pe). Furthermore, the mapping Z↪Zp is injective, so not much information is lost when reducing to p-adic numbers.

Sign in to keep reading

14 more chapters are free with a Lably account.

More in Number theory