Lably
Skip to content

Schur–Zassenhaus theorem

  • 4 min read
  • 3 chapters

Related on Lably

Through Theorem, Coprime integers and Element of a set

The Schur–Zassenhaus theorem at least partially answers the question: "In a composition series, how can we classify groups with a certain set of composition factors?" The other part, which is where the composition factors do not have coprime orders, is tackled in extension theory.

History

The Schur–Zassenhaus theorem was introduced by Zassenhaus (1937, 1958, Chapter IV, section 7). Theorem 25, which he credits to Issai Schur, proves the existence of a complement, and theorem 27 proves that all complements are conjugate under the assumption that N or G/N is solvable. It is not easy to find an explicit statement of the existence of a complement in Schur's published works, though the results of Schur (1904, 1907) on the Schur multiplier imply the existence of a complement in the special case when the normal subgroup is in the center. Zassenhaus pointed out that the Schur–Zassenhaus theorem for non-solvable groups would follow if all groups of odd order are solvable, which was later proved by Feit and Thompson. Ernst Witt showed that it would also follow from the Schreier conjecture (see Witt (1998, p.277) for Witt's unpublished 1937 note about this), but the Schreier conjecture has only been proved using the classification of finite simple groups, which is far harder than the Feit–Thompson theorem.

Sign in to keep reading

2 more chapters are free with a Lably account.

More in Topics in mathematics