Search arXivSearch

arXiv · 1006.5163

Coleman maps and the p-adic regulator

Abstract

This paper is a sequel to our earlier paper "Wach modules and Iwasawa theory for modular forms" (arXiv: 0912.1263), where we defined a family of Coleman maps for a crystalline representation of the Galois group of Qp with nonnegative Hodge-Tate weights. In this paper, we study these Coleman maps using Perrin-Riou's p-adic regulator L_V. Denote by H(Γ) the algebra of Qp-valued distributions on Γ= Gal(Qp(μ(p^\infty) / Qp). Our first result determines the H(Γ)-elementary divisors of the quotient of D_{cris}(V) \otimes H(Γ) by the H(Γ)-submodule generated by (ϕ* N(V))^{ψ= 0}, where N(V) is the Wach module of V. By comparing the determinant of this map with that of L_V (which can be computed via Perrin-Riou's explicit reciprocity law), we obtain a precise description of the images of the Coleman maps. In the case when V arises from a modular form, we get some stronger results about the integral Coleman maps, and we can remove many technical assumptions that were required in our previous work in order to reformulate Kato's main conjecture in terms of cotorsion Selmer groups and bounded p-adic L-functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Antonio Lei, David Loeffler, Sarah Livia Zerbes. 2010-10-17. Coleman maps and the p-adic regulator. https://doi.org/10.2140/ant.2011.5.1095

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