p-adic number#Quote notation

{{Short description|Number system extending the rational numbers}}

{{DISPLAYTITLE:p-adic number}}

Image:3-adic integers with dual colorings.svg group]]

In number theory, given a prime number {{mvar|p}},{{efn-num|In this article, unless otherwise stated, {{mvar|p}} denotes a prime number that is fixed once for all.}} the {{mvar|p}}-adic numbers form an extension of the rational numbers which is distinct from the real numbers, though with some similar properties; {{mvar|p}}-adic numbers can be written in a form similar to (possibly infinite) decimals, but with digits based on a prime number {{mvar|p}} rather than ten, and extending to the left rather than to the right.

For example, comparing the expansion of the rational number \tfrac15 in Ternary numeral system vs. the {{math|3}}-adic expansion,

: \begin{alignat}{3}

\tfrac15 &{}= 0.01210121\ldots \ (\text{base } 3)

&&{}= 0\cdot 3^0 + 0\cdot 3^{-1} + 1\cdot 3^{-2} + 2\cdot 3^{-3} + \cdots \\[5mu]

\tfrac15 &{}= \dots 121012102 \ \ (\text{3-adic})

&&{}= \cdots + 2\cdot 3^3 + 1 \cdot 3^2 + 0\cdot3^1 + 2 \cdot 3^0.

\end{alignat}

Formally, given a prime number {{mvar|p}}, a {{mvar|p}}-adic number can be defined as a series

: 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 {{mvar|k}} is an integer (possibly negative), and each a_i is an integer such that 0\le a_i < p. A {{mvar|p}}-adic integer is a {{mvar|p}}-adic number such that k\ge 0.

In general the series that represents a {{mvar|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 {{mvar|k}} is the least integer {{mvar|i}} such that a_i\ne 0 (if all a_i are zero, one has the zero {{mvar|p}}-adic number, which has {{math|0}} as its {{mvar|p}}-adic absolute value).

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

{{mvar|p}}-adic numbers were first described by Kurt Hensel in 1897,{{Harv|Hensel|1897}} though, with hindsight, some of Ernst Kummer's earlier work can be interpreted as implicitly using {{mvar|p}}-adic numbers.Translator's introduction, [https://books.google.com/books?id=Qxte2mhlEOYC&pg=PA35 page 35]: "Indeed, with hindsight it becomes apparent that a discrete valuation is behind Kummer's concept of ideal numbers." {{Harv|Dedekind|Weber|2012|p=35}}

Motivation

Roughly speaking, modular arithmetic modulo a positive integer {{mvar|n}} consists of "approximating" every integer by the remainder of its division by {{mvar|n}}, called its residue modulo {{mvar|n}}. The main property of modular arithmetic is that the residue modulo {{mvar|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 {{mvar|n}}. If one knows that the absolute value of the result is less than {{mvar|n/2}}, this allows a computation of the result which does not involve any integer larger than {{mvar|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 {{mvar|p}}, and applying Hensel's lemma for recovering iteratively the result modulo p^2, p^3, \ldots, p^n, \ldots If the process is continued infinitely, this provides eventually a result which is a {{mvar|p}}-adic number.

Basic lemmas

The theory of {{mvar|p}}-adic numbers is fundamentally based on the two following lemmas:

Every nonzero rational number can be written p^v\frac{m}{n}, where {{mvar|v}}, {{mvar|m}}, and {{mvar|n}} are integers and neither {{mvar|m}} nor {{mvar|n}} is divisible by {{mvar|p}}. The exponent {{mvar|v}} is uniquely determined by the rational number and is called its {{mvar|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 {{mvar|r}} of valuation {{mvar|v}} can be uniquely written r=ap^v+ s, where {{mvar|s}} is a rational number of valuation greater than {{mvar|v}}, and {{mvar|a}} is an integer such that 0

The proof of this lemma results from modular arithmetic: By the above lemma, r=p^v\frac{m}{n}, where {{mvar|m}} and {{mvar|n}} are integers coprime with {{mvar|p}}.

By Bézout's lemma, there exist integers {{mvar|a}} and {{mvar|b}}, with 0\leq a < p, such that

m = a n + b p. Setting s = b/n (hence {\rm val}(s) \geq 0), we have

: {m\over n} = a + p {b \over n},\quad {\rm or} \quad r = a p^v + p^{v + 1} s.

To show the uniqueness of this representation, observe that if r = a' p^v + p^{v + 1} s', with

0\leq a' < p and {\rm val}(s')\geq 0,

there holds by difference (a -a') + p(s- s') = 0, with |a - a'| < p and {\rm val}(s-s') \geq 0.

Write s-s' = c/d, where {{mvar|d}} is coprime to {{mvar|p}}; then

(a - a')d + p c = 0, which is possible only if a - a' = 0 and c=0.

Hence a = a' and s = s'.

The above process can be iterated starting from {{mvar|s}} instead of {{mvar|r}}, giving the following.

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

: r=a_0p^v + a_1 p^{v+1} +\cdots + a_{k-1}p^{v+k-1} +p^{v+k}s_k.

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

''p''-adic series

The {{mvar|p}}-adic numbers are commonly defined by means of {{mvar|p}}-adic series.

A {{mvar|p}}-adic series is a formal power series of the form

: \sum_{i=v}^\infty r_i p^{i},

where v is an integer and the r_i are rational numbers that either are zero or have a nonnegative valuation (that is, the denominator of r_i is not divisible by {{mvar|p}}).

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

Two {{mvar|p}}-adic series \sum_{i=v}^\infty r_i p^{i} and \sum_{i=w}^\infty s_i p^{i}

are equivalent if there is an integer {{mvar|N}} such that, for every integer n>N, the rational number

: \sum_{i=v}^n r_i p^{i} - \sum_{i=w}^n s_i p^{i}

is zero or has a {{mvar|p}}-adic valuation greater than {{mvar|n}}.

A {{mvar|p}}-adic series \sum_{i=v}^\infty a_i p^{i} is normalized if either all a_i are integers such that 0\le a_i and a_v >0, or all a_i are zero. In the latter case, the series is called the zero series.

Every {{mvar|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 {{mvar|p}}-adic series is an equivalence relation, and each equivalence class contains exactly one normalized {{mvar|p}}-adic series.

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

: \begin{align}

S\pm U&\sim &T\pm U,\\

SU&\sim &TU,\\

1/S&\sim &1/T.

\end{align}

The {{mvar|p}}-adic numbers are often defined as the equivalence classes of {{mvar|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 {{mvar|p}}-adic number by the corresponding normalized {{mvar|p}}-adic series. The compatibility of the series equivalence leads almost immediately to basic properties of {{mvar|p}}-adic numbers:

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

= Normalization of a ''p''-adic series =

Starting with the series \sum_{i=v}^\infty r_i p^{i}, the first above lemma allows getting an equivalent series such that the {{mvar|p}}-adic valuation of r_v is zero. For that, one considers the first nonzero r_i. If its {{mvar|p}}-adic valuation is zero, it suffices to change {{mvar|v}} into {{mvar|i}}, that is to start the summation from {{mvar|v}}. Otherwise, the {{mvar|p}}-adic valuation of r_i is j>0, and r_i= p^js_i where the valuation of s_i is zero; so, one gets an equivalent series by changing r_i to {{math|0}} and r_{i+j} to 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 r_v is zero.

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

Definition

There are several equivalent definitions of {{mvar|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 {{slink||p-adic integers}}), completion of a metric space (see {{slink||Topological properties}}), or inverse limits (see {{slink||Modular properties}}).

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

One can say also that any {{mvar|p}}-adic series represents a {{mvar|p}}-adic number, since every {{mvar|p}}-adic series is equivalent to a unique normalized {{mvar|p}}-adic series. This is useful for defining operations (addition, subtraction, multiplication, division) of {{mvar|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 {{mvar|p}}-adic numbers, since the series operations are compatible with equivalence of {{mvar|p}}-adic series.

{{anchor|Field of p-adic numbers}}

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

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

''p''-adic integers

The {{mvar|p}}-adic integers are the {{mvar|p}}-adic numbers with a nonnegative valuation.

A p-adic integer can be represented as a sequence

: 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 x_i \equiv x_j ~ (\operatorname{mod} p^i) for i < j.

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

The {{mvar|p}}-adic integers form a commutative ring, denoted \Z_p or \mathbf Z_p, that has the following properties.

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

Topological properties

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

: |x|_p = p^{-v_p(x)},

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

  • |x|_p = 0 if and only if x=0;
  • |x|_p\cdot |y|_p = |xy|_p
  • |x+y|_p\le \max(|x|_p,|y|_p) \le |x|_p + |y|_p.

Moreover, if |x|_p \ne |y|_p, one has |x+y|_p = \max(|x|_p,|y|_p).

This makes the {{mvar|p}}-adic numbers a metric space, and even an ultrametric space, with the {{mvar|p}}-adic distance defined by

d_p(x,y)=|x-y|_p.

As a metric space, the {{mvar|p}}-adic numbers form the completion of the rational numbers equipped with the {{mvar|p}}-adic absolute value. This provides another way for defining the {{mvar|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 {{mvar|p}}-adic series, and thus a unique normalized {{mvar|p}}-adic series can be associated to every equivalence class of Cauchy sequences; so, for building the completion, it suffices to consider normalized {{mvar|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 B_r(x) =\{y\mid d_p(x,y) equals the closed ball B_{p^{-v}}[x] =\{y\mid d_p(x,y)\le p^{-v}\}, where {{mvar|v}} is the least integer such that p^{-v}< r. Similarly, B_r[x] = B_{p^{-w}}(x), where {{mvar|w}} is the greatest integer such that p^{-w}>r.

This implies that the {{mvar|p}}-adic numbers form a locally compact space (locally compact field), and the {{mvar|p}}-adic integers—that is, the ball B_1[0]=B_p(0)—form a compact space.

''p''-adic expansion of rational numbers

The decimal expansion of a positive rational number r is its representation as a series

:r = \sum_{i=k}^\infty a_i 10^{-i},

where k is an integer and each a_i is also an integer such that 0\le 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 r=\tfrac n d is a rational number such that 10^k\le r <10^{k+1}, there is an integer a such that 0< a <10, and r = a\,10^k +r', with r'<10^k. The decimal expansion is obtained by repeatedly applying this result to the remainder r' which in the iteration assumes the role of the original rational number r.

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

: {{anchor|division_step}}r = a\,p^k + r'

where a is an integer such that 0\le a and r' is either zero, or a rational number such that |r'|_p < p^{-k} (that is, v_p(r')>k).

The p-adic expansion of r is the formal power series

: r = \sum_{i=k}^\infty a_i p^i

obtained by repeating indefinitely the above division step on successive remainders. In a {{mvar|p}}-adic expansion, all a_i are integers such that 0\le a_i

If r=p^k \tfrac n 1 with 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 r in base-N.

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

: r=p^k \tfrac n d(t d+u p)=p^k n t + p^{k+1}\frac{u n}d.

Then, the Euclidean division of n t by p gives

: n t=q p+a,

with 0\le a

This gives the division step as

: \begin{array}{lcl}

r & = & p^k(q p+a) + p^{k+1}\frac {u n}d \\

& = & a p^k +p^{k+1}\,\frac{q d+u n} d, \\

\end{array}

so that in the iteration

: r' = p^{k+1}\,\frac{q d+u n} d

is the new rational number.

The uniqueness of the division step and of the whole {{mvar|p}}-adic expansion is easy: if p^k a_1 + p^{k+1}s_1=p^k a_2 + p^{k+1}s_2, one has a_1-a_2=p(s_2-s_1). This means p divides a_1-a_2. Since 0\le a_1 and 0\le a_2 the following must be true: 0\le a_1 and a_2 Thus, one gets -p < a_1-a_2 < p, and since p divides a_1-a_2 it must be that a_1=a_2.

The {{mvar|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 {{mvar|p}}-adic absolute value.

In the standard {{mvar|p}}-adic notation, the digits are written in the same order as in a Positional notation#Base of the numeral 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 {{mvar|p}}-adic expansion of a rational number is eventually periodic. Conversely, a series \sum_{i=k}^\infty a_i p^i, with 0\le a_i converges (for the {{mvar|p}}-adic absolute value) to a rational number if and only if it is eventually periodic; in this case, the series is the {{mvar|p}}-adic expansion of that rational number. The proof is similar to that of the similar result for repeating decimals.

= Example =

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

: \frac 13= 2+5(\frac {-1}3).

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

: -\frac 13=-2+\frac 53.

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

: -\frac 13=3-5+\frac 53 = 3-\frac {10}3 = 3 +5 (\frac{-2}3),

and the expansion in the first step becomes

: \frac 13= 2+5\cdot (3 + 5 \cdot (\frac{-2}3))= 2+3\cdot 5 + \frac {-2}3\cdot 5^2.

Similarly, one has

: -\frac 23=1-\frac 53,

and

: \frac 13=2+3\cdot 5 + 1\cdot 5^2 +\frac {-1}3\cdot 5^3.

As the "remainder" -\tfrac 13 has already been found, the process can be continued easily, giving coefficients 3 for odd powers of five, and 1 for even powers.

Or in the standard 5-adic notation

: \frac 13= \ldots 1313132_5

with the ellipsis \ldots on the left hand side.

= Positional notation =

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

Let \sum_{i=k}^\infty a_i p^i be a normalized {{mvar|p}}-adic series, i.e. each a_i is an integer in the interval [0,p-1]. One can suppose that k\le 0 by setting a_i=0 for 0\le i (if k>0), and adding the resulting zero terms to the series.

If k\ge 0, the positional notation consists of writing the a_i consecutively, ordered by decreasing values of {{mvar|i}}, often with {{mvar|p}} appearing on the right as an index:

: \ldots a_n \ldots a_1{a_0}_p

So, the computation of the example above shows that

: \frac 13= \ldots 1313132_5,

and

: \frac {25}3= \ldots 131313200_5.

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

: \frac 1{15}= \ldots 3131313._52,

and

: \frac 1{75}= \ldots 1313131._532.

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

Modular properties

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

The inverse limit of the rings \Z_p/p^n\Z_p is defined as the ring formed by the sequences a_0, a_1, \ldots such that a_i \in \Z/p^i \Z and a_i \equiv a_{i+1} \pmod {p^i} for every {{mvar|i}}.

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

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

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

The same method can be used for computing the {{mvar|p}}-adic square root of an integer that is a quadratic residue modulo {{mvar|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 \Z_p/p^n\Z_p. Applying Newton's method to find the square root requires 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 {{mvar|p}} of a polynomial with integer coefficients to a factorization modulo p^n for large values of {{mvar|n}}. This is commonly used by polynomial factorization algorithms.

Notation

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

: \frac15 = \dots 121012102_3.

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

:

\frac15 = 2.01210121\dots_3 \mbox{ or }

\frac1{15} = 20.1210121\dots_3.

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

: \frac15 = \dots\underline{1}11\underline{11}11\underline{11}11\underline{1}_{\text{3}} .

In fact any set of {{mvar|p}} integers which are in distinct residue classes modulo {{mvar|p}} may be used as {{mvar|p}}-adic digits. In number theory, Teichmüller representatives are sometimes used as digits.{{Harv|Hazewinkel|2009|p=342}}

{{vanchor|Quote notation}} is a variant of the {{mvar|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.{{Harv|Hehner|Horspool|1979|pp=124–134}}

Cardinality

Both \Z_p and \Q_p are uncountable and have the cardinality of the continuum.{{Harv|Robert|2000|loc=Chapter 1 Section 1.1}} For \Z_p, this results from the {{mvar|p}}-adic representation, which defines a bijection of \Z_p on the power set \{0,\ldots,p-1\}^\N. For \Q_p this results from its expression as a countably infinite union of copies of \Z_p:

: \Q_p=\bigcup_{i=0}^\infty \frac 1{p^i}\Z_p.

Algebraic closure

\Q_p contains \Q and is a field of characteristic {{math|0}}.

{{anchor|not_orderable}}Because {{math|0}} can be written as sum of squares,According to Hensel's lemma \Q_2 contains a square root of {{math|−7}}, so that 2^2 +1^2+1^2+1^2+\left(\sqrt{-7}\right)^2 = 0 , and if {{math|p > 2}} then also by Hensel's lemma \Q_p contains a square root of {{math|1 − p}}, thus

(p-1)\times 1^2 +\left(\sqrt{1-p}\right)^2 = 0 . \Q_p cannot be turned into an ordered field.

The field of real numbers \R has only a single proper algebraic extension: the complex numbers \C. In other words, this quadratic extension is already algebraically closed. By contrast, the algebraic closure of \Q_p, denoted \overline{\Q_p}, has infinite degree,{{Harv|Gouvêa|1997|loc=Corollary 5.3.10}} that is, \Q_p has infinitely many inequivalent algebraic extensions. Also contrasting the case of real numbers, although there is a unique extension of the {{mvar|p}}-adic valuation to \overline{\Q_p}, the latter is not (metrically) complete.{{Harv|Gouvêa|1997|loc=Theorem 5.7.4}}{{Harv|Cassels|1986|p=149}} Its (metric) completion is called \C_p or \Omega_p.{{Harv|Koblitz|1980|p=13}} Here an end is reached, as \C_p is algebraically closed.{{Harv|Gouvêa|1997|loc=Proposition 5.7.8}} However unlike \C this field is not locally compact.

\C_p and \C are isomorphic as rings,Two algebraically closed fields are isomorphic if and only if they have the same characteristic and transcendence degree (see, for example Lang’s Algebra X §1), and both \C_p and \C have characteristic zero and the cardinality of the continuum. so we may regard \C_p as \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 K is any finite Galois extension of \Q_p, the Galois group \operatorname{Gal} \left(K/\Q_p \right) is solvable. Thus, the Galois group \operatorname{Gal} \left(\overline{\Q_p}/ \Q_p \right) is prosolvable.

Multiplicative group

\Q_p contains the {{mvar|n}}-th cyclotomic field ({{math|n > 2}}) if and only if {{math|n {{!}} p − 1}}.{{Harv|Gouvêa|1997|loc=Proposition 3.4.2}} For instance, the {{mvar|n}}-th cyclotomic field is a subfield of \Q_{13} if and only if {{math|n {{=}} 1, 2, 3, 4, 6}}, or {{math|12}}. In particular, there is no multiplicative {{mvar|p}}-torsion in \Q_p if {{math|p > 2}}. Also, {{math|−1}} is the only non-trivial torsion element in \Q_2.

Given a natural number {{mvar|k}}, the index of the multiplicative group of the {{mvar|k}}-th powers of the non-zero elements of \Q_p in \Q_p^\times is finite.

The number {{mvar|e}}, defined as the sum of reciprocals of factorials, is not a member of any {{mvar|p}}-adic field; but e^p \in \Q_p for p \ne 2. For {{math|p {{=}} 2}} one must take at least the fourth power.{{Harv|Robert|2000|loc=Section 4.1}} (Thus a number with similar properties as {{mvar|e}} — namely a {{mvar|p}}-th root of {{math|ep}} — is a member of \Q_p for all {{mvar|p}}.)

Local–global principle

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 {{mvar|p}}-adic numbers for every prime {{mvar|p}}. This principle holds, for example, for equations given by quadratic forms, but fails for higher polynomials in several indeterminates.

Rational arithmetic with Hensel lifting

{{main|Hensel lifting}}

See also

Footnotes

= Notes =

{{reflist|group=note}}

= Citations =

{{reflist}}

References

{{refbegin}}

  • {{Citation |last=Cassels |first=J. W. S. |author-link=J. W. S. Cassels |title=Local Fields |series=London Mathematical Society Student Texts |volume=3 |publisher=Cambridge University Press |year=1986 |isbn=0-521-31525-5 |zbl=0595.12006}}
  • {{citation|title=Theory of Algebraic Functions of One Variable|volume=39|series=History of mathematics|first1=Richard|last1=Dedekind|author1-link=Richard Dedekind|first2=Heinrich|last2=Weber|author2-link=Heinrich Martin Weber|publisher=American Mathematical Society|year=2012|isbn=978-0-8218-8330-3}}. — Translation into English by John Stillwell of Theorie der algebraischen Functionen einer Veränderlichen (1882).
  • {{Citation|last=Gouvêa|first=F. Q.|date=March 1994|title=A Marvelous Proof|journal=American Mathematical Monthly|pages=203–222|volume=101|issue=3 |jstor=2975598|doi=10.2307/2975598}}
  • {{Citation |last=Gouvêa |first=Fernando Q. |year=1997 |title=p-adic Numbers: An Introduction |edition=2nd |publisher=Springer |isbn=3-540-62911-4 | zbl=0874.11002}}
  • {{citation|title=Handbook of Algebra|volume=6|editor-first=M.|editor-last=Hazewinkel|publisher=North Holland|date=2009|isbn=978-0-444-53257-2|page=342|url={{Google books|yimXZ-7L9ZoC|page=342|plainurl=yes}}}}
  • {{Citation|last1=Hehner|first1=Eric C. R.|author-link1=Eric C. R. Hehner|last2=Horspool|first2=R. Nigel|year=1979|title=A new representation of the rational numbers for fast easy arithmetic|journal=SIAM Journal on Computing|pages=124–134 |volume=8 |issue=2 |doi=10.1137/0208011 |url=https://www.researchgate.net/publication/220617770|citeseerx=10.1.1.64.7714}}
  • {{Citation | last = Hensel | first = Kurt | author-link=Kurt Hensel | title = Über eine neue Begründung der Theorie der algebraischen Zahlen | journal = Jahresbericht der Deutschen Mathematiker-Vereinigung | volume = 6 | year = 1897 | issue = 3 | pages = 83–88 | url = http://www.digizeitschriften.de/resolveppn/GDZPPN00211612X&L=2}}
  • {{Citation|last1=Kelley|first1=John L.|author-link=John Leroy Kelley|title=General Topology|date=2008|orig-year=1955|publisher=Ishi Press|location=New York|isbn=978-0-923891-55-8}}
  • {{Citation |last=Koblitz |first=Neal |author-link=Neal Koblitz |title=p-adic analysis: a short course on recent work |series=London Mathematical Society Lecture Note Series |volume=46 |publisher=Cambridge University Press |year=1980 |isbn=0-521-28060-5 |zbl=0439.12011}}
  • {{Citation |last=Robert |first=Alain M. |year=2000 |title=A Course in p-adic Analysis |publisher=Springer |isbn=0-387-98669-3}}

{{refend}}

Further reading

{{refbegin}}

  • {{Citation |last=Bachman |first=George |title=Introduction to p-adic Numbers and Valuation Theory |year=1964 |publisher=Academic Press |isbn=0-12-070268-1}}
  • {{Citation|last1=Borevich|first1=Z. I.|author-link1=Zenon Ivanovich Borevich|last2=Shafarevich|first2=I. R.|author2-link=Igor Rostislavovich Shafarevich|year=1986|title=Number Theory|publisher=Academic Press|location=Boston, MA|series=Pure and Applied Mathematics|volume=20|isbn=978-0-12-117851-2|url={{Google books|njgVUjjO-EAC|Number Theory|plainurl=yes}}|mr=0195803}}
  • {{Citation |last=Koblitz |first=Neal |author-link=Neal Koblitz |year=1984 | series=Graduate Texts in Mathematics | volume=58 | title=p-adic Numbers, p-adic Analysis, and Zeta-Functions | edition=2nd |publisher=Springer |isbn=0-387-96017-1}}
  • {{Citation | last=Mahler | first=Kurt | author-link=Kurt Mahler | title=p-adic numbers and their functions | edition=2nd | zbl=0444.12013 | series=Cambridge Tracts in Mathematics | volume=76 | location=Cambridge | publisher=Cambridge University Press | year=1981 | isbn=0-521-23102-7 | url-access=registration | url=https://archive.org/details/padicnumbersthei0000mahl }}
  • {{Citation |last=Steen |first=Lynn Arthur |author-link=Lynn Arthur Steen |year=1978 |title=Counterexamples in Topology |publisher=Dover |isbn=0-486-68735-X|title-link=Counterexamples in Topology }}

{{refend}}