Burnside's problem

From Wikipedia, the free encyclopedia

One of the oldest open problems in group theory was first posed by William Burnside in a paper published in 1902. Some variations of the problem which were also stated in this paper have been resolved; but a full solution to the basic problem is still open as of 2004.

Unsolved problems in mathematics: Is B(2,5) finite?

1 General Burnside problem
2 Burnside problem
3 Restricted Burnside problem
4 External links

[edit] General Burnside problem

A group G is called periodic if every element has finite order; in other words, for each g in G, there exists some positive integer n such that gⁿ = 1. Clearly, every finite group is periodic. There exist easily defined groups such as the p^∞-group which are infinite periodic groups; but the latter group cannot be finitely generated.

The general Burnside problem can be posed as: if G is a periodic group, and G is finitely generated, then is G necessarily a finite group?

This question was answered in the negative in 1964, when Golod and Shafarevich gave an example of an infinite p-group that can be finitely generated.

[edit] Burnside problem

As a related question which seems as if it might have an easier answer, consider a periodic group G with the additional property that there exists a single integer n such that for all g in G, gⁿ = 1. A group with this property is said to be periodic with bounded exponent n, or just a group with exponent n.

Then the Burnside problem is stated as, if G is a finitely generated group with exponent n, is G finite?

There are exponents n for which this problem also has a negative answer. S.I. Adian and P.S. Novikov showed in 1968 that for every odd n with n > 4381, there are finitely generated exponent n groups that are infinite. (John Britton proposed a nearly 300 page alternative proof to the Burnside problem in 1973, however Adian ultimately pointed out a flaw in that proof.) A more famous class of counterexamples (given in 1982) are the Tarski Monsters - finitely generated infinite groups in which every nontrivial proper subgroup is cyclic of order p, where p is a prime greater than 10⁷⁵.

The problem of completely determining for which particular exponents n the answer to the Burnside Problem is positive has turned out to be more intractable.

To summarize the results to date, let F_r be the free group of rank r; and given a fixed integer n, let F_rⁿ be the subgroup of F_r generated by the set {gⁿ : g in F_r}. F_rⁿ is a normal subgroup of F_r; since if h = a₁ⁿa₂ⁿ...a_mⁿ is in F_rⁿ, then

g^-1hg = (g^-1a₁ⁿg)(g^-1a₂ⁿg)...(g^-1a_mⁿg) = (g^-1a₁g)ⁿ(g^-1a₂g)ⁿ...(g^-1a_mg)ⁿ

is also in F_rⁿ.

We then define the Burnside free group B(r, n) to be the factor group F_r/(F_rⁿ).

If G is any finitely generated group of exponent n, then G has a presentation including relations {gⁿ = 1} for all g in G, plus some additional relations. G is then a homomorphic image of B(r, n) for some r; so the Burnside problem can be re-stated as: for which positive integers r, n is B(r,n) finite?

Burnside proved some easy cases in his original paper:

Clearly if r = 1, then for all n, B(1, n) = C_n, the cyclic group of order n.
B(r, 2) is the direct product of r copies of C₂.
- This follows since, for any a, b in B(r, 2), we have that (ab)(ab) = 1, and a = a^-1; therefore ab = ba, and so B(r,2) is abelian, and so every element of B(r,2) is of the form a₁^n₁a₂^n₂...a_r^n_r, where n_i is either 0 or 1 and {a_i} is the set of r generators.

In addition, Burnside gave finite upper bounds on the order of B(r, 3) and B(2,4).

One hundred years later, the following additional results have been established:

B(r,3), B(r,4), and B(r,6) are finite for all r.
B(r, n) is infinite if r > 2 and n > 12.

The particular case of B(r, 5) is still an area of intense research. As of 2005, it is not even known whether B(2,5) is finite.

[edit] Restricted Burnside problem

The restricted Burnside problem (formulated in the 1930s) asks another related question: are there only finitely many finite r-generator groups of exponent n, up to isomorphism? (An r-generator group is group which can be generated by r elements.)

If this holds for a given r and n, then consider subgroups H and K of B(r, n), where both H and K have finite index. The intersection of H and K then also has finite index. Let M be the intersection of all subgroups of B(r, n) which have finite index. M is a normal subgroup of B(r, n) (otherwise, there exists a subgroup g^-1Mg with finite index containing elements not in M). We can then define B₀(r,n) to be the factor group formed by B(r,n)/M. B₀(r,n) is a finite group; and every finite r-generator group of exponent n is a homomorphic image of B₀(r,n).

The restricted Burnside problem was answered in the affirmative in 1991 by Efim Zelmanov, for which he was awarded the Fields Medal in 1994. The solution relates the problem to deep questions about Lie algebras.