Search arXivSearch

arXiv · 2009.05278

Weber's class number problem and $p$-rationality in the cyclotomic $\widehat{\mathbb{Z}}$-extension of $\mathbb{Q}$

Abstract

Let $K$ be the $N$th layer in the cyclotomic $\widehat{\mathbb{Z}}$-extension $\widehat{\mathbb{Q}}$. Many authors (Aoki, Fukuda, Horie, Ichimura, Inatomi, Komatsu, Miller, Morisawa, Nakajima, Okazaki, Washington,\,$\ldots$) analyse the behavior of the $p$-class groups ${\mathcal C}_K$. We revisit this problem, in a more conceptual form, since computations show that the $p$-torsion group ${\mathcal T}_K$ of the Galois groups of the maximal abelian $p$-ramified pro-$p$-extension of $K$ (Tate--Shafarevich group of $K$) is often non-trivial; this raises questions since $\# {\mathcal T}_K = \# {\mathcal C}_K\, \# {\mathcal R}_K$ where ${\mathcal R}_K$ is the normalized $p$-adic regulator. We give a new method testing ${\mathcal T}_K \ne 1$ (Theorem 4.6, Table 6.2) and characterize the $p$-extensions $F$ of $K$ in $\widehat{\mathbb{Q}}$ with ${\mathcal C}_F \ne 1$ (Theorem 7.5 and Corollary 7.6). We publish easy to use programs, justifying again the eight known examples, and allowing further extensive computations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Georges Gras. 2020-11-10. Weber's class number problem and $p$-rationality in the cyclotomic $\widehat{\mathbb{Z}}$-extension of $\mathbb{Q}$. https://doi.org/10.1016/j.jnt.2021.04.019

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