P-adic analysis

Last updated December 01, 2023

In mathematics, p-adic analysis is a branch of number theory that deals with the mathematical analysis of functions of p-adic numbers.

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.

Important results

Ostrowski's theorem

Ostrowski's theorem, due to Alexander Ostrowski (1916), states that every non-trivial absolute value on the rational numbers Q is equivalent to either the usual real absolute value or a $p$ -adic absolute value.^[1]

Mahler's theorem

Mahler's theorem, introduced by Kurt Mahler,^[2] expresses continuous p-adic functions in terms of polynomials.

In any field of characteristic 0, one has the following result. Let

(\Delta f)(x)=f(x+1)-f(x)

be the forward difference operator. Then for polynomial functions f we have the Newton series:

f(x)=\sum _{k=0}^{\infty }(\Delta ^{k}f)(0){x \choose k},

where

{x \choose k}={\frac {x(x-1)(x-2)\cdots (x-k+1)}{k!}}

is the kth binomial coefficient polynomial.

Over the field of real numbers, the assumption that the function f is a polynomial can be weakened, but it cannot be weakened all the way down to mere continuity.

Mahler proved the following result:

Mahler's theorem: If f is a continuous p-adic-valued function on the p-adic integers then the same identity holds.

Hensel's lemma

Hensel's lemma, also known as Hensel's lifting lemma, named after Kurt Hensel, is a result in modular arithmetic, stating that if a polynomial equation has a simple root modulo a prime number $p$ , then this root corresponds to a unique root of the same equation modulo any higher power of $p$ , which can be found by iteratively "lifting" the solution modulo successive powers of $p$ . More generally it is used as a generic name for analogues for complete commutative rings (including p-adic fields in particular) of the Newton method for solving equations. Since p-adic analysis is in some ways simpler than real analysis, there are relatively easy criteria guaranteeing a root of a polynomial.

To state the result, let $f(x)$ be a polynomial with integer (or p-adic integer) coefficients, and let m,k be positive integers such that m ≤ k. If r is an integer such that

f(r)\equiv 0{\pmod {p^{k}}}

and

f'(r)\not \equiv 0{\pmod {p}}

then there exists an integer s such that

f(s)\equiv 0{\pmod {p^{k+m}}}

and

r\equiv s{\pmod {p^{k}}}.

Furthermore, this s is unique modulo p^k+m, and can be computed explicitly as

s=r+tp^{k}

where

t=-{\frac {f(r)}{p^{k}}}\cdot (f'(r)^{-1}).

Applications

P-adic quantum mechanics

P-adic quantum mechanics is a relatively recent approach to understanding the nature of fundamental physics. It is the application of p-adic analysis to quantum mechanics. The p-adic numbers are an intuitive arithmetic system (but geometrically counterintuitive) that was discovered by German mathematician Kurt Hensel in about 1899 and by German mathematician Ernst Kummer(1810-1893) earlier in elementary form. The closely related adeles and ideles were introduced in the 1930s by Claude Chevalley and André Weil. Their study has now transformed into a major branch of mathematics. They were occasionally applied to the physical sciences, but it wasn't until a publication by the Russian mathematician Volovich in 1987 that the subject was taken seriously in the physics world.^[3] There are now hundreds of research articles on the subject,^[4]^[5] along with international journals as well.

There are two main approaches to the subject.^[6]^[7] The first considers particles in a p-adic potential well, and the goal is to find solutions with smoothly varying complex-valued wavefunctions. Here the solutions are to have a certain amount of familiarity from ordinary life. The second considers particles in p-adic potential wells, and the goal is to find p-adic valued wavefunctions. In this case, the physical interpretation is more difficult. Yet the math often exhibits striking characteristics, therefore people continue to explore it. The situation was summed up in 2005 by one scientist as follows: "I simply cannot think of all this as a sequence of amusing accidents and dismiss it as a 'toy model'. I think more work on this is both needed and worthwhile."^[8]

Local–global principle

Helmut Hasse's local–global principle, also known as the Hasse principle, is the idea that one can find an integer solution to an equation by using the Chinese remainder theorem to piece together solutions modulo powers of each different prime number. This is handled by examining the equation in the completions of the rational numbers: the real numbers and the p-adic numbers. A more formal version of the Hasse principle states that certain types of equations have a rational solution if and only if they have a solution in the real numbers and in the p-adic numbers for each prime p.

Related Research Articles

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 these integers, under the condition that the divisors are pairwise coprime.

In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book Disquisitiones Arithmeticae, published in 1801.

In mathematics, a polynomial is an expression consisting of indeterminates and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example of a polynomial of a single indeterminate $x$ is $x 2 - 4 x + 7$ . An example with three indeterminates is $x 3 + 2 xyz 2 - yz + 1$ .

In mathematics, a transcendental number is a real or complex number that is not algebraic – that is, not the root of a non-zero polynomial of finite degree with rational coefficients. The best known transcendental numbers are $π$ and $e$ .

In number theory, given a prime number $p$ , the $p$ -adic numbers form an extension of the rational numbers which is distinct from the real numbers, though with some similar properties; $p$ -adic numbers can be written in a form similar to decimals, but with digits based on a prime number $p$ rather than ten, and extending to the left rather than to the right. Formally, given a prime number $p$ , a $p$ -adic number can be defined as a series

In number theory, Fermat's little theorem states that if $p$ is a prime number, then for any integer $a$ , the number $a p - a$ is an integer multiple of $p$ . In the notation of modular arithmetic, this is expressed as

In number theory, Euler's criterion is a formula for determining whether an integer is a quadratic residue modulo a prime. Precisely,

In modular arithmetic, a number $g$ is a primitive root modulo $n$ if every number $a$ coprime to $n$ is congruent to a power of $g$ modulo $n$ . That is, $g$ is a primitive root modulo $n$ if for every integer $a$ coprime to $n$ , there is some integer $k$ for which $g$ ^$k$ ≡ $a$ . Such a value $k$ is called the index or discrete logarithm of $a$ to the base $g$ modulo $n$ . So $g$ is a primitive root modulo $n$ if and only if $g$ is a generator of the multiplicative group of integers modulo $n$ .

In theoretical computer science and cryptography, a trapdoor function is a function that is easy to compute in one direction, yet difficult to compute in the opposite direction without special information, called the "trapdoor". Trapdoor functions are a special case of one-way functions and are widely used in public-key cryptography.

In algebra and number theory, Wilson's theorem states that a natural number n > 1 is a prime number if and only if the product of all the positive integers less than n is one less than a multiple of n. That is, the factorial $satisfies$

In mathematics, an automorphic number is a natural number in a given number base $whose square "ends" in the same digits as the number itself.$

The quadratic sieve algorithm (QS) is an integer factorization algorithm and, in practice, the second-fastest method known. It is still the fastest for integers under 100 decimal digits or so, and is considerably simpler than the number field sieve. It is a general-purpose factorization algorithm, meaning that its running time depends solely on the size of the integer to be factored, and not on special structure or properties. It was invented by Carl Pomerance in 1981 as an improvement to Schroeppel's linear sieve.

In mathematics, Wolstenholme's theorem states that for a prime number $, the congruence$

<span class="mw-page-title-main">Carmichael function</span> Function in mathematical number theory

In number theory, a branch of mathematics, the Carmichael function $λ (n)$ of a positive integer $n$ is the smallest positive integer $m$ such that

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 $p$ , then this root can be lifted to a unique root modulo any higher power of $p$ . More generally, if a polynomial factors modulo $p$ into two coprime polynomials, this factorization can be lifted to a factorization modulo any higher power of $p$ .

Schoof's algorithm is an efficient algorithm to count points on elliptic curves over finite fields. The algorithm has applications in elliptic curve cryptography where it is important to know the number of points to judge the difficulty of solving the discrete logarithm problem in the group of points on an elliptic curve.

In mathematics, particularly in the area of arithmetic, a modular multiplicative inverse of an integer $a$ is an integer $x$ such that the product $ax$ is congruent to 1 with respect to the modulus $m$ . In the standard notation of modular arithmetic this congruence is written as

Anatoly Alexeyevich Karatsuba was a Russian mathematician working in the field of analytic number theory, p-adic numbers and Dirichlet series.

In mathematics, an algebraic number field is an extension field $of the field of rational numbers such that the field extension has finite degree . Thus is a field that contains and has finite dimension when considered as a vector space over .$

In number theory, Berlekamp's root finding algorithm, also called the Berlekamp–Rabin algorithm, is the probabilistic method of finding roots of polynomials over a field $. The method was discovered by Elwyn Berlekamp in 1970 as an auxiliary to the algorithm for polynomial factorization over finite fields. The algorithm was later modified by Rabin for arbitrary finite fields in 1979. The method was also independently discovered before Berlekamp by other researchers.$

References

↑ Koblitz, Neal (1984). P-adic numbers, p-adic analysis, and zeta-functions (2nd ed.). New York: Springer-Verlag. p. 3. ISBN 978-0-387-96017-3 . Retrieved 24 August 2012. Theorem 1 (Ostrowski). Every nontrivial norm ‖ ‖ on $\mathbb {Q}$ is equivalent to $| | p$ for some prime $p$ or for $p = \infty$ .
↑ Mahler, K. (1958), "An interpolation series for continuous functions of a p-adic variable", Journal für die reine und angewandte Mathematik , 1958 (199): 23–34, doi:10.1515/crll.1958.199.23, ISSN 0075-4102, MR 0095821, S2CID 199546556
↑ I.V.Volovich, Number theory as the ultimate theory, CERN preprint, CERN-TH.4791/87
↑ V. S. Vladimirov, I.V. Volovich, and E.I. Zelenov P-adic Analysis and Mathematical Physics, (World Scientific, Singapore 1994)
↑ L. Brekke and P. G. O. Freund, P-adic numbers in physics, Phys. Rep. 233, 1-66(1993)
↑ Dragovich, Branko (2007). "Adeles in Mathematical Physics". arXiv: 0707.3876 .{{cite journal}}: Cite journal requires |journal= (help)
↑ Djordjević, G. S.; Dragovich, B. (2000). "P-Adic and adelic harmonic oscillator with a time-dependent frequency". Theoretical and Mathematical Physics. 124 (2): 3. arXiv: quant-ph/0005027 . Bibcode:2000TMP...124.1059D. doi:10.1007/BF02551077. S2CID 14281188.
↑ Freund, Peter G. O. (2006). "P-Adic Strings and Their Applications". AIP Conference Proceedings. Vol. 826. pp. 65–73. arXiv: hep-th/0510192 . doi:10.1063/1.2193111. S2CID 119086848.

v t e Number systems
Sets of definable numbers	Natural numbers ( $\mathbb {N}$ ) Integers ( $\mathbb {Z}$ ) Rational numbers ( $\mathbb {Q}$ ) Constructible numbers Algebraic numbers ( $\mathbb {A}$ ) Closed-form numbers Periods Computable numbers Arithmetical numbers Set-theoretically definable numbers Gaussian integers
Composition algebras	Division algebras: Real numbers ( $\mathbb {R}$ ) Complex numbers ( $\mathbb {C}$ ) Quaternions ( $\mathbb {H}$ ) Octonions ( $\mathbb {O}$ )
Split types	Over $\mathbb {R}$ : Split-complex numbers Split-quaternions Split-octonions Over $\mathbb {C}$ : Bicomplex numbers Biquaternions Bioctonions
Other hypercomplex	Dual numbers Dual quaternions Dual-complex numbers Hyperbolic quaternions Sedenions ( $\mathbb {S}$ ) Split-biquaternions Multicomplex numbers Geometric algebra/Clifford algebra Algebra of physical space Spacetime algebra Plane-based geometric algebra
Other types	Cardinal numbers Extended natural numbers Irrational numbers Fuzzy numbers Hyperreal numbers Levi-Civita field Surreal numbers Transcendental numbers Ordinal numbers p-adic numbers (p-adic solenoids) Supernatural numbers Profinite integers Superreal numbers Normal numbers
Classification List