2009Oxford University Research Archive (ORA) (University of Oxford)Open access

The width of verbal subgroups in profinite groups

Nicholas James Simons, Simons, Nicholas James

Open full text 0 citations

Abstract

The main result of this thesis is an original proof that every word has finite width in a compact p-adic analytic group. The proof we give here is an alternative to Andrei Jaikin-Zapirain's recent proof of the same result, and utilises entirely group-theoretical ideas. We accomplish this by reducing the problem to a proof that every word has finite width in a profinite group which is virtually a polycyclic pro-p group. To obtain this latter result we first establish that such a group can be embedded as an open subgroup of a group of the form N₁ M₁, where N₁ is a finitely generated closed normal nilpotent subgroup, and M₁ is a finitely generated closed nilpotent-by-finite subgroup; we then adapt a method of V. A. Romankov. As a corollary we note that our approach also proves that every word has finite width in a polycyclic-by-finite group (which is not profinite). As a supplementary result we show that for finitely generated closed subgroups H and K of a profinite group the commutator subgroup [H,K] is closed, and give examples to show that various hypotheses are necessary. This implies that the outer-commutator words have finite width in profinite groups of finite rank. We go on to establish some bounds for this width. In addition, we show that every word has finite width in a product of a nilpotent group of finite rank and a virtually nilpotent group of finite rank. We consider the possible application of this to soluble minimax groups.

About this research paper

What this paper is about

The main result of this thesis is an original proof that every word has finite width in a compact p-adic analytic group. The proof we give here is an alternative to Andrei Jaikin-Zapirain's recent proof of the same result, and utilises entirely group-theoretical ideas. We accomplish this by reducing the problem to a proof that every word has finite width in a profinite group which is virtually a polycyclic pro-p group. To obtain this latter result we first establish that such a group can be embedded as an open subgroup of a group of the form N₁ M₁, where N₁ is a finitely generated closed normal nilpotent subgroup, and M₁ is a finitely generated closed nilpotent-by-finite subgroup; we then adapt a method of V. A. Romankov. As a corollary we note that our approach also proves that every word has finite width in a polycyclic-by-finite group (which is not profinite). As a supplementary result we show that for finitely generated closed subgroups H and K of a profinite group the commutator subgroup [H,K] is closed, and give examples to show that various hypotheses are necessary. This implies that the outer-commutator words have finite width in profinite groups of finite rank. We go on to establish some bounds for this width. In addition, we show that every word has finite width in a product of a nilpotent group of finite rank and a virtually nilpotent group of finite rank. We consider the possible application of this to soluble minimax groups.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The main result of this thesis is an original proof that every word has finite width in a compact p-adic analytic group. The proof we give here is an alternative to Andrei Jaikin-Zapirain's recent proof of the same result, and utilises entirely group-theoretical ideas. We accomplish this by reducing the problem to a proof that every word has finite width in a profinite group which is virtually a polycyclic pro-p group. To obtain this latter result we first establish that such a group can be embedded as an open subgroup of a group of the form N₁ M₁, where N₁ is a finitely generated closed normal nilpotent subgroup, and M₁ is a finitely generated closed nilpotent-by-finite subgroup; we then adapt a method of V. A. Romankov. As a corollary we note that our approach also proves that every word has finite width in a polycyclic-by-finite group (which is not profinite). As a supplementary result we show that for finitely generated closed subgroups H and K of a profinite group the commutator subgroup [H,K] is closed, and give examples to show that various hypotheses are necessary. This implies that the outer-commutator words have finite width in profinite groups of finite rank. We go on to establish some bounds for this width. In addition, we show that every word has finite width in a product of a nilpotent group of finite rank and a virtually nilpotent group of finite rank. We consider the possible application of this to soluble minimax groups.

Key concepts: Profinite group, Mathematics, Nilpotent group, Nilpotent, Commutator subgroup, Word (group theory), Commutator, Group (periodic table)

Related papers

Back to paper searchBrowse research topicsOriginal source
The width of verbal subgroups in profinite groups — Research Paper | ScholarLens