[Paper Review] The Generalized Burnside Theorem

S. Bachmuth|ArXiv.org|Sep 11, 2007

Finite Group Theory Research2 references3 citations

TL;DR

This paper generalizes Burnside's theorem by constructing infinite solvable groups with a prime power exponent q, where all elements have finite order or are infinite-order, yet the commutator subgroup and at least one generator have order q. The key contribution is a systematic method to generate such groups, revealing deep structural connections between finite and infinite groups of exponent q.

ABSTRACT

All groups have 2 generators. For every prime power q, the Generalized Burnside Theorem (Theorem GB) produces an infinite number of solvable groups, Some, such as groups of a prime power exponent, have only elements of finite order and are therefore finite groups. Others have elements of infinite order and are thus infinite groups. All these groups, even when infinite, are closely related to groups of exponent q. They have at least one generator of order q, and their commutator subgroup has exponent q.

Motivation & Objective

• To extend Burnside's theorem to infinite solvable groups with prime power exponent q.
• To investigate the structural properties of groups where all elements have finite order or are infinite-order, yet the commutator subgroup has exponent q.
• To clarify the relationship between finite groups of exponent q and their infinite analogues.
• To correct and refine earlier erroneous statements in the abstract and introduction of the original version.
• To provide a rigorous construction method for infinite solvable groups with controlled exponent and generator structure.

Proposed method

• The paper constructs infinite solvable groups using a generalized version of Burnside's original framework.
• It ensures that the commutator subgroup of each constructed group has exponent q, a key property of groups of exponent q.
• The method guarantees at least one generator of order q in each group, preserving structural similarity to finite groups of exponent q.
• The construction is based on group presentations and combinatorial group theory techniques, maintaining solvability.
• The authors revise and correct earlier claims, particularly in the abstract and introduction, while preserving the original proofs.
• The approach allows for both finite groups (when all elements have finite order) and infinite groups (when some elements have infinite order) to be generated from the same framework.

Experimental results

Research questions

• RQ1 How can Burnside's theorem be generalized to include infinite solvable groups with prime power exponent q?
• RQ2 What structural properties do infinite solvable groups of exponent q share with their finite counterparts?
• RQ3 Can a systematic method generate both finite and infinite groups with exponent q while preserving the commutator subgroup's exponent q?
• RQ4 What role does a generator of order q play in linking finite and infinite groups of exponent q?
• RQ5 How do corrections to the original abstract and introduction affect the validity and interpretation of the group constructions?

Key findings

• The generalized Burnside theorem successfully produces an infinite family of solvable groups with prime power exponent q.
• Some of these groups are finite, consisting only of elements of finite order, while others are infinite, containing elements of infinite order.
• All constructed groups, whether finite or infinite, contain at least one generator of order q.
• The commutator subgroup of every such group has exponent q, ensuring a strong structural link to groups of exponent q.
• The revised version corrects an erroneous statement in the original abstract and introduction, improving the paper's accuracy without altering the core proofs.
• The method demonstrates that infinite solvable groups can be systematically generated with properties closely mirroring those of finite groups of exponent q.