Burnside's theorem

(Redirected from Burnside theorem)

In mathematics, Burnside's theorem in group theory states that if is a finite group of order where and are prime numbers, and and are non-negative integers, then is solvable. Hence each non-Abelian finite simple group has order divisible by at least three distinct primes.

William Burnside.

History

edit

The theorem was proved by William Burnside (1904) using the representation theory of finite groups. Several special cases of the theorem had previously been proved by Burnside in 1897, Jordan in 1898, and Frobenius in 1902. John G. Thompson pointed out that a proof avoiding the use of representation theory could be extracted from his work in the 1960s and 1970s on the N-group theorem, and this was done explicitly by Goldschmidt (1970) for groups of odd order, and by Bender (1972) for groups of even order. Matsuyama (1973) simplified the proofs.

Proof

edit

The following proof — using more background than Burnside's — is by contradiction. Let   be the smallest product of two prime powers, such that there is a non-solvable group   whose order is equal to this number.

  •   is a simple group with trivial center and   is not zero.

If   had a nontrivial proper normal subgroup  , then (because of the minimality of  ),   and   would be solvable, so   as well, which would contradict our assumption. So   is simple.

If   were zero,   would be a finite q-group, hence nilpotent, and therefore solvable.

Similarly,   cannot be abelian, otherwise it would be solvable. As   is simple, its center must therefore be trivial.

  • There is an element   of   which has   conjugates, for some  .

By the first statement of Sylow's theorem,   has a subgroup   of order  . Because   is a nontrivial  -group, its center   is nontrivial. Fix a nontrivial element  . The number of conjugates of   is equal to the index of its stabilizer subgroup  , which divides the index   of   (because   is a subgroup of  ). Hence this number is of the form  . Moreover, the integer   is strictly positive, since   is nontrivial and therefore not central in  .

  • There exists a nontrivial irreducible representation   with character  , such that its dimension   is not divisible by   and the complex number   is not zero.

Let   be the family of irreducible characters of   over   (here   denotes the trivial character). Because   is not in the same conjugacy class as 1, the orthogonality relation for the columns of the group's character table gives:

 

Now the   are algebraic integers, because they are sums of roots of unity. If all the nontrivial irreducible characters which don't vanish at   take a value divisible by   at 1, we deduce that

 

is an algebraic integer (since it is a sum of integer multiples of algebraic integers), which is absurd. This proves the statement.

  • The complex number   is an algebraic integer.

The set of integer-valued class functions on  ,  , is a commutative ring, finitely generated over  . All of its elements are thus integral over  , in particular the mapping   which takes the value 1 on the conjugacy class of   and 0 elsewhere.

The mapping   which sends a class function   to

 

is a ring homomorphism. Because   for all  , Schur's lemma implies that   is a homothety  . Its trace   is equal to

 

Because the homothety   is the homomorphic image of an integral element, this proves that the complex number   is an algebraic integer.

  • The complex number   is an algebraic integer.

Since   is relatively prime to  , by Bézout's identity there are two integers   and   such that:

 

Because a linear combination with integer coefficients of algebraic integers is again an algebraic integer, this proves the statement.

  • The image of  , under the representation  , is a homothety.

Let   be the complex number  . It is an algebraic integer, so its norm   (i.e. the product of its conjugates, that is the roots of its minimal polynomial over  ) is a nonzero integer. Now   is the average of roots of unity (the eigenvalues of  ), hence so are its conjugates, so they all have an absolute value less than or equal to 1. Because the absolute value of their product   is greater than or equal to 1, their absolute value must all be 1, in particular  , which means that the eigenvalues of   are all equal, so   is a homothety.

  • Conclusion

Let   be the kernel of  . The homothety   is central in   (which is canonically isomorphic to  ), whereas   is not central in  . Consequently, the normal subgroup   of the simple group   is nontrivial, hence it is equal to  , which contradicts the fact that   is a nontrivial representation.

This contradiction proves the theorem.

References

edit
  • Bender, Helmut (1972), "A group theoretic proof of Burnside's paqb-theorem.", Mathematische Zeitschrift, 126 (4): 327–338, doi:10.1007/bf01110337, MR 0322048, S2CID 119821947
  • Burnside, W. (1904), "On Groups of Order pαqβ", Proceedings of the London Mathematical Society (s2-1 (1)): 388–392, doi:10.1112/plms/s2-1.1.388
  • Goldschmidt, David M. (1970), "A group theoretic proof of the paqb theorem for odd primes", Mathematische Zeitschrift, 113 (5): 373–375, doi:10.1007/bf01110506, MR 0276338, S2CID 123625253
  • James, Gordon; and Liebeck, Martin (2001). Representations and Characters of Groups (2nd ed.) Cambridge University Press. ISBN 0-521-00392-X. See chapter 31.
  • Matsuyama, Hiroshi (1973), "Solvability of groups of order 2aqb.", Osaka Journal of Mathematics, 10: 375–378, MR 0323890