Search arXivSearch

arXiv · 2311.13525

On the Galois structure of units in totally real $p$-rational number fields

Abstract

The theory of factor-equivalence of integral lattices establishes a far-reaching relationship between the Galois module structure of the unit group of the ring of integers of a number field and its arithmetic. For a number field $K$ that is Galois over $\mathbb{Q}$ or an imaginary quadratic field, we prove a necessary and sufficient condition on the quotients of class numbers of subfields of $K$, for the quotient $E_{K}$ of the unit group of the ring of integers of $K$ modulo the subgroup of roots of unity to be factor equivalent to the standard cyclic Galois module. Using strong arithmetic properties of totally real $p$-rational number fields, we prove that the non-abelian $p$-rational $p$-extensions of $\mathbb{Q}$ do not admit Minkowski units, thereby extending a result of Burns to non-abelian number fields. We also study the relative Galois module structure of $E_{L}$ for varying Galois extensions $L/F$ of totally real $p$-rational number fields whose Galois groups are isomorphic to a fixed finite group $G$. In that case, we prove that there exists a finite set $Ω$ of $\mathbb{Z}_p[G]$-lattices such that for every $L$, $\mathbb{Z}_{p} \otimes_{\mathbb{Z}} E_{L}$ is factor equivalent to $\mathbb{Z}_{p}[G]^{n} \oplus X$ as $\mathbb{Z}_p[G]$-lattices for some $X \in Ω$ and an integer $n \geq 0$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zakariae Bouazzaoui, Donghyeok Lim. 2025-10-05. On the Galois structure of units in totally real $p$-rational number fields. https://arxiv.org/abs/2311.13525

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