Kronecker classes, normal coverings and chief factors of groups

preprint2024arXivOpen access

Abstract

For a group GG, a subgroup U≤GU \leq G and a group Inn(G)≤A≤Aut(G)\mathrm{Inn}(G) \leq A \leq \mathrm{Aut}(G), we say that UU is an AA-covering group of GG if G=⋃a∈AUaG = \bigcup_{a\in A}U^a. A theorem of Jordan (1872) implies that if GG is a finite group, A=Inn(G)A = \mathrm{Inn}(G) and UU is an AA-covering group of GG, then U=GU = G. Motivated by a question concerning Kronecker classes of field extensions, Neumann and Praeger (1988) conjectured that, more generally, there is an integer function ff such that if GG is a finite group and UU is an AA-covering subgroup of GG, then ∣G:U∣≤f(∣A:Inn(G)∣)|G:U| \leq f(|A:\mathrm{Inn}(G)|). A key piece of evidence for this conjecture is a theorem of Praeger (1994), which asserts that there is a two-variable integer function gg such that if GG is a finite group and UU is an AA-covering subgroup of GG, then ∣G:U∣≤g(∣A:Inn(G)∣,c)|G:U|\leq g(|A:\mathrm{Inn}(G)|,c) where cc is the number of AA-chief factors of~GG. Unfortunately, the proof of this result contains an error. In this paper, using a different argument, we give a correct proof of this theorem.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.