Search arXivSearch

arXiv · 2505.15224

Stabilization on ideal class groups in potential cyclic towers

Abstract

Let $p$ be a prime and let $F$ be a number field. Consider a Galois extension $K/F$ with Galois group $H\rtimes Δ$ where $H\cong \mathbb{Z}_p$ or $\mathbb{Z}/p^d\mathbb{Z}$, and $Δ$ is an arbitrary Galois group. The subfields fixed by $H^{p^n} \rtimes Δ$ $(n=0,1,\cdots)$ form a tower which we call it a potential cyclic $p$-tower in this paper. A radical $p$-tower is a typical example, say $\mathbb{Z}\subset \mathbb{Z}(\sqrt[p]{a})\subset \mathbb{Z}(\sqrt[p^2]{a})\subset \cdots$ where $a\in \mathbb{Z}$. We extend the stabilization result of Fukuda in Iwasawa theory on $p$-class groups in cyclic $p$-towers to potential cyclic $p$-towers. We also extend Iwasawa's class number formula in $\mathbb{Z}_p$-extensions to potential $\mathbb{Z}_p$-extensions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jianing Li. 2025-05-21. Stabilization on ideal class groups in potential cyclic towers. https://arxiv.org/abs/2505.15224

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