Math 2.0

Group theory and generalizations Infinite groups and combinatorial group theory Theorem

Restricted Burnside problem

Builds on Finitely generated groupExponent of a groupNormal subgroupIndex of a subgroup

Statement

Let m≥1m \ge 1 and n≥1n \ge 1 be integers. Then there are only finitely many finite groups, up to isomorphism, that are generated by mm elements and have exponent dividing nn. Equivalently, the free Burnside group B(m,n)B(m, n) has only finitely many normal subgroups of finite index. Then the quotient R(m,n)R(m, n) of B(m,n)B(m, n) by their intersection is finite. Every finite mm-generated group of exponent dividing nn is a quotient of it.

Remarks

Kostrikin proved the case where nn is prime. Hall and Higman reduced the general case to prime powers n=pkn = p^k. Their reduction assumes the Schreier conjecture on outer automorphism groups of finite simple groups, which follows from the classification of finite simple groups. Zelmanov solved the prime power case around 1990, for which he received a Fields Medal. The proofs pass to a Lie ring built from a central series of the group, which satisfies Engel identities. They show that such Lie rings are nilpotent under the right finiteness conditions.

Example: for n=2n = 2, every group of exponent 22 is abelian, and R(m,2)=(ℤ/2)mR(m, 2) = (\Z/2)^m has order 2m2^m.

The restriction to finite groups is necessary: the group B(m,n)B(m, n) itself is infinite for m≥2m \ge 2 and many large nn, by the negative answer to the bounded Burnside problem.

Going deeper

For a student

The theorem gives a largest finite group R(m,n)R(m, n) with mm generators and exponent dividing nn, and all others are its quotients. It is a statement about finite groups, but its proof goes through Lie rings. Kostrikin and Zelmanov proved that Lie algebras satisfying an Engel condition are locally nilpotent under suitable hypotheses. It contrasts with the bounded Burnside problem, where the free Burnside group can be infinite while all its finite quotients have bounded order.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Exponent of a group concept
  2. Finitely generated group concept
  3. Index of a subgroup concept
  4. Normal subgroup concept
  5. Restricted Burnside problem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Burnside_problem, Restricted Burnside problem
About this page
TagFQZJKY2G5Q
URIm2://FQZJKY2G5Q
Kindstatement, theorem
WritingW0 stub
MSC20F50, 20D15, 20F40
StatusThis copy of the site has no build data. Run m2 status FQZJKY2G5Q.
AboutExponent of a group, Burnside problem
UsesFinitely generated group, Exponent of a group, Normal subgroup, Index of a subgroup
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.