An analogue of the Nielsen-Schreier formula for pro-\(p\)-groups. (Q882538)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An analogue of the Nielsen-Schreier formula for pro-\(p\)-groups.
scientific article

    Statements

    An analogue of the Nielsen-Schreier formula for pro-\(p\)-groups. (English)
    0 references
    0 references
    24 May 2007
    0 references
    Let \(p\) be prime and \(G\) a finitely generated pro-\(p\) group. It is well known that \(G\) is a free pro-\(p\) group if and only if the Nielsen-Schreier formula \(d(U)-1=[G:U](d(G)-1)\) holds for all open subgroups \(U\) of \(G\), where \(d(U)\) denotes the minimal number of topological generators of \(U\). More in general one can consider the class \(\mathcal E_n\) of pro-\(p\)-groups \(G\) such that \(d(U)-n=[G:U](d(G)-n)\) for any open subgroup \(U\). The class \(\mathcal E_2\) contains all Demushkin groups and \(\mathbb{Z}_p^n\in\mathcal E_n\). The question is open whether there are other examples of groups in \(\mathcal E_n\). In this paper, the author considers the inequality \(d(U)-n\leq [G:U](d(G)-n)\) instead, and studies \(i(G)\), the maximum of \(n\) such that the previous inequality holds for all open subgroups of \(G\). For example, he proves that, if \(|G|\geq 3\), then \(i(G)\leq\max\{d(G),r(G)+1\}\), \(r(G)\) being the minimal number of relations of \(G\) and gives information on the cases when either \(i(G)=d(G)\) or \(i(G)=r(G)+1\). Finally, he consider some questions about the Galois group of the maximal pro-\(p\)-extension of a number field with given ramification.
    0 references
    finitely generated pro-\(p\)-groups
    0 references
    Nielsen-Schreier formula
    0 references
    free pro-\(p\) groups
    0 references
    open subgroups
    0 references
    numbers of topological generators
    0 references
    Demushkin groups
    0 references
    pro-\(p\)-extensions of number fields
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references