Kronecker classes, normal coverings and chief factors of groups

Abstract

For a group G, a subgroup U ≤ G and a group Inn(G) ≤ A ≤ Aut(G), we say that U is an A-covering group of G if G = a∈ AUa. A theorem of Jordan (1872) implies that if G is a finite group, A = Inn(G) and U is an A-covering group of G, then U = G. Motivated by a question concerning Kronecker classes of field extensions, Neumann and Praeger (1988) conjectured that, more generally, there is an integer function f such that if G is a finite group and U is an A-covering subgroup of G, then |G:U| ≤ f(|A: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 g such that if G is a finite group and U is an A-covering subgroup of G, then |G:U|≤ g(|A:Inn(G)|,c) where c is the number of A-chief factors of~G. Unfortunately, the proof of this result contains an error. In this paper, using a different argument, we give a correct proof of this theorem.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…