p-adic number

In number theory, given a prime number p, the p-adic numbers form an extension of the rational numbers which is distinct from the real numbers, though with some similar properties; p-adic numbers can be written in a form similar to (possibly infinite) decimals, but with digits based on a prime number p rather than ten, and extending to the left rather than to the right.

For example, comparing the expansion of the rational number ${\displaystyle {\tfrac {1}{5}}}$ in base 3 vs. the 3-adic expansion,

${\displaystyle {\begin{alignedat}{3}{\tfrac {1}{5}}&{}=0.01210121\ldots \ ({\text{base }}3)&&{}=0\cdot 3^{0}+0\cdot 3^{-1}+1\cdot 3^{-2}+2\cdot 3^{-3}+\cdots \\[5mu]{\tfrac {1}{5}}&{}=\dots 121012102\ \ ({\text{3-adic}})&&{}=\cdots +2\cdot 3^{3}+1\cdot 3^{2}+0\cdot 3^{1}+2\cdot 3^{0}.\end{alignedat}}}$

Formally, given a prime number p, a p-adic number can be defined as a series

${\displaystyle s=\sum _{i=k}^{\infty }a_{i}p^{i}=a_{k}p^{k}+a_{k+1}p^{k+1}+a_{k+2}p^{k+2}+\cdots }$

where k is an integer (possibly negative), and each ${\displaystyle a_{i}}$ is an integer such that ${\displaystyle 0\leq a_{i}<p.}$ A p-adic integer is a p-adic number such that ${\displaystyle k\geq 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 ${\displaystyle |s|_{p}=p^{-k},}$ where k is the least integer i such that ${\displaystyle a_{i}\neq 0}$ (if all ${\displaystyle a_{i}}$ 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,^[1] though, with hindsight, some of Ernst Kummer's earlier work can be interpreted as implicitly using p-adic numbers.^{[note 1]}

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. If one knows that the absolute value of the result is less than n/2, this allows a computation of the result which does not involve any integer larger than n.

For larger results, an old method, still in common use, consists of using several small moduli that are pairwise coprime, and applying the Chinese remainder theorem for recovering the result modulo the product of the moduli.

Another method discovered by Kurt Hensel consists of using a prime modulus p, and applying Hensel's lemma for recovering iteratively the result modulo ${\displaystyle p^{2},p^{3},\ldots ,p^{n},\ldots }$ If the process is continued infinitely, this provides eventually a result which is a p-adic number.

The theory of p-adic numbers is fundamentally based on the two following lemmas

Every nonzero rational number can be written ${\textstyle p^{v}{\frac {m}{n}},}$ where v, m, and n are integers and neither m nor n is divisible by p. The exponent v is uniquely determined by the rational number and is called its p-adic valuation (this definition is a particular case of a more general definition, given below). The proof of the lemma results directly from the fundamental theorem of arithmetic.

Every nonzero rational number r of valuation v can be uniquely written ${\displaystyle r=ap^{v}+s,}$ where s is a rational number of valuation greater than v, and a is an integer such that ${\displaystyle 0<a<p.}$

The proof of this lemma results from modular arithmetic: By the above lemma, ${\textstyle r=p^{v}{\frac {m}{n}},}$ where m and n are integers coprime with p. The modular inverse of n is an integer q such that ${\displaystyle nq=1+ph}$ for some integer h. Therefore, one has ${\textstyle {\frac {1}{n}}=q-p{\frac {h}{n}},}$ and ${\textstyle r=p^{v}mq-p^{v+1}{\frac {hm}{n}}.}$ The Euclidean division of ${\displaystyle mq}$ by p gives ${\displaystyle mq=pk+a}$ where ${\displaystyle 0<a<p,}$ since mq is not divisible by p. So,

${\displaystyle r=ap^{v}+p^{v+1}{\frac {kn-hm}{n}},}$

which is the desired result.

This can be iterated starting from s instead of r, giving the following.

Given a nonzero rational number r of valuation v and a positive integer k, there are a rational number ${\displaystyle s_{k}}$ of nonnegative valuation and k uniquely defined nonnegative integers ${\displaystyle a_{0},\ldots ,a_{k-1}}$ less than p such that ${\displaystyle a_{0}>0}$ and

${\displaystyle r=a_{0}p^{v}+a_{1}p^{v+1}+\cdots +a_{k-1}p^{v+k-1}+p^{v+k}s_{k}.}$

The p-adic numbers are essentially obtained by continuing this infinitely to produce an infinite series.

The p-adic numbers are commonly defined by means of p-adic series.

A p-adic series is a formal power series of the form

${\displaystyle \sum _{i=v}^{\infty }r_{i}p^{i},}$

where ${\displaystyle v}$ is an integer and the ${\displaystyle r_{i}}$ are rational numbers that either are zero or have a nonnegative valuation (that is, the denominator of ${\displaystyle r_{i}}$ is not divisible by p).

Every rational number may be viewed as a p-adic series with a single nonzero term, consisting of its factorization of the form ${\displaystyle p^{k}{\tfrac {n}{d}},}$ with n and d both coprime with p.

Two p-adic series ${\textstyle \sum _{i=v}^{\infty }r_{i}p^{i}}$ and ${\textstyle \sum _{i=w}^{\infty }s_{i}p^{i}}$ are equivalent if there is an integer N such that, for every integer ${\displaystyle n>N,}$ the rational number

${\displaystyle \sum _{i=v}^{n}r_{i}p^{i}-\sum _{i=w}^{n}s_{i}p^{i}}$

is zero or has a p-adic valuation greater than n.

A p-adic series ${\textstyle \sum _{i=v}^{\infty }a_{i}p^{i}}$ is normalized if either all ${\displaystyle a_{i}}$ are integers such that ${\displaystyle 0\leq a_{i}<p,}$ and ${\displaystyle a_{v}>0,}$ or all ${\displaystyle a_{i}}$ are zero. In the latter case, the series is called the zero series.

Every p-adic series is equivalent to exactly one normalized series. This normalized series is obtained by a sequence of transformations, which are equivalences of series; see § Normalization of a p-adic series, below.

In other words, the equivalence of p-adic series is an equivalence relation, and each equivalence class contains exactly one normalized p-adic series.

The usual operations of series (addition, subtraction, multiplication, division) are compatible with equivalence of p-adic series. That is, denoting the equivalence with ~, if S, T and U are nonzero p-adic series such that ${\displaystyle S\sim T,}$ one has

${\displaystyle {\begin{aligned}S\pm U&\sim T\pm U,\\SU&\sim TU,\\1/S&\sim 1/T.\end{aligned}}}$

The p-adic numbers are often defined as the equivalence classes of p-adic series, in a similar way as the definition of the real numbers as equivalence classes of Cauchy sequences. The uniqueness property of normalization, allows uniquely representing any p-adic number by the corresponding normalized p-adic series. The compatibility of the series equivalence leads almost immediately to basic properties of p-adic numbers:

• Addition, multiplication and multiplicative inverse of p-adic numbers are defined as for formal power series, followed by the normalization of the result.
• With these operations, the p-adic numbers form a field, which is an extension field of the rational numbers.
• The valuation of a nonzero p-adic number x, commonly denoted ${\displaystyle v_{p}(x)}$ is the exponent of p in the first non zero term of the corresponding normalized series; the valuation of zero is ${\displaystyle v_{p}(0)=+\infty }$
• The p-adic absolute value of a nonzero p-adic number x, is ${\displaystyle |x|_{p}=p^{-v(x)};}$ for the zero p-adic number, one has ${\displaystyle |0|_{p}=0.}$

Starting with the series ${\textstyle \sum _{i=v}^{\infty }r_{i}p^{i},}$ the first above lemma allows getting an equivalent series such that the p-adic valuation of ${\displaystyle r_{v}}$ is zero. For that, one considers the first nonzero ${\displaystyle r_{i}.}$ If its p-adic valuation is zero, it suffices to change v into i, that is to start the summation from v. Otherwise, the p-adic valuation of ${\displaystyle r_{i}}$ is ${\displaystyle j>0,}$ and ${\displaystyle r_{i}=p^{j}s_{i}}$ where the valuation of ${\displaystyle s_{i}}$ is zero; so, one gets an equivalent series by changing ${\displaystyle r_{i}}$ to 0 and ${\displaystyle r_{i+j}}$ to ${\displaystyle r_{i+j}+s_{i}.}$ Iterating this process, one gets eventually, possibly after infinitely many steps, an equivalent series that either is the zero series or is a series such that the valuation of ${\displaystyle r_{v}}$ is zero.

Then, if the series is not normalized, consider the first nonzero ${\displaystyle r_{i}}$ that is not an integer in the interval ${\displaystyle [0,p-1].}$ The second above lemma allows writing it ${\displaystyle r_{i}=a_{i}+ps_{i};}$ one gets n equivalent series by replacing ${\displaystyle r_{i}}$ with ${\displaystyle a_{i},}$ and adding ${\displaystyle s_{i}}$ to ${\displaystyle r_{i+1}.}$ Iterating this process, possibly infinitely many times, provides eventually the desired normalized p-adic series.

There are several equivalent definitions of p-adic numbers. The one that is given here is relatively elementary, since it does not involve any other mathematical concepts than those introduced in the preceding sections. Other equivalent definitions use completion of a discrete valuation ring (see § p-adic integers), completion of a metric space (see § Topological properties), or inverse limits (see § Modular properties).

A p-adic number can be defined as a normalized p-adic series. Since there are other equivalent definitions that are commonly used, one says often that a normalized p-adic series represents a p-adic number, instead of saying that it is a p-adic number.

One can say also that any p-adic series represents a p-adic number, since every p-adic series is equivalent to a unique normalized p-adic series. This is useful for defining operations (addition, subtraction, multiplication, division) of p-adic numbers: the result of such an operation is obtained by normalizing the result of the corresponding operation on series. This well defines operations on p-adic numbers, since the series operations are compatible with equivalence of p-adic series.

With these operations, p-adic numbers form a field called the field of p-adic numbers and denoted ${\displaystyle \mathbb {Q} _{p}}$ or ${\displaystyle \mathbf {Q} _{p}.}$ There is a unique field homomorphism from the rational numbers into the p-adic numbers, which maps a rational number to its p-adic expansion. The image of this homomorphism is commonly identified with the field of rational numbers. This allows considering the p-adic numbers as an extension field of the rational numbers, and the rational numbers as a subfield of the p-adic numbers.

The valuation of a nonzero p-adic number x, commonly denoted ${\displaystyle v_{p}(x),}$ is the exponent of p in the first nonzero term of every p-adic series that represents x. By convention, ${\displaystyle v_{p}(0)=\infty ;}$ that is, the valuation of zero is ${\displaystyle \infty .}$ This valuation is a discrete valuation. The restriction of this valuation to the rational numbers is the p-adic valuation of ${\displaystyle \mathbb {Q} ,}$ that is, the exponent v in the factorization of a rational number as ${\displaystyle {\tfrac {n}{d}}p^{v},}$ with both n and d coprime with p.

The p-adic integers are the p-adic numbers with a nonnegative valuation.

A p-adic integer can be represented as a sequence

${\displaystyle x=(x_{1}\operatorname {mod} p,~x_{2}\operatorname {mod} p^{2},~x_{3}\operatorname {mod} p^{3},~\ldots )}$

of residues x_e mod p^e for each integer e, satisfying the compatibility relations ${\displaystyle x_{i}\equiv x_{j}~(\operatorname {mod} p^{i})}$ for i < j.

Every integer is a p-adic integer (including zero, since ${\displaystyle 0<\infty }$). The rational numbers of the form ${\textstyle {\tfrac {n}{d}}p^{k}}$ with d coprime with p and ${\displaystyle k\geq 0}$ are also p-adic integers (for the reason that d has an inverse mod p^e for every e).

The p-adic integers form a commutative ring, denoted ${\displaystyle \mathbb {Z} _{p}}$ or ${\displaystyle \mathbf {Z} _{p}}$, that has the following properties.

• It is an integral domain, since it is a subring of a field, or since the first term of the series representation of the product of two non zero p-adic series is the product of their first terms.
• The units (invertible elements) of ${\displaystyle \mathbb {Z} _{p}}$ are the p-adic numbers of valuation zero.
• It is a principal ideal domain, such that each ideal is generated by a power of p.
• It is a local ring of Krull dimension one, since its only prime ideals are the zero ideal and the ideal generated by p, the unique maximal ideal.
• It is a discrete valuation ring, since this results from the preceding properties.
• It is the completion of the local ring ${\displaystyle \mathbb {Z} _{(p)}=\{{\tfrac {n}{d}}\mid n,d\in \mathbb {Z} ,\,d\not \in p\mathbb {Z} \},}$ which is the localization of ${\displaystyle \mathbb {Z} }$ at the prime ideal ${\displaystyle p\mathbb {Z} .}$

The last property provides a definition of the p-adic numbers that is equivalent to the above one: the field of the p-adic numbers is the field of fractions of the completion of the localization of the integers at the prime ideal generated by p.

The p-adic valuation allows defining an absolute value on p-adic numbers: the p-adic absolute value of a nonzero p-adic number x is

${\displaystyle |x|_{p}=p^{-v_{p}(x)},}$

where ${\displaystyle v_{p}(x)}$ is the p-adic valuation of x. The p-adic absolute value of ${\displaystyle 0}$ is ${\displaystyle |0|_{p}=0.}$ This is an absolute value that satisfies the strong triangle inequality since, for every x and y one has

• ${\displaystyle |x|_{p}=0}$ if and only if ${\displaystyle x=0;}$
• ${\displaystyle |x|_{p}\cdot |y|_{p}=|xy|_{p}}$
• ${\displaystyle |x+y|_{p}\leq \max(|x|_{p},|y|_{p})\leq |x|_{p}+|y|_{p}.}$

Moreover, if ${\displaystyle |x|_{p}\neq |y|_{p},}$ one has ${\displaystyle |x+y|_{p}=\max(|x|_{p},|y|_{p}).}$

This makes the p-adic numbers a metric space, and even an ultrametric space, with the p-adic distance defined by ${\displaystyle d_{p}(x,y)=|x-y|_{p}.}$

As a metric space, the p-adic numbers form the completion of the rational numbers equipped with the p-adic absolute value. This provides another way for defining the p-adic numbers. However, the general construction of a completion can be simplified in this case, because the metric is defined by a discrete valuation (in short, one can extract from every Cauchy sequence a subsequence such that the differences between two consecutive terms have strictly decreasing absolute values; such a subsequence is the sequence of the partial sums of a p-adic series, and thus a unique normalized p-adic series can be associated to every equivalence class of Cauchy sequences; so, for building the completion, it suffices to consider normalized p-adic series instead of equivalence classes of Cauchy sequences).

As the metric is defined from a discrete valuation, every open ball is also closed. More precisely, the open ball ${\displaystyle B_{r}(x)=\{y\mid d_{p}(x,y)<r\}}$ equals the closed ball ${\displaystyle B_{p^{-v}}[x]=\{y\mid d_{p}(x,y)\leq p^{-v}\},}$ where v is the least integer such that ${\displaystyle p^{-v}<r.}$ Similarly, ${\displaystyle B_{r}[x]=B_{p^{-w}}(x),}$ where w is the greatest integer such that ${\displaystyle p^{-w}>r.}$

This implies that the p-adic numbers form a locally compact space, and the p-adic integers—that is, the ball ${\displaystyle B_{1}[0]=B_{p}(0)}$—form a compact space.

The decimal expansion of a positive rational number ${\displaystyle r}$ is its representation as a series

${\displaystyle r=\sum _{i=k}^{\infty }a_{i}10^{-i},}$

where ${\displaystyle k}$ is an integer and each ${\displaystyle a_{i}}$ is also an integer such that ${\displaystyle 0\leq a_{i}<10.}$ This expansion can be computed by long division of the numerator by the denominator, which is itself based on the following theorem: If ${\displaystyle r={\tfrac {n}{d}}}$ is a rational number such that ${\displaystyle 10^{k}\leq r<10^{k+1},}$ there is an integer ${\displaystyle a}$ such that ${\displaystyle 0<a<10,}$ and ${\displaystyle r=a\,10^{k}+r',}$ with ${\displaystyle r'<10^{k}.}$ The decimal expansion is obtained by repeatedly applying this result to the remainder ${\displaystyle r'}$ which in the iteration assumes the role of the original rational number ${\displaystyle r}$.

The p-adic expansion of a rational number is defined similarly, but with a different division step. More precisely, given a fixed prime number ${\displaystyle p}$, every nonzero rational number ${\displaystyle r}$ can be uniquely written as ${\displaystyle r=p^{k}{\tfrac {n}{d}},}$ where ${\displaystyle k}$ is a (possibly negative) integer, ${\displaystyle n}$ and ${\displaystyle d}$ are coprime integers both coprime with ${\displaystyle p}$, and ${\displaystyle d}$ is positive. The integer ${\displaystyle k}$ is the p-adic valuation of ${\displaystyle r}$, denoted ${\displaystyle v_{p}(r),}$ and ${\displaystyle p^{-k}}$ is its p-adic absolute value, denoted ${\displaystyle |r|_{p}}$ (the absolute value is small when the valuation is large). The division step consists of writing

${\displaystyle r=a\,p^{k}+r'}$

where ${\displaystyle a}$ is an integer such that ${\displaystyle 0\leq a<p,}$ and ${\displaystyle r'}$ is either zero, or a rational number such that ${\displaystyle |r'|_{p}<p^{-k}}$ (that is, ${\displaystyle v_{p}(r')>k}$).

The ${\displaystyle p}$-adic expansion of ${\displaystyle r}$ is the formal power series

${\displaystyle r=\sum _{i=k}^{\infty }a_{i}p^{i}}$

obtained by repeating indefinitely the above division step on successive remainders. In a p-adic expansion, all ${\displaystyle a_{i}}$ are integers such that ${\displaystyle 0\leq a_{i}<p.}$

If ${\displaystyle r=p^{k}{\tfrac {n}{1}}}$ with ${\displaystyle n>0}$, the process stops eventually with a zero remainder; in this case, the series is completed by trailing terms with a zero coefficient, and is the representation of ${\displaystyle r}$ in base-p.

The existence and the computation of the p-adic expansion of a rational number results from Bézout's identity in the following way. If, as above, ${\displaystyle r=p^{k}{\tfrac {n}{d}},}$ and ${\displaystyle d}$ and ${\displaystyle p}$ are coprime, there exist integers ${\displaystyle t}$ and ${\displaystyle u}$ such that ${\displaystyle td+up=1.}$ So

${\displaystyle r=p^{k}{\tfrac {n}{d}}(td+up)=p^{k}nt+p^{k+1}{\frac {un}{d}}.}$

Then, the Euclidean division of ${\displaystyle nt}$ by ${\displaystyle p}$ gives

${\displaystyle nt=qp+a,}$

with ${\displaystyle 0\leq a<p.}$ This gives the division step as

${\displaystyle {\begin{array}{lcl}r&=&p^{k}(qp+a)+p^{k+1}{\frac {un}{d}}\\&=&ap^{k}+p^{k+1}\,{\frac {qd+un}{d}},\\\end{array}}}$

so that in the iteration

${\displaystyle r'=p^{k+1}\,{\frac {qd+un}{d}}}$

is the new rational number.

The uniqueness of the division step and of the whole p-adic expansion is easy: if ${\displaystyle p^{k}a_{1}+p^{k+1}s_{1}=p^{k}a_{2}+p^{k+1}s_{2},}$ one has ${\displaystyle a_{1}-a_{2}=p(s_{2}-s_{1}).}$ This means ${\displaystyle p}$ divides ${\displaystyle a_{1}-a_{2}.}$ Since ${\displaystyle 0\leq a_{1}<p}$ and ${\displaystyle 0\leq a_{2}<p,}$ the following must be true: ${\displaystyle 0\leq a_{1}}$ and ${\displaystyle a_{2}<p.}$ Thus, one gets ${\displaystyle -p<a_{1}-a_{2}<p,}$ and since ${\displaystyle p}$ divides ${\displaystyle a_{1}-a_{2}}$ it must be that ${\displaystyle a_{1}=a_{2}.}$

The p-adic expansion of a rational number is a series that converges to the rational number, if one applies the definition of a convergent series with the p-adic absolute value. In the standard p-adic notation, the digits are written in the same order as in a standard base-p system, namely with the powers of the base increasing to the left. This means that the production of the digits is reversed and the limit happens on the left hand side.

The p-adic expansion of a rational number is eventually periodic. Conversely, a series ${\textstyle \sum _{i=k}^{\infty }a_{i}p^{i},}$ with ${\displaystyle 0\leq a_{i}<p}$ converges (for the p-adic absolute value) to a rational number if and only if it is eventually periodic; in this case, the series is the p-adic expansion of that rational number. The proof is similar to that of the similar result for repeating decimals.

Let us compute the 5-adic expansion of ${\displaystyle {\tfrac {1}{3}}.}$ Bézout's identity for 5 and the denominator 3 is ${\displaystyle 2\cdot 3+(-1)\cdot 5=1}$ (for larger examples, this can be computed with the extended Euclidean algorithm). Thus

${\displaystyle {\frac {1}{3}}=2+5({\frac {-1}{3}}).}$

For the next step, one has to expand ${\displaystyle -1/3}$ (the factor 5 has to be viewed as a "shift" of the p-adic valuation, similar to the basis of any number expansion, and thus it should not be itself expanded). To expand ${\displaystyle -1/3}$, we start from the same Bézout's identity and multiply it by ${\displaystyle -1}$, giving

${\displaystyle -{\frac {1}{3}}=-2+{\frac {5}{3}}.}$

The "integer part" ${\displaystyle -2}$ is not in the right interval. So, one has to use Euclidean division by ${\displaystyle 5}$ for getting ${\displaystyle -2=3-1\cdot 5,}$ giving

${\displaystyle -{\frac {1}{3}}=3-5+{\frac {5}{3}}=3-{\frac {10}{3}}=3+5({\frac {-2}{3}}),}$

and the expansion in the first step becomes

${\displaystyle {\frac {1}{3}}=2+5\cdot (3+5\cdot ({\frac {-2}{3}}))=2+3\cdot 5+{\frac {-2}{3}}\cdot 5^{2}.}$

Similarly, one has

${\displaystyle -{\frac {2}{3}}=1-{\frac {5}{3}},}$

and

${\displaystyle {\frac {1}{3}}=2+3\cdot 5+1\cdot 5^{2}+{\frac {-1}{3}}\cdot 5^{3}.}$

As the "remainder" ${\displaystyle -{\tfrac {1}{3}}}$ has already been found, the process can be continued easily, giving coefficients ${\displaystyle 3}$ for odd powers of five, and ${\displaystyle 1}$ for even powers. Or in the standard 5-adic notation

${\displaystyle {\frac {1}{3}}=\ldots 1313132_{5}}$

with the ellipsis ${\displaystyle \ldots }$ on the left hand side.

It is possible to use a positional notation similar to that which is used to represent numbers in base p.

Let ${\textstyle \sum _{i=k}^{\infty }a_{i}p^{i}}$ be a normalized p-adic series, i.e. each ${\displaystyle a_{i}}$ is an integer in the interval ${\displaystyle [0,p-1].}$ One can suppose that ${\displaystyle k\leq 0}$ by setting ${\displaystyle a_{i}=0}$ for ${\displaystyle 0\leq i<k}$ (if ${\displaystyle k>0}$), and adding the resulting zero terms to the series.

If ${\displaystyle k\geq 0,}$ the positional notation consists of writing the ${\displaystyle a_{i}}$ consecutively, ordered by decreasing values of i, often with p appearing on the right as an index:

${\displaystyle \ldots a_{n}\ldots a_{1}{a_{0}}_{p}}$

So, the computation of the example above shows that

${\displaystyle {\frac {1}{3}}=\ldots 1313132_{5},}$

and

${\displaystyle {\frac {25}{3}}=\ldots 131313200_{5}.}$

When ${\displaystyle k<0,}$ a separating dot is added before the digits with negative index, and, if the index p is present, it appears just after the separating dot. For example,

${\displaystyle {\frac {1}{15}}=\ldots 3131313._{5}2,}$

and

${\displaystyle {\frac {1}{75}}=\ldots 1313131._{5}32.}$

If a p-adic representation is finite on the left (that is, ${\displaystyle a_{i}=0}$ for large values of i), then it has the value of a nonnegative rational number of the form ${\displaystyle np^{v},}$ with ${\displaystyle n,v}$ integers. These rational numbers are exactly the nonnegative rational numbers that have a finite representation in base p. For these rational numbers, the two representations are the same.

The quotient ring ${\displaystyle \mathbb {Z} _{p}/p^{n}\mathbb {Z} _{p}}$ may be identified with the ring ${\displaystyle \mathbb {Z} /p^{n}\mathbb {Z} }$ of the integers modulo ${\displaystyle p^{n}.}$ This can be shown by remarking that every p-adic integer, represented by its normalized p-adic series, is congruent modulo ${\displaystyle p^{n}}$ with its partial sum ${\textstyle \sum _{i=0}^{n-1}a_{i}p^{i},}$ whose value is an integer in the interval ${\displaystyle [0,p^{n}-1].}$ A straightforward verification shows that this defines a ring isomorphism from ${\displaystyle \mathbb {Z} _{p}/p^{n}\mathbb {Z} _{p}}$ to ${\displaystyle \mathbb {Z} /p^{n}\mathbb {Z} .}$

The inverse limit of the rings ${\displaystyle \mathbb {Z} _{p}/p^{n}\mathbb {Z} _{p}}$ is defined as the ring formed by the sequences ${\displaystyle a_{0},a_{1},\ldots }$ such that ${\displaystyle a_{i}\in \mathbb {Z} /p^{i}\mathbb {Z} }$ and ${\textstyle a_{i}\equiv a_{i+1}{\pmod {p^{i}}}}$ for every i.

The mapping that maps a normalized p-adic series to the sequence of its partial sums is a ring isomorphism from ${\displaystyle \mathbb {Z} _{p}}$ to the inverse limit of the ${\displaystyle \mathbb {Z} _{p}/p^{n}\mathbb {Z} _{p}.}$ This provides another way for defining p-adic integers (up to an isomorphism).

This definition of p-adic integers is specially useful for practical computations, as allowing building p-adic integers by successive approximations.

For example, for computing the p-adic (multiplicative) inverse of an integer, one can use Newton's method, starting from the inverse modulo p; then, each Newton step computes the inverse modulo ${\textstyle p^{n^{2}}}$ from the inverse modulo ${\textstyle p^{n}.}$

The same method can be used for computing the p-adic square root of an integer that is a quadratic residue modulo p. This seems to be the fastest known method for testing whether a large integer is a square: it suffices to test whether the given integer is the square of the value found in ${\displaystyle \mathbb {Z} _{p}/p^{n}\mathbb {Z} _{p}}$. Applying Newton's method to find the square root requires ${\textstyle p^{n}}$ to be larger than twice the given integer, which is quickly satisfied.

Hensel lifting is a similar method that allows to "lift" the factorization modulo p of a polynomial with integer coefficients to a factorization modulo ${\textstyle p^{n}}$ for large values of n. This is commonly used by polynomial factorization algorithms.

There are several different conventions for writing p-adic expansions. So far this article has used a notation for p-adic expansions in which powers of p increase from right to left. With this right-to-left notation the 3-adic expansion of ${\displaystyle {\tfrac {1}{5}},}$ for example, is written as

${\displaystyle {\frac {1}{5}}=\dots 121012102_{3}.}$

When performing arithmetic in this notation, digits are carried to the left. It is also possible to write p-adic expansions so that the powers of p increase from left to right, and digits are carried to the right. With this left-to-right notation the 3-adic expansion of ${\displaystyle {\tfrac {1}{5}}}$ is

${\displaystyle {\frac {1}{5}}=2.01210121\dots _{3}{\mbox{ or }}{\frac {1}{15}}=20.1210121\dots _{3}.}$

p-adic expansions may be written with other sets of digits instead of {0, 1, ..., p − 1}. For example, the 3-adic expansion of ${\displaystyle {\tfrac {1}{5}}}$ can be written using balanced ternary digits {1, 0, 1}, with 1 representing negative one, as

${\displaystyle {\frac {1}{5}}=\dots {\underline {1}}11{\underline {11}}11{\underline {11}}11{\underline {1}}_{\text{3}}.}$

In fact any set of p integers which are in distinct residue classes modulo p may be used as p-adic digits. In number theory, Teichmüller representatives are sometimes used as digits.^[2]

Quote notation is a variant of the p-adic representation of rational numbers that was proposed in 1979 by Eric Hehner and Nigel Horspool for implementing on computers the (exact) arithmetic with these numbers.^[3]

Both ${\displaystyle \mathbb {Z} _{p}}$ and ${\displaystyle \mathbb {Q} _{p}}$ are uncountable and have the cardinality of the continuum.^[4] For ${\displaystyle \mathbb {Z} _{p},}$ this results from the p-adic representation, which defines a bijection of ${\displaystyle \mathbb {Z} _{p}}$ on the power set ${\displaystyle \{0,\ldots ,p-1\}^{\mathbb {N} }.}$ For ${\displaystyle \mathbb {Q} _{p}}$ this results from its expression as a countably infinite union of copies of ${\displaystyle \mathbb {Z} _{p}}$:

${\displaystyle \mathbb {Q} _{p}=\bigcup _{i=0}^{\infty }{\frac {1}{p^{i}}}\mathbb {Z} _{p}.}$

${\displaystyle \mathbb {Q} _{p}}$ contains ${\displaystyle \mathbb {Q} }$ and is a field of characteristic 0.

Because 0 can be written as sum of squares,^[5] ${\displaystyle \mathbb {Q} _{p}}$ cannot be turned into an ordered field.

The field of real numbers ${\displaystyle \mathbb {R} }$ has only a single proper algebraic extension: the complex numbers ${\displaystyle \mathbb {C} }$. In other words, this quadratic extension is already algebraically closed. By contrast, the algebraic closure of ${\displaystyle \mathbb {Q} _{p}}$, denoted ${\displaystyle {\overline {\mathbb {Q} _{p}}},}$ has infinite degree,^[6] that is, ${\displaystyle \mathbb {Q} _{p}}$ has infinitely many inequivalent algebraic extensions. Also contrasting the case of real numbers, although there is a unique extension of the p-adic valuation to ${\displaystyle {\overline {\mathbb {Q} _{p}}},}$ the latter is not (metrically) complete.^[7][8] Its (metric) completion is called ${\displaystyle \mathbb {C} _{p}}$ or ${\displaystyle \Omega _{p}}$.^[8][9] Here an end is reached, as ${\displaystyle \mathbb {C} _{p}}$ is algebraically closed.^[8][10] However unlike ${\displaystyle \mathbb {C} }$ this field is not locally compact.^[9]

${\displaystyle \mathbb {C} _{p}}$ and ${\displaystyle \mathbb {C} }$ are isomorphic as rings,^[11] so we may regard ${\displaystyle \mathbb {C} _{p}}$ as ${\displaystyle \mathbb {C} }$ endowed with an exotic metric. The proof of existence of such a field isomorphism relies on the axiom of choice, and does not provide an explicit example of such an isomorphism (that is, it is not constructive).

If ${\displaystyle K}$ is any finite Galois extension of ${\displaystyle \mathbb {Q} _{p},}$, the Galois group ${\displaystyle \operatorname {Gal} \left(K/\mathbb {Q} _{p}\right)}$ is solvable. Thus, the Galois group ${\displaystyle \operatorname {Gal} \left({\overline {\mathbb {Q} _{p}}}/\mathbb {Q} _{p}\right)}$ is prosolvable.

${\displaystyle \mathbb {Q} _{p}}$ contains the n-th cyclotomic field (n > 2) if and only if n | p − 1.^[12] For instance, the n-th cyclotomic field is a subfield of ${\displaystyle \mathbb {Q} _{13}}$ if and only if n = 1, 2, 3, 4, 6, or 12. In particular, there is no multiplicative p-torsion in ${\displaystyle \mathbb {Q} _{p}}$ if p > 2. Also, −1 is the only non-trivial torsion element in ${\displaystyle \mathbb {Q} _{2}}$.

Given a natural number k, the index of the multiplicative group of the k-th powers of the non-zero elements of ${\displaystyle \mathbb {Q} _{p}}$ in ${\displaystyle \mathbb {Q} _{p}^{\times }}$ is finite.

The number e, defined as the sum of reciprocals of factorials, is not a member of any p-adic field; but ${\displaystyle e^{p}\in \mathbb {Q} _{p}}$ for ${\displaystyle p\neq 2}$. For p = 2 one must take at least the fourth power.^[13] (Thus a number with similar properties as e — namely a p-th root of e^p — is a member of ${\displaystyle \mathbb {Q} _{p}}$ for all p.)

Helmut Hasse's local–global principle is said to hold for an equation if it can be solved over the rational numbers if and only if it can be solved over the real numbers and over the p-adic numbers for every prime p. This principle holds, for example, for equations given by quadratic forms, but fails for higher polynomials in several indeterminates.

The reals and the p-adic numbers are the completions of the rationals; it is also possible to complete other fields, for instance general algebraic number fields, in an analogous way. This will be described now.

Suppose D is a Dedekind domain and E is its field of fractions. Pick a non-zero prime ideal P of D. If x is a non-zero element of E, then xD is a fractional ideal and can be uniquely factored as a product of positive and negative powers of non-zero prime ideals of D. We write ord_P(x) for the exponent of P in this factorization, and for any choice of number c greater than 1 we can set

${\displaystyle |x|_{P}=c^{-\!\operatorname {ord} _{P}(x)}.}$

Completing with respect to this absolute value |⋅|_P yields a field E_P, the proper generalization of the field of p-adic numbers to this setting. The choice of c does not change the completion (different choices yield the same concept of Cauchy sequence, so the same completion). It is convenient, when the residue field D/P is finite, to take for c the size of D/P.

For example, when E is a number field, Ostrowski's theorem says that every non-trivial non-Archimedean absolute value on E arises as some |⋅|_P. The remaining non-trivial absolute values on E arise from the different embeddings of E into the real or complex numbers. (In fact, the non-Archimedean absolute values can be considered as simply the different embeddings of E into the fields C_p, thus putting the description of all the non-trivial absolute values of a number field on a common footing.)

Often, one needs to simultaneously keep track of all the above-mentioned completions when E is a number field (or more generally a global field), which are seen as encoding "local" information. This is accomplished by adele rings and idele groups.

p-adic integers can be extended to p-adic solenoids ${\displaystyle \mathbb {T} _{p}}$. There is a map from ${\displaystyle \mathbb {T} _{p}}$ to the circle group whose fibers are the p-adic integers ${\displaystyle \mathbb {Z} _{p}}$, in analogy to how there is a map from ${\displaystyle \mathbb {R} }$ to the circle whose fibers are ${\displaystyle \mathbb {Z} }$.

Wikimedia Commons has media related to P-adic numbers.

• Weisstein, Eric W. "p-adic Number". MathWorld.
• p-adic number at Springer On-line Encyclopaedia of Mathematics