A subnormal series is a finite chain of subgroups in which each is a normal subgroup of the next. A member need not be normal in the whole group. Requiring the factors to be cyclic groups defines a polycyclic group; allowing finite factors as well defines a poly-(cyclic or finite) group.
Any two finite subnormal series have refinements with the same successive factors up to ordering and group isomorphism. For descending chains and , insert between and and insert in the other chain. The Zassenhaus butterfly lemma identifies the factor indexed by in the first refinement with the factor indexed by in the second. If both chains are composition series, their simple factors admit no nontrivial refinement, giving the Jordan–Hölder theorem.
Let and be subgroups of one group. Put and . Then and the first isomorphism theorem identifies both
with . Indeed maps onto either displayed quotient group, and its kernel in either case is . This gives the matching factors used in the Schreier refinement theorem.
A normal series is a chain whose terms are all normal subgroups of the ambient group. A subnormal series only requires each term normal in the next. Confusing these conditions would incorrectly require every term of a composition series to be normal in the full group.
A chief series is a strict normal series of a group with no proper normal-series refinement. Its factors are minimal normal subgroups of the appropriate quotient groups. A chief factor of a finite soluble group is elementary abelian, whereas a composition factor of a finite soluble group is cyclic of prime order. A chief factor can therefore have order larger than a prime.
A chief factor of is a quotient with normal in and no -normal subgroup strictly between them. Equivalently, is a minimal normal subgroup of . Such factors are the successive factors of a chief series, and are direct products of isomorphic simple groups when is finite.

Articles by others on the same topic (0)

There are currently no matching articles.