On complemented nonabelian chief factors of a finite group
Consider the intervals in each of two \(G\)-chief series between the normal subgroups \(K\) and \(H\) in a group \(G\), \(K\subset H\). By the strengthened form of the Jordan-Hölder theorem a pairing consisting of a complemented abelian chief factor from each interval exists such that both factors are \(G\)-isomorphic. An analogy to extend this result to include nonabelian complemented chief factors was introduced by the second author [\textit{J. Lafuente}, J. Aust. Math. Soc., Ser. A 46, No. 3, 356-364 (1989; Zbl 0686.20018)]. Denote a \(G\)-chief factor as a \(c\)-factor, respectively \(m\)-factor, if it is complemented by a subgroup in \(G\), respectively a maximal subgroup in \(G\), and otherwise as a \(c'\)-factor, respectively \(m'\)-factor. Lafuente proved the existence of a pairing such that a pair has both factors either \(m\)-factors or \(m'\)-factors and if \(m\)-factors, both have a maximal subgroup as a common complement. In this article, the authors examine the challenging case for the \(m'\)-factors. With respect to the same association between factors used above, they prove for \(m'\)-factors that precisely one of the following conditions are satisfied: 1) both factors are \(c'\)-factors, 2) both factors are nonabelian \(c\)-factors, or 3) both factors are nonabelian and one is \(c\)-factor whereas the other is a \(c'\)-factor, defined as a \(cc'\)-type. Consequently the difference \(\nu\) in the number of complemented chief factors in the two intervals is dependent upon the pairings of \(cc'\)-type. It is proven that \(\nu\) is the number of equivalence classes of irreducible \(G\)-groups of \(cc'\)-type in the intervals, the equivalence relation being that introduced to effect the pairings. The concepts and results are presented with care and clarity. This is a fresh approach to the study of chief factors that extends Lafuente's original work to a potential for even broader application.
scientific article; zbMATH DE number 1216492