Torsion group explained

In group theory, a branch of mathematics, a torsion group or a periodic group is a group in which every element has finite order. The exponent of such a group, if it exists, is the least common multiple of the orders of the elements.

For example, it follows from Lagrange's theorem that every finite group is periodic and it has an exponent that divides its order.

Infinite examples

Examples of infinite periodic groups include the additive group of the ring of polynomials over a finite field, and the quotient group of the rationals by the integers, as well as their direct summands, the Prüfer groups. Another example is the direct sum of all dihedral groups. None of these examples has a finite generating set. Explicit examples of finitely generated infinite periodic groups were constructed by Golod,^[1] based on joint work with Shafarevich (see Golod–Shafarevich theorem), and by Aleshin^[2] and Grigorchuk^[3] using automata. These groups have infinite exponent; examples with finite exponent are given for instance by Tarski monster groups constructed by Olshanskii.^[4]

Burnside's problem

See main article: Burnside's problem. Burnside's problem is a classical question that deals with the relationship between periodic groups and finite groups, when only finitely generated groups are considered: Does specifying an exponent force finiteness? The existence of infinite, finitely generated periodic groups as in the previous paragraph shows that the answer is "no" for an arbitrary exponent. Though much more is known about which exponents can occur for infinite finitely generated groups there are still some for which the problem is open.

For some classes of groups, for instance linear groups, the answer to Burnside's problem restricted to the class is positive.

Mathematical logic

An interesting property of periodic groups is that the definition cannot be formalized in terms of first-order logic. This is because doing so would require an axiom of the form

\forall x, ( (x = e) \lor (x\circ x = e) \lor ((x\circ x)\circ x = e) \lor … ) , which contains an infinite disjunction and is therefore inadmissible: first order logic permits quantifiers over one type and cannot capture properties or subsets of that type. It is also not possible to get around this infinite disjunction by using an infinite set of axioms: the compactness theorem implies that no set of first-order formulae can characterize the periodic groups.^[5]

Related notions

The torsion subgroup of an abelian group A is the subgroup of A that consists of all elements that have finite order. A torsion abelian group is an abelian group in which every element has finite order. A torsion-free abelian group is an abelian group in which the identity element is the only element with finite order.

See also

• Torsion (algebra)
• Jordan–Schur theorem

References

• R. I. Grigorchuk, Degrees of growth of finitely generated groups and the theory of invariant means, Izv. Akad. Nauk SSSR Ser. Mat. 48:5 (1984), 939–985 (Russian).

Notes and References

1. E. S. Golod, On nil-algebras and finitely approximable p-groups, Izv. Akad. Nauk SSSR Ser. Mat. 28 (1964) 273–276.
2. S. V. Aleshin, Finite automata and the Burnside problem for periodic groups, (Russian) Mat. Zametki 11 (1972), 319–328.
3. R. I. Grigorchuk, On Burnside's problem on periodic groups, Functional Anal. Appl. 14 (1980), no. 1, 41–43.
4. [Aleksandr Olshansky|A. Yu. Olshanskii]
5. Book: Ebbinghaus. H.-D.. Flum. J.. Thomas. W.. Mathematical logic. 1994. Springer. New York [u.a.]. 978-0-387-94258-2. 50. 2. ed., 4. pr.. 18 July 2012. However, in first-order logic we may not form infinitely long disjunctions. Indeed, we shall later show that there is no set of first-order formulas whose models are precisely the periodic groups..