P-adic number: Difference between revisions

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
imported>D.Lazard
p-adic series: fixing math display
 
imported>LightbulbMEOW
made citation consistent
 
Line 1: Line 1:
{{Short description|Number system extending the rational numbers}}
{{Short description|Number system extending the rational numbers}}
{{DISPLAYTITLE:''p''-adic number}}
{{DISPLAYTITLE:''p''-adic number}}
[[Image:3-adic integers with dual colorings.svg|thumb|The 3-adic integers, with selected corresponding characters on their [[Pontryagin dual]] group]]
[[Image:3-adic integers with dual colorings.svg|thumb|The 3-adic integers, with selected corresponding characters on their [[Pontryagin dual]] 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 number]]s which is distinct from the [[real number]]s, though with some similar properties; {{mvar|p}}-adic numbers can be written in a form similar to (possibly [[infinity (mathematics)|infinite]]) [[decimal representation|decimal]]s, but with digits based on a prime number {{mvar|p}} rather than ten, and extending to the left rather than to the right.
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 number]]s that is distinct from the [[real number]]s, though with some similar properties; {{mvar|p}}-adic numbers can be written in a form similar to (possibly [[infinity (mathematics)|infinite]]) [[decimal representation|decimal]]s, 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 <math>\tfrac15</math> in [[Ternary numeral system|base {{math|3}}]] vs. the {{math|3}}-adic expansion,
For example, comparing the expansion of the rational number <math>\tfrac15</math> in [[Ternary numeral system|base {{math|3}}]] vs. the {{math|3}}-adic expansion,
Line 25: Line 26:
== Motivation ==
== Motivation ==


Roughly speaking, [[modular arithmetic]] modulo a positive integer {{mvar|n}} consists of "approximating" every integer by the remainder of its [[Euclidean division|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}}.
Roughly speaking, [[modular arithmetic]] modulo a positive integer {{mvar|n}} consists of "approximating" every integer by the remainder of its [[Euclidean division|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}}.
 
When studying [[Diophantine equations]], it's sometimes useful to reduce the equation modulo a prime {{mvar|p}}, 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, {{math|''p''<sup>2</sup>}}, {{math|''p''<sup>3</sup>, ...}}. 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">{{Harv|Chen|loc=Chapter 27}}</ref>
 
[[Kurt Hensel]] discovered a method which consists of using a prime modulus {{mvar|p}}, and applying [[Hensel's lemma]] to lift solutions modulo {{mvar|p}} to modulo {{math|''p''<sup>2</sup>}}, {{math|''p''<sup>3</sup>, ...}}. This process creates an infinite sequence of residues, and a {{mvar|p}}-adic number is defined as the "limit" of such a sequence.
 
Essentially, {{mvar|p}}-adic numbers allows "taking modulo {{math|''p''<sup>''e''</sup>}} for all {{mvar|e}} at once". A distinguishing feature of {{mvar|p}}-adic numbers from ordinary modulo arithmetic is that the set of {{mvar|p}}-adic numbers <math>\mathbb Q_p</math> forms a [[Field_(mathematics)|field]], making division by {{mvar|p}} possible (unlike when working modulo {{math|''p''<sup>''e''</sup>}}). Furthermore, the mapping <math>\mathbb Z\hookrightarrow\mathbb Z_p</math> is [[Injective_function|injective]], so not much information is lost when reducing to {{mvar|p}}-adic numbers.<ref name="Chen"/>
 
== Informal description ==
 
There are multiple ways to understand {{mvar|p}}-adic numbers.
 
=== As a base-''p'' expansion ===
 
One way to think about {{mvar|p}}-adic integers is using "base {{mvar|p}}". For example, every integer can be written in base {{mvar|p}},
 
<math display="block">50=1212_3=1\cdot3^3+2\cdot3^2+1\cdot3^1+2\cdot3^0</math>
 
Informally, '''{{mvar|p}}-adic integers''' can be thought of as integers in base-{{mvar|p}}, 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 {{mvar|p}}-adic integers can be carried out similarly to integers in base-{{mvar|p}}.<ref name="Koc">{{Harv|Koç|2002}}</ref>
 
When adding together two {{mvar|p}}-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 {{mvar|p}}-adic integers works similarly via [[Multiplication_algorithm|long multiplication]]. Since addition and multiplication can be performed with {{mvar|p}}-adic integers, they form a [[Ring_(mathematics)|ring]], denoted <math>\mathbb Z_p</math> or <math>\mathbf Z_p</math>.
 
Note that some rational numbers can also be {{mvar|p}}-adic integers, even if they aren't integers in a real sense. For example, the rational number {{sfrac|1|5}} 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 {{mvar|p}}-adic integer. Because of this, {{mvar|p}}-adic integers are generalized further to {{mvar|p}}-adic numbers:
 
'''{{mvar|p}}-adic numbers''' can be thought of as {{mvar|p}}-adic integers with ''finitely many digits after the decimal point''. An example of a 3-adic number is


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


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 <math>p^2, p^3, \ldots, p^n, \ldots</math> If the process is continued infinitely, this provides eventually  a result which is a {{mvar|p}}-adic number.
Equivalently, every {{mvar|p}}-adic number is of the form <math>\tfrac x{p^k}</math>, where {{mvar|x}} is a {{mvar|p}}-adic integer.


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


The theory of {{mvar|p}}-adic numbers is fundamentally based on the two following lemmas:
=== As a sequence of residues mod {{mvar|p}}<sup>''k''</sup> ===


''Every nonzero rational number can be written <math display=inline>p^v\frac{m}{n},</math> 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]].
Another way to define {{mvar|p}}-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"/>


''Every nonzero rational number {{mvar|r}} of valuation {{mvar|v}} can be uniquely written <math>r=ap^v+ s,</math> where {{mvar|s}} is a rational number of valuation greater than {{mvar|v}}, and {{mvar|a}} is an integer such that <math>0<a<p.</math>''
<math display="block"> x = (x_1 \operatorname{mod} p, ~ x_2 \operatorname{mod} p^2, ~ x_3 \operatorname{mod} p^3, ~ \ldots)</math>


The proof of this lemma results from [[modular arithmetic]]: By the above lemma, <math display=inline>r=p^v\frac{m}{n},</math> where {{mvar|m}} and {{mvar|n}} are integers [[coprime]] with {{mvar|p}}.
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 {{mvar|p}}-adic integers are defined component-wise:
By [[Bézout's lemma]], there exist integers {{mvar|a}} and {{mvar|b}}, with <math>0\leq a < p</math>, such that
<math> m  =  a n + b p.</math> Setting <math> s = b/n</math> (hence <math>{\rm val}(s) \geq 0</math>), we have
<math display="block"> {m\over n} = a + p {b \over n},\quad {\rm or} \quad r = a p^v  + p^{v + 1} s.</math>


To show the uniqueness of this representation, observe that if <math> r = a' p^v + p^{v + 1} s',</math> with
<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>0\leq a' < p</math> and <math>{\rm val}(s')\geq 0</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>
there holds by difference <math>(a -a') + p(s- s') = 0,</math> with <math>|a - a'| < p</math> and <math>{\rm val}(s-s') \geq 0</math>.
Write <math> s-s' = c/d</math>, where {{mvar|d}} is coprime to {{mvar|p}}; then
<math>(a - a')d + p c = 0</math>, which is possible only if <math>a - a' = 0</math> and <math>c=0</math>.
Hence <math>a = a'</math> and <math> s = s'</math>


The above process can be iterated starting from {{mvar|s}} instead of {{mvar|r}}, giving the following.
This is equivalent to the base-{{mvar|p}} definition, because the last {{mvar|k}} digits of a base-{{mvar|p}} expansion uniquely define its value mod {{mvar|p}}<sup>''k''</sup>, and vice versa.


''Given a nonzero rational number {{mvar|r}} of valuation {{mvar|v}} and a positive integer {{mvar|k}}, there are a rational number <math>s_k</math> of nonnegative valuation and {{mvar|k}} uniquely  defined nonnegative integers <math>a_0, \ldots, a_{k-1}</math> less than {{mvar|p}} such that <math>a_0>0</math> and''
This form can also explain why some rational numbers are {{mvar|p}}-adic integers, even if they are not integers. For example, {{sfrac|1|5}} is a 3-adic integer, because its 3-adic expansion consists of the [[Modular multiplicative inverse|multiplicative inverse]]s of 5 mod 3, 3<sup>2</sup>, 3<sup>3</sup>, ...
<math display="block">r=a_0p^v + a_1 p^{v+1} +\cdots + a_{k-1}p^{v+k-1} +p^{v+k}s_k.</math>


The {{mvar|p}}-adic numbers are essentially obtained by continuing this infinitely to produce an [[infinite series]].
<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>


== ''p''-adic series ==
== Definition ==


The {{mvar|p}}-adic numbers are commonly defined by means of {{mvar|p}}-adic series.
There are several equivalent definitions of {{mvar|p}}-adic numbers. The two approaches given below are relatively elementary.


A ''{{mvar|p}}-adic series'' is a [[formal power series]] of the form  
=== As formal series in base {{mvar|p}} ===
 
A '''{{mvar|p}}-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 {{mvar|p}}".
 
A '''{{mvar|p}}-adic unit''' is a {{mvar|p}}-adic integer whose first digit is nonzero, i.e. <math>a_0\ne 0</math>. The set of all {{mvar|p}}-adic integers is usually denoted <math>\mathbb Z_p</math>.<ref>{{Harv|Koblitz|1984|p=13}}</ref>
 
A '''{{mvar|p}}-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 {{mvar|v}} is a (possibly negative) integer, and each <math>a_i\in\{0,1,\ldots,p-1\}</math>.<ref name=G18>{{Harv|Gouvêa|1997|p=18}}</ref> Equivalently, a {{mvar|p}}-adic number is anything of the form <math>\tfrac{x}{p^k}</math>, where {{mvar|x}} is a {{mvar|p}}-adic integer.
 
The first index {{mvar|v}} for which the digit <math>a_v</math> is nonzero in {{mvar|r}} is called the '''[[p-adic valuation|{{mvar|p}}-adic valuation]]''' of {{mvar|r}}, 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 {{mvar|p}}-adic numbers are carried out similarly to numbers in base {{mvar|p}}, with "carries" or "borrows" moving from left to right rather than right to left.<ref>{{Harv|Koblitz|1984|pp=14–15}}</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 {{mvar|p}}-adic numbers may also be carried out "formally" via [[Formal_power_series#Division|division of formal power series]], with some care about having to "carry".<ref name=G18/>
 
With these operations, the set of {{mvar|p}}-adic numbers form a [[Field_(mathematics)|field]], denoted <math>\mathbb Q_p</math>.
 
=== As equivalence classes ===
 
The {{mvar|p}}-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 {{mvar|r}} can be written <math display=inline>r=p^v\frac{m}{n},</math> 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 {{mvar|r}} and is called its '''{{mvar|p}}-adic valuation''', denoted <math>v_p(r)</math>. The proof of the lemma results directly from the [[fundamental theorem of arithmetic]].
 
A '''{{mvar|p}}-adic series''' is a [[formal Laurent series]] of the form
<math display="block">\sum_{i=v}^\infty r_i p^{i},</math>
<math display="block">\sum_{i=v}^\infty r_i p^{i},</math>
where <math>v</math> is an 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 {{mvar|p}}).
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 {{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 <math>p^k\tfrac nd,</math> with {{mvar|n}} and {{mvar|d}} both coprime with {{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 <math>p^k\tfrac mn,</math> with {{mvar|m}} and {{mvar|n}} both coprime with {{mvar|p}}.


Two {{mvar|p}}-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>
Two {{mvar|p}}-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 {{mvar|N}} such that, for every integer <math>n>N,</math> the rational number  
are ''equivalent'' if there is an integer {{mvar|N}} 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>  
<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 {{mvar|p}}-adic valuation greater than {{mvar|n}}.
is zero or has a {{mvar|p}}-adic valuation greater than {{mvar|n}}.


Line 86: Line 156:
\end{align}</math>
\end{align}</math>


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 sequence]]s. 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:
With this, the '''{{mvar|p}}-adic numbers''' are defined as the ''equivalence classes'' of {{mvar|p}}-adic series.
* ''Addition'', ''multiplication'' and [[multiplicative inverse]] of {{mvar|p}}-adic numbers are defined as for [[formal power series]], followed by the normalization of the result.  
 
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 (mathematics)|field]], which is an [[extension field]] of the rational numbers.
* With these operations, the {{mvar|p}}-adic numbers form a [[field (mathematics)|field]], which is an [[extension field]] of the rational numbers.
* The ''valuation'' of a nonzero {{mvar|p}}-adic number {{mvar|x}}, commonly denoted <math>v_p(x)</math> is the exponent of {{mvar|p}} in the first non zero term of the corresponding normalized series; the valuation of zero is <math>v_p(0)=+\infty</math>
* The ''valuation'' of a nonzero {{mvar|p}}-adic number {{mvar|x}}, commonly denoted <math>v_p(x)</math> is the exponent of {{mvar|p}} in the first non zero term of the corresponding normalized series; the valuation of zero is <math>v_p(0)=+\infty</math>
* The ''{{mvar|p}}-adic absolute value'' of a nonzero {{mvar|p}}-adic number {{mvar|x}}, is <math>|x|_p=p^{-v(x)};</math> for the zero {{mvar|p}}-adic number, one has <math>|0|_p=0.</math>
* The ''{{mvar|p}}-adic absolute value'' of a nonzero {{mvar|p}}-adic number {{mvar|x}}, is <math>|x|_p=p^{-v(x)};</math> for the zero {{mvar|p}}-adic number, one has <math>|0|_p=0.</math>


=== Normalization of a ''p''-adic series ===
==== Normalization of a ''p''-adic series ====
Starting with the series <math display=inline>\sum_{i=v}^\infty r_i p^{i}, </math> the first above lemma allows getting an equivalent series such that the {{mvar|p}}-adic valuation of <math>r_v</math> is zero. For that, one considers the first nonzero <math>r_i.</math> 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 <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 {{math|0}} 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.
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 {{mvar|p}}-adic valuation of <math>r_v</math> is zero. For that, one considers the first nonzero <math>r_i.</math> 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 <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 {{math|0}} 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> The second above lemma allows writing it <math>r_i=a_i+ps_i;</math> one gets n 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 {{math|p}}-adic series.
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 {{math|p}}-adic series.


== Definition ==
=== Other equivalent definitions ===
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 ring|completion]] of a [[discrete valuation ring]] (see {{slink||p-adic integers}}), [[completion of a metric space]] (see {{slink||Topological properties}}), or [[inverse limit]]s (see {{slink||Modular properties}}).
 
Other equivalent definitions use [[completion of a ring|completion]] of a [[discrete valuation ring]] (see {{slink||p-adic integers}}), [[completion of a metric space]] (see {{slink||Topological properties}}), or [[inverse limit]]s (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.
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.
Line 108: Line 181:


The ''valuation'' of a nonzero {{mvar|p}}-adic number {{mvar|x}}, commonly denoted <math>v_p(x),</math> is the exponent of {{mvar|p}} in the first nonzero term of every {{mvar|p}}-adic series that represents {{mvar|x}}. 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 {{mvar|p}}-adic valuation of <math>\Q,</math> that is, the exponent {{mvar|v}} in the factorization of a rational number as <math dosplay=inline≝>\tfrac nd p^v,</math> with both {{mvar|n}} and {{mvar|d}} [[coprime]] with {{mvar|p}}.
The ''valuation'' of a nonzero {{mvar|p}}-adic number {{mvar|x}}, commonly denoted <math>v_p(x),</math> is the exponent of {{mvar|p}} in the first nonzero term of every {{mvar|p}}-adic series that represents {{mvar|x}}. 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 {{mvar|p}}-adic valuation of <math>\Q,</math> that is, the exponent {{mvar|v}} in the factorization of a rational number as <math dosplay=inline≝>\tfrac nd p^v,</math> with both {{mvar|n}} and {{mvar|d}} [[coprime]] with {{mvar|p}}.
== 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 [[exponentiation|powers]] of {{mvar|p}} 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 [[carry (arithmetic)|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 <math>\tfrac15</math> is
<math display="block">
\frac15 = 2.01210121\dots_3 \mbox{ or }
\frac1{15} = 20.1210121\dots_3.
</math>
{{mvar|p}}-adic expansions may be written with [[Signed-digit representation|other sets of digits]] instead of {{math|{0,&thinsp;1,&thinsp;...,}}&thinsp;{{math|''p'' − 1}}}. For example, the {{math|3}}-adic expansion of <math>\tfrac15</math> can be written using [[balanced ternary]] digits {{math|{<u>1</u>,&thinsp;0,&thinsp;1}}}, with {{math|<u>1</u>}} 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 {{mvar|p}} integers which are in distinct [[residue class]]es modulo {{mvar|p}} may be used as {{mvar|p}}-adic digits. In number theory, [[Witt vector#Motivation|Teichmüller representatives]] are sometimes used as digits.<ref>{{Harv|Hazewinkel|2009|p=342}}</ref>
'''{{vanchor|Quote notation}}''' is a variant of the {{mvar|p}}-adic representation of [[rational number]]s that was proposed in 1979 by [[Eric Hehner]] and [[Nigel Horspool]] for implementing on computers the (exact) arithmetic with these numbers.<ref>{{Harv|Hehner|Horspool|1979|pp=124–134}}</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 (mathematics)|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 {{mvar|p}}-''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, {{mvar|d}} is not divisible by {{mvar|p}}). The division step consists of writing
{{anchor|division_step}}<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 {{mvar|a}} can be computed as a [[modular multiplicative inverse]]: <math>a=nd^{-1}\operatorname{mod}p</math>. Because of this, writing {{mvar|r}} in this way is always possible, and such a representation is unique.
The {{mvar|p}}-adic expansion of a rational number is eventually [[periodic function|periodic]]. [[Converse (logic)|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 {{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 [[mathematical proof|proof]] is similar to that of the similar result for [[repeating decimal]]s.
=== 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 ==
== ''p''-adic integers ==
Line 124: Line 242:
* It is a [[local ring]] of [[Krull dimension]] one, since its only [[prime ideal]]s are the [[zero ideal]] and the ideal generated by {{mvar|p}}, the unique [[maximal ideal]].
* It is a [[local ring]] of [[Krull dimension]] one, since its only [[prime ideal]]s are the [[zero ideal]] and the ideal generated by {{mvar|p}}, the unique [[maximal ideal]].
* It is a [[discrete valuation ring]], since this results from the preceding properties.
* It is a [[discrete valuation ring]], since this results from the preceding properties.
* It is the [[completion of a ring|completion]] of the local ring <math>\Z_{(p)} = \{\tfrac nd \mid n, d \in \Z,\, d \not\in p\Z \},</math> which is the [[localization (commutative algebra)|localization]] of <math>\Z</math> at the prime ideal <math>p\Z.</math>
* It is the [[completion of a ring|completion]] of the local ring <math>\Z_{(p)} = \bigl\{\tfrac nd \mathbin{\big|} n, d \in \Z,\, d \not\in p\Z \bigr\},</math> which is the [[localization (commutative algebra)|localization]] of <math>\Z</math> at the prime ideal <math>p\Z.</math>


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}}.
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 ==
== Topological properties ==
[[File:3-adic integers.png|thumb|Visual depiction of the 3-adic integers <math>\mathbb Z_3</math> as a metric space]]
The {{mvar|p}}-adic valuation allows defining an [[absolute value (algebra)|absolute value]] on {{mvar|p}}-adic numbers: the {{mvar|p}}-adic absolute value of a nonzero {{mvar|p}}-adic number {{mvar|x}} is
The {{mvar|p}}-adic valuation allows defining an [[absolute value (algebra)|absolute value]] on {{mvar|p}}-adic numbers: the {{mvar|p}}-adic absolute value of a nonzero {{mvar|p}}-adic number {{mvar|x}} is
<math display="block">|x|_p = p^{-v_p(x)},</math>
<math display=block>|x|_p = p^{-v_p(x)},</math>
where <math>v_p(x)</math> is the {{mvar|p}}-adic valuation of {{mvar|x}}. The {{mvar|p}}-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 {{mvar|x}} and {{mvar|y}} one has
where <math>v_p(x)</math> is the {{mvar|p}}-adic valuation of {{mvar|x}}. The {{mvar|p}}-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 {{mvar|x}} and {{mvar|y}}:
* <math>|x|_p = 0</math> if and only if <math>x=0;</math>
* <math>|x|_p = 0</math> if and only if <math>x=0;</math>
* <math>|x|_p\cdot |y|_p = |xy|_p</math>
* <math>|x|_p\cdot |y|_p = |xy|_p;</math>
* <math>|x+y|_p\le \max(|x|_p,|y|_p) \le |x|_p + |y|_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> one has <math>|x+y|_p = \max(|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 {{mvar|p}}-adic numbers a [[metric space]], and even an [[ultrametric space]], with the {{mvar|p}}-adic distance defined by
This makes the {{mvar|p}}-adic numbers a [[metric space]], and even an [[ultrametric space]], with the {{mvar|p}}-adic distance defined by
<math>d_p(x,y)=|x-y|_p.</math>
<math>d_p(x,y)=|x-y|_p.</math>


As a metric space, the {{mvar|p}}-adic numbers form the [[completion (metric space)|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 sum]]s 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 a metric space, the {{mvar|p}}-adic numbers form the [[completion (metric space)|completion]] of the rational numbers equipped with the {{mvar|p}}-adic absolute value. This provides another way for defining the {{mvar|p}}-adic numbers.
 
As the metric is defined from a discrete valuation, every [[open ball]] is also [[closed ball|closed]]. More precisely, the open ball <math>B_r(x) =\{y\mid d_p(x,y)<r\}</math> equals the closed ball <math>B_{p^{-v}}[x] =\{y\mid d_p(x,y)\le p^{-v}\},</math>  where {{mvar|v}} is the least integer such that <math>p^{-v}< r.</math> Similarly, <math>B_r[x] = B_{p^{-w}}(x),</math> where {{mvar|w}} is the greatest integer such that <math>p^{-w}>r.</math>
 
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 <math>B_1[0]=B_p(0)</math>—form a [[compact space]].
 
== ''p''-adic expansion of rational numbers ==
 
The [[decimal expansion]] of a positive [[rational number]] <math>r</math> is its representation as a [[series (mathematics)|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>10^k\le r <10^{k+1},</math> there is an integer <math>a</math> such that <math>0< a <10,</math> and <math>r = a\,10^k +r',</math> with <math>r'<10^k.</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 {{mvar|p}}-''adic expansion'' of a rational number is defined similarly, but with a different division step. More precisely, given a fixed [[prime number]] <math>p</math>, every nonzero rational number <math>r</math> can be uniquely written as <math>r=p^k\tfrac n d,</math> where <math>k</math> is a (possibly negative) integer, <math>n</math> and <math>d</math> are [[coprime integer]]s both coprime with <math>p</math>, and <math>d</math> is positive. The integer <math>k</math> is the '''{{mvar|p}}-adic valuation''' of <math>r</math>, denoted <math>v_p(r),</math> and <math>p^{-k}</math> is its '''{{mvar|p}}-adic absolute value''', denoted <math>|r|_p</math> (the absolute value is small when the valuation is large). The division step consists of writing
{{anchor|division_step}}<math display="block">r = a\,p^k + r'</math>
where <math>a</math> is an integer such that <math>0\le a <p,</math> and <math>r'</math> is either zero, or a rational number such that <math>|r'|_p < p^{-k}</math> (that is, <math>v_p(r')>k</math>).
 
The <math>p</math>-''adic expansion'' of <math>r</math> is the [[formal power series]]
<math display="block">r = \sum_{i=k}^\infty a_i p^i</math>
obtained by repeating indefinitely the [[#division_step|above]] division step on successive remainders. In a {{mvar|p}}-adic expansion, all <math>a_i</math> are integers such that <math>0\le a_i <p.</math>
 
If <math>r=p^k \tfrac n 1</math> with <math>n > 0</math>, 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 <math>r</math> in [[base-N|base-{{mvar|p}}]].
 
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, <math>r=p^k \tfrac n d,</math> and <math>d</math> and <math>p</math> are coprime, there exist integers <math>t</math> and <math>u</math> such that <math>t d+u p=1.</math> So
<math display="block">r=p^k \tfrac n d(t d+u p)=p^k n t + p^{k+1}\frac{u n}d.</math>
Then, the [[Euclidean division]] of <math>n t</math> by <math>p</math> gives
<math display="block">n t=q p+a,</math>
with <math>0\le a <p.</math>
This gives the division step as
<math display="block">\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}</math>
so that in the iteration
<math display="block">r' = p^{k+1}\,\frac{q d+u n} d</math>
is the new rational number.
 
The uniqueness of the division step and of the whole {{mvar|p}}-adic expansion is easy: if <math>p^k a_1 + p^{k+1}s_1=p^k a_2 + p^{k+1}s_2,</math> one has <math>a_1-a_2=p(s_2-s_1).</math> This means <math>p</math> divides <math>a_1-a_2.</math> Since <math>0\le a_1 <p</math> and <math>0\le a_2 <p,</math> the following must be true: <math>0\le a_1</math> and <math>a_2<p.</math> Thus, one gets <math>-p < a_1-a_2 < p,</math> and since <math>p</math> divides <math>a_1-a_2</math> it must be that <math>a_1=a_2.</math>
 
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|standard base-{{mvar|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 {{mvar|p}}-adic expansion of a rational number is eventually [[periodic function|periodic]]. [[Converse (logic)|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 {{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 [[mathematical proof|proof]] is similar to that of the similar result for [[repeating decimal]]s.
 
=== Example ===
Let us compute the 5-adic expansion of <math>\tfrac 13.</math> Bézout's identity for 5 and the denominator 3 is <math>2\cdot 3 + (-1)\cdot 5 =1</math> (for larger examples, this can be computed with the [[extended Euclidean algorithm]]). Thus
<math display="block">\frac 13= 2+5(\frac {-1}3).</math>
For the next step, one has to expand <math>-1/3</math> (the factor 5 has to be viewed as a "[[arithmetic shift|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 <math>-1/3</math>, we start from the same Bézout's identity and multiply it by <math>-1</math>, giving
<math display="block">-\frac 13=-2+\frac 53.</math>
The "integer part" <math>-2</math> is not in the right interval. So, one has to use [[Euclidean division]] by <math>5</math> for getting <math>-2= 3-1\cdot 5,</math> giving
<math display="block">-\frac 13=3-5+\frac 53 = 3-\frac {10}3 = 3 +5 (\frac{-2}3),</math>
and the expansion in the first step becomes
<math display="block">\frac 13= 2+5\cdot (3 + 5 \cdot (\frac{-2}3))= 2+3\cdot 5 + \frac {-2}3\cdot 5^2.</math>
 
Similarly, one has
<math display="block">-\frac 23=1-\frac 53,</math>
and
<math display="block">\frac 13=2+3\cdot 5 + 1\cdot 5^2 +\frac {-1}3\cdot 5^3.</math>
 
As the "remainder" <math>-\tfrac 13</math> has already been found, the process can be continued easily, giving coefficients <math>3</math> for [[parity (mathematics)|odd]] powers of five, and <math>1</math> for [[parity (mathematics)|even]] powers.
Or in the standard 5-adic notation
<math display="block">\frac 13= \ldots 1313132_5 </math>
with the [[ellipsis]] <math> \ldots </math> on the left hand side.


=== Positional notation ===
As the metric is defined from a [[discrete valuation]], every [[open ball]] is also [[closed ball|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 {{mvar|v}} is the least integer such that <math>\textstyle p^{-v}< r.</math> Similarly, <math>\textstyle B_r[x] = B_{p^{-w}}(x),</math> where {{mvar|w}} is the greatest integer such that <math>\textstyle p^{-w}>r.</math>
It is possible to use a [[positional notation]] similar to that which is used to represent numbers in [[radix|base]] {{mvar|p}}.


Let <math display = inline>\sum_{i=k}^\infty a_i p^i</math> be a normalized {{mvar|p}}-adic series, i.e. each <math>a_i</math> is an integer in the interval <math>[0,p-1].</math> One can suppose that <math>k\le 0</math> by setting <math>a_i=0</math> for <math>0\le i <k</math> (if <math>k>0</math>), and adding the resulting zero terms to the series.
This implies that the {{mvar|p}}-adic numbers <math>\mathbb Q_p</math> form a [[locally compact space]] ([[locally compact field]]), and the {{mvar|p}}-adic integers <math>\mathbb Z_p</math>—that is, the ball <math>B_1[0]=B_p(0)</math>—form a [[compact space]].<ref>{{Harv|Gouvêa|1997|loc=Corollary 4.2.7}}</ref>


If <math>k\ge 0,</math> the positional notation consists of writing the <math>a_i</math> consecutively, ordered by decreasing values of {{mvar|i}}, often with {{mvar|p}} appearing on the right as an index:
The space of 2-adic integers <math>\mathbb Z_2</math> is [[homeomorphic]] to the [[Cantor set]] <math>\mathcal C</math>.<ref>{{Harv|Robert|2000|loc=Chapter 1 Section 2.3}}</ref><ref>{{Harv|Gouvêa|1997|loc=Theorem 4.4.1}}</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">\ldots a_n \ldots a_1{a_0}_p</math>
<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>
So, the computation of the [[#Example|example above]] shows that
Moreover, for any {{mvar|p}}, <math>\mathbb Z_p</math> is homeomorphic to <math>\mathbb Z_2</math>, and therefore also homeomorphic to the Cantor set.<ref>{{Harv|Gouvêa|1997|loc=Theorem 4.4.2}}</ref>
<math display="block">\frac 13= \ldots 1313132_5,</math>
and
<math display="block">\frac {25}3= \ldots 131313200_5.</math>
When <math>k<0,</math> 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,
<math display="block">\frac 1{15}= \ldots 3131313._52,</math>
and
<math display="block">\frac 1{75}= \ldots 1313131._532.</math>


If a {{mvar|p}}-adic representation is finite on the left (that is, <math>a_i=0</math> for large values of {{mvar|i}}), then it has the value of a nonnegative rational number of the form <math>n p^v,</math> with <math>n,v</math> integers. These rational numbers are exactly the nonnegative rational numbers that have a finite representation in [[radix|base]] {{mvar|p}}. For these rational numbers, the two representations are the same.
The [[Pontryagin dual]] of the group of {{mvar|p}}-adic integers is the [[Prüfer group|Prüfer {{mvar|p}}-group]] <math>\mathbb Z(p^\infty)</math>, and the Pontryagin dual of the Prüfer {{mvar|p}}-group is the group of {{mvar|p}}-adic integers.<ref>{{Harv|Armacost|Armacost|1972}}</ref>


== Modular properties ==
== Modular properties ==
Line 236: Line 287:


[[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 <math display = inline>p^n</math> for large values of {{mvar|n}}. This is commonly used by [[polynomial factorization]] algorithms.
[[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 <math display = inline>p^n</math> 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 [[exponentiation|powers]] of {{mvar|p}} 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 [[carry (arithmetic)|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 <math>\tfrac15</math> is
<math display="block">
\frac15 = 2.01210121\dots_3 \mbox{ or }
\frac1{15} = 20.1210121\dots_3.
</math>
{{mvar|p}}-adic expansions may be written with [[Signed-digit representation|other sets of digits]] instead of {{math|{0,&thinsp;1,&thinsp;...,}}&thinsp;{{math|''p'' − 1}}}. For example, the {{math|3}}-adic expansion of <math>\tfrac15</math> can be written using [[balanced ternary]] digits {{math|{<u>1</u>,&thinsp;0,&thinsp;1}}}, with {{math|<u>1</u>}} 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 {{mvar|p}} integers which are in distinct [[residue class]]es modulo {{mvar|p}} may be used as {{mvar|p}}-adic digits. In number theory, [[Witt vector#Motivation|Teichmüller representatives]] are sometimes used as digits.<ref>{{Harv|Hazewinkel|2009|p=342}}</ref>
'''{{vanchor|Quote notation}}''' is a variant of the {{mvar|p}}-adic representation of [[rational number]]s that was proposed in 1979 by [[Eric Hehner]] and [[Nigel Horspool]] for implementing on computers the (exact) arithmetic with these numbers.<ref>{{Harv|Hehner|Horspool|1979|pp=124–134}}</ref>


== Cardinality ==
== Cardinality ==
Line 258: Line 292:
<math display="block">\Q_p=\bigcup_{i=0}^\infty \frac 1{p^i}\Z_p.</math>
<math display="block">\Q_p=\bigcup_{i=0}^\infty \frac 1{p^i}\Z_p.</math>


== Algebraic closure ==
== Algebraic closure <span class="anchor" id="Complex p-adic number"></span>  ==


<math>\Q_p</math> contains <math>\Q</math> and is a field of [[characteristic (algebra)|characteristic]] {{math|0}}.
<math>\Q_p</math> contains <math>\Q</math> and is a field of [[characteristic (algebra)|characteristic]] {{math|0}}.


{{anchor|not_orderable}}Because {{math|0}} can be written as sum of squares,<ref>According to [[Hensel's lemma#Examples|Hensel's lemma]] <math>\Q_2</math> contains a square root of {{math|−7}}, so that <math>2^2 +1^2+1^2+1^2+\left(\sqrt{-7}\right)^2 = 0 ,</math> and if {{math|''p'' > 2}} then also by Hensel's lemma <math>\Q_p</math> contains a square root of {{math|1 − ''p''}}, thus  
{{anchor|not_orderable}}Because {{math|0}} can be written as sum of squares,<ref group="note">According to [[Hensel's lemma#Examples|Hensel's lemma]] <math>\Q_2</math> contains a square root of {{math|−7}}, so that <math>2^2 +1^2+1^2+1^2+\left(\sqrt{-7}\right)^2 = 0 ,</math> and if {{math|''p'' > 2}} then also by Hensel's lemma <math>\Q_p</math> contains a square root of {{math|1 − ''p''}}, 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#Orderability of fields|ordered field]].
<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#Orderability of fields|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 field|algebraically closed]]. By contrast, the [[algebraic closure]] of <math>\Q_p</math>, denoted <math>\overline{\Q_p},</math> has infinite degree,<ref>{{Harv|Gouvêa|1997|loc=Corollary 5.3.10}}</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 {{mvar|p}}-adic valuation to <math>\overline{\Q_p},</math> the latter is not (metrically) complete.<ref>{{Harv|Gouvêa|1997|loc=Theorem 5.7.4}}</ref><ref name=C149>{{Harv|Cassels|1986|p=149}}</ref> Its (metric) completion is called <math>\C_p</math> or <math>\Omega_p</math>.<ref name=C149/><ref name=K13>{{Harv|Koblitz|1980|p=13}}</ref> Here an end is reached, as <math>\C_p</math> is algebraically closed.<ref name=C149/><ref>{{Harv|Gouvêa|1997|loc=Proposition 5.7.8}}</ref> However unlike <math>\C</math> this field is not [[locally compact]].<ref name=K13/>
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 field|algebraically closed]]. By contrast, the [[algebraic closure]] of <math>\Q_p</math>, denoted <math>\overline{\Q_p},</math> has infinite degree,<ref>{{Harv|Gouvêa|1997|loc=Corollary 5.3.10}}</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 {{mvar|p}}-adic valuation to <math>\overline{\Q_p},</math> the latter is not (metrically) complete.<ref>{{Harv|Gouvêa|1997|loc=Theorem 5.7.4}}</ref><ref name=C149>{{Harv|Cassels|1986|p=149}}</ref>


<math>\C_p</math> and <math>\C</math> are isomorphic as rings,<ref>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 proof|constructive]]).
Its (metric) completion is denoted <math>\C_p</math> or <math>\Omega_p</math>,<ref name=C149/><ref name=K13>{{Harv|Koblitz|1980|p=13}}</ref> and sometimes called the '''complex {{mvar|p}}-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>{{Harv|Gouvêa|1997|loc=Proposition 5.7.8}}</ref> However unlike <math>\C</math> this field is not [[locally compact]].<ref name=K13/>


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 group|solvable]]. Thus, the Galois group <math>\operatorname{Gal} \left(\overline{\Q_p}/ \Q_p \right)</math> is [[prosolvable]].
<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 proof|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 group|solvable]]. Thus, the Galois group <math>{\operatorname{Gal}} \bigl(\,\overline{\Q_p}/ \Q_p \bigr)</math> is [[prosolvable]].


== Multiplicative group ==
== Multiplicative group ==
Line 283: Line 319:
== Rational arithmetic with Hensel lifting ==
== Rational arithmetic with Hensel lifting ==
{{main|Hensel lifting}}
{{main|Hensel lifting}}
== Applications ==
The ''p''-adic numbers have appeared in several fields of mathematics as well as physics.
=== Analysis ===
{{Main|p-adic analysis}}
Similar to the more classical fields of [[real analysis|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 group]]s ([[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 space]]s over ''p''-adic fields show distinctive features; for example aspects relating to [[convex set|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 [[integral|integration]] for ''p''-adic functions.
=== Hodge theory ===
{{Main|p-adic Hodge theory}}
'''''p''-adic Hodge theory''' is a theory that provides a way to classify and study [[Galois representation|''p''-adic Galois representations]] of [[characteristic (algebra)|characteristic 0]] [[local field]]s with residual characteristic ''p'' (such as '''Q'''<sub>''p''</sub>). The theory has its beginnings in [[Jean-Pierre Serre]] and [[John Tate (mathematician)|John Tate]]'s study of [[Tate module]]s of [[abelian variety|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 [[Algebraic variety|varieties]]. [[Jean-Marc Fontaine]] introduced many of the basic concepts of the field.
=== Teichmüller theory ===
{{Main|p-adic Teichmüller theory}}
'''''p''-adic Teichmüller theory''' describes the "uniformization" of ''p''-adic curves and their [[Moduli_spaces|moduli]], generalizing the usual [[Teichmüller theory]] that describes the [[Uniformization theorem|uniformization]] of [[Riemann surfaces]] and their moduli. It was introduced and developed by [[Shinichi Mochizuki]].
=== Quantum physics ===
{{Main|p-adic quantum mechanics}}
'''''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'''.


== Generalizations and related concepts ==
== Generalizations and related concepts ==
Line 297: Line 356:


''p''-adic integers can be extended to [[Solenoid (mathematics)#p-adic solenoids|''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>.
''p''-adic integers can be extended to [[Solenoid (mathematics)#p-adic solenoids|''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 ''p''<sup>k</sup>, the profinite integers generalizes the modulo over ''all'' natural numbers ''n''.


== See also ==
== See also ==
{{div col}}
{{div col}}
* [[Non-Archimedean (disambiguation)|Non-Archimedean]]
* [[Non-Archimedean (disambiguation)|Non-Archimedean]]
* [[p-adic quantum mechanics]]
* [[p-adically closed field]]
* [[p-adic Hodge theory]]
* [[p-adic Teichmuller theory]]
* [[p-adic analysis]]
* [[1 + 2 + 4 + 8 + ⋯]]
* [[1 + 2 + 4 + 8 + ⋯]]
* [[Bijective numeration|''k''-adic notation]]
* [[Bijective numeration|''k''-adic notation]]
* [[C-minimal theory]]
* [[C-minimal theory]]
* [[Mahler's theorem]]
* [[Profinite integer]]
* [[Volkenborn integral]]
* [[Two's complement]]
* [[Two's complement]]
{{div col end}}
{{div col end}}
Line 324: Line 381:
== References ==
== References ==
{{refbegin}}
{{refbegin}}
* {{cite journal |last1=Armacost |first1=D. L. |last2=Armacost |first2=W. L. |title=On ''p''-thetic groups |journal=Pacific Journal of Mathematics |date=1972 |volume=41 |issue=2 |pages=295–301 |url=http://projecteuclid.org/euclid.pjm/1102968274}}
* {{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 |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}}
* {{cite web |last1=Chen |first1=Evan |title=An Infinitely Large Napkin |url=https://venhance.github.io/napkin/Napkin.pdf |access-date=23 July 2025}}
* {{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}}. &mdash; Translation into English by [[John Stillwell]] of ''Theorie der algebraischen Functionen einer Veränderlichen'' (1882).
* {{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}}. &mdash; 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=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}}
Line 333: Line 392:
* {{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|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=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}}
* {{cite web |last1=Koç |first1=Ç. K. |title=A Tutorial on {{mvar|p}}-adic Arithmetic |url=https://cetinkayakoc.net/docs/r09.pdf |access-date=23 July 2025 |location=Electrical & Computer Engineering, Oregon State University |date=2002}}
* {{Citation |last=Robert |first=Alain M. |year=2000 |title=A Course in ''p''-adic Analysis |publisher=Springer |isbn=0-387-98669-3}}
* {{Citation |last=Robert |first=Alain M. |year=2000 |title=A Course in ''p''-adic Analysis |publisher=Springer |isbn=0-387-98669-3}}
{{refend}}
{{refend}}

Latest revision as of 04:49, 4 August 2025

Template:Short description

File:3-adic integers with dual colorings.svg
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 15 in [[Ternary numeral system|base Template:Math]] vs. the Template:Math-adic expansion, 15=0.01210121 (base 3)=030+031+132+233+15=121012102  (3-adic)=+233+132+031+230.

Formally, given a prime number Template:Mvar, a Template:Mvar-adic number can be defined as a series s=i=kaipi=akpk+ak+1pk+1+ak+2pk+2+ where Template:Mvar is an integer (possibly negative), and each ai is an integer such that 0ai<p. A Template:Mvar-adic integer is a Template:Mvar-adic number such that k0.

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]] |s|p=pk, where Template:Mvar is the least integer Template:Mvar such that ai0 (if all ai 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,[1] though, with hindsight, some of Ernst Kummer's earlier work can be interpreted as implicitly using Template:Mvar-adic numbers.[note 1]

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 /p 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 /pe not being a field, which loses a lot of the algebraic properties that /p has.[2]

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 p forms a field, making division by Template:Mvar possible (unlike when working modulo Template:Math). Furthermore, the mapping p is injective, so not much information is lost when reducing to Template:Mvar-adic numbers.[2]

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,

50=12123=133+232+131+230

Informally, Template:Mvar-adic integers can be thought of as integers in base-Template:Mvar, but the digits extend infinitely to the left.[2]

1210121023=+233+132+031+230

Addition and multiplication on Template:Mvar-adic integers can be carried out similarly to integers in base-Template:Mvar.[3]

When adding together two Template:Mvar-adic integers, for example 0121023+1012113, their digits are added with carries being propagated from right to left.

1110121023+1012113

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 p or 𝐙p.

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 15=1210121023. However, some rational numbers, such as 1p, 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

121012.1023=+131+230+131+032+233

Equivalently, every Template:Mvar-adic number is of the form xpk, where Template:Mvar is a Template:Mvar-adic integer.

For any Template:Mvar-adic number Template:Mvar, its multiplicative inverse 1x is also a Template:Mvar-adic number, which can be computed using a variant of long division.[3] For this reason, the Template:Mvar-adic numbers form a field, denoted p or 𝐐p.

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 xe mod pe for each integer e,[2]

x=(x1modp,x2modp2,x3modp3,)

satisfying the compatibility relations xixj(modpi) for i<j. In this notation, addition and multiplication of Template:Mvar-adic integers are defined component-wise:

x+y=(x1+y1modp,x2+y2modp2,x3+y3modp3,) xy=(x1y1modp,x2y2modp2,x3y3modp3,)

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, ...

15=(15mod3,15mod32,15mod33,15mod34,)=(2mod3,2mod32,11mod33,65mod34,)

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 r=i=0aipi=a0+a1p+a2p2+a3p3+ where each ai{0,1,,p1} 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. a00. The set of all Template:Mvar-adic integers is usually denoted p.[4]

A Template:Mvar-adic number is then defined as a formal Laurent series of the form r=i=vaipi=avpv+av+1pv+1+av+2pv+2+av+3pv+3+ where Template:Mvar is a (possibly negative) integer, and each ai{0,1,,p1}.[5] Equivalently, a Template:Mvar-adic number is anything of the form xpk, where Template:Mvar is a Template:Mvar-adic integer.

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

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.[6] As an example in 3,

111230+031+132+233+134++130+131+232+133+034+

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".[5]

With these operations, the set of Template:Mvar-adic numbers form a field, denoted p.

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 r=pvmn, 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 vp(r). 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 i=vripi, where v is a (possibly negative) integer and the ri are rational numbers that either are zero or have a nonnegative valuation (that is, the denominator of ri 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 pkmn, with Template:Mvar and Template:Mvar both coprime with Template:Mvar.

Two Template:Mvar-adic series i=vripi and i=wsipi are equivalent if there is an integer Template:Mvar such that, for every integer n>N, the rational number i=vnripii=wnsipi is zero or has a Template:Mvar-adic valuation greater than Template:Mvar.

A Template:Mvar-adic series i=vaipi is normalized if either all ai are integers such that 0ai<p, and av>0, or all ai 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 ST, one has S±UT±U,SUTU,1/S1/T.

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 i=vripi, we wish to arrive at an equivalent series such that the Template:Mvar-adic valuation of rv is zero. For that, one considers the first nonzero ri. 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 ri is j>0, and ri=pjsi where the valuation of si is zero; so, one gets an equivalent series by changing ri to Template:Math and ri+j to ri+j+si. 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 rv is zero.

Then, if the series is not normalized, consider the first nonzero ri that is not an integer in the interval [0,p1]. Using Bézout's lemma, write this as ri=ai+psi, where ai[0,p1] and si has nonnegative valuation. Then, one gets an equivalent series by replacing ri with ai, and adding si to ri+1. 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.

Script error: No such module "anchor". With these operations, Template:Mvar-adic numbers form a field called the field of Template:Math-adic numbers and denoted p or 𝐐p. 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 vp(x), is the exponent of Template:Mvar in the first nonzero term of every Template:Mvar-adic series that represents Template:Mvar. By convention, vp(0)=; that is, the valuation of zero is . This valuation is a discrete valuation. The restriction of this valuation to the rational numbers is the Template:Mvar-adic valuation of , that is, the exponent Template:Mvar in the factorization of a rational number as ndpv, 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 15, for example, is written as 15=1210121023.

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 15 is 15=2.012101213 or 115=20.12101213.

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 15 can be written using balanced ternary digits Template:Math}, with Template:Math representing negative one, as 15=1_1111_1111_111_3.

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.[7]

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.[8] 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. 15=121023

p-adic expansion of rational numbers

The decimal expansion of a positive rational number r is its representation as a series r=i=kai10i, where k is an integer and each ai is also an integer such that 0ai<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=nd is a rational number such that 0r<1, there is an integer a such that 0a<10, and 10r=a+r, with 0r<1. 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 Template:Mvar-adic expansion of a rational number can be computed similarly, but with a different division step. Suppose that r=nd is a rational number with nonnegative valuation (that is, Template:Mvar is not divisible by Template:Mvar). The division step consists of writing Script error: No such module "anchor".r=a+pr where a is an integer such that 0a<p, and r has nonnegative valuation.

The integer Template:Mvar can be computed as a modular multiplicative inverse: a=nd1modp. 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 i=kaipi, with 0ai<p 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 13. We can write this number as 13=2+513. Thus we use a=2 for the first step. 13=2+51(13) For the next step, we can write the "remainder" 13 as 13=3+523. Thus we use a=3. 13=2+351+52(23) We can write the "remainder" 23 as 23=1+513. Thus we use a=1. 13=2+351+152+53(13) Notice that we obtain the "remainder" 13 again, which means the digits can only repeat from this point on. 13=2+351+152+353+154+355+156+ In the standard 5-adic notation, we can write this as 13=13131325 with the ellipsis on the left hand side.

p-adic integers

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

A p-adic integer can be represented as a sequence x=(x1modp,x2modp2,x3modp3,) of residues xe mod pe for each integer e, satisfying the compatibility relations xixj(modpi) for i<j.

Every integer is a p-adic integer (including zero, since 0<). The rational numbers of the form ndpk with d coprime with p and k0 are also p-adic integers (for the reason that d has an inverse mod pe for every e).

The Template:Mvar-adic integers form a commutative ring, denoted p or 𝐙p, 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

File:3-adic integers.png
Visual depiction of the 3-adic integers 3 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 |x|p=pvp(x), where vp(x) is the Template:Mvar-adic valuation of Template:Mvar. The Template:Mvar-adic absolute value of 0 is |0|p=0. This is an absolute value that satisfies the strong triangle inequality since, for every Template:Mvar and Template:Mvar:

  • |x|p=0 if and only if x=0;
  • |x|p|y|p=|xy|p;
  • |x+y|pmax(|x|p,|y|p)|x|p+|y|p.

Moreover, if |x|p|y|p, then |x+y|p=max(|x|p,|y|p).

This makes the Template:Mvar-adic numbers a metric space, and even an ultrametric space, with the Template:Mvar-adic distance defined by dp(x,y)=|xy|p.

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 Br(x)={ydp(x,y)<r} equals the closed ball Bpv[x]={ydp(x,y)pv}, where Template:Mvar is the least integer such that pv<r. Similarly, Br[x]=Bpw(x), where Template:Mvar is the greatest integer such that pw>r.

This implies that the Template:Mvar-adic numbers p form a locally compact space (locally compact field), and the Template:Mvar-adic integers p—that is, the ball B1[0]=Bp(0)—form a compact space.[9]

The space of 2-adic integers 2 is homeomorphic to the Cantor set 𝒞.[10][11] This can be seen by considering the continuous 1-to-1 mapping ψ:2𝒞 defined by ψ:a0+a12+a222+a323+2a03+2a132+2a233+2a334+ Moreover, for any Template:Mvar, p is homeomorphic to 2, and therefore also homeomorphic to the Cantor set.[12]

The Pontryagin dual of the group of Template:Mvar-adic integers is the [[Prüfer group|Prüfer Template:Mvar-group]] (p), and the Pontryagin dual of the Prüfer Template:Mvar-group is the group of Template:Mvar-adic integers.[13]

Modular properties

The quotient ring p/pnp may be identified with the ring /pn of the integers modulo pn. This can be shown by remarking that every Template:Mvar-adic integer, represented by its normalized Template:Mvar-adic series, is congruent modulo pn with its partial sum i=0n1aipi, whose value is an integer in the interval [0,pn1]. A straightforward verification shows that this defines a ring isomorphism from p/pnp to /pn.

The inverse limit of the rings p/pnp is defined as the ring formed by the sequences a0,a1, such that ai/pi and aiai+1(modpi) 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 p to the inverse limit of the p/pnp. 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 pn2 from the inverse modulo pn.

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 p/pnp. Applying Newton's method to find the square root requires pn 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 pn for large values of Template:Mvar. This is commonly used by polynomial factorization algorithms.

Cardinality

Both p and p are uncountable and have the cardinality of the continuum.[14] For p, this results from the Template:Mvar-adic representation, which defines a bijection of p on the power set {0,,p1}. For p this results from its expression as a countably infinite union of copies of p: p=i=01pip.

Algebraic closure

p contains and is a field of characteristic Template:Math.

Script error: No such module "anchor".Because Template:Math can be written as sum of squares,[note 2] p cannot be turned into an ordered field.

The field of real numbers has only a single proper algebraic extension: the complex numbers . In other words, this quadratic extension is already algebraically closed. By contrast, the algebraic closure of p, denoted p, has infinite degree,[15] that is, p 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 p, the latter is not (metrically) complete.[16][17]

Its (metric) completion is denoted p or Ωp,[17][18] and sometimes called the complex Template:Mvar-adic numbers by analogy to the complex numbers. Here an end is reached, as p is algebraically closed.[17][19] However unlike this field is not locally compact.[18]

p and are isomorphic as rings,[note 3] so we may regard p as 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 p, the Galois group Gal(K/p) is solvable. Thus, the Galois group Gal(p/p) is prosolvable.

Multiplicative group

p contains the Template:Mvar-th cyclotomic field (Template:Math) if and only if Template:Math.[20] For instance, the Template:Mvar-th cyclotomic field is a subfield of 13 if and only if Template:Math, or Template:Math. In particular, there is no multiplicative Template:Mvar-torsion in p if Template:Math. Also, Template:Math is the only non-trivial torsion element in 2.

Given a natural number Template:Mvar, the index of the multiplicative group of the Template:Mvar-th powers of the non-zero elements of p in p× 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 epp for p2. For Template:Math one must take at least the fourth power.[21] (Thus a number with similar properties as Template:Mvar — namely a Template:Mvar-th root of Template:Math — is a member of p 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

Script error: No such module "Labelled list hatnote".

Applications

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

Analysis

Script error: No such module "Labelled list hatnote". 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

Script error: No such module "Labelled list hatnote". 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

Script error: No such module "Labelled list hatnote". 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

Script error: No such module "Labelled list hatnote". 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.

Generalizations and related concepts

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 |x|P=cordP(x). 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 𝕋p. There is a map from 𝕋p to the circle group whose fibers are the p-adic integers p, in analogy to how there is a map from to the circle whose fibers are .

The p-adic integers can also be extended to profinite integers ^, which can be understood as the direct product of rings ^=pp. 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

  • Script error: No such module "Citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".. — Translation into English by John Stillwell of Theorie der algebraischen Functionen einer Veränderlichen (1882).
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".

Template:Refend

Further reading

Template:Refbegin

  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".

Template:Refend

External links

Template:Sister project

Template:Number systems Template:Authority control

  1. Script error: No such module "Footnotes".
  2. a b c d Script error: No such module "Footnotes".
  3. a b Script error: No such module "Footnotes".
  4. Script error: No such module "Footnotes".
  5. a b Script error: No such module "Footnotes".
  6. Script error: No such module "Footnotes".
  7. Script error: No such module "Footnotes".
  8. Script error: No such module "Footnotes".
  9. Script error: No such module "Footnotes".
  10. Script error: No such module "Footnotes".
  11. Script error: No such module "Footnotes".
  12. Script error: No such module "Footnotes".
  13. Script error: No such module "Footnotes".
  14. Script error: No such module "Footnotes".
  15. Script error: No such module "Footnotes".
  16. Script error: No such module "Footnotes".
  17. a b c Script error: No such module "Footnotes".
  18. a b Script error: No such module "Footnotes".
  19. Script error: No such module "Footnotes".
  20. Script error: No such module "Footnotes".
  21. Script error: No such module "Footnotes".


Cite error: <ref> tags exist for a group named "note", but no corresponding <references group="note"/> tag was found