HOME

TheInfoList



OR:

In
number theory Number theory is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. Number theorists study prime numbers as well as the properties of mathematical objects constructed from integers (for example ...
, given a
prime number A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime ...
, the -adic numbers form an extension of the
rational number In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (for example, The set of all ...
s which is distinct from the
real number In mathematics, a real number is a number that can be used to measure a continuous one- dimensional quantity such as a duration or temperature. Here, ''continuous'' means that pairs of values can have arbitrarily small differences. Every re ...
s, though with some similar properties; -adic numbers can be written in a form similar to (possibly infinite)
decimal The decimal numeral system (also called the base-ten positional numeral system and denary or decanary) is the standard system for denoting integer and non-integer numbers. It is the extension to non-integer numbers (''decimal fractions'') of th ...
s, but with digits based on a prime number rather than ten, and extending to the left rather than to the right. For example, comparing the expansion of the rational number \tfrac15 in base vs. the -adic expansion, \begin \tfrac15 &= 0.01210121\ldots \ (\text 3) &&= 0\cdot 3^0 + 0\cdot 3^ + 1\cdot 3^ + 2\cdot 3^ + \cdots \\ mu\tfrac15 &= \dots 121012102 \ \ (\text) &&= \cdots + 2\cdot 3^3 + 1 \cdot 3^2 + 0\cdot3^1 + 2 \cdot 3^0. \end Formally, given a prime number , a -adic number can be defined as a series s=\sum_^\infty a_i p^i = a_k p^k + a_ p^ + a_ p^ + \cdots where is an
integer An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative in ...
(possibly negative), and each a_i is an integer such that 0\le a_i < p. A -adic integer is a -adic number such that k\ge 0. In general the series that represents a -adic number is not convergent in the usual sense, but it is convergent for the -adic absolute value , s, _p=p^, where is the least integer such that a_i\ne 0 (if all a_i are zero, one has the zero -adic number, which has as its -adic absolute value). Every rational number can be uniquely expressed as the sum of a series as above, with respect to the -adic absolute value. This allows considering rational numbers as special -adic numbers, and alternatively defining the -adic numbers as the completion of the rational numbers for the -adic absolute value, exactly as the real numbers are the completion of the rational numbers for the usual absolute value. -adic numbers were first described by Kurt Hensel in 1897, though, with hindsight, some of Ernst Kummer's earlier work can be interpreted as implicitly using -adic numbers.Translator's introduction
page 35
"Indeed, with hindsight it becomes apparent that a discrete valuation is behind Kummer's concept of ideal numbers."


Motivation

Roughly speaking,
modular arithmetic In mathematics, modular arithmetic is a system of arithmetic operations for integers, other than the usual ones from elementary arithmetic, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to mo ...
modulo a positive integer consists of "approximating" every integer by the remainder of its division by , called its ''residue modulo'' . The main property of modular arithmetic is that the residue modulo 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 . If one knows that the absolute value of the result is less than , this allows a computation of the result which does not involve any integer larger than . 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 In mathematics, the Chinese remainder theorem states that if one knows the remainders of the Euclidean division of an integer ''n'' by several integers, then one can determine uniquely the remainder of the division of ''n'' by the product of thes ...
for recovering the result modulo the product of the moduli. Another method discovered by Kurt Hensel consists of using a prime modulus , and applying
Hensel's lemma In mathematics, Hensel's lemma, also known as Hensel's lifting lemma, named after Kurt Hensel, is a result in modular arithmetic, stating that if a univariate polynomial has a simple root modulo a prime number , then this root can be ''lifted'' to ...
for recovering iteratively the result modulo p^2, p^3, \ldots, p^n, \ldots If the process is continued infinitely, this provides eventually a result which is a -adic number.


Basic lemmas

The theory of -adic numbers is fundamentally based on the two following lemmas: ''Every nonzero rational number can be written p^v\frac, where , , and are integers and neither nor is divisible by .'' The exponent is uniquely determined by the rational number and is called its ''-adic valuation'' (this definition is a particular case of a more general definition, given below). The proof of the lemma results directly from the fundamental theorem of arithmetic. ''Every nonzero rational number of valuation can be uniquely written r=ap^v+ s, where is a rational number of valuation greater than , and is an integer such that 0'' The proof of this lemma results from
modular arithmetic In mathematics, modular arithmetic is a system of arithmetic operations for integers, other than the usual ones from elementary arithmetic, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to mo ...
: By the above lemma, r=p^v\frac, where and are integers
coprime In number theory, two integers and are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1. Consequently, any prime number that divides does not divide , and vice versa. This is equiv ...
with . By Bézout's lemma, there exist integers and , with 0\leq a < p, such that m = a n + b p. Setting s = b/n (hence (s) \geq 0), we have = a + p ,\quad \quad r = a p^v + p^ s. To show the uniqueness of this representation, observe that if r = a' p^v + p^ s', with 0\leq a' < p and (s')\geq 0, there holds by difference (a -a') + p(s- s') = 0, with , a - a', < p and (s-s') \geq 0. Write s-s' = c/d, where is coprime to ; then (a - a')d + p c = 0, which is possible only if a - a' = 0 and c=0. Hence a = a' and s = s'. The above process can be iterated starting from instead of , giving the following. ''Given a nonzero rational number of valuation and a positive integer , there are a rational number s_k of nonnegative valuation and uniquely defined nonnegative integers a_0, \ldots, a_ less than such that a_0>0 and'' r=a_0p^v + a_1 p^ +\cdots + a_p^ +p^s_k. The -adic numbers are essentially obtained by continuing this infinitely to produce an infinite series.


''p''-adic series

The -adic numbers are commonly defined by means of -adic series. A ''-adic series'' is a
formal power series In mathematics, a formal series is an infinite sum that is considered independently from any notion of convergence, and can be manipulated with the usual algebraic operations on series (addition, subtraction, multiplication, division, partial su ...
of the form \sum_^\infty r_i p^, where v is an integer and the r_i are rational numbers that either are zero or have a nonnegative valuation (that is, the denominator of r_i is not divisible by ). Every rational number may be viewed as a -adic series with a single nonzero term, consisting of its factorization of the form p^k\tfrac nd, with and both coprime with . Two -adic series \sum_^\infty r_i p^ and \sum_^\infty s_i p^ are ''equivalent'' if there is an integer such that, for every integer n>N, the rational number \sum_^n r_i p^ - \sum_^n s_i p^ is zero or has a -adic valuation greater than . A -adic series \sum_^\infty a_i p^ is ''normalized'' if either all a_i are integers such that 0\le a_i and a_v >0, or all a_i are zero. In the latter case, the series is called the ''zero series''. Every -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 -adic series, below. In other words, the equivalence of -adic series is an equivalence relation, and each equivalence class contains exactly one normalized -adic series. The usual operations of series (addition, subtraction, multiplication, division) are compatible with equivalence of -adic series. That is, denoting the equivalence with , if , and are nonzero -adic series such that S\sim T, one has \begin S\pm U&\sim T\pm U,\\ SU&\sim TU,\\ 1/S&\sim 1/T. \end The -adic numbers are often defined as the equivalence classes of -adic series, in a similar way as the definition of the real numbers as equivalence classes of Cauchy sequences. The uniqueness property of normalization, allows uniquely representing any -adic number by the corresponding normalized -adic series. The compatibility of the series equivalence leads almost immediately to basic properties of -adic numbers: * ''Addition'', ''multiplication'' and
multiplicative inverse In mathematics, a multiplicative inverse or reciprocal for a number ''x'', denoted by 1/''x'' or ''x''−1, is a number which when Multiplication, multiplied by ''x'' yields the multiplicative identity, 1. The multiplicative inverse of a ra ...
of -adic numbers are defined as for
formal power series In mathematics, a formal series is an infinite sum that is considered independently from any notion of convergence, and can be manipulated with the usual algebraic operations on series (addition, subtraction, multiplication, division, partial su ...
, followed by the normalization of the result. * With these operations, the -adic numbers form a field, which is an extension field of the rational numbers. * The ''valuation'' of a nonzero -adic number , commonly denoted v_p(x) is the exponent of in the first non zero term of the corresponding normalized series; the valuation of zero is v_p(0)=+\infty * The ''-adic absolute value'' of a nonzero -adic number , is , x, _p=p^; for the zero -adic number, one has , 0, _p=0.


Normalization of a ''p''-adic series

Starting with the series \sum_^\infty r_i p^, the first above lemma allows getting an equivalent series such that the -adic valuation of r_v is zero. For that, one considers the first nonzero r_i. If its -adic valuation is zero, it suffices to change into , that is to start the summation from . Otherwise, the -adic valuation of r_i is j>0, and r_i= p^js_i where the valuation of s_i is zero; so, one gets an equivalent series by changing r_i to and r_ to r_ + s_i. Iterating this process, one gets eventually, possibly after infinitely many steps, an equivalent series that either is the zero series or is a series such that the valuation of r_v is zero. Then, if the series is not normalized, consider the first nonzero r_i that is not an integer in the interval ,p-1 The second above lemma allows writing it r_i=a_i+ps_i; one gets n equivalent series by replacing r_i with a_i, and adding s_i to r_. Iterating this process, possibly infinitely many times, provides eventually the desired normalized -adic series.


Definition

There are several equivalent definitions of -adic numbers. The one that is given here is relatively elementary, since it does not involve any other mathematical concepts than those introduced in the preceding sections. Other equivalent definitions use completion of a discrete valuation ring (see ), completion of a metric space (see ), or inverse limits (see ). A -adic number can be defined as a ''normalized -adic series''. Since there are other equivalent definitions that are commonly used, one says often that a normalized -adic series ''represents'' a -adic number, instead of saying that it ''is'' a -adic number. One can say also that any -adic series represents a -adic number, since every -adic series is equivalent to a unique normalized -adic series. This is useful for defining operations (addition, subtraction, multiplication, division) of -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 -adic numbers, since the series operations are compatible with equivalence of -adic series. With these operations, -adic numbers form a field called the field of -adic numbers and denoted \Q_p or \mathbf Q_p. There is a unique field homomorphism from the rational numbers into the -adic numbers, which maps a rational number to its -adic expansion. The
image An image or picture is a visual representation. An image can be Two-dimensional space, two-dimensional, such as a drawing, painting, or photograph, or Three-dimensional space, three-dimensional, such as a carving or sculpture. Images may be di ...
of this homomorphism is commonly identified with the field of rational numbers. This allows considering the -adic numbers as an extension field of the rational numbers, and the rational numbers as a subfield of the -adic numbers. The ''valuation'' of a nonzero -adic number , commonly denoted v_p(x), is the exponent of in the first nonzero term of every -adic series that represents . By convention, v_p(0)=\infty; that is, the valuation of zero is \infty. This valuation is a discrete valuation. The restriction of this valuation to the rational numbers is the -adic valuation of \Q, that is, the exponent in the factorization of a rational number as \tfrac nd p^v, with both and
coprime In number theory, two integers and are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1. Consequently, any prime number that divides does not divide , and vice versa. This is equiv ...
with .


''p''-adic integers

The -adic integers are the -adic numbers with a nonnegative valuation. A p-adic integer can be represented as a sequence x = (x_1 \operatorname p, ~ x_2 \operatorname p^2, ~ x_3 \operatorname p^3, ~ \ldots) of residues x_e mod p^e for each integer e, satisfying the compatibility relations x_i \equiv x_j ~ (\operatorname p^i) for i < j. Every
integer An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative in ...
is a p-adic integer (including zero, since 0<\infty). The rational numbers of the form \tfrac nd p^k with d coprime with p and k\ge 0 are also p-adic integers (for the reason that d has an inverse mod p^e for every e). The -adic integers form a
commutative ring In mathematics, a commutative ring is a Ring (mathematics), ring in which the multiplication operation is commutative. The study of commutative rings is called commutative algebra. Complementarily, noncommutative algebra is the study of ring prope ...
, denoted \Z_p or \mathbf Z_p, that has the following properties. * It is an
integral domain In mathematics, an integral domain is a nonzero commutative ring in which the product of any two nonzero elements is nonzero. Integral domains are generalizations of the ring of integers and provide a natural setting for studying divisibilit ...
, since it is a subring of a field, or since the first term of the series representation of the product of two non zero -adic series is the product of their first terms. * The units (invertible elements) of \Z_p are the -adic numbers of valuation zero. * It is a
principal ideal domain In mathematics, a principal ideal domain, or PID, is an integral domain (that is, a non-zero commutative ring without nonzero zero divisors) in which every ideal is principal (that is, is formed by the multiples of a single element). Some author ...
, such that each ideal is generated by a power of . * It is a
local ring In mathematics, more specifically in ring theory, local rings are certain rings that are comparatively simple, and serve to describe what is called "local behaviour", in the sense of functions defined on algebraic varieties or manifolds, or of ...
of
Krull dimension In commutative algebra, the Krull dimension of a commutative ring ''R'', named after Wolfgang Krull, is the supremum of the lengths of all chains of prime ideals. The Krull dimension need not be finite even for a Noetherian ring. More generally ...
one, since its only prime ideals are the zero ideal and the ideal generated by , the unique
maximal ideal In mathematics, more specifically in ring theory, a maximal ideal is an ideal that is maximal (with respect to set inclusion) amongst all ''proper'' ideals. In other words, ''I'' is a maximal ideal of a ring ''R'' if there are no other ideals ...
. * It is a discrete valuation ring, since this results from the preceding properties. * It is the completion of the local ring \Z_ = \, which is the localization of \Z at the prime ideal p\Z. The last property provides a definition of the -adic numbers that is equivalent to the above one: the field of the -adic numbers is the
field of fractions In abstract algebra, the field of fractions of an integral domain is the smallest field in which it can be embedded. The construction of the field of fractions is modeled on the relationship between the integral domain of integers and the fie ...
of the completion of the localization of the integers at the prime ideal generated by .


Topological properties

The -adic valuation allows defining an
absolute value In mathematics, the absolute value or modulus of a real number x, is the non-negative value without regard to its sign. Namely, , x, =x if x is a positive number, and , x, =-x if x is negative (in which case negating x makes -x positive), ...
on -adic numbers: the -adic absolute value of a nonzero -adic number is , x, _p = p^, where v_p(x) is the -adic valuation of . The -adic absolute value of 0 is , 0, _p = 0. This is an absolute value that satisfies the strong triangle inequality since, for every and one has * , x, _p = 0 if and only if x=0; * , x, _p\cdot , y, _p = , xy, _p * , x+y, _p\le \max(, x, _p,, y, _p) \le , x, _p + , y, _p. Moreover, if , x, _p \ne , y, _p, one has , x+y, _p = \max(, x, _p,, y, _p). This makes the -adic numbers a
metric space In mathematics, a metric space is a Set (mathematics), set together with a notion of ''distance'' between its Element (mathematics), elements, usually called point (geometry), points. The distance is measured by a function (mathematics), functi ...
, and even an
ultrametric space In mathematics, an ultrametric space is a metric space in which the triangle inequality is strengthened to d(x,z)\leq\max\left\ for all x, y, and z. Sometimes the associated metric is also called a non-Archimedean metric or super-metric. Formal d ...
, with the -adic distance defined by d_p(x,y)=, x-y, _p. As a metric space, the -adic numbers form the completion of the rational numbers equipped with the -adic absolute value. This provides another way for defining the -adic numbers. However, the general construction of a completion can be simplified in this case, because the metric is defined by a discrete valuation (in short, one can extract from every Cauchy sequence a subsequence such that the differences between two consecutive terms have strictly decreasing absolute values; such a subsequence is the sequence of the partial sums of a -adic series, and thus a unique normalized -adic series can be associated to every equivalence class of Cauchy sequences; so, for building the completion, it suffices to consider normalized -adic series instead of equivalence classes of Cauchy sequences). As the metric is defined from a discrete valuation, every open ball is also closed. More precisely, the open ball B_r(x) =\ equals the closed ball B_ =\, where is the least integer such that p^< r. Similarly, B_r = B_(x), where is the greatest integer such that p^>r. This implies that the -adic numbers form a
locally compact space In topology and related branches of mathematics, a topological space is called locally compact if, roughly speaking, each small portion of the space looks like a small portion of a compact space. More precisely, it is a topological space in which ...
( locally compact field), and the -adic integers—that is, the ball B_1 B_p(0)—form a
compact space In mathematics, specifically general topology, compactness is a property that seeks to generalize the notion of a closed and bounded subset of Euclidean space. The idea is that a compact space has no "punctures" or "missing endpoints", i.e., i ...
.


''p''-adic expansion of rational numbers

The
decimal expansion A decimal representation of a non-negative real number is its expression as a sequence of symbols consisting of decimal digits traditionally written with a single separator: r = b_k b_\cdots b_0.a_1a_2\cdots Here is the decimal separator ...
of a positive
rational number In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (for example, The set of all ...
r is its representation as a series r = \sum_^\infty a_i 10^, where k is an integer and each a_i is also an
integer An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative in ...
such that 0\le a_i <10. This expansion can be computed by long division of the numerator by the denominator, which is itself based on the following theorem: If r=\tfrac n d is a rational number such that 10^k\le r <10^, there is an integer a such that 0< a <10, and r = a\,10^k +r', with r'<10^k. The decimal expansion is obtained by repeatedly applying this result to the remainder r' which in the iteration assumes the role of the original rational number r. The -''adic expansion'' of a rational number is defined similarly, but with a different division step. More precisely, given a fixed
prime number A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime ...
p, every nonzero rational number r can be uniquely written as r=p^k\tfrac n d, where k is a (possibly negative) integer, n and d are coprime integers both coprime with p, and d is positive. The integer k is the -adic valuation of r, denoted v_p(r), and p^ is its -adic absolute value, denoted , r, _p (the absolute value is small when the valuation is large). The division step consists of writing r = a\,p^k + r' where a is an integer such that 0\le a and r' is either zero, or a rational number such that , r', _p < p^ (that is, v_p(r')>k). The p-''adic expansion'' of r is the
formal power series In mathematics, a formal series is an infinite sum that is considered independently from any notion of convergence, and can be manipulated with the usual algebraic operations on series (addition, subtraction, multiplication, division, partial su ...
r = \sum_^\infty a_i p^i obtained by repeating indefinitely the above division step on successive remainders. In a -adic expansion, all a_i are integers such that 0\le a_i If r=p^k \tfrac n 1 with n > 0, the process stops eventually with a zero remainder; in this case, the series is completed by trailing terms with a zero coefficient, and is the representation of r in base-. The existence and the computation of the -adic expansion of a rational number results from
Bézout's identity In mathematics, Bézout's identity (also called Bézout's lemma), named after Étienne Bézout who proved it for polynomials, is the following theorem: Here the greatest common divisor of and is taken to be . The integers and are called B� ...
in the following way. If, as above, r=p^k \tfrac n d, and d and p are coprime, there exist integers t and u such that t d+u p=1. So r=p^k \tfrac n d(t d+u p)=p^k n t + p^\fracd. Then, the Euclidean division of n t by p gives n t=q p+a, with 0\le a This gives the division step as \begin r & = & p^k(q p+a) + p^\frac d \\ & = & a p^k +p^\,\frac d, \\ \end so that in the iteration r' = p^\,\frac d is the new rational number. The uniqueness of the division step and of the whole -adic expansion is easy: if p^k a_1 + p^s_1=p^k a_2 + p^s_2, one has a_1-a_2=p(s_2-s_1). This means p divides a_1-a_2. Since 0\le a_1 and 0\le a_2 the following must be true: 0\le a_1 and a_2 Thus, one gets -p < a_1-a_2 < p, and since p divides a_1-a_2 it must be that a_1=a_2. The -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 -adic absolute value. In the standard -adic notation, the digits are written in the same order as in a standard base- 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 -adic expansion of a rational number is eventually periodic. Conversely, a series \sum_^\infty a_i p^i, with 0\le a_i converges (for the -adic absolute value) to a rational number
if and only if In logic and related fields such as mathematics and philosophy, "if and only if" (often shortened as "iff") is paraphrased by the biconditional, a logical connective between statements. The biconditional is true in two cases, where either bo ...
it is eventually periodic; in this case, the series is the -adic expansion of that rational number. The proof is similar to that of the similar result for
repeating decimal A repeating decimal or recurring decimal is a decimal representation of a number whose digits are eventually periodic (that is, after some place, the same sequence of digits is repeated forever); if this sequence consists only of zeros (that i ...
s.


Example

Let us compute the 5-adic expansion of \tfrac 13. Bézout's identity for 5 and the denominator 3 is 2\cdot 3 + (-1)\cdot 5 =1 (for larger examples, this can be computed with the extended Euclidean algorithm). Thus \frac 13= 2+5(\frac 3). For the next step, one has to expand -1/3 (the factor 5 has to be viewed as a " shift" of the -adic valuation, similar to the basis of any number expansion, and thus it should not be itself expanded). To expand -1/3, we start from the same Bézout's identity and multiply it by -1, giving -\frac 13=-2+\frac 53. The "integer part" -2 is not in the right interval. So, one has to use Euclidean division by 5 for getting -2= 3-1\cdot 5, giving -\frac 13=3-5+\frac 53 = 3-\frac 3 = 3 +5 (\frac3), and the expansion in the first step becomes \frac 13= 2+5\cdot (3 + 5 \cdot (\frac3))= 2+3\cdot 5 + \frac 3\cdot 5^2. Similarly, one has -\frac 23=1-\frac 53, and \frac 13=2+3\cdot 5 + 1\cdot 5^2 +\frac 3\cdot 5^3. As the "remainder" -\tfrac 13 has already been found, the process can be continued easily, giving coefficients 3 for odd powers of five, and 1 for even powers. Or in the standard 5-adic notation \frac 13= \ldots 1313132_5 with the
ellipsis The ellipsis (, plural ellipses; from , , ), rendered , alternatively described as suspension points/dots, points/periods of ellipsis, or ellipsis points, or colloquially, dot-dot-dot,. According to Toner it is difficult to establish when t ...
\ldots on the left hand side.


Positional notation

It is possible to use a
positional notation Positional notation, also known as place-value notation, positional numeral system, or simply place value, usually denotes the extension to any radix, base of the Hindu–Arabic numeral system (or decimal, decimal system). More generally, a posit ...
similar to that which is used to represent numbers in base . Let \sum_^\infty a_i p^i be a normalized -adic series, i.e. each a_i is an integer in the interval ,p-1 One can suppose that k\le 0 by setting a_i=0 for 0\le i (if k>0), and adding the resulting zero terms to the series. If k\ge 0, the positional notation consists of writing the a_i consecutively, ordered by decreasing values of , often with appearing on the right as an index: \ldots a_n \ldots a_1_p So, the computation of the example above shows that \frac 13= \ldots 1313132_5, and \frac 3= \ldots 131313200_5. When k<0, a separating dot is added before the digits with negative index, and, if the index is present, it appears just after the separating dot. For example, \frac 1= \ldots 3131313._52, and \frac 1= \ldots 1313131._532. If a -adic representation is finite on the left (that is, a_i=0 for large values of ), then it has the value of a nonnegative rational number of the form n p^v, with n,v integers. These rational numbers are exactly the nonnegative rational numbers that have a finite representation in base . For these rational numbers, the two representations are the same.


Modular properties

The
quotient ring In ring theory, a branch of abstract algebra, a quotient ring, also known as factor ring, difference ring or residue class ring, is a construction quite similar to the quotient group in group theory and to the quotient space in linear algebra. ...
\Z_p/p^n\Z_p may be identified with the ring \Z/p^n\Z of the integers
modulo In computing and mathematics, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another, the latter being called the '' modulus'' of the operation. Given two positive numbers and , mo ...
p^n. This can be shown by remarking that every -adic integer, represented by its normalized -adic series, is congruent modulo p^n with its partial sum \sum_^a_ip^i, whose value is an integer in the interval ,p^n-1 A straightforward verification shows that this defines a ring isomorphism from \Z_p/p^n\Z_p to \Z/p^n\Z. The inverse limit of the rings \Z_p/p^n\Z_p is defined as the ring formed by the sequences a_0, a_1, \ldots such that a_i \in \Z/p^i \Z and a_i \equiv a_ \pmod for every . The mapping that maps a normalized -adic series to the sequence of its partial sums is a ring isomorphism from \Z_p to the inverse limit of the \Z_p/p^n\Z_p. This provides another way for defining -adic integers (
up to Two Mathematical object, mathematical objects and are called "equal up to an equivalence relation " * if and are related by , that is, * if holds, that is, * if the equivalence classes of and with respect to are equal. This figure of speech ...
an isomorphism). This definition of -adic integers is specially useful for practical computations, as allowing building -adic integers by successive approximations. For example, for computing the -adic (multiplicative) inverse of an integer, one can use
Newton's method In numerical analysis, the Newton–Raphson method, also known simply as Newton's method, named after Isaac Newton and Joseph Raphson, is a root-finding algorithm which produces successively better approximations to the roots (or zeroes) of a ...
, starting from the inverse modulo ; then, each Newton step computes the inverse modulo p^ from the inverse modulo p^n. The same method can be used for computing the -adic
square root In mathematics, a square root of a number is a number such that y^2 = x; in other words, a number whose ''square'' (the result of multiplying the number by itself, or y \cdot y) is . For example, 4 and −4 are square roots of 16 because 4 ...
of an integer that is a
quadratic residue In number theory, an integer ''q'' is a quadratic residue modulo operation, modulo ''n'' if it is Congruence relation, congruent to a Square number, perfect square modulo ''n''; that is, if there exists an integer ''x'' such that :x^2\equiv q \pm ...
modulo . This seems to be the fastest known method for testing whether a large integer is a square: it suffices to test whether the given integer is the square of the value found in \Z_p/p^n\Z_p. Applying Newton's method to find the square root requires p^n to be larger than twice the given integer, which is quickly satisfied. Hensel lifting is a similar method that allows to "lift" the factorization modulo of a polynomial with integer coefficients to a factorization modulo p^n for large values of . This is commonly used by polynomial factorization algorithms.


Notation

There are several different conventions for writing -adic expansions. So far this article has used a notation for -adic expansions in which powers of increase from right to left. With this right-to-left notation the 3-adic expansion of \tfrac15, for example, is written as \frac15 = \dots 121012102_3. When performing arithmetic in this notation, digits are carried to the left. It is also possible to write -adic expansions so that the powers of increase from left to right, and digits are carried to the right. With this left-to-right notation the 3-adic expansion of \tfrac15 is \frac15 = 2.01210121\dots_3 \mbox \frac1 = 20.1210121\dots_3. -adic expansions may be written with other sets of digits instead of . For example, the -adic expansion of \tfrac15 can be written using balanced ternary digits , with representing negative one, as \frac15 = \dots\underline11\underline11\underline11\underline_ . In fact any set of integers which are in distinct
residue class In mathematics, modular arithmetic is a system of arithmetic operations for integers, other than the usual ones from elementary arithmetic, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to mod ...
es modulo may be used as -adic digits. In number theory, Teichmüller representatives are sometimes used as digits. is a variant of the -adic representation of
rational number In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (for example, The set of all ...
s that was proposed in 1979 by Eric Hehner and Nigel Horspool for implementing on computers the (exact) arithmetic with these numbers.


Cardinality

Both \Z_p and \Q_p are uncountable and have the
cardinality of the continuum In set theory, the cardinality of the continuum is the cardinality or "size" of the set of real numbers \mathbb R, sometimes called the continuum. It is an infinite cardinal number and is denoted by \bold\mathfrak c (lowercase Fraktur "c") or \ ...
. For \Z_p, this results from the -adic representation, which defines a
bijection In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between two sets such that each element of the second set (the codomain) is the image of exactly one element of the first set (the domain). Equival ...
of \Z_p on the
power set In mathematics, the power set (or powerset) of a set is the set of all subsets of , including the empty set and itself. In axiomatic set theory (as developed, for example, in the ZFC axioms), the existence of the power set of any set is po ...
\^\N. For \Q_p this results from its expression as a
countably infinite In mathematics, a set is countable if either it is finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is ''countable'' if there exists an injective function from it into the natural numbe ...
union of copies of \Z_p: \Q_p=\bigcup_^\infty \frac 1\Z_p.


Algebraic closure

\Q_p contains \Q and is a field of characteristic . Because can be written as sum of squares, \Q_p cannot be turned into an
ordered field In mathematics, an ordered field is a field together with a total ordering of its elements that is compatible with the field operations. Basic examples of ordered fields are the rational numbers and the real numbers, both with their standard ord ...
. The field of
real numbers In mathematics, a real number is a number that can be used to measurement, measure a continuous variable, continuous one-dimensional quantity such as a time, duration or temperature. Here, ''continuous'' means that pairs of values can have arbi ...
\R has only a single proper algebraic extension: the
complex numbers In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the form a ...
\C. In other words, this quadratic extension is already algebraically closed. By contrast, the algebraic closure of \Q_p, denoted \overline, has infinite degree, that is, \Q_p has infinitely many inequivalent algebraic extensions. Also contrasting the case of real numbers, although there is a unique extension of the -adic valuation to \overline, the latter is not (metrically) complete. Its (metric) completion is called \C_p or \Omega_p. Here an end is reached, as \C_p is algebraically closed. However unlike \C this field is not locally compact. \C_p and \C are isomorphic as rings, so we may regard \C_p as \C endowed with an exotic metric. The proof of existence of such a field isomorphism relies on the
axiom of choice In mathematics, the axiom of choice, abbreviated AC or AoC, is an axiom of set theory. Informally put, the axiom of choice says that given any collection of non-empty sets, it is possible to construct a new set by choosing one element from e ...
, and does not provide an explicit example of such an isomorphism (that is, it is not constructive). If K is any finite Galois extension of \Q_p, the
Galois group In mathematics, in the area of abstract algebra known as Galois theory, the Galois group of a certain type of field extension is a specific group associated with the field extension. The study of field extensions and their relationship to the pol ...
\operatorname \left(K/\Q_p \right) is solvable. Thus, the Galois group \operatorname \left(\overline/ \Q_p \right) is prosolvable.


Multiplicative group

\Q_p contains the -th
cyclotomic field In algebraic number theory, a cyclotomic field is a number field obtained by adjoining a complex root of unity to \Q, the field of rational numbers. Cyclotomic fields played a crucial role in the development of modern algebra and number theory ...
() if and only if . For instance, the -th cyclotomic field is a subfield of \Q_ if and only if , or . In particular, there is no multiplicative - torsion in \Q_p if . Also, is the only non-trivial torsion element in \Q_2. Given a
natural number In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positive in ...
, the
index Index (: indexes or indices) may refer to: Arts, entertainment, and media Fictional entities * Index (''A Certain Magical Index''), a character in the light novel series ''A Certain Magical Index'' * The Index, an item on the Halo Array in the ...
of the multiplicative group of the -th powers of the non-zero elements of \Q_p in \Q_p^\times is finite. The number , defined as the sum of reciprocals of
factorial In mathematics, the factorial of a non-negative denoted is the Product (mathematics), product of all positive integers less than or equal The factorial also equals the product of n with the next smaller factorial: \begin n! &= n \times ...
s, is not a member of any -adic field; but e^p \in \Q_p for p \ne 2. For one must take at least the fourth power. (Thus a number with similar properties as — namely a -th root of — is a member of \Q_p for all .)


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 In logic and related fields such as mathematics and philosophy, "if and only if" (often shortened as "iff") is paraphrased by the biconditional, a logical connective between statements. The biconditional is true in two cases, where either bo ...
it can be solved over the real numbers and over the -adic numbers for every prime . This principle holds, for example, for equations given by
quadratic form In mathematics, a quadratic form is a polynomial with terms all of degree two (" form" is another name for a homogeneous polynomial). For example, 4x^2 + 2xy - 3y^2 is a quadratic form in the variables and . The coefficients usually belong t ...
s, but fails for higher polynomials in several indeterminates.


Rational arithmetic with Hensel lifting


Generalizations and related concepts

The reals and the -adic numbers are the completions of the rationals; it is also possible to complete other fields, for instance general
algebraic number field In mathematics, an algebraic number field (or simply number field) is an extension field K of the field of rational numbers such that the field extension K / \mathbb has finite degree (and hence is an algebraic field extension). Thus K is a ...
s, in an analogous way. This will be described now. Suppose ''D'' is a Dedekind domain and ''E'' is its
field of fractions In abstract algebra, the field of fractions of an integral domain is the smallest field in which it can be embedded. The construction of the field of fractions is modeled on the relationship between the integral domain of integers and the fie ...
. Pick a non-zero prime ideal ''P'' of ''D''. If ''x'' is a non-zero element of ''E'', then ''xD'' is a
fractional ideal In mathematics, in particular commutative algebra, the concept of fractional ideal is introduced in the context of integral domains and is particularly fruitful in the study of Dedekind domains. In some sense, fractional ideals of an integral do ...
and can be uniquely factored as a product of positive and negative powers of non-zero prime ideals of ''D''. We write ord''P''(''x'') for the exponent of ''P'' in this factorization, and for any choice of number ''c'' greater than 1 we can set , x, _P = c^. Completing with respect to this absolute value , ⋅, ''P'' yields a field ''E''''P'', the proper generalization of the field of ''p''-adic numbers to this setting. The choice of ''c'' does not change the completion (different choices yield the same concept of Cauchy sequence, so the same completion). It is convenient, when the residue field ''D''/''P'' is finite, to take for ''c'' the size of ''D''/''P''. For example, when ''E'' is a number field, Ostrowski's theorem says that every non-trivial non-Archimedean absolute value on ''E'' arises as some , ⋅, ''P''. The remaining non-trivial absolute values on ''E'' arise from the different embeddings of ''E'' into the real or complex numbers. (In fact, the non-Archimedean absolute values can be considered as simply the different embeddings of ''E'' into the fields C''p'', thus putting the description of all the non-trivial absolute values of a number field on a common footing.) Often, one needs to simultaneously keep track of all the above-mentioned completions when ''E'' is a number field (or more generally a global field), which are seen as encoding "local" information. This is accomplished by adele rings and idele groups. ''p''-adic integers can be extended to ''p''-adic solenoids \mathbb_p. There is a map from \mathbb_p to the circle group whose fibers are the ''p''-adic integers \mathbb_p, in analogy to how there is a map from \mathbb to the circle whose fibers are \mathbb.


See also

* Non-Archimedean * p-adic quantum mechanics * p-adic Hodge theory * p-adic Teichmuller theory * p-adic analysis * 1 + 2 + 4 + 8 + ⋯ * ''k''-adic notation * C-minimal theory * Mahler's theorem * Profinite integer * Volkenborn integral * Two's complement


Footnotes


Notes


Citations


References

* * . — Translation into English by John Stillwell of ''Theorie der algebraischen Functionen einer Veränderlichen'' (1882). * * * * * * * *


Further reading

* * * * *


External links

*
''p''-adic number
at Springer On-line Encyclopaedia of Mathematics {{DEFAULTSORT:P-Adic Number Field (mathematics) Number theory