Greenberg's conjecture for totally real number fields in terms of algorithmic complexity - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2020

Greenberg's conjecture for totally real number fields in terms of algorithmic complexity

Résumé

Let k be a totally real number field and let k_∞ be its cyclotomic Z_p-extension, p≥2. Generalizing some viewpoints of Taya and others, we show that Greenberg's conjecture (lambda = mu = 0) depends on images, of ideal norms along the stages k_n/k of the tower, in the torsion group T_k of the Galois group of the maximal abelian p-ramified pro-p-extension of k; these images (obtained inductively via a classical algorithm in each k_n) take place both in the p-class group Cl_k and in the normalized p-adic regulator R_k of k (Theorem 6.2). A property of uniform distribution of these images (Conjecture 6.4) would lead to density results needed for a proof of Greenberg's conjecture, which remains hopeless within the sole framework of Iwasawa's theory. Indeed, many ``algebraic/class field theory'' criteria exist, which hide a broad p-adic arithmetic and algorithmic complexity governed by T_k. No assumption is made on the degree [k : Q], nor on the decomposition of p in k/Q.
Fichier principal
Vignette du fichier
synthesis.Greenberg.New.pdf (465.94 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02541269 , version 1 (13-04-2020)
hal-02541269 , version 2 (13-05-2020)
hal-02541269 , version 3 (22-06-2020)
hal-02541269 , version 4 (15-01-2021)

Identifiants

Citer

Georges Gras. Greenberg's conjecture for totally real number fields in terms of algorithmic complexity. 2020. ⟨hal-02541269v3⟩
104 Consultations
131 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More