In the previous post we defined $p$-adic numbers. This post will state (mostly without proof) some more surprising results about continuous functions $f \colon \mathbb Z_p \rightarrow \mathbb Q_p$. Then we give the famous proof of the Skolem-Mahler-Lech theorem using $p$-adic analysis.

1. Digression on $\mathbb C_p$

Before I go on, I want to mention that $\mathbb Q_p$ is not algebraically closed. So, we can take its algebraic closure $\overline{\mathbb Q_p}$ — but this field is now no longer complete (in the topological sense). However, we can then take the completion of this space to obtain $\mathbb C_p$. In general, completing an algebraically closed field remains algebraically closed, and so there is a larger space $\mathbb …$

I think this post is more than two years late in coming, but anywhow…

This post introduces the $p$-adic integers $\mathbb Z_p$, and the $p$-adic numbers $\mathbb Q_p$. The one-sentence description is that these are “integers/rationals carrying full mod $p^e$ information” (and only that information).

The first four sections will cover the founding definitions culminating in a short solution to a USA TST problem.

In this whole post, $p$ is always a prime. Much of this is based off of Chapter 3A from Straight from the Book.

1. Motivation

Before really telling you what $\mathbb Z_p$ and $\mathbb Q_p$ are, let me tell you what you might expect them to do.

In elementary/olympiad number theory, we’re already well-familiar …

Here I talk about my first project at the Emory REU. Prerequisites for this post: some familiarity with number fields.

1. Motivation: Arithmetic Progressions

Given a property $P$ about primes, there’s two questions we can ask:

1. How many primes $\le x$ are there with this property?
2. What’s the least prime with this property?

As an example, consider an arithmetic progression $a$, $a+d$, …, with $a < d$ and $\gcd(a,d) = 1$. The strong form of Dirichlet’s Theorem tells us that basically, the number of primes $\equiv a \pmod d$ is $\frac 1d$ the total number of primes. Moreover, the celebrated Linnik’s Theorem tells us that the first prime is $O({\mathrm{d\; \dots }}^{}$

In this post I will sketch a proof Dirichlet Theorem’s in the following form:

Theorem 1 (Dirichlet’s Theorem on Arithmetic Progression)

Let $$\psi(x;q,a) = \sum_{\substack{n \le x \\ n \equiv a \mod q}} \Lambda(n).$$ Let $N$ be a positive constant. Then for some constant $C(N) > 0$ depending on $N$, we have for any $q$ such that $q \le (\log x)^N$ we have $$\psi(x;q,a) = \frac{1}{\phi(q)} x + O\left( x\exp\left(-C(N) \sqrt{\log …$$