HOME

TheInfoList



OR:

In
group theory In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field ...
, a branch of mathematics, a torsion group or a periodic group is a
group A group is a number of persons or things that are located, gathered, or classed together. Groups of people * Cultural group, a group whose members share the same cultural identity * Ethnic group, a group whose members share the same ethnic ide ...
in which every element has finite order. The exponent of such a group, if it exists, is the
least common multiple In arithmetic and number theory, the least common multiple, lowest common multiple, or smallest common multiple of two integers ''a'' and ''b'', usually denoted by lcm(''a'', ''b''), is the smallest positive integer that is divisible by bo ...
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 dividing 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 group In mathematics, a dihedral group is the group of symmetries of a regular polygon, which includes rotations and reflections. Dihedral groups are among the simplest examples of finite groups, and they play an important role in group theory, ...
s. None of these examples has a finite generating set. Explicit examples of finitely generated infinite periodic groups were constructed by Golod, based on joint work with Shafarevich, see Golod–Shafarevich theorem, and by Aleshin and Grigorchuk using
automata An automaton (; plural: automata or automatons) is a relatively self-operating machine, or control mechanism designed to automatically follow a sequence of operations, or respond to predetermined instructions.Automaton – Definition and More ...
. These groups have infinite exponent; examples with finite exponent are given for instance by Tarski monster groups constructed by Olshanskii.


Burnside's problem

Burnside's problem is a classical question which 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 group In mathematics, a matrix group is a group ''G'' consisting of invertible matrices over a specified field ''K'', with the operation of matrix multiplication. A linear group is a group that is isomorphic to a matrix group (that is, admitting a f ...
s, the answer to Burnside's problem restricted to the class is positive.


Mathematical logic

One of the interesting properties of periodic groups is that the definition cannot be formalized in terms of
first-order logic First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantifie ...
. This is because doing so would require an axiom of the form :\forall x,\big((x = e) \lor (x\circ x=e) \lor ((x\circ x)\circ x=e) \lor \cdots\big) which contains an infinite disjunction and is therefore inadmissible: First order logic permits quantifiers over one type and can't 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 In mathematical logic, the compactness theorem states that a set of first-order sentences has a model if and only if every finite subset of it has a model. This theorem is an important tool in model theory, as it provides a useful (but generally ...
implies that no set of first-order formulae can characterize the periodic groups.


Related notions

The torsion subgroup of an
abelian group In mathematics, an abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written. That is, the group operation is comm ...
''A'' is the subgroup of ''A'' consisting 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) In mathematics, specifically in ring theory, a torsion element is an element of a module that yields zero when multiplied by some non-zero-divisor of the ring. The torsion submodule of a module is the submodule formed by the torsion elements. ...
* 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). Properties of groups {{Abstract-algebra-stub