In p-adic Analysis (Spring 2018), we will look at a family of number systems called the -adic numbers, one for each prime. The real numbers are a familiar completion of the rational numbers: any real number can be written as a limit of rational numbers. But using a different definition of the absolute value or distance, we can define new number systems known as the -adic numbers. Like the real numbers, they are well-suited to analysis, so we can talk about sequences and series of -adic numbers. But the -adic versions typically behave better than the real ones. For instance, there are sequences of real numbers so that as , but the corresponding series does not converge. Not so for the -adic versions: the series converges if and only if the terms tend to 0. It is also easy to determine whether a -adic polynomial has a root, and how many of them there are. In fact, there is even a simple method of calculating the number of roots of a polynomial with a given absolute value, something that has no analogue in the real numbers.
Many familiar functions on the natural numbers, including the Fibonacci numbers, can be extended to -adic functions, or, more precisely functions on the product of all the -adic numbers. We will look at how that works and what conditions are needed for a function to be extensible to the -adic numbers. There are also -adic exponential, logarithm, , and functions, among many others. Along the way, we will introduce topics from analysis, topology, and abstract algebra as needed so that we can understand the -adic version, which are generally quite a bit simpler. For instance, there are only finitely many field extensions of the -adic field of any given degree, in contrast to the case of .
The -adic numbers are important in number theory. Since contains , a polynomial that has a root in must also have a root in each . But sometimes, it also turns out that we can detect the presence of a root in from a root in each , and also in . In particular, this is true for quadratic forms; this is the celebrated Hasse-Minkowski Theorem. We will also look at other applications of -adic numbers to number theory. For instance, in an integer sequence satisfying a linear recurrence relation, the zeros form a union of arithmetic progressions, together with finitely many exceptions. All known proofs of this theorem rely on the -adic numbers.
There are many problems related to -adic numbers that have not been explored much, if at all. Thus there are plenty of opportunities to start on research projects based on material in the class, and we will include some possible problems on the problem sets.
This class will meet on Tuesdays and Wednesdays for ten weeks from 6:30–8:30 PM in Palo Alto, starting on April 3rd. Click here to apply! The regular application deadline has already passed, but we are still able to accept a few more applications on a first-come first-serve basis.