Search arXivSearch

arXiv · 2309.15692

An introduction to $p$-adic $L$-functions

Abstract

These expository notes introduce $p$-adic $L$-functions and the foundations of Iwasawa theory. We focus on Kubota--Leopoldt's $p$-adic analogue of the Riemann zeta function, which we describe in three different ways. We first present a measure-theoretic (analytic) $p$-adic interpolation of special values of the Riemann zeta function. Next, we describe Coleman's (arithmetic) construction via cyclotomic units. Finally, we examine Iwasawa's (algebraic) construction via Galois modules over the Iwasawa algebra. The Iwasawa Main conjecture, now a theorem due to Mazur and Wiles, says that these constructions agree. We will state the conjecture precisely, and give a proof when $p$ is a Vandiver prime (which conjecturally covers every prime). Throughout, we discuss generalisations of these constructions and their connections to modern research directions in number theory.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joaquín Rodrigues Jacinto, Chris Williams. 2024-12-19. An introduction to $p$-adic $L$-functions. https://doi.org/10.2140/ent.2025.4.101

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT