arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2004.06959math.NT
收藏

Greenberg猜想的数学复杂性

Algorithmic complexity of Greenberg's conjecture

Georges Gras

摘要:

设$k$是全实数域,$p$是素数.通过分圆塔层$k_n$的理想范数在${\mathcal T}_k$中的映象,我们证明了格林伯格猜想($λ= μ= 0$)的“复杂性”具有$p$ -adic性质,(在Leopoldt猜想下)由$k$的极大交换$p$ -分支pro-$p$-扩张的伽罗瓦群的有限扭群${\mathcal T}_k$支配(定理(5.2))。这些图像是通过形式化算法计算得到的,通过"拧松“,~ $k_n$的$p$类群.这些图像的等分布的猜想(5.4)将表明,算法的步骤数$b_n$以$n \to \infty$为界,因此格林伯格的猜想,在岩泽理论的唯一框架内是无望的,将“以$1$的概率”成立。没有对$[k : \mathbb{Q}]$进行假设,也没有对$p$在$k/\mathbb{Q}$中的分解进行假设。

英文摘要:

Let $k$ be a totally real number field and $p$ a prime. We show that the ``complexity'' of Greenberg's conjecture ($λ= μ= 0$) is of $p$-adic nature governed (under Leopoldt's conjecture) by the finite torsion group ${\mathcal T}_k$ of the Galois group of the maximal abelian $p$-ramified pro-$p$-extension of $k$, by means of images in ${\mathcal T}_k$ of ideal norms from the layers $k_n$ of the cyclotomic tower (Theorem (5.2)). These images are obtained via the formal algorithm computing, by ``unscrewing'', the $p$-class group of~$k_n$. Conjecture (5.4) of equidistribution of these images would show that the number of steps $b_n$ of the algorithms is bounded as $n \to \infty$, so that Greenberg's conjecture, hopeless within the sole framework of Iwasawa's theory, would hold true ``with probability $1$''. No assumption is made on $[k : \mathbb{Q}]$, nor on the decomposition of $p$ in $k/\mathbb{Q}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑