p-adic number

From Vero - Wikipedia
(Redirected from P-adic integer)
Jump to navigation Jump to search

Template:Short description

The 3-adic integers, with selected corresponding characters on their Pontryagin dual group

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

For example, comparing the expansion of the rational number <math>\tfrac15</math> in [[Ternary numeral system|base Template:Math]] vs. the Template:Math-adic expansion, <math display="block">\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}</math>

Formally, given a prime number Template:Mvar, a Template:Mvar-adic number can be defined as a series <math display="block">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</math> where Template:Mvar is an integer (possibly negative), and each <math>a_i</math> is an integer such that <math>0\le a_i < p.</math> A Template:Mvar-adic integer is a Template:Mvar-adic number such that <math>k\ge 0.</math>

In general the series that represents a Template:Mvar-adic number is not convergent in the usual sense, but it is convergent for the [[p-adic absolute value|Template:Mvar-adic absolute value]] <math>|s|_p=p^{-k},</math> where Template:Mvar is the least integer Template:Mvar such that <math>a_i\ne 0</math> (if all <math>a_i</math> are zero, one has the zero Template:Mvar-adic number, which has Template:Math as its Template:Mvar-adic absolute value).

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

Template:Mvar-adic numbers were first described by Kurt Hensel in 1897,<ref>Template:Harv</ref> though, with hindsight, some of Ernst Kummer's earlier work can be interpreted as implicitly using Template:Mvar-adic numbers.<ref group="note">Translator's introduction, page 35: "Indeed, with hindsight it becomes apparent that a discrete valuation is behind Kummer's concept of ideal numbers." Template:Harv</ref>

Motivation

Roughly speaking, modular arithmetic modulo a positive integer Template:Mvar consists of "approximating" every integer by the remainder of its division by Template:Mvar, called its residue modulo Template:Mvar. The main property of modular arithmetic is that the residue modulo Template:Mvar 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 Template:Mvar.

When studying Diophantine equations, it's sometimes useful to reduce the equation modulo a prime Template:Mvar, since this usually provides more insight about the equation itself. Unfortunately, doing this loses some information because the reduction <math>\mathbb Z\twoheadrightarrow\mathbb Z/p</math> is not injective.

One way to preserve more information is to use larger moduli, such as higher prime powers, Template:Math, Template:Math. However, this has the disadvantage of <math>\mathbb Z/p^e</math> not being a field, which loses a lot of the algebraic properties that <math>\mathbb Z/p</math> has.<ref name="Chen">Template:Harv</ref>

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

Essentially, Template:Mvar-adic numbers allows "taking modulo Template:Math for all Template:Mvar at once". A distinguishing feature of Template:Mvar-adic numbers from ordinary modulo arithmetic is that the set of Template:Mvar-adic numbers <math>\mathbb Q_p</math> forms a field, making division by Template:Mvar possible (unlike when working modulo Template:Math). Furthermore, the mapping <math>\mathbb Z\hookrightarrow\mathbb Z_p</math> is injective, so not much information is lost when reducing to Template:Mvar-adic numbers.<ref name="Chen"/>

Informal description

There are multiple ways to understand Template:Mvar-adic numbers.

As a base-p expansion

One way to think about Template:Mvar-adic integers is using "base Template:Mvar". For example, every integer can be written in base Template:Mvar,

<math display="block">50=1212_3=1\cdot3^3+2\cdot3^2+1\cdot3^1+2\cdot3^0</math>

Informally, Template:Mvar-adic integers can be thought of as integers in base-Template:Mvar, but the digits extend infinitely to the left.<ref name="Chen"/>

<math display="block">\ldots121012102_3=\cdots+2\cdot3^3+1\cdot3^2+0\cdot3^1+2\cdot3^0</math>

Addition and multiplication on Template:Mvar-adic integers can be carried out similarly to integers in base-Template:Mvar.<ref name="Koc">Template:Harv</ref>

When adding together two Template:Mvar-adic integers, for example <math>\ldots012102_3+\ldots101211_3</math>, their digits are added with carries being propagated from right to left.

<math display="block">\begin{array}{cccccccc}

 &        &   &_1 &_1 &   &_1 &   \\
 & \cdots & 0 & 1 & 2 & 1 & 0 & 2 \,_3 \\

+ & \cdots & 1 & 0 & 1 & 2 & 1 & 1 \,_3 \\\hline

 & \cdots & 1 & 2 & 1 & 0 & 2 & 0 \,_3

\end{array}</math>

Multiplication of Template:Mvar-adic integers works similarly via long multiplication. Since addition and multiplication can be performed with Template:Mvar-adic integers, they form a ring, denoted <math>\mathbb Z_p</math> or <math>\mathbf Z_p</math>.

Note that some rational numbers can also be Template:Mvar-adic integers, even if they aren't integers in a real sense. For example, the rational number Template:Sfrac is a 3-adic integer, and has the 3-adic expansion <math>\tfrac{1}{5}=\ldots121012102_3</math>. However, some rational numbers, such as <math>\tfrac{1}{p}</math>, cannot be written as a Template:Mvar-adic integer. Because of this, Template:Mvar-adic integers are generalized further to Template:Mvar-adic numbers:

Template:Mvar-adic numbers can be thought of as Template:Mvar-adic integers with finitely many digits after the decimal point. An example of a 3-adic number is

<math display="block">\ldots121012.102_3 = \cdots+1\cdot3^1+2\cdot3^0+1\cdot3^{-1}+0\cdot3^{-2}+2\cdot3^{-3}</math>

Equivalently, every Template:Mvar-adic number is of the form <math>\tfrac x{p^k}</math>, where Template:Mvar is a Template:Mvar-adic integer.

For any Template:Mvar-adic number Template:Mvar, its multiplicative inverse <math>\tfrac{1}{x}</math> is also a Template:Mvar-adic number, which can be computed using a variant of long division.<ref name="Koc"/> For this reason, the Template:Mvar-adic numbers form a field, denoted <math>\mathbb Q_p</math> or <math>\mathbf Q_p</math>.

As a sequence of residues mod Template:Mvark

Another way to define Template:Mvar-adic integers is by representing it as a sequence of residues <math>x_e</math> mod <math>p^e</math> for each integer <math>e</math>,<ref name="Chen"/>

<math display="block"> x = (x_1 \operatorname{mod} p, ~ x_2 \operatorname{mod} p^2, ~ x_3 \operatorname{mod} p^3, ~ \ldots)</math>

satisfying the compatibility relations <math>x_i \equiv x_j ~ (\operatorname{mod} p^i)</math> for <math>i < j</math>. In this notation, addition and multiplication of Template:Mvar-adic integers are defined component-wise:

<math display="block"> x+y = (x_1+y_1 \operatorname{mod} p, ~ x_2+y_2 \operatorname{mod} p^2, ~ x_3+y_3 \operatorname{mod} p^3, ~ \ldots)</math> <math display="block"> x\cdot y = (x_1\cdot y_1 \operatorname{mod} p, ~ x_2\cdot y_2 \operatorname{mod} p^2, ~ x_3\cdot y_3 \operatorname{mod} p^3, ~ \ldots)</math>

This is equivalent to the base-Template:Mvar definition, because the last Template:Mvar digits of a base-Template:Mvar expansion uniquely define its value mod Template:Mvark, and vice versa.

This form can also explain why some rational numbers are Template:Mvar-adic integers, even if they are not integers. For example, Template:Sfrac is a 3-adic integer, because its 3-adic expansion consists of the multiplicative inverses of 5 mod 3, 32, 33, ...

<math display="block">\begin{align} \frac15 &= (\tfrac15 \operatorname{mod} 3, ~ \tfrac15 \operatorname{mod} 3^2, ~ \tfrac15 \operatorname{mod} 3^3, ~ \tfrac15 \operatorname{mod} 3^4, ~ \ldots)\\ &= (2 \operatorname{mod} 3, ~ 2 \operatorname{mod} 3^2, ~ 11 \operatorname{mod} 3^3, ~ 65 \operatorname{mod} 3^4, ~ \ldots) \end{align}</math>

Definition

There are several equivalent definitions of Template:Mvar-adic numbers. The two approaches given below are relatively elementary.

As formal series in base Template:Mvar

A Template:Mvar-adic integer is often defined as a formal power series of the form <math display="block">r=\sum_{i=0}^\infty a_i p^i = a_0 + a_1 p + a_2 p^2 + a_3 p^3 + \cdots</math> where each <math>a_i\in\{0,1,\ldots,p-1\}</math> represents a "digit in base Template:Mvar".

A Template:Mvar-adic unit is a Template:Mvar-adic integer whose first digit is nonzero, i.e. <math>a_0\ne 0</math>. The set of all Template:Mvar-adic integers is usually denoted <math>\mathbb Z_p</math>.<ref>Template:Harv</ref>

A Template:Mvar-adic number is then defined as a formal Laurent series of the form <math display="block">r=\sum_{i=v}^\infty a_i p^i = a_v p^v + a_{v+1} p^{v+1} + a_{v+2} p^{v+2} + a_{v+3} p^{v+3} + \cdots</math> where Template:Mvar is a (possibly negative) integer, and each <math>a_i\in\{0,1,\ldots,p-1\}</math>.<ref name=G18>Template:Harv</ref> Equivalently, a Template:Mvar-adic number is anything of the form <math>\tfrac{x}{p^k}</math>, where Template:Mvar is a Template:Mvar-adic integer.

The first index Template:Mvar for which the digit <math>a_v</math> is nonzero in Template:Mvar is called the [[p-adic valuation|Template:Mvar-adic valuation]] of Template:Mvar, denoted <math>v_p(r)</math>. If <math>r=0</math>, then such an index does not exist, so by convention <math>v_p(0)=\infty</math>.

In this definition, addition, subtraction, multiplication, and division of Template:Mvar-adic numbers are carried out similarly to numbers in base Template:Mvar, with "carries" or "borrows" moving from left to right rather than right to left.<ref>Template:Harv</ref> As an example in <math>\mathbb Q_3</math>,

<math display="block">\begin{array}{lllllllllll}

 &           & & _1        & &           & & _1        & & _1 \\
 & 2\cdot3^0 &+& 0\cdot3^1 &+& 1\cdot3^2 &+& 2\cdot3^3 &+& 1\cdot3^4 &+ \cdots \\

+ & 1\cdot3^0 &+& 1\cdot3^1 &+& 2\cdot3^2 &+& 1\cdot3^3 &+& 0\cdot3^4 &+ \cdots \\\hline

 & 0\cdot3^0 &+& 2\cdot3^1 &+& 0\cdot3^2 &+& 1\cdot3^3 &+& 2\cdot3^4 &+ \cdots

\end{array}</math>

Division of Template:Mvar-adic numbers may also be carried out "formally" via division of formal power series, with some care about having to "carry".<ref name=G18/>

With these operations, the set of Template:Mvar-adic numbers form a field, denoted <math>\mathbb Q_p</math>.

As equivalence classes

The Template:Mvar-adic numbers may also be defined as equivalence classes, in a similar way as the definition of real numbers as equivalence classes of Cauchy sequences. It is fundamentally based on the following lemma:

Every nonzero rational number Template:Mvar can be written <math display=inline>r=p^v\frac{m}{n},</math> where Template:Mvar, Template:Mvar, and Template:Mvar are integers and neither Template:Mvar nor Template:Mvar is divisible by Template:Mvar.

The exponent Template:Mvar is uniquely determined by Template:Mvar and is called its Template:Mvar-adic valuation, denoted <math>v_p(r)</math>. The proof of the lemma results directly from the fundamental theorem of arithmetic.

A Template:Mvar-adic series is a formal Laurent series of the form <math display="block">\sum_{i=v}^\infty r_i p^{i},</math> where <math>v</math> is a (possibly negative) integer and the <math>r_i</math> are rational numbers that either are zero or have a nonnegative valuation (that is, the denominator of <math>r_i</math> is not divisible by Template:Mvar).

Every rational number may be viewed as a Template:Mvar-adic series with a single nonzero term, consisting of its factorization of the form <math>p^k\tfrac mn,</math> with Template:Mvar and Template:Mvar both coprime with Template:Mvar.

Two Template:Mvar-adic series <math display=inline>\sum_{i=v}^\infty r_i p^{i} </math> and <math display=inline> \sum_{i=w}^\infty s_i p^{i} </math> are equivalent if there is an integer Template:Mvar such that, for every integer <math>n>N,</math> the rational number <math display="block">\sum_{i=v}^n r_i p^{i} - \sum_{i=w}^n s_i p^{i} </math> is zero or has a Template:Mvar-adic valuation greater than Template:Mvar.

A Template:Mvar-adic series <math display=inline>\sum_{i=v}^\infty a_i p^{i} </math> is normalized if either all <math>a_i</math> are integers such that <math>0\le a_i <p,</math> and <math>a_v >0,</math> or all <math>a_i</math> are zero. In the latter case, the series is called the zero series.

Every Template:Mvar-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|§ Normalization of a Template:Mvar-adic series]], below.

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

The usual operations of series (addition, subtraction, multiplication, division) are compatible with equivalence of Template:Mvar-adic series. That is, denoting the equivalence with Template:Math, if Template:Mvar, Template:Mvar and Template:Mvar are nonzero Template:Mvar-adic series such that <math>S\sim T,</math> one has <math display="block">\begin{align} S\pm U&\sim T\pm U,\\ SU&\sim TU,\\ 1/S&\sim 1/T. \end{align}</math>

With this, the Template:Mvar-adic numbers are defined as the equivalence classes of Template:Mvar-adic series.

The uniqueness property of normalization, allows uniquely representing any Template:Mvar-adic number by the corresponding normalized Template:Mvar-adic series. The compatibility of the series equivalence leads almost immediately to basic properties of Template:Mvar-adic numbers:

Normalization of a p-adic series

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

Then, if the series is not normalized, consider the first nonzero <math>r_i</math> that is not an integer in the interval <math>[0,p-1].</math> Using Bézout's lemma, write this as <math>r_i=a_i+ps_i</math>, where <math>a_i\in[0,p-1]</math> and <math>s_i</math> has nonnegative valuation. Then, one gets an equivalent series by replacing <math>r_i</math> with <math>a_i,</math> and adding <math>s_i</math> to <math>r_{i+1}.</math> Iterating this process, possibly infinitely many times, provides eventually the desired normalized Template:Math-adic series.

Other equivalent definitions

Other equivalent definitions use completion of a discrete valuation ring (see Template:Slink), completion of a metric space (see Template:Slink), or inverse limits (see Template:Slink).

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

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

Template:Anchor With these operations, Template:Mvar-adic numbers form a field called the field of Template:Math-adic numbers and denoted <math>\Q_p</math> or <math>\mathbf Q_p.</math> There is a unique field homomorphism from the rational numbers into the Template:Mvar-adic numbers, which maps a rational number to its Template:Mvar-adic expansion. The image of this homomorphism is commonly identified with the field of rational numbers. This allows considering the Template:Math-adic numbers as an extension field of the rational numbers, and the rational numbers as a subfield of the Template:Math-adic numbers.

The valuation of a nonzero Template:Mvar-adic number Template:Mvar, commonly denoted <math>v_p(x),</math> is the exponent of Template:Mvar in the first nonzero term of every Template:Mvar-adic series that represents Template:Mvar. By convention, <math>v_p(0)=\infty;</math> that is, the valuation of zero is <math>\infty.</math> This valuation is a discrete valuation. The restriction of this valuation to the rational numbers is the Template:Mvar-adic valuation of <math>\Q,</math> that is, the exponent Template:Mvar in the factorization of a rational number as <math dosplay=inline≝>\tfrac nd p^v,</math> with both Template:Mvar and Template:Mvar coprime with Template:Mvar.

Notation

There are several different conventions for writing Template:Mvar-adic expansions. So far this article has used a notation for Template:Mvar-adic expansions in which powers of Template:Mvar increase from right to left. With this right-to-left notation the 3-adic expansion of <math>\tfrac15,</math> for example, is written as <math display="block">\frac15 = \dots 121012102_3.</math>

When performing arithmetic in this notation, digits are carried to the left. It is also possible to write Template:Mvar-adic expansions so that the powers of Template:Mvar increase from left to right, and digits are carried to the right. With this left-to-right notation the 3-adic expansion of <math>\tfrac15</math> is <math display="block"> \frac15 = 2.01210121\dots_3 \mbox{ or } \frac1{15} = 20.1210121\dots_3. </math>

Template:Mvar-adic expansions may be written with other sets of digits instead of Template:MathTemplate:Math}. For example, the Template:Math-adic expansion of <math>\tfrac15</math> can be written using balanced ternary digits Template:Math}, with Template:Math representing negative one, as <math display="block">\frac15 = \dots\underline{1}11\underline{11}11\underline{11}11\underline{1}_{\text{3}} .</math>

In fact any set of Template:Mvar integers which are in distinct residue classes modulo Template:Mvar may be used as Template:Mvar-adic digits. In number theory, Teichmüller representatives are sometimes used as digits.<ref>Template:Harv</ref>

Template:Vanchor is a variant of the Template:Mvar-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.<ref>Template:Harv</ref> It can be used as a compact way to represent rational numbers, which have an infinite periodic sequence of digits. In this notation, a quote mark (') is used to separate the repeating part from the nonrepeating part. <math display="block">\frac15=1210\,'2_3</math>

p-adic expansion of rational numbers

The decimal expansion of a positive rational number <math>r</math> is its representation as a series <math display="block">r = \sum_{i=k}^\infty a_i 10^{-i},</math> where <math>k</math> is an integer and each <math>a_i</math> is also an integer such that <math>0\le a_i <10.</math> This expansion can be computed by long division of the numerator by the denominator, which is itself based on the following theorem: If <math>r=\tfrac n d</math> is a rational number such that <math>0\le r <1,</math> there is an integer <math>a</math> such that <math>0\le a <10,</math> and <math>10r = a+r',</math> with <math>0\le r'<1.</math> The decimal expansion is obtained by repeatedly applying this result to the remainder <math>r'</math> which in the iteration assumes the role of the original rational number <math>r</math>.

The Template:Mvar-adic expansion of a rational number can be computed similarly, but with a different division step. Suppose that <math>r=\tfrac{n}{d}</math> is a rational number with nonnegative valuation (that is, Template:Mvar is not divisible by Template:Mvar). The division step consists of writing Template:Anchor<math display="block">r = a + p\,r'</math> where <math>a</math> is an integer such that <math>0\le a <p,</math> and <math>r'</math> has nonnegative valuation.

The integer Template:Mvar can be computed as a modular multiplicative inverse: <math>a=nd^{-1}\operatorname{mod}p</math>. Because of this, writing Template:Mvar in this way is always possible, and such a representation is unique.

The Template:Mvar-adic expansion of a rational number is eventually periodic. Conversely, a series <math display=inline>\sum_{i=k}^\infty a_i p^i,</math> with <math>0\le a_i <p</math> converges (for the Template:Mvar-adic absolute value) to a rational number if and only if it is eventually periodic; in this case, the series is the Template:Mvar-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 <math>\tfrac 13.</math> We can write this number as <math>\tfrac13 = 2 + 5 \cdot \tfrac{-1}3</math>. Thus we use <math>a=2</math> for the first step. <math display="block">\frac13 = 2 + 5^1 \cdot \left(\frac{-1}3\right)</math> For the next step, we can write the "remainder" <math>\tfrac{-1}3</math> as <math>\tfrac{-1}3 = 3 + 5 \cdot \tfrac{-2}3</math>. Thus we use <math>a=3</math>. <math display="block">\frac13 = 2 + 3\cdot 5^1 + 5^2 \cdot \left(\frac{-2}3\right)</math> We can write the "remainder" <math>\tfrac{-2}3</math> as <math>\tfrac{-2}3 = 1 + 5 \cdot \tfrac{-1}3</math>. Thus we use <math>a=1</math>. <math display="block">\frac13 = 2 + 3\cdot 5^1 + 1\cdot5^2 + 5^3\cdot \left(\frac{-1}3\right)</math> Notice that we obtain the "remainder" <math>\tfrac{-1}3</math> again, which means the digits can only repeat from this point on. <math display="block">\frac13 = 2 + 3\cdot 5^1 + 1\cdot5^2 + 3\cdot 5^3 + 1\cdot 5^4 + 3\cdot 5^5 + 1\cdot 5^6 + \cdots</math> In the standard 5-adic notation, we can write this as <math display="block">\frac 13= \ldots 1313132_5 </math> with the ellipsis <math> \ldots </math> on the left hand side.

p-adic integers

The Template:Mvar-adic integers are the Template:Mvar-adic numbers with a nonnegative valuation.

A <math>p</math>-adic integer can be represented as a sequence <math display="block"> x = (x_1 \operatorname{mod} p, ~ x_2 \operatorname{mod} p^2, ~ x_3 \operatorname{mod} p^3, ~ \ldots)</math> of residues <math>x_e</math> mod <math>p^e</math> for each integer <math>e</math>, satisfying the compatibility relations <math>x_i \equiv x_j ~ (\operatorname{mod} p^i)</math> for <math>i < j</math>.

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

The Template:Mvar-adic integers form a commutative ring, denoted <math>\Z_p</math> or <math>\mathbf Z_p</math>, that has the following properties.

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

Topological properties

Visual depiction of the 3-adic integers <math>\mathbb Z_3</math> as a metric space

The Template:Mvar-adic valuation allows defining an absolute value on Template:Mvar-adic numbers: the Template:Mvar-adic absolute value of a nonzero Template:Mvar-adic number Template:Mvar is <math display=block>|x|_p = p^{-v_p(x)},</math> where <math>v_p(x)</math> is the Template:Mvar-adic valuation of Template:Mvar. The Template:Mvar-adic absolute value of <math>0</math> is <math>|0|_p = 0.</math> This is an absolute value that satisfies the strong triangle inequality since, for every Template:Mvar and Template:Mvar:

  • <math>|x|_p = 0</math> if and only if <math>x=0;</math>
  • <math>|x|_p\cdot |y|_p = |xy|_p;</math>
  • <math>|x+y|_p\le \max\bigl(|x|_p,|y|_p\bigr) \le |x|_p + |y|_p.</math>

Moreover, if <math>|x|_p \ne |y|_p,</math> then <math>|x+y|_p = \max\bigl(|x|_p,|y|_p\bigr).</math>

This makes the Template:Mvar-adic numbers a metric space, and even an ultrametric space, with the Template:Mvar-adic distance defined by <math>d_p(x,y)=|x-y|_p.</math>

As a metric space, the Template:Mvar-adic numbers form the completion of the rational numbers equipped with the Template:Mvar-adic absolute value. This provides another way for defining the Template:Mvar-adic numbers.

As the metric is defined from a discrete valuation, every open ball is also closed. More precisely, the open ball <math>B_r(x) =\{y\mid d_p(x,y)<r\}</math> equals the closed ball <math>\textstyle B_{p^{-v}}[x] =\{y\mid d_p(x,y)\le p^{-v}\},</math> where Template:Mvar is the least integer such that <math>\textstyle p^{-v}< r.</math> Similarly, <math>\textstyle B_r[x] = B_{p^{-w}}(x),</math> where Template:Mvar is the greatest integer such that <math>\textstyle p^{-w}>r.</math>

This implies that the Template:Mvar-adic numbers <math>\mathbb Q_p</math> form a locally compact space (locally compact field), and the Template:Mvar-adic integers <math>\mathbb Z_p</math>—that is, the ball <math>B_1[0]=B_p(0)</math>—form a compact space.<ref>Template:Harv</ref>

The space of 2-adic integers <math>\mathbb Z_2</math> is homeomorphic to the Cantor set <math>\mathcal C</math>.<ref>Template:Harv</ref><ref>Template:Harv</ref> This can be seen by considering the continuous 1-to-1 mapping <math>\psi:\mathbb Z_2\to \mathcal C</math> defined by <math display="block">\psi:~a_0+a_12+a_22^2+a_32^3+\cdots~\longmapsto~\frac{2a_0}3+\frac{2a_1}{3^2}+\frac{2a_2}{3^3}+\frac{2a_3}{3^4}+\cdots</math> Moreover, for any Template:Mvar, <math>\mathbb Z_p</math> is homeomorphic to <math>\mathbb Z_2</math>, and therefore also homeomorphic to the Cantor set.<ref>Template:Harv</ref>

The Pontryagin dual of the group of Template:Mvar-adic integers is the [[Prüfer group|Prüfer Template:Mvar-group]] <math>\mathbb Z(p^\infty)</math>, and the Pontryagin dual of the Prüfer Template:Mvar-group is the group of Template:Mvar-adic integers.<ref>Template:Harv</ref>

Modular properties

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

The inverse limit of the rings <math>\Z_p/p^n\Z_p</math> is defined as the ring formed by the sequences <math>a_0, a_1, \ldots</math> such that <math>a_i \in \Z/p^i \Z</math> and <math display = inline>a_i \equiv a_{i+1} \pmod {p^i}</math> for every Template:Mvar.

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

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

For example, for computing the Template:Mvar-adic (multiplicative) inverse of an integer, one can use Newton's method, starting from the inverse modulo Template:Mvar; then, each Newton step computes the inverse modulo <math display = inline>p^{n^2}</math> from the inverse modulo <math display = inline>p^n.</math>

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

Cardinality

Both <math>\Z_p</math> and <math>\Q_p</math> are uncountable and have the cardinality of the continuum.<ref>Template:Harv</ref> For <math>\Z_p,</math> this results from the Template:Mvar-adic representation, which defines a bijection of <math>\Z_p</math> on the power set <math>\{0,\ldots,p-1\}^\N.</math> For <math>\Q_p</math> this results from its expression as a countably infinite union of copies of <math>\Z_p</math>: <math display="block">\Q_p=\bigcup_{i=0}^\infty \frac 1{p^i}\Z_p.</math>

Algebraic closure

<math>\Q_p</math> contains <math>\Q</math> and is a field of characteristic Template:Math.

Template:AnchorBecause Template:Math can be written as sum of squares,<ref group="note">According to Hensel's lemma <math>\Q_2</math> contains a square root of Template:Math, so that <math>2^2 +1^2+1^2+1^2+\left(\sqrt{-7}\right)^2 = 0 ,</math> and if Template:Math then also by Hensel's lemma <math>\Q_p</math> contains a square root of Template:Math, thus <math>(p-1)\times 1^2 +\left(\sqrt{1-p}\right)^2 = 0 .</math></ref> <math>\Q_p</math> cannot be turned into an ordered field.

The field of real numbers <math>\R</math> has only a single proper algebraic extension: the complex numbers <math>\C</math>. In other words, this quadratic extension is already algebraically closed. By contrast, the algebraic closure of <math>\Q_p</math>, denoted <math>\overline{\Q_p},</math> has infinite degree,<ref>Template:Harv</ref> that is, <math>\Q_p</math> has infinitely many inequivalent algebraic extensions. Also contrasting the case of real numbers, although there is a unique extension of the Template:Mvar-adic valuation to <math>\overline{\Q_p},</math> the latter is not (metrically) complete.<ref>Template:Harv</ref><ref name=C149>Template:Harv</ref>

Its (metric) completion is denoted <math>\C_p</math> or <math>\Omega_p</math>,<ref name=C149/><ref name=K13>Template:Harv</ref> and sometimes called the complex Template:Mvar-adic numbers by analogy to the complex numbers. Here an end is reached, as <math>\C_p</math> is algebraically closed.<ref name=C149/><ref>Template:Harv</ref> However unlike <math>\C</math> this field is not locally compact.<ref name=K13/>

<math>\C_p</math> and <math>\C</math> are isomorphic as rings,<ref group="note">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 <math>\C_p</math> and <math>\C</math> have characteristic zero and the cardinality of the continuum.</ref> so we may regard <math>\C_p</math> as <math>\C</math> 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 <math>K</math> is any finite Galois extension of <math>\Q_p,</math> the Galois group <math>\operatorname{Gal} \left(K/\Q_p \right)</math> is solvable. Thus, the Galois group <math>{\operatorname{Gal}} \bigl(\,\overline{\Q_p}/ \Q_p \bigr)</math> is prosolvable.

Multiplicative group

<math>\Q_p</math> contains the Template:Mvar-th cyclotomic field (Template:Math) if and only if Template:Math.<ref>Template:Harv</ref> For instance, the Template:Mvar-th cyclotomic field is a subfield of <math>\Q_{13}</math> if and only if Template:Math, or Template:Math. In particular, there is no multiplicative Template:Mvar-torsion in <math>\Q_p</math> if Template:Math. Also, Template:Math is the only non-trivial torsion element in <math>\Q_2</math>.

Given a natural number Template:Mvar, the index of the multiplicative group of the Template:Mvar-th powers of the non-zero elements of <math>\Q_p</math> in <math>\Q_p^\times</math> is finite.

The number Template:Mvar, defined as the sum of reciprocals of factorials, is not a member of any Template:Mvar-adic field; but <math>e^p \in \Q_p</math> for <math>p \ne 2</math>. For Template:Math one must take at least the fourth power.<ref>Template:Harv</ref> (Thus a number with similar properties as Template:Mvar — namely a Template:Mvar-th root of Template:Math — is a member of <math>\Q_p</math> for all Template:Mvar.)

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

Rational arithmetic with Hensel lifting

Template:Main

Applications

The p-adic numbers have appeared in several fields of mathematics as well as physics.

Analysis

Template:Main Similar to the more classical fields of real and complex analysis, which deal, respectively, with functions on the real and complex numbers, p-adic analysis studies functions on p-adic numbers. The theory of complex-valued numerical functions on the p-adic numbers is part of the theory of locally compact groups (abstract harmonic analysis). The usual meaning taken for p-adic analysis is the theory of p-adic-valued functions on spaces of interest.

Applications of p-adic analysis have mainly been in number theory, where it has a significant role in diophantine geometry and diophantine approximation. Some applications have required the development of p-adic functional analysis and spectral theory. In many ways p-adic analysis is less subtle than classical analysis, since the ultrametric inequality means, for example, that convergence of infinite series of p-adic numbers is much simpler. Topological vector spaces over p-adic fields show distinctive features; for example aspects relating to convexity and the Hahn–Banach theorem are different.

Two important concepts from p-adic analysis are Mahler's theorem, which characterizes every continuous p-adic function in terms of polynomials, and Volkenborn integral, which provides a method of integration for p-adic functions.

Hodge theory

Template:Main p-adic Hodge theory is a theory that provides a way to classify and study p-adic Galois representations of characteristic 0 local fields with residual characteristic p (such as Qp). The theory has its beginnings in Jean-Pierre Serre and John Tate's study of Tate modules of abelian varieties and the notion of Hodge–Tate representation. Hodge–Tate representations are related to certain decompositions of p-adic cohomology theories analogous to the Hodge decomposition, hence the name p-adic Hodge theory. Further developments were inspired by properties of p-adic Galois representations arising from the étale cohomology of varieties. Jean-Marc Fontaine introduced many of the basic concepts of the field.

Teichmüller theory

Template:Main p-adic Teichmüller theory describes the "uniformization" of p-adic curves and their moduli, generalizing the usual Teichmüller theory that describes the uniformization of Riemann surfaces and their moduli. It was introduced and developed by Shinichi Mochizuki.

Quantum physics

Template:Main p-adic quantum mechanics is a collection of related research efforts in quantum physics that replace real numbers with p-adic numbers. Historically, this research was inspired by the discovery that the Veneziano amplitude of the open bosonic string, which is calculated using an integral over the real numbers, can be generalized to the p-adic numbers. This observation initiated the study of p-adic string theory.

The reals and the Template:Mvar-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 ordP(x) for the exponent of P in this factorization, and for any choice of number c greater than 1 we can set <math display="block">|x|_P = c^{-\!\operatorname{ord}_P(x)}.</math> Completing with respect to this absolute value Template:Nowrap begin|⋅|PTemplate:Nowrap end yields a field EP, 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 Template:Nowrap begin|⋅|PTemplate:Nowrap end. 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 Cp, 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 <math>\mathbb{T}_p</math>. There is a map from <math>\mathbb{T}_p</math> to the circle group whose fibers are the p-adic integers <math>\mathbb{Z}_p</math>, in analogy to how there is a map from <math>\mathbb{R}</math> to the circle whose fibers are <math>\mathbb{Z}</math>.

The p-adic integers can also be extended to profinite integers <math>\widehat{\mathbb{Z}}</math>, which can be understood as the direct product of rings <math display="block">\widehat{\mathbb{Z}} = \prod_p \mathbb{Z}_p.</math> Unlike the p-adic integers which only generalize the modulo over prime powers pk, the profinite integers generalizes the modulo over all natural numbers n.

See also

Template:Div col

Template:Div col end

Footnotes

Notes

Template:Reflist

Citations

Template:Reflist

References

Template:Refbegin

Template:Refend

Further reading

Template:Refbegin

Template:Refend

Template:Commons category

Template:Number systems Template:Authority control