What Are P-Adic Numbers? What Are They Used For?
What Are P-Adic Numbers? What Are They Used For?
What Are P-Adic Numbers? What Are They Used For?
What
What are are p-Adic
p-Adic Numbers?
Numbers? What are
What areTheyThey
Used Used
for? for?
U A Rozikov
U A Rozikov
Abstract. In this short paper we give a popular intro- rational numbers, such that |2|∗ < 1. This is done
duction to the theory of p-adic numbers. We give some as follows. Let Q be the field of rational numbers.
properties of p-adic numbers distinguishing them to
Every rational number x 0 can be represented
“good” and “bad”. Some remarks about applications
of p-adic numbers to mathematics, biology and physics in the form x = pr mn , where r, n ∈ Z, m is a positive
are given. integer, ( p, n) = 1, ( p, m) = 1 and p is a fixed prime
number. The p-adic absolute value (norm) of x is
1. p-Adic Numbers given by
−r
p-adic numbers were introduced in 1904 by the p , for x 0,
|x|p =
0, for x = 0.
German mathematician K Hensel. They are used
intensively in number theory. p-adic analysis was The p-adic norm satisfies the so called strong
developed (mainly for needs of number theory) triangle inequality
in many directions, see, for example, [20, 50].
|x + y|p ≤ max{|x|p , |y|p}, (2)
When we write a number in decimal, we can
only have finitely many digits on the left of the and this is a non-Archimedean norm.
decimal, but we can have infinitely many on the This definition of |x|p has the effect that high
right of the decimal. They might “terminate” (and powers of p become “small”, in particular |2n |2 =
become all zeros after some point) but they might 1/2n . By the fundamental theorem of arithmetic,
not. The p-adic integers can be thought of as for a given non-zero rational number x there is a
writing out integers in base p, but one can have unique finite set of distinct primes p1 , . . . , pr and
infinitely many digits to the left of the decimal a corresponding sequence of non-zero integers
(and none on the right; but the rational p-adic a1 , . . . , an such that x = pa11 . . . par r . It then follows
numbers can have finitely many digits on the that |x|pi = p−a i
i
for all i = 1, . . . , r, and |x|p = 1 for
right of the decimal). For example, the binary any other prime p {p1 , . . . , pr }.
expansion of 35 is 1·20 +1·21 +0·22 +0·23 +0·24 +1·25, For example, take 63/550 = 2−1 · 32 · 5−2 · 7 · 11−1
often written in the shorthand notation 1000112. we have
One has 1 = 0, 111111111 . . .2 = 0, (1)2. But what is
2, if p = 2,
. . . 111111, 02 = (1), 02? Compute (1), 02 + 1:
1/9, if p = 3,
. . . 111111, 02
25, if p = 5,
�� 63 ��� =
�� �
+. . . 000001, 02
. . . 000000, 02 � 550 �p
1/7, if p = 7,
11, if p = 11,
Hence (1), 02 = −1. This equality can be written as
1, if p ≥ 13.
n−1
�
(1), 02 = lim 2i = lim (2n − 1) = −1. (1)
n→∞ n→∞
i=0 We say that two norms � · �1 and � · �2 on Q are
This limit equivalent to limn→∞ 2 = 0. In real
n equivalent if there exists α > 0 such that
case one has limn→∞ qn = 0 if and only if absolute
� · �α1 = � · �2 .
value |q| is less than 1. Remember that to define
real numbers one considers all limit points of It is a theorem of Ostrowski (see [41]) that
sequences of rational numbers, using the absolute each absolute value on Q is equivalent either
value as metric. to the Euclidean absolute value | · |, the trivial
To give a meaning of the limit (1), one has absolute value, or to one of the p-adic absolute
to give a new absolute value | · |∗ , on the set of values for some prime p. So the only norms on
The sum ∞
Q modulo equivalence are the absolute value, n=0 n! exists in every Qp . The follow-
the trivial absolute value and the p-adic absolute ing problem has been open since 1971.
∞
value which means that there are only as many Problem. Can n=0 n! be rational for some
completions (with respect to a norm) of Q. prime p?
The p-adic absolute value defines a metric It is not known if ∞
n=0 n! 0 in every Qp .
|x − y|p on Q. Two numbers x and y are p-adically 7. For any x ∈ Q, we have
closer as long as r is higher, such that pr divides
|x − y|p . Amazingly, for p = 5 the result is that 135 |x| |x|p = 1.
p:prime
is closer to 10 than 35.
The completion of Q with respect to p-adic This formula have been used to solve several
norm defines the p-adic field which is denoted problems in number theory, many of them us-
by Qp . Any p-adic number x 0 can be uniquely ing Helmut Hasse’s local-global principle, which
represented in the canonical form roughly states that an equation can be solved
over the rational numbers if and only if it can be
x = pγ(x) (x0 + x1 p + x2 p2 + · · · ),
solved over the real numbers and over the p-adic
where γ = γ(x) ∈ Z and xj are integers, 0 ≤ xj ≤ numbers for every prime p.
p − 1, x0 > 0, j = 0, 1, 2, ... (see more detail [31,
50, 54]). In this case |x|p = p−γ(x) . The set of p-adic 3. “Bad” Properties of p-Adic Numbers
numbers contains the field of rational numbers Q
but is different from it. 1. Qp is not ordered.
Using canonical form of p-adic numbers, simi- 2. Qp is not comparable with R, for example
√ √
larly as real numbers, one makes arithmetic oper- 7 Q5 , but i = −1 ∈ Q5 .
ations on p-adic numbers (see for example, [41]). 3. Qp is not algebraically closed.
But | · |p can be extended uniquely to the
2. “Good” Properties of p-Adic Numbers algebraic closure Qap and the completion of (Qap , |·|p )
is called Cp , the field of the p-adic complex num-
The ultra-metric triangle inequality, i.e. (2), under- bers. Cp is no locally compact, but separable and
lies many of the interesting differences between algebraically closed.
real and p-adic analysis. The following properties Now define the functions expp (x) and logp (x).
of p-adic numbers make some directions of the Given a ∈ Qp and r > 0 put
p-adic analysis more simple than real analysis:
1. All triangles are isosceles. B(a, r) = {x ∈ Qp : |x − a|p < r}.
2. Any point of ball D(a, r) = {x ∈ Qp : |x−a|p ≤ r}
The p-adic logarithm is defined by the series
is center. Each ball has an empty boundary. Two
∞
balls are either disjoint, or one is contained in the (x − 1)n
logp (x) = logp (1 + (x − 1)) = ( − 1)n+1 ,
other. n=1
n
3. | · |p1 | · |p2 if p1 p2 . This means that each
which converges for x ∈ B(1, 1);
prime number p generates its own field of p-adic
The p-adic exponential is defined by
numbers Qp .
∞
4. x2 = −1 has a solution x ∈ Qp if and only if xn
expp (x) = ,
p = 1 mod 4. n=0
n!
5. A sequence {xn } in Qp is a Cauchy sequence
which converges for x ∈ B(0, p−1/(p−1)).
if and only if |xn+1 − xn |p → 0 as n → ∞.
Let x ∈ B(0, p−1/(p−1), then
This has the useful corollary that a sum con-
verges if and only if the individual terms tend to | expp (x)|p = 1, | expp (x)−1|p = |x|p , | logp (1+x)|p = |x|p ,
zero:
6. (A student’s dream) ∞ logp ( expp (x)) = x, expp ( logp (1 + x)) = 1 + x.
n=1 an < ∞ if and only
if an → 0.
4. Some “good” functions become “bad”. For
Since |n!|p → 0 we have, for example,
example exp (x) is very “good” function on R, but
∞ ∞
as we seen above expp (x) is defined only on ball
( − 1)n n!(n + 2) = 1, ( − 1)n n!(n2 − 5) = −3.
n=0 n=0 B(0, p−1/(p−1) ).
[20] Z. I. Borevich and I. R. Shafarevich, Number Theory of compact-open subsets of non-archimedean local
(Academic Press, New York, 1966). fields, Trans. Amer. Math. Soc. 361(1) (2009) 61–85.
[21] G. Call and J. Silverman, Canonical height on va- [37] J. Kingsbery, A. Levin, A. Preygel and C. E. Silva,
rieties with morphisms, Compositio Math. 89 (1993) Dynamics of the p-adic shift and applications, Disc.
163–205. Contin. Dyn. Syst. 30(1) (2011) 209–218.
[22] B. Dragovich, A. Yu. Khrennikov, S. V. Kozyrev [38] D. Lin, T. Shi and Z. Yang, Ergodic theory over
and I. V. Volovich, On p-adic mathematical F2 [[X]], Finite Fields Appl. 18 (2012) 473–491.
physics, p-Adic Numbers, Ultrametric Anal. Appl. [39] J. Lubin, Nonarchimedean dynamical systems,
1(1) (2009) 1–17. Composito Math. 94(3) (1994) 321–346.
[23] D. Dubischer, V. M. Gundlach, A. Khrennikov and [40] E. Marinari and G. Parisi, On the p-adic five point
O. Steinkamp, Attractors of random dynamical function, Phys. Lett. B 203 (1988) 52–56.
system over p-adic numbers and a model of ‘noisy’ [41] N. Koblitz, p-Adic Numbers, p-Adic Analysis, and
cognitive process, Phys. D 130 (1999) 1–12. Zeta-Functions (Springer, Berlin, 1977).
[24] G. Gandolfo, U. A. Rozikov and J. Ruiz, On p- [42] Yu. I. Manin and A. A. Panchishkin, Introduction
adic Gibbs measures for hard core model on a to Modern Number Theory (Springer, Berlin, 2007).
Cayley tree, Markov Processes Related Fields 18(4) [43] E. Marinary and G. Parisi, On the p-adic five point
(2012) 701–720. function, Phys. Lett. B 203 (1988) 52–56.
[25] N. N. Ganikhodjaev, F. M. Mukhamedov and U. [44] F. M. Mukhamedov and U. A. Rozikov, On ratio-
A. Rozikov, Phase transitions in the Ising model nal p-adic dynamical systems, Methods Func. Anal.
on Z over the p-adic number field, Uzb. Mat. Zh. Topology 10(2) (2004) 21–31.
4 (1998) 23–29. [45] F. M. Mukhamedov and U. A. Rozikov, On Gibbs
[26] N. N. Ganikhodjaev, F. M. Mukhamedov and U. measures of p-adic Potts model on Cayley tree,
A. Rozikov, Existence of phase transition for the Indag. Math. (N.S.) 15(1) (2004) 85–100.
Potts p-adic model on the set Z, Theor. Math. Phys. [46] F. M. Mukhamedov and U. A. Rozikov, On inho-
130 (2002) 425–431. mogeneous p-adic Potts model on a Cayley tree,
[27] V. M. Gundlach, A. Khrennikov and K. O. Lindahl, Inf. Dim. Anal. Quant. Prob. Rel. Fields 8(2) (2005)
On ergodic behavior of p-adic dynamical systems, 277–290.
Infin. Dimen. Anal. Quantum Probab. Relat. Top. 4 [47] T. Pezda, Polynomial cycles in certain local do-
(2001) 569–577. mains, Acta Arith. 66 (1994) 11–22.
[28] A.-H. Fan and L.-M. Liao, On minimal decomposi- [48] J.-E. Pin, Profinite methods in automata theory,
tion of p-adic polynomial dynamical systems, Adv. in Symposium on Theoretical Aspects of Computer
Math. 228 (2011) 2116–2144. Science — STACS 2009, (Freiburg, 2009), pp. 31–50.
[29] P. G. O. Freund and E. Witten, Adelic string am- [49] A. M. Robert, A Course of p-Adic Analysis (Springer,
pletudes, Phys. Lett. B 199 (1987) 191–194. New York, 2000).
[30] M. Khamraev, F. M. Mukhamedov and U. A. [50] W. Schikhof, Ultrametric Calculas (Cambridge Uni-
Rozikov, On the uniqueness of Gibbs measures for versity, Cambridge, 1984).
p-adic non homogeneous λ-model on the Cayley [51] T. Shi, V. Anashin and D. Lin, Linear weaknesses
tree, Lett. Math. Phys. 70 (2004) 17–28. in T-functions, in SETA 2012, eds. T. Helleseth
[31] A. Yu. Khrennikov, p-Adic Valued Distributions in and J. Jedwab, Lecture Notes Comp. Sci., Vol.
Mathematical Physics (Kluwer, Dordrecht, 1994). 7280 (Springer-Verlag, Berlin, Heidelberg, 2012),
[32] A. Yu. Khrennikov, Mathematical methods of the pp. 279–290.
non-Archimedean physics, Uspekhi Mat. Nauk 45(4) [52] J. Silverman, The Arithmetic of Dynamical Systems,
(1990) 79–110. Graduate Texts in Mathematics, No. 241 (Springer-
[33] A. Yu. Khrennikov, Non-Archimedean Analysis: Verlag, New York, 2007).
Quantum Paradoxes, Dynamical Systems and Biolog- [53] E. Thiran, D. Verstegen and J. Weters, p-adic dy-
ical Models (Kluwer Academic Publishers, Dor- namics, J. Stat. Phys. 54(3/4) (1989) 893–913.
drecht, The Netherlands, 1997). [54] V. S. Vladimirov, I. V. Volovich and E. I. Zelenov, p-
[34] A. Yu. Khrennikov, S. Yamada and A. van Rooij, Adic Analysis and Mathematical Physics [in Russian],
The measure-theoretical approach to p-adic prob- Nauka, Moscow (1994); English transl., World Sci-
ability theory, Ann. Math. Blaise Pascal 6 (1999) entific, Singapore (1994).
21–32. [55] I. V. Volovich, p-adic strings, Class. Quantum Gray.
[35] A. Yu. Khrennikov, The description of Brain’s func- 4 (1987) L83–L87.
tioning by the p-adic dynamical system, preprint [56] V. S. Vladimirov, I. V. Volovich and E. I. Zelenov,
No. 355 (SFB-237), Ruhr Univ. Bochum, Bochum The spectral theory in the p-adic quantum me-
(1997). chanics, Izvestia Akad. Nauk SSSR, Ser. Mat. 54(2)
[36] J. Kingsbery, A. Levin, A. Preygel and C. E. (1990) 275–302.
Silva, On measure-preserving c1 transformations
U A Rozikov
Institute of Mathematics, Tashkent, Uzbekistan
rozikovu@yandex.ru